Computational nonlinear morphology: with emphasis on semitic languages
Computational nonlinear morphology: with emphasis on semitic languages
Multitiered nonlinear morphology using multitape finite automata: a case study on Syriac and Arabic
Computational Linguistics - Special issue on finite-state methods in NLP
Nonconcatenative finite-state morphology
EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
Consonant spreading in Arabic stems
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Finite-state description of semitic morphology: a case study of Ancient Akkadian
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Multi-tape two-level morphology: a case study in semitic non-linear morphology
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
Arabic finite-state morphological analysis and generation
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
MAGEAD: a morphological analyzer and generator for the Arabic dialects
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
A finite-state morphological grammar of hebrew
Natural Language Engineering
Regular Expressions and Predicate Logic in Finite-State Language Processing
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
Arabic morphology using only finite-state operations
Semitic '98 Proceedings of the Workshop on Computational Approaches to Semitic Languages
Morphological analysis and generation for Arabic dialects
Semitic '05 Proceedings of the ACL Workshop on Computational Approaches to Semitic Languages
| Hi-index | 0.00 |
Various methods have been devised to produce morphological analyzers and generators for Semitic languages, ranging from methods based on widely used finite-state technologies to very specific solutions designed for a specific language or problem. Since the earliest proposals of how to adopt the elsewhere successful finite-state methods to root-and-pattern morphologies, the solution of encoding Semitic grammars using multi-tape automata has resurfaced on a regular basis. Multi-tape automata, however, require specific algorithms and reimplementation of finite-state operators across the board, and hence such technology has not been readily available to linguists. This paper, using an actual Arabic grammar as a case study, describes an approach to encoding multi-tape automata on a single tape that can be implemented using any standard finite-automaton toolkit.