A computational framework for lexical description
Computational Linguistics - Special issue of the lexicon
Computational Complexity and Natural Language
Computational Complexity and Natural Language
On the generative power of two-level morphological rules
EACL '89 Proceedings of the fourth 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
Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
One-level phonology: autosegmental representations and rules as finite automata
Computational Linguistics
Arabic morphology generation using a concatenative strategy
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
Incremental construction of a lexical transducer for Korean
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
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
Two-level morphology with composition
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
A method for compiling two-level rules with multiple contexts
SIGMORPHON '10 Proceedings of the 11th Meeting of the ACL Special Interest Group on Computational Morphology and Phonology
| Hi-index | 0.00 |
The two-level model of morphology and phonology arose from work on finite-state machine descriptions of phonological phenomena. However, the two-level rule notation can be given a precise declarative semantics in terms of the segmentation of sequences of pairs of symbols, quite independently of any computational representation as sets of finite-state transducers. Thus defined, the two-level model can be shown to be less powerful, in terms of weak generative capacity, than parallel intersections of arbitrary finite-state transducers without empty transitions (the usual computational representation). However, if a special boundary symbol is permitted, the full family of regular languages can be generated. Two-level morphological grammars may, without loss of generality, be written in a simplified normal form. The set of two-level generated languages can be shown to be closed under intersection, but not under union or complementation.