Dynamic programming for linear-time incremental parsing

Proceedings of the Annual Meeting of the Association for Computational Linguistics

Volumn 2010-July, Issue , 2010, Pages 1077-1086

  Huang, Liang ^a   Sagae, Kenji ^b  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^b University of Southern California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS;

BEAM SEARCH; DEPENDENCY PARSER; FEATURE VALUES; INCREMENTAL PARSING; LINEAR TIME; STATE OF THE ART;

DYNAMIC PROGRAMMING;

EID: 85118453802     PISSN: 0736587X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

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. S. Billot and B. Lang. 1989. The structure of shared forests in ambiguous parsing. In Proceedings of the 27th ACL, pages 143-151.
3. Eugene Charniak and Mark Johnson. 2005. Coarse-to-fine-grained n-best parsing and discriminative reranking. In Proceedings of the 43rd ACL, Ann Arbor, MI.
4. Eugene Charniak. 2000. A maximum-entropy-inspired parser. In Proceedings of NAACL.
5. Michael Collins and Brian Roark. 2004. Incremental parsing with the perceptron algorithm. In Proceedings of ACL.
6. Michael Collins. 2000. Discriminative reranking for natural language parsing. In Proceedings of ICML, pages 175-182.
7. Michael Collins. 2002. Discriminative training methods for hidden Markov models: Theory and experiments with perceptron algorithms. In Proceedings of EMNLP.
8. Xiangyu Duan, Jun Zhao, and Bo Xu. 2007. Probabilistic models for action-based chinese dependency parsing. In Proceedings of ECML/PKDD.
9. Jay Earley. 1970. An efficient context-free parsing algorithm. Communications of the ACM, 13(2):94-102.
10. Jason Eisner and Giorgio Satta. 1999. Efficient parsing for bilexical context-free grammars and head-automaton grammars. In Proceedings of ACL.
11. Jason Eisner. 1996. Three new probabilistic models for dependency parsing: An exploration. In Proceedings of COLING.
12. Lyn Frazier and Keith Rayner. 1982. Making and correcting errors during sentence comprehension: Eye movements in the analysis of structurally ambiguous sentences. Cognitive Psychology, 14(2):178 - 210.
13. Liang Huang and David Chiang. 2005. Better k-best Parsing. In Proceedings of the Ninth International Workshop on Parsing Technologies (IWPT-2005).
14. Liang Huang, Wenbin Jiang, and Qun Liu. 2009. Bilingually-constrained (monolingual) shift-reduce parsing. In Proceedings of EMNLP.
15. Liang Huang. 2008. Forest reranking: Discriminative parsing with non-local features. In Proceedings of the ACL: HLT, Columbus, OH, June.
16. Mark Johnson. 1998. PCFG models of linguistic tree representations. Computational Linguistics, 24:613-632.
17. Terry Koo, Xavier Carreras, and Michael Collins. 2008. Simple semi-supervised dependency parsing. In Proceedings of ACL.
18. B. Lang. 1974. Deterministic techniques for efficient non-deterministic parsers. In Automata, Languages and Programming, 2nd Colloquium, volume 14 of Lecture Notes in Computer Science, pages 255-269, Saarbrücken. Springer-Verlag.
19. Lillian Lee. 2002. Fast context-free grammar parsing requires fast Boolean matrix multiplication. Journal of the ACM, 49(1):1-15.
20. Ryan McDonald, Koby Crammer, and Fernando Pereira. 2005a. Online large-margin training of dependency parsers. In Proceedings of the 43rd ACL.
21. Ryan McDonald, Fernando Pereira, Kiril Ribarov, and Jan Hajič. 2005b. Non-projective dependency parsing using spanning tree algorithms. In Proc. of HLT-EMNLP.
22. Mark-Jan Nederhof. 2003. Weighted deductive parsing and Knuth's algorithm. Computational Linguistics, pages 135-143.
23. Joakim Nivre. 2004. Incrementality in deterministic dependency parsing. In Incremental Parsing: Bringing Engineering and Cognition Together. Workshop at ACL-2004, Barcelona.
24. Slav Petrov and Dan Klein. 2007. Improved inference for unlexicalized parsing. In Proceedings of HLT-NAACL.
25. Brian Roark and Kristy Hollingshead. 2009. Linear complexity context-free parsing pipelines via chart constraints. In Proceedings of HLT-NAACL.
26. Andreas Stolcke. 1995. An efficient probabilistic context-free parsing algorithm that computes prefix probabilities. Computational Linguistics, 21(2):165-201.
27. Masaru Tomita. 1988. Graph-structured stack and natural language parsing. In Proceedings of the 26th annual meeting on Association for Computational Linguistics, pages 249-257, Morristown, NJ, USA. Association for Computational Linguistics.
28. Masaru Tomita, editor. 1991. Generalized LR Parsing. Kluwer Academic Publishers.
29. H. Yamada and Y. Matsumoto. 2003. Statistical dependency analysis with support vector machines. In Proceedings of IWPT.
30. 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.