K-Best A∗ Parsing

ACL-IJCNLP 2009 - Joint Conf. of the 47th Annual Meeting of the Association for Computational Linguistics and 4th Int. Joint Conf. on Natural Language Processing of the AFNLP, Proceedings of the Conf.

Volumn , Issue , 2009, Pages 958-966

  Pauls, Adam ^a   Klein, Dan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NATURAL LANGUAGE PROCESSING SYSTEMS;

CONDITION; EXTRACTION METHOD; OPTIMALITY; UNIFIED ALGORITHM;

EXTRACTION;

EID: 79959858882     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. Eugene Charniak and Mark Johnson. 2005. Coarse-to-fine n-best parsing and maxent discriminative reranking. In Proceedings of the 43rd Annual Meeting of the Association for Computational Linguistics (ACL).
2. Michael Collins. 2000. Discriminative reranking for natural language parsing. In Proceedings of the Seventeenth International Conference on Machine Learning (ICML).
3. P. Felzenszwalb and D. McAllester. 2007. The generalized A* architecture. Journal of Artificial Intelligence Research.
4. Michel Galley, Mark Hopkins, Kevin Knight, and Daniel Marcu. 2004. What’s in a translation rule? In Human Language Technologies: The Annual Conference of the North American Chapter of the Association for Computational Linguistics (HLT-ACL).
5. Michel Galley, Jonathan Graehl, Kevin Knight, Daniel Marcu, Steve DeNeefe, Wei Wang, and Ignacio Thayer. 2006. Scalable inference and training of context-rich syntactic translation models. In The Annual Conference of the Association for Computational Linguistics (ACL).
6. Joshua Goodman. 1998. Parsing Inside-Out. Ph.D. thesis, Harvard University.
7. Aria Haghighi, John DeNero, and Dan Klein. 2007. Approximate factoring for A* search. In Proceedings of HLT-NAACL.
8. Liang Huang and David Chiang. 2005. Better k-best parsing. In Proceedings of the International Workshop on Parsing Technologies (IWPT), pages 53–64.
9. ~lhuang3/knuth.pdf.
10. Víctor M. Jiménez and Andrés Marzal. 2000. Computation of the n best parse trees for weighted and stochastic context-free grammars. In Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition, pages 183–192, London, UK. Springer-Verlag.
11. Dan Klein and Christopher D. Manning. 2001. Parsing and hypergraphs. In IWPT, pages 123–134.
12. Dan Klein and Chris Manning. 2002. Fast exact inference with a factored model for natural language processing,. In Proceedings of NIPS.
13. Dan Klein and Chris Manning. 2003a. Accurate unlexicalized parsing. In Proceedings of the North American Chapter of the Association for Computational Linguistics (NAACL).
14. Dan Klein and Chris Manning. 2003b. Factored A* search for models over sequences and trees. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI).
15. Dan Klein and Christopher D. Manning. 2003c. A* parsing: Fast exact Viterbi parse selection. In In Proceedings of the Human Language Technology Conference and the North American Association for Computational Linguistics (HLT-NAACL), pages 119–126.
16. Donald Knuth. 1977. A generalization of Dijkstra’s algorithm. Information Processing Letters, 6(1):1–5.
17. Shankar Kumar and William Byrne. 2004. Minimum bayes-risk decoding for statistical machine translation. In Proceedings of The Annual Conference of the North American Chapter of the Association for Computational Linguistics (NAACL).
18. M. Marcus, B. Santorini, and M. Marcinkiewicz. 1993. Building a large annotated corpus of English: The Penn Treebank. In Computational Linguistics.
19. David McClosky, Eugene Charniak, and Mark Johnson. 2006. Effective self-training for parsing. In Proceedings of The Annual Conference of the North American Chapter of the Association for Computational Linguistics (NAACL), pages 152–159.
20. Mark-Jan Nederhof. 2003. Weighted deductive parsing and Knuth’s algorithm. Computationl Linguistics, 29(1):135–143.
21. Franz Josef Och. 2003. Minimum error rate training in statistical machine translation. In Proceedings of the 41st Annual Meeting on Association for Computational Linguistics (ACL), pages 160–167, Morris-town, NJ, USA. Association for Computational Linguistics.
22. Adam Pauls and Dan Klein. 2009. Hierarchical search for parsing. In Proceedings of The Annual Conference of the North American Chapter of the Association for Computational Linguistics (NAACL).
23. Slav Petrov, Leon Barrett, Romain Thibaux, and Dan Klein. 2006. Learning accurate, compact, and interpretable tree annotation. In Proceedings of COLING-ACL 2006.
24. Adwait Ratnaparkhi. 1999. Learning to parse natural language with maximum entropy models. In Machine Learning, volume 34, pages 151–5175.
25. Stuart M. Shieber, Yves Schabes, and Fernando C. N. Pereira. 1995. Principles and implementation of deductive parsing. Journal of Logic Programming, 24:3–36.