Some advances in transformation-based part of speech tagging
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
A statistical parser for Czech
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Learning accurate, compact, and interpretable tree annotation
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Discriminative learning and spanning tree algorithms for dependency parsing
Discriminative learning and spanning tree algorithms for dependency parsing
Generalized categorial dependency grammars
Pillars of computer science
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
Hi-index | 0.00 |
A POS-tagger can be used in front of a parser to reduce the number of combinations of possible dependency trees which, in the majority, give spurious analyses. In the paper we compare the results of the addition of three morphological taggers to the parser of the CDG Lab. The experimental results show that these models perform better than the model which do not use a morphological tagger at the cost of loosing some correct analyses. In fact, the adequacy of these solutions is mainly based on the compatibility between the lexical units defined by the taggers and the dependency grammar.