Top-down K-best A* parsing

ACL 2010 - 48th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference

Volumn , Issue , 2010, Pages 200-204

  Pauls, Adam ^a   Klein, Dan ^a   Quirk, Chris ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOTTOM UP; OPTIMALITY; TOP-DOWN ALGORITHMS; TOPDOWN;

COMPUTATIONAL LINGUISTICS;

ALGORITHMS;

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

References (9)

1. Liang Huang and David Chiang. 2005. Better k-best parsing. In Proceedings of the International Workshop on Parsing Technologies (IWPT), pages 53-64.
2. 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.
3. Dan Klein and Christopher D. Manning. 2001. Parsing and hypergraphs. In Proceedings of the International Workshop on Parsing Technologies (IWPT), pages 123-134.
4. Dan Klein and Christopher D. Manning. 2003. A* parsing: Fast exact Viterbi parse selection. In Proceedings of the Human Language Technology Conference and the North American Association for Computational Linguistics (HLT-NAACL), pages 119-126.
5. Mark-Jan Nederhof. 2003. Weighted deductive parsing and Knuth's algorithm. Computationl Linguistics, 29(1):135-143.
6. Adam Pauls and Dan Klein. 2009. K-best A* parsing. In Proccedings of the Association for Computational Linguistics (ACL).
7. Slav Petrov, Leon Barrett, Romain Thibaux, and Dan Klein. 2006. Learning accurate, compact, and interpretable tree annotation. In Proccedings of the Association for Computational Linguistics (ACL).
8. Stuart M. Shieber, Yves Schabes, and Fernando C. N. Pereira. 1995. Principles and implementation of deductive parsing. Journal of Logic Programming, 24:3-36.
9. Frank K. Soong and Eng-Fong Huang. 1991. A treetrellis based fast search for finding the n best sentence hypotheses in continuous speech recognition. In Proceedings of the Workshop on Speech and Natural Language.