Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
Computational Complexity and Natural Language
Computational Complexity and Natural Language
Constraint grammar as a framework for parsing running text
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Complexity, Two-Level Morphology and Finnish
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Two-level morphology with composition
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
Compiling and using finite-state syntactic rules
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
Finite-state parsing and disambiguation
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
Restricted inflectional form generation in management of morphological keyword variation
Information Retrieval
Finite-state methods and models in natural language processing
Natural Language Engineering
Is a morphologically complex language really that complex in full-text retrieval?
FinTAL'06 Proceedings of the 5th international conference on Advances in Natural Language Processing
IRFC'12 Proceedings of the 5th conference on Multidisciplinary Information Retrieval
| Hi-index | 0.00 |
A source of potential systematic errors in information retrieval is identified and discussed. These errors occur when base form reduction is applied with a (necessarily) finite dictionary. Formal methods for avoiding this error source are presented, along with some practical complexities met in its implementation.