Building a large annotated corpus of English: the penn treebank
Computational Linguistics - Special issue on using large corpora: II
Ambiguity packing in constraint-based parsing: practical results
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
New models for improving supertag disambiguation
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
STAR '01 Proceedings of the ACL 2001 Workshop on Sharing Tools and Resources - Volume 15
Improving the accuracy of subcategorizations acquired from corpora
ACLstudent '04 Proceedings of the ACL 2004 workshop on Student research
Guiding a constraint dependency parser with supertags
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
The importance of supertagging for wide-coverage CCG parsing
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
A robust and hybrid deep-linguistic theory applied to large-scale parsing
ROMAND '04 Proceedings of the 3rd Workshop on RObust Methods in Analysis of Natural Language Data
Faster parsing by supertagger adaptation
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Building a wide coverage dynamic grammar
AI*IA'05 Proceedings of the 9th conference on Advances in Artificial Intelligence
| Hi-index | 0.00 |
In this paper, we identify syntactic lexical ambiguity and sentence complexity as factors that contribute to parsing complexity in fully lexicalized grammar formalisms such as Lexicalized Tree Adjoining Grammars. We also report on experiments that explore the effects of these factors on parsing complexity. We discuss how these constraints can be exploited in improving efficiency of parsers for such grammar formalisms.