Optimal incremental parsing via best-first dynamic programming

EMNLP 2013 - 2013 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference

Volumn , Issue , 2013, Pages 758-768

  Zhao, Kai ^a   Cross, James ^a   Huang, Liang ^a,b  

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL LINGUISTICS; NATURAL LANGUAGE PROCESSING SYSTEMS; POLYNOMIAL APPROXIMATION;

INCREMENTAL PARSING; NON-TRIVIAL; POLYNOMIAL-TIME DYNAMIC PROGRAMMING; PROBABLISTIC;

DYNAMIC PROGRAMMING;

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

References (16)

1. Alfred V. Aho and Jeffrey D. Ullman. 1972. The Theory of Parsing, Translation, and Compiling, volume I: Parsing of Series in Automatic Computation. Prentice Hall, Englewood Cliffs, New Jersey.
2. Sharon A Caraballo and Eugene Charniak. 1998. New figures of merit for best-first probabilistic chart parsing. Computational Linguistics, 24(2):275-298.
3. Jay Earley. 1970. An efficient context-free parsing algorithm. Communications of the ACM, 13(2):94-102.
4. Jason Eisner. 1996. Three new probabilistic models for dependency parsing: An exploration. In Proceedings of COLING.
5. Liang Huang and Kenji Sagae. 2010. Dynamic programming for linear-time incremental parsing. In Proceedings of ACL 2010.
6. ∗ parsing: Fast exact Viterbi parse selection. In Proceedings of HLT-NAACL.
7. Dan Klein and Christopher D Manning. 2005. Parsing and hypergraphs. In New developments in parsing technology, pages 351-372. Springer.
8. Donald Knuth. 1977. A generalization of Dijkstra's algorithm. Information Processing Letters, 6(1).
9. Marco Kuhlmann, Carlos Gómez-Rodríguez, and Giorgio Satta. 2011. Dynamic programming algorithms for transition-based dependency parsers. In Proceedings of ACL.
10. Ryan McDonald, Koby Crammer, and Fernando Pereira. 2005. Online large-margin training of dependency parsers. In Proceedings of the 43rd ACL.
11. Mark-Jan Nederhof. 2003. Weighted deductive parsing and Knuth's algorithm. Computational Linguistics, pages 135-143.
12. Joakim Nivre. 2008. Algorithms for deterministic incremental dependency parsing. Computational Linguistics, 34(4):513-553.
13. Adam Pauls and Dan Klein. 2009. Hierarchical search for parsing. In Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, pages 557-565. Association for Computational Linguistics.
14. Kenji Sagae and Alon Lavie. 2006. A best-first probabilistic shift-reduce parser. In Proceedings of ACL.
15. Andreas Stolcke. 1995. An efficient probabilistic context-free parsing algorithm that computes prefix probabilities. Computational Linguistics, 21(2):165-201.
16. Yue Zhang and Stephen Clark. 2008. A tale of two parsers: investigating and combining graph-based and transition-based dependency parsing using beam-search. In Proceedings of EMNLP.