Abstract
The paper deals with the computational complexity of Part-of-Speech tagging (aka morphological disambiguation) by means of rules derived from loosened negative n-grams. Loosened negative n-grams [2] were originally developed as a tool for the task of pure verification of results of Part-of-Speech tagging (corpus quality checking). It is shown that while the verification is just a polynomial problem, the time consumed by the tagging (disambiguation) task cannot be bounded by a polynom in the general case. The results presented in the paper are relevant above all for disambiguation performed by means of Constraint-based Grammars [1] and similar frameworks, which are in fact only notational variants of the rules derived via loosened negative n-grams. Throughout the paper some familiarity with finite-state automata (FSA) and the class of NP problems is assumed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Karlsson, F., Voutilainen, A., Heikkila, J., Antilla, A. (eds.): Constraint Grammar - A Language-Independent System for Parsing Unrestricted Text. Mouton de Gruyter, Berlin & NewYork (1995)
Květoň, P., Oliva, K.: Achieving an Almost Correct PoS-Tagged Corpus. In: Sojka, P., Kopeček, I., Pala, K. (eds.) TSD 2002. LNCS (LNAI), vol. 2448, pp. 19–26. Springer, Heidelberg (2002)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman, San Francisco (1979)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oliva, K., Květoň, P., Ondruška, R. (2003). The Computational Complexity of Rule-Based Part-of-Speech Tagging. In: Matoušek, V., Mautner, P. (eds) Text, Speech and Dialogue. TSD 2003. Lecture Notes in Computer Science(), vol 2807. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39398-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-39398-6_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20024-6
Online ISBN: 978-3-540-39398-6
eBook Packages: Springer Book Archive