Building a large annotated corpus of English: the penn treebank
Computational Linguistics - Special issue on using large corpora: II
Deep linguistic analysis for the accurate identification of predicate-argument relations
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Using the web as an implicit training set: application to structural ambiguity resolution
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Feature forest models for probabilistic hpsg parsing
Computational Linguistics
Coordinate structure analysis with global structural constraints and alignment-based local features
ACL '09 Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 2 - Volume 2
On dual decomposition and linear programming relaxations for natural language processing
EMNLP '10 Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing
IJCNLP'04 Proceedings of the First international joint conference on Natural Language Processing
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
Coordination disambiguation remains a difficult sub-problem in parsing despite the frequency and importance of coordination structures. We propose a method for disambiguating coordination structures. In this method, dual decomposition is used as a framework to take advantage of both HPSG parsing and coordinate structure analysis with alignment-based local features. We evaluate the performance of the proposed method on the Genia corpus and the Wall Street Journal portion of the Penn Treebank. Results show it increases the percentage of sentences in which coordination structures are detected correctly, compared with each of the two algorithms alone.