Efficient implementation of beam-search incremental parsers

ACL 2013 - 51st Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference

Volumn 2, Issue , 2013, Pages 628-633

  Goldberg, Yoav ^a   Zhao, Kai ^b   Huang, Liang ^b  

^a BAR ILAN UNIVERSITY   (Israel)

^b CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; SYNTACTICS; TREES (MATHEMATICS);

BEAM SEARCH; EFFICIENT IMPLEMENTATION; LINEAR TIME; LINEAR-TIME ALGORITHMS; ORDERS OF MAGNITUDE; TREE-STRUCTURED;

COMPUTATIONAL LINGUISTICS;

FORESTRY; MATHEMATICS; TREES;

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

References (16)

1. Eugene Charniak. 2000. A maximum-entropy-inspired parser. In Proceedings of NAACL.
2. Michael Collins and Brian Roark. 2004. Incremental parsing with the perceptron algorithm. In Proceedings of ACL.
3. Michael Collins. 1999. Head-Driven Statistical Models for Natural Language Parsing. Ph.D. thesis, University of Pennsylvania.
4. Yoav Goldberg and Michael Elhadad. 2010. An efficient algorithm for easy-first non-directional dependency parsing. In Proceedings of HLT-NAACL, pages 742-750.
5. Liang Huang and Kenji Sagae. 2010. Dynamic programming for linear-time incremental parsing. In Proceedings of ACL 2010.
6. Liang Huang, Wenbin Jiang, and Qun Liu. 2009. Bilingually-constrained (monolingual) shift-reduce parsing. In Proceedings of EMNLP.
7. Philipp Koehn. 2004. Pharaoh: a beam search decoder for phrase-based statistical machine translation models. In Proceedings of AMTA, pages 115-124.
8. Marco Kuhlmann, Carlos Gmez-Rodrguez, and Giorgio Satta. 2011. Dynamic programming algorithms for transition-based dependency parsers. In Proceedings of ACL.
9. Joakim Nivre and Mario Scholz. 2004. Deterministic dependency parsing of english text. In Proceedings of COLING, Geneva.
10. Joakim Nivre. 2008. Algorithms for deterministic incremental dependency parsing. Computational Linguistics, 34(4):513-553.
11. Chris Okasaki. 1999. Purely functional data structures. Cambridge University Press.
12. Brian Roark. 2001. Probabilistic top-down parsing and language modeling. Computational Linguistics, 27(2):249-276.
13. Masaru Tomita. 1985. An efficient context-free parsing algorithm for natural languages. In Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2, pages 756-764.
14. 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.
15. Yue Zhang and Stephen Clark. 2011. Shift-reduce ccg parsing. In Proceedings of ACL.
16. Yue Zhang and Joakim Nivre. 2011. Transition-based dependency parsing with rich non-local features. In Proceedings of ACL, pages 188-193.