Artificial Intelligence - Special volume on empirical methods
Constraint Grammar: A Language-Independent System for Parsing Unrestricted Text
Constraint Grammar: A Language-Independent System for Parsing Unrestricted Text
Tagging and morphological disambiguation of Turkish text
ANLC '94 Proceedings of the fourth conference on Applied natural language processing
Ambiguity resolution in a reductionistic parser
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
A syntax-based part-of-speech analyser
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Specifying a shallow grammatical representation for parsing purposes
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Comparing a linguistic and a stochastic tagger
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Constraint grammar as a framework for parsing running text
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Finite-state parsing and disambiguation
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
A cascaded finite-state parser for syntactic analysis of Swedish
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
How much can part-of-speech tagging help parsing?
Natural Language Engineering
| Hi-index | 0.00 |
The usefulness of POS taggers for syntactic parsing is a question little addressed in the literature. Because taggers reduce ambiguity from the parser's input, parsing is commonly supposed to become faster, and the result less ambiguous. On the other hand, tagging errors probably reduce the parser's recognition rate, so this drawback may outweigh the possible advantages. This paper empirically investigates these issues using two different rule-based morphological disambiguators as preprocessor of a wide-coverage finite-state parser of English. With these rule-based taggers, the parser's output becomes less ambiguous without a considerable penalty to recognition rate. Parsing speed increases slightly, not decisively.