Elamur Research⌕
☰
home / papers / 1998 / Consonant Spreading in Arabic Stems

Consonant Spreading in Arabic Stems

Paper · 1998 · Kenneth R. Beesley

Summary

Arabic stems are formed by interleaving a consonantal root with a vowel-and-slot pattern. A purely set-based finite-state account of this seems to break when one root consonant surfaces more than once, either as a doubled consonant or as a copy separated by a vowel. Beesley shows that such cases fit the finite-state framework. Roots and patterns are treated as regular languages and combined by intersection. A special copy symbol X marks where a consonant is repeated, and it can sit in a pattern or even in a root. A small set of local variation rules then decides how X surfaces: as a doubled consonant before a vowel-initial suffix, or as a separate full copy before a consonant-initial suffix or after a long vowel or diphthong. When a copying root meets a copying pattern, the rules produce a double spread with no extra machinery. The approach runs inside a large Arabic analyzer built with Xerox finite-state tools. This matters because one mechanism covers gemination and spreading without multi-tape devices.

Key points

  • Stems come from compile-time intersection of root and pattern languages, not concatenation. Prefixes and suffixes are then attached by ordinary concatenation.
  • The X symbol follows the consonant slot to be copied. One example is Form IX CCaCaX, giving dhamaX. Its surface form depends on the next segment: geminated before +a/+at, spread before +tu/+ta.
  • Spreading occurs in Forms IX, XI, XII, XIV and several noun patterns. Some broken plurals spread a radical whose singular only geminates it, as in dabXuur → dabaaXiir.
  • Biliteral roots can carry X themselves (e.g. s m X). The root m k X with pattern CaCaaXiiC yields makaakiik, where k is spread twice.
  • The system has 4930 hand-coded roots (after Buckwalter) and about 90,000 compiled stems. These yield over 72,000,000 abstract words, mapped to orthography by 66 variation rules. Optional diacritic deletion lets it read unvoweled, partially voweled and fully voweled text. It is derived from earlier ALPNET work and has a Java web interface.

Interesting ideas

  • I1. Instead of a special copying device, the paper places an abstract placeholder in the underlying form and lets context-sensitive rules decide its surface shape later. This keeps combination simple and pushes the variation into a separate, testable layer.
  • I2. One underlying form is realized as doubling or as a separated copy depending only on the following suffix. This shows that apparently different phenomena can share one representation once the conditioning context is identified.
  • I3. Combining two independent constraint sets (root and pattern) by intersection at compile time yields a large enumerated lexicon. Lookup then stays cheap and every entry stays decomposable into its sources.
  • I4. The same mechanism handles the rare case where root and pattern both trigger copying, with no extra code. That emergent case serves as a strong check that the formalism is right.
  • I5. The analyzer generates full forms first, then applies optional deletion rules for diacritics. One model thus accepts input at several levels of explicitness.

For Mova

How these ideas could serve Mova, our small open language model — its files, stages and tests:

  • I1 (tokens): English morphology in crate en could use underlying markers for consonant doubling (stop → stopping) or y/i alternation, with explicit rules explaining each surface change.
  • I2 (tokens): the lemmatizer can store one lexical form and attach the conditioning rule to each analysis, so every inflected form traces back to a named rule.
  • I3 (world): verb-class or frame inventories could be precompiled as intersections of independent constraints (e.g. VerbNet class × syntactic frame), with each compiled entry keeping provenance for explanation.
  • I4 (learn): evaluation suites could deliberately include rare combinations of two independently known phenomena as stress tests that rules should handle without special-casing.
  • I5 (back): generation could produce a fully specified surface form and then apply optional reduction rules (contractions, ellipsis), keeping one model for both explicit and reduced text.

Our summary of the paper, in our own words — not its text. The work belongs to its authors; read it at the links above.

 Fields, topics and concepts

📚 Shelves 4The field of science this work belongs to (OpenAlex fields).Arts and Humanities · 16,039 worksLanguage and Linguistics · 15,891 worksPsychology · 1,552 worksExperimental and Cognitive Psychology · 870 works

🧭 Topics 1Research subjects and languages the work is about.Semitic languages · 2,908 works

Cite

Cite as Kenneth R. Beesley. 1998. Consonant Spreading in Arabic Stems. 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics, Volume 1.

The paper itself, not this page. BibTeX from the library's record of the work. DOI 10.3115/980845.980865

@inproceedings{beesley1998consonant,
  title = {{Consonant Spreading in Arabic Stems}},
  author = {Kenneth R. Beesley},
  booktitle = {36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics, Volume 1},
  year = {1998},
  doi = {10.3115/980845.980865},
  url = {https://doi.org/10.3115/980845.980865}
}

References

23 references, 3 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
  2. 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
  3. Kenneth R. Beesley. 1996. Arabic finite-state morphological analysis and generation. In COLING'g6, volume 1, pages 89-94, Copenhagen, August 5-9. Center for Sprogteknologi. The 16th International Conference on Computational Linguistics.
  4. Kenneth R. Beesley. 1998a. Arabic morphological analysis on the Internet. In ICEMCO-98, 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
  5. 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, C, hampaign, IL. ↗
  6. A. F. L. Beeston. 1968. Written Arabic: an approach to the basic structures. Cambridge University Press, Cambridge. find
  7. Steven Bird and Patrick Blackburn. 1991. A logical approach to Arabic phonology. In EACL-91, pages 89-94.
  8. Timothy A. Buckwalter. 1990. Lexicographic 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
  9. Zelig Harris. 1941. Linguistic structure of Hebrew. Journal of the American Oriental Society, 62:143-167. ↗
  10. Clives Holes. 1995. Modern Arabic: Structures, Functions and Varieties. Longman, London. find
  11. Grover Hudson. 1986. Arabic root and pattern morphology without tiers. Journal of Linguistics, 22:85-122. Reply to McCarthy:1981. ↗
  12. 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
  13. Ronald M. Kaplan and Martin Kay. 1994. Regular models of phonological rule systems. Computational Linguistics, 20(3):331-378. ↗
  14. 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
  15. 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
  16. 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
  17. Lauri Karttunen. 1993. Finite-state lexicon compiler. Technical Report ISTL-NLTT-1993-04-02, Xerox Palo Alto Research Center, Palo Alto, CA, April. find
  18. 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
  19. 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. find
  20. George Kiraz. 1994. Multi-tape two-level morphology: a case study in Semitic non-linear morphology. In COLING'94, volume 1, pages 180-186. George Anton Kiraz. 1 9 9 6 . Computing prosodic morphology. In COLING'96. ↗
  21. 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
  22. John J. McCarthy. 1981. A prosodic theory of nonconcatenative morphology. Linguistic Inquiry, 12(3):373-418. find
  23. Hans Wehr. 1979. A Dictionary of Modern Written Arabic. Spoken Language Services, Inc., Ithaca, NY, 4 edition. Edited by J. Milton Cowan. find

Updated

↑ back to top

This page in Markdown → https://md.research.elamur.ai/free/en/papers/beesley-1998-consonant-spreading-arabic-stems/