Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
A logical approach to Arabic phonology
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Prosodic Inheritance and morphological generalisations
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
A general computational model for word-form recognition and production
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
Incorporating inheritance and feature structures into a Logic Grammar formalism
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Structure-sharing in lexical representation
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Finite-state description of semitic morphology: a case study of Ancient Akkadian
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
One-level phonology: autosegmental representations and rules as finite automata
Computational Linguistics
SEMHE: a generalised two-level system
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Arabic morphological analysis techniques: a comprehensive survey
Journal of the American Society for Information Science and Technology
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
A computational approach to the variations in Arabic verbal orthography
Computer Speech and Language
| Hi-index | 0.00 |
Aspects of abstract finite-state morphology are introduced and demonstrated. The use of two-way finite automata for Arabic noun stem and verb root inflection leads to abstractions based on finite-state transition network topology as well as the form and content of network arcs. Nonconcatenative morphology is distinguished from concatenative morphology by its use of movement on the output tape rather than the input tape. The idea of specific automata for classes of inflection inheriting some or all of the nodes, arc form and arc content of the abstract automaton is also introduced. This can lead to novel linguistic generalities and application, as well as advantages in terms of procedural efficiency and representation.