ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on 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
A morphological recognizer with syntactic and phonological rules
COLING '86 Proceedings of the 11th coference on Computational linguistics
Multitiered nonlinear morphology using multitape finite automata: a case study on Syriac and Arabic
Computational Linguistics - Special issue on finite-state methods in NLP
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
It would be much easier if WENT were GOED
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
Compiling regular formalisms with rule features into finite-state automata
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Syllable-based model for the Korean morphology
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
A high-level morphological description language exploiting inflectional paradigms
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
Lexeme-based morphology: a computationally expensive approach intended for a server-architecture
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
X2MORF: a morphological component based on augmented two-level morphology
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 2
| Hi-index | 0.00 |
Two-level phonology, as currently practiced, has two severe limitations. One is that phonological generalizations are generally expressed in terms of transition tables of finite-state automata, and these tables are cumbersome to develop and refine. The other is that lexical idiosyncrasy is encoded by introducing arbitrary diacritics into the spelling of a morpheme. This paper explains how phonological rules may be employed instead of transition tables and describes a more elegant way of expressing phonological irregularity than with arbitrary diacritics, making use of the fact that generalizations are expressed with rules instead of automata.