Formalisms for morphographemic description
EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
Formalisms for morphographemic description
EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
Constraint propagation in Kimmo systems
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
Constituent-based morphological parsing: a new approach to the problem of word-recognition.
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Complexity, Two-Level Morphology and Finnish
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Parallel intersection and serial composition of finite state transducers
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Syllable-based model for the Korean morphology
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
A two-level morphological analysis of Korean
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
Variable and clause ordering in an FSA approach to propositional satisfiability
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Sentence boundary detection in turkish
ADVIS'04 Proceedings of the Third international conference on Advances in Information Systems
A finite state intersection approach to propositional satisfiability
Theoretical Computer Science
| Hi-index | 0.00 |
Morphological analysis must take into account the spelling-change processes of a language as well as its possible configurations of stems, affixes, and inflectional markings. The computational difficulty of the task can be clarified by investigating specific models of morphological processing. The use of finite-state machinery in the "two-level" model by Kimmo Koskenniemi gives it the appearance of computational efficiency, but closer examination shows the model does not guarantee efficient processing. Reductions of the satisfiability problem show that finding the proper lexical/surface correspondence in a two-level generation or recognition problem can be computationally difficult. The difficulty increases if unrestricted deletions (null characters) are allowed.