Finite-state morphology has been successful in the description and computational implementation of a wide variety of natural languages. However, the particular challenges of Arabic, and the limitations of some implementations of finite-state morphology, have led many researchers to believe that finite-state power was not sufficient to handle Arabic and other Semitic morphology. This paper illustrates how the morphotactics and the variation rules of Arabic have been described using only finitestate operations and how this approach has been implemented in a significant morphological analyzer/generator.
REF showed how the morphotactics and the variation rules of Arabic have been described using only finite state operation and implemented a significant morphological analyser using this approach.
Arabic Morphology Using Only Finite-State Operations
Workshop On Computational Approaches To Semitic Languages
Computer Science