Computational Complexity and Natural Language
Computational Complexity and Natural Language
Computational complexity in two-level morphology
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
Finite state morphology and information retrieval
Natural Language Engineering
A finite-state morphological processor for Spanish
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 freely available wide coverage morphological analyzer for English
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 3
A freely available wide coverage morphological analyzer for English
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 3
| Hi-index | 0.00 |
Although, Two-Level Morphology has been found in practice to be an extremely efficient method for processing Finnish words on very small machines, [Barton86] has recently shown the method to be NP-hard. This paper will discuss Barton's theoretical argument and explain why it has not been a problem for us in practice.