A computational framework for lexical description
Computational Linguistics - Special issue of the lexicon
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computational complexity in two-level morphology
ACL '86 Proceedings of the 24th 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
A dictionary and morphological analyser for English
COLING '86 Proceedings of the 11th coference on Computational linguistics
A computational framework for lexical description
Computational Linguistics - Special issue of the lexicon
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
Compiling a partition-based two-level formalism
COLING '96 Proceedings of the 16th 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 |
Recently there has been some interest in rule formalisms for describing morphologically significant regularities in orthography of words, largely influenced by the work of Koskenniemi. Various implementations of these rules are possible, but there are some weaknesses in the formalism as it stands. An alternative specification formalism is possible which solves some of the problems. This new formalism can be viewed as a variant of the "pure" Koskenniemi model with certain constraints relaxed. The new formalism has particular advantages for multiple character changes. An interpreter has been implemented for the formalism and a significant subset of English morphographemics has been described, but it has yet to be used for describing other languages.