[Mova](https://md.mova.elamur.ai/free/en/) · [this page in HTML](https://mova.elamur.ai/free/en/docs/papers/aclbulk-1998-beesley-arabic-morphology-only-finite-state/)

[home](https://md.mova.elamur.ai/free/en/) / [docs](https://md.mova.elamur.ai/free/en/docs/) / [papers](https://md.mova.elamur.ai/free/en/docs/papers/) / [Semitic languages](https://md.mova.elamur.ai/free/en/docs/papers/sem/) / Arabic Morphology Using Only Finite-State Operations

# Arabic Morphology Using Only Finite-State Operations

**Authors:** Kenneth R. Beesley · **Year:** 1998 · **Venue:** Computational Approaches to Semitic Languages **Link:** [aclanthology.org/W98-1007](https://aclanthology.org/W98-1007/) · library `aclbulk-1998-beesley-arabic-morphology-only-finite-state` · **Licence:** [CC BY-NC-SA 3.0](https://creativecommons.org/licenses/by-nc-sa/3.0/) — summary only

[**66** citations](https://openalex.org/works?filter=cites:W2159781504) openalex · 2026-10-19[**27** citations in our library](https://md.mova.elamur.ai/free/en/docs/papers/cited-by/aclbulk-1998-beesley-arabic-morphology-only-finite-state/) of the 140673 papers whose bibliographies we read[Computational Approaches to Semitic Languages](https://aclanthology.org/volumes/W98-10/)[licence](https://creativecommons.org/licenses/by-nc-sa/3.0/)

- [Publisher's page](https://aclanthology.org/W98-1007/)
- [PDF](https://aclanthology.org/W98-1007.pdf)
- [DOI 10.3115/1621753.1621763](https://doi.org/10.3115/1621753.1621763)
- [OpenAlex](https://openalex.org/W2159781504)

**Authors (1)**

1. [Beesley, Kenneth R.](https://openalex.org/A5001977140) [Semantic Scholar](https://www.semanticscholar.org/author/3135905) · h 12 · 550 citations · 27 works

Citations and author metrics from openalex (2026-10-19); authors with the same name are not always told apart.

## What it is about

The paper shows that Arabic root-and-pattern morphology can be written with finite-state operations alone, and that this is implemented in a large analyser and generator at Xerox. A root is a regular language (the three consonants in order, with anything between them), a pattern is a template over consonant and vowel slots, and a vowel melody is a regular expression. A stem is the intersection of root, pattern and vocalisation. Prefixes and suffixes are concatenated to the stems, and filters are composed on top to remove illegal combinations (an article cannot take an indefinite ending, a preposition takes only genitive). Sixty-six variation rules map abstract strings to spelling. The system has 4,930 hand-coded roots and generates over 72 million fully voweled forms, and it reads unvoweled, partly voweled and fully voweled text. The paper gives no accuracy figures; its claim is about expressive power.

## Ideas

- I1. Filter instead of rewriting: let the lexicon overgenerate and compose a filter that forbids illegal clitic combinations (an article with an indefinite ending, a preposition with a nominative or accusative). For `tools/hbo`, the prefix and suffix tables could be checked with such a filter, so that a vav, bet, lamed or mem prefix cannot combine with a suffix the grammar forbids.
- I2. A root as a subsequence language: k-t-b is the set of strings that contain k, t, b in that order with anything between. In the unpointed mode of `tools/hbo`, match a lemma's consonants this way against the unvoweled token, which allows for inserted matres lectionis.
- I3. A test: the same word spelled unvoweled, partly voweled and fully voweled must receive the same analysis. Build such triples from the Hebrew Bible text (MACULA) and report, per run, how often `tools/hbo` agrees with itself.

## For Mova

I1 goes into [Pronouns, particles and prepositions](https://md.mova.elamur.ai/free/en/docs/languages/hbo/05-pronouns-particles/) (prefix and suffix legality) and into the segmenter of `tools/hbo`. I2 goes into the unpointed mode of `tools/hbo`. I3 is a measure for `tools/hbo`, pointed against unpointed input.

## Cite

The paper itself, not this card. BibTeX from the library's record of the work. [DOI 10.3115/1621753.1621763](https://doi.org/10.3115/1621753.1621763)

```
@inproceedings{beesley1998arabic,
  title = {{Arabic Morphology Using Only Finite-State Operations}},
  author = {Beesley, Kenneth R.},
  booktitle = {Computational Approaches to Semitic Languages},
  year = {1998},
  doi = {10.3115/1621753.1621763},
  url = {https://doi.org/10.3115/1621753.1621763}
}
```

- [← previous A Morphological Analyzer for Akkadian Verbal Forms with a Model of Phonetic Transformations](https://md.mova.elamur.ai/free/en/docs/papers/aclbulk-1998-barthelemy-morphological-analyzer-akkadian-verbal-forms/)
- [next → Paradigmatic Treatment of Arabic Morphology](https://md.mova.elamur.ai/free/en/docs/papers/aclbulk-1998-smets-paradigmatic-treatment-arabic-morphology/)
- [↑ back to Semitic languages](https://md.mova.elamur.ai/free/en/docs/papers/sem/)

## References

29 references, 0 of them with a card of ours. ↗ leads to the work, «find» searches for one we have no id for yet.

1. Evan L. Antworth. 1990. PC-KIMMO: a two-level processor for morphological analysis. Number 16 in Occasional publications in academic computing. Summer Institute of Linguistics, Dallas. [find](https://scholar.google.com/scholar?q=Evan+L%2E+Antworth%2E+1990%2E+PC%2DKIMMO%3A+a+two%2Dlevel+processor+for+morphological+analysis%2E+Number+16+in+Occasional+publications+in+academic+computing%2E+Summer+Institute+of+Linguistics%2C+Dallas%2E)
2. Kenneth R. Beesley, Tim Buckwalter, and Stuart N. Newton. 1989. Two-level finite-state analysis of Arabic morphology. In Proceedings of the Seminar on Bilingual Computing in Arabic and English, Cambridge, England, September 6-7. No pagination. [find](https://scholar.google.com/scholar?q=Kenneth+R%2E+Beesley%2C+Tim+Buckwalter%2C+and+Stuart+N%2E+Newton%2E+1989%2E+Two%2Dlevel+finite%2Dstate+analysis+of+Arabic+morphology%2E+In+Proceedings+of+the+Seminar+on+Bilingual+Computing+in+Arabic+and+English%2C+Cambri)
3. Kenneth R. Beesley. 1989. Computer analysis of Arabic morphology: A two-level approach with detours. In Third Annual Symposium on Arabic Linguistics, Salt Lake City, March 3-4. University of Utah. Published as Beesley, 1991. [find](https://scholar.google.com/scholar?q=Kenneth+R%2E+Beesley%2E+1989%2E+Computer+analysis+of+Arabic+morphology%3A+A+two%2Dlevel+approach+with+detours%2E+In+Third+Annual+Symposium+on+Arabic+Linguistics%2C+Salt+Lake+City%2C+March+3%2D4%2E+University+of+Utah%2E+Pub)
4. Kenneth R. Beesley. 1990. Finite-state description of Arabic morphology. In Proceedings of the Second Cambridge Conference on Bilingual Computing in Arabic and English, September 5-7. No pagination. [find](https://scholar.google.com/scholar?q=Kenneth+R%2E+Beesley%2E+1990%2E+Finite%2Dstate+description+of+Arabic+morphology%2E+In+Proceedings+of+the+Second+Cambridge+Conference+on+Bilingual+Computing+in+Arabic+and+English%2C+September+5%2D7%2E+No+pagination%2E)
5. Kenneth R. Beesley. 1991. Computer analysis of Arabic morphology: A two-level approach with detours. In Bernard Comrie and Mushira Eid, editors, Perspectives on Arabic Linguistics III: Papers from the Third Annual Symposium on Arabic Linguistics, pages 155-172. John Benjamins, Amsterdam. Read originally at the Third Annual Symposium on Arabic Linguistics, University of Utah, Salt Lake City, Utah, 3-4 March 1989. [find](https://scholar.google.com/scholar?q=Kenneth+R%2E+Beesley%2E+1991%2E+Computer+analysis+of+Arabic+morphology%3A+A+two%2Dlevel+approach+with+detours%2E+In+Bernard+Comrie+and+Mushira+Eid%2C+editors%2C+Perspectives+on+Arabic+Linguistics+III%3A+Papers+from+the)
6. Kenneth R. Beesley. 1998a. Arabic morphological analysis on the Internet. In ICEMCO-g8, Cambridge, April 17-18. Centre for Middle Eastern Studies. Proceedings of the 6th International Conference and Exhibition on Multilingual Computing. Paper number 3.1.1; no pagination. [find](https://scholar.google.com/scholar?q=Kenneth+R%2E+Beesley%2E+1998a%2E+Arabic+morphological+analysis+on+the+Internet%2E+In+ICEMCO%2Dg8%2C+Cambridge%2C+April+17%2D18%2E+Centre+for+Middle+Eastern+Studies%2E+Proceedings+of+the+6th+International+Conference+and+E)
7. Kenneth R. Beesley. 1998b. Arabic stem morphotactics via finite-state intersection. Paper presented at the 12th Symposium on Arabic Linguistics, Arabic Linguistic Society, 6-7 March, 1998, Champaign, IL. [find](https://scholar.google.com/scholar?q=Kenneth+R%2E+Beesley%2E+1998b%2E+Arabic+stem+morphotactics+via+finite%2Dstate+intersection%2E+Paper+presented+at+the+12th+Symposium+on+Arabic+Linguistics%2C+Arabic+Linguistic+Society%2C+6%2D7+March%2C+1998%2C+Champaign%2C+)
8. Kenneth R. Beesley. 1998c. Consonant spreading in Arabic stems. In COLING'98. [find](https://scholar.google.com/scholar?q=Kenneth+R%2E+Beesley%2E+1998c%2E+Consonant+spreading+in+Arabic+stems%2E+In+COLING%2798%2E)
9. Kenneth R. Beesley. 1998d. Constraining separated morphotactic dependencies in finite-state grammars. In FSMNLP-98, Bilkent. Bilkent University. [find](https://scholar.google.com/scholar?q=Kenneth+R%2E+Beesley%2E+1998d%2E+Constraining+separated+morphotactic+dependencies+in+finite%2Dstate+grammars%2E+In+FSMNLP%2D98%2C+Bilkent%2E+Bilkent+University%2E)
10. Timothy A. Buckwalter. 1990. Le:dcographic notation of Arabic noun pattern morphemes and their inflectional features. In Proceedings of the Second Cambridge Conference on Bilingual Computing in Arabic and English, September 5-7. No pagination. [find](https://scholar.google.com/scholar?q=Timothy+A%2E+Buckwalter%2E+1990%2E+Le%3Adcographic+notation+of+Arabic+noun+pattern+morphemes+and+their+inflectional+features%2E+In+Proceedings+of+the+Second+Cambridge+Conference+on+Bilingual+Computing+in+Arabic)
11. Noam Chomsky and Morris Halle. 1968. The Sound Pattern of English. Harper and Row, New York. [find](https://scholar.google.com/scholar?q=Noam+Chomsky+and+Morris+Halle%2E+1968%2E+The+Sound+Pattern+of+English%2E+Harper+and+Row%2C+New+York%2E)
12. Zelig Harris. 1941. Linguistic structure of Hebrew. Journal of the American Oriental Society, 62:143-167. [find](https://scholar.google.com/scholar?q=Zelig+Harris%2E+1941%2E+Linguistic+structure+of+Hebrew%2E+Journal+of+the+American+Oriental+Society%2C+62%3A143%2D167%2E)
13. Grover Hudson. 1986. Arabic root and pattern morphology without tiers. Journal of Linguistics, 22:85-122. Reply to McCarthy:1981. [find](https://scholar.google.com/scholar?q=Grover+Hudson%2E+1986%2E+Arabic+root+and+pattern+morphology+without+tiers%2E+Journal+of+Linguistics%2C+22%3A85%2D122%2E+Reply+to+McCarthy%3A1981%2E)
14. C. Douglas Johnson. 1972. Formal Aspects of Phonological Description. Mouton, The Hague. [find](https://scholar.google.com/scholar?q=C%2E+Douglas+Johnson%2E+1972%2E+Formal+Aspects+of+Phonological+Description%2E+Mouton%2C+The+Hague%2E)
15. Ronald M. Kaplan and Martin Kay. 1981. Phonological rules and finite-state transducers. In Linguistic Society of America Meeting Handbook. Fifty-Sixth Annual Meeting, New York. December 27-30. Abstract. [find](https://scholar.google.com/scholar?q=Ronald+M%2E+Kaplan+and+Martin+Kay%2E+1981%2E+Phonological+rules+and+finite%2Dstate+transducers%2E+In+Linguistic+Society+of+America+Meeting+Handbook%2E+Fifty%2DSixth+Annual+Meeting%2C+New+York%2E+December+27%2D30%2E+Abstrac)
16. Ronald M. Kaplan and Martin Kay. 1994. Regular models of phonological rule systems. Computational Linguistics, 20(3):331-378. [find](https://scholar.google.com/scholar?q=Ronald+M%2E+Kaplan+and+Martin+Kay%2E+1994%2E+Regular+models+of+phonological+rule+systems%2E+Computational+Linguistics%2C+20%283%29%3A331%2D378%2E)
17. Lauri Karttunen and Kenneth R. Beesley. 1992. Two-level rule compiler. Technical Report ISTL-92-2, Xerox Palo Alto Research Center, Palo Alto, CA, October. [find](https://scholar.google.com/scholar?q=Lauri+Karttunen+and+Kenneth+R%2E+Beesley%2E+1992%2E+Two%2Dlevel+rule+compiler%2E+Technical+Report+ISTL%2D92%2D2%2C+Xerox+Palo+Alto+Research+Center%2C+Palo+Alto%2C+CA%2C+October%2E)
18. Lauri Karttunen and Andr6 Kempe. 1995. The parallel replacement operation in finite-state calculus. Technical Report MLTT-021, Rank Xerox Research Centre, Grenoble, France, December. A~ilable at [http://www.xrce.xerox.com/publis/mltt/mltttech.html](http://www.xrce.xerox.com/publis/mltt/mltttech.html). [↗](http://www.xrce.xerox.com/publis/mltt/mltttech.html)
19. Lauri Karttunen, Ronald M. Kaplan, and Annie Zaenen. 1992. Two-level morphology with composition. In COLING'92, pages 141-148, Nantes, France, August 23-28. [find](https://scholar.google.com/scholar?q=Lauri+Karttunen%2C+Ronald+M%2E+Kaplan%2C+and+Annie+Zaenen%2E+1992%2E+Two%2Dlevel+morphology+with+composition%2E+In+COLING%2792%2C+pages+141%2D148%2C+Nantes%2C+France%2C+August+23%2D28%2E)
20. Lauri Karttunen. 1983. K I M M O : a general morphological processor. In Mary Dalrymple, Edit Doron, John Goggin, Beverley Goodman, and John McCarthy, editors, Tezas Linguistic Forum, number 22, pages 165-186. Department of Linguistics, The University of Texas at Austin, Austin, TX. [find](https://scholar.google.com/scholar?q=Lauri+Karttunen%2E+1983%2E+K+I+M+M+O+%3A+a+general+morphological+processor%2E+In+Mary+Dalrymple%2C+Edit+Doron%2C+John+Goggin%2C+Beverley+Goodman%2C+and+John+McCarthy%2C+editors%2C+Tezas+Linguistic+Forum%2C+number+22%2C+pages)
21. Lauri Karttunen. 1991. Finite-state constraints. In Proceedings of the International Conference on Current Issues in Computational Linguistics, Penang, Malaysia, June 10-14. Universiti Sains Malaysia. [find](https://scholar.google.com/scholar?q=Lauri+Karttunen%2E+1991%2E+Finite%2Dstate+constraints%2E+In+Proceedings+of+the+International+Conference+on+Current+Issues+in+Computational+Linguistics%2C+Penang%2C+Malaysia%2C+June+10%2D14%2E+Universiti+Sains+Malaysia%2E)
22. Lauri Karttunen. 1993. Finite-state lexicon compiler. Technical Report ISTL-NLTT-1993-04-02, Xerox Palo Alto Research Center, Palo Alto, CA, April. [find](https://scholar.google.com/scholar?q=Lauri+Karttunen%2E+1993%2E+Finite%2Dstate+lexicon+compiler%2E+Technical+Report+ISTL%2DNLTT%2D1993%2D04%2D02%2C+Xerox+Palo+Alto+Research+Center%2C+Palo+Alto%2C+CA%2C+April%2E)
23. Lauri Karttunen. 1994. Constructing lexical transducers. In COLING'g~, Kyoto, Japan. [find](https://scholar.google.com/scholar?q=Lauri+Karttunen%2E+1994%2E+Constructing+lexical+transducers%2E+In+COLING%27g%7E%2C+Kyoto%2C+Japan%2E)
24. Lauri Karttunen. 1995. The replace operator. In Proceedings of the 33rd Annual Meeting of the ACL, Cambridge, MA. Available at [http://www.xrce.xerox.com/publis/mltt/mltttech.html](http://www.xrce.xerox.com/publis/mltt/mltttech.html). [↗](http://www.xrce.xerox.com/publis/mltt/mltttech.html)
25. Lauri Karttunen. 1996. Directed replacement. In Proceedings of the 3~rd Annual Meeting of the ACL, Santa Cruz, CA. [find](https://scholar.google.com/scholar?q=Lauri+Karttunen%2E+1996%2E+Directed+replacement%2E+In+Proceedings+of+the+3%7Erd+Annual+Meeting+of+the+ACL%2C+Santa+Cruz%2C+CA%2E)
26. Laura Kataja and Kimmo Koskenniemi. 1988. Finite-state description of Semitic morphology: A case study of Ancient Akkadian. In COLING'88, pages 313-315. [find](https://scholar.google.com/scholar?q=Laura+Kataja+and+Kimmo+Koskenniemi%2E+1988%2E+Finite%2Dstate+description+of+Semitic+morphology%3A+A+case+study+of+Ancient+Akkadian%2E+In+COLING%2788%2C+pages+313%2D315%2E)
27. Martin Kay. 1987. Nonconcatenative finite-state morphology. In Proceedings of the Third Conference of the European Chapter of the Association for Computational Linguistics, pages 2-10. George Anton Kiraz. 1 9 9 6 . Computing prosodic morphology. In COLING'96, pages 664-669. [find](https://scholar.google.com/scholar?q=Martin+Kay%2E+1987%2E+Nonconcatenative+finite%2Dstate+morphology%2E+In+Proceedings+of+the+Third+Conference+of+the+European+Chapter+of+the+Association+for+Computational+Linguistics%2C+pages+2%2D10%2E+George+Anton+Ki)
28. Kimmo Koskenniemi. 1983. Two-level morphology: A general computational model for word-form recognition and production. Publication 11, University of Helsinki, Department of General Linguistics, Helsinki. [find](https://scholar.google.com/scholar?q=Kimmo+Koskenniemi%2E+1983%2E+Two%2Dlevel+morphology%3A+A+general+computational+model+for+word%2Dform+recognition+and+production%2E+Publication+11%2C+University+of+Helsinki%2C+Department+of+General+Linguistics%2C+Helsin)
29. John J. McCarthy. 1981. A prosodic theory of nonconcatenative morphology. Linguistic Inquiry, 12(3):373-418. [find](https://scholar.google.com/scholar?q=John+J%2E+McCarthy%2E+1981%2E+A+prosodic+theory+of+nonconcatenative+morphology%2E+Linguistic+Inquiry%2C+12%283%29%3A373%2D418%2E)