Exact inference for generative probabilistic non-projective dependency parsing

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

Volumn , Issue , 2011, Pages 1234-1245

  Cohen, Shay B ^a   Gómez Rodríguez, Carlos ^b   Satta, Giorgio ^c  

^a Carnegie Mellon University ^*  (United States)

^b UNIVERSITY OF A CORUÑA   (Spain)

^c UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DEPENDENCY TREES; EXACT INFERENCE; GENERATIVE MODEL; NON-PROJECTIVE DEPENDENCY PARSING; PARSING ALGORITHM; TRANSITION SYSTEM;

ALGORITHMS; COMPUTATIONAL LINGUISTICS; DYNAMIC PROGRAMMING; TREES (MATHEMATICS);

NATURAL LANGUAGE PROCESSING SYSTEMS;

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

References (32)

1. Giuseppe Attardi. 2006. Experiments with a multil-anguage non-projective dependency parser. In Proceedings of the Tenth Conference on Computational Natural Language Learning (CoNLL), pages 166-170, New York, USA.
2. Sylvie Billot and Bernard Lang. 1989. The structure of shared forests in ambiguous parsing. In Proceedings of the 27th Annual Meeting of the Association for Computational Linguistics (ACL), pages 143-151, Vancouver, Canada.
3. Manuel Bodirsky, Marco Kuhlmann, and Mathias Möhl. 2005. Well-nested drawings as models of syntactic structure. In Tenth Conference on Formal Grammar and Ninth Meeting on Mathematics of Language, pages 195-203, Edinburgh, UK.
4. Sabine Buchholz and Erwin Marsi. 2006. CoNLL-X shared task on multilingual dependency parsing. In Proceedings of the Tenth Conference on Computational Natural Language Learning (CoNLL), pages 149-164, New York, USA.
5. Jason Eisner and Giorgio Satta. 1999. Efficient parsing for bilexical context-free grammars and Head Automaton Grammars. In Proceedings of the 37th Annual Meeting of the Association for Computational Linguistics (ACL), pages 457-464, College Park, MD, USA.
6. Jason Eisner, Eric Goldlust, and Noah A. Smith. 2005. Compiling Comp Ling: Practical weighted dynamic programming and the Dyna language. In Proceedings of HLT-EMNLP, pages 281-290.
7. Carlos Gómez-Rodríguez and Joakim Nivre. 2010. A transition-based parser for 2-planar dependency structures. In Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics (ACL), pages 1492-1501, Uppsala, Sweden.
8. Carlos Gómez-Rodríguez, David J. Weir, and John Carroll. 2009. Parsing mildly non-projective dependency structures. In Twelfth Conference of the European Chapter of the Association for Computational Linguistics (EACL), pages 291-299, Athens, Greece.
9. Carlos Gómez-Rodríguez, John Carroll, and David Weir. 2011. Dependency parsing schemata and mildly non-projective dependency parsing. Computational Linguistics (in press), 37(3).
10. Joshua Goodman. 1999. Semiring parsing. Computational Linguistics, 25(4):573-605.
11. John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman. 2000. Introduction to Automata Theory. Addison-Wesley, 2nd edition.
12. Liang Huang and Kenji Sagae. 2010. Dynamic programming for linear-time incremental parsing. In Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics (ACL), pages 1077-1086, Uppsala, Sweden.
13. Sylvain Kahane, Alexis Nasr, and Owen Rambow. 1998. Pseudo-projectivity: A polynomially parsable non-projective dependency grammar. In 36th Annual Meeting of the Association for Computational Linguistics and 18th International Conference on Computational Linguistics (COLING-ACL), pages 646-652, Montréal, Canada.
14. Dan Klein and Christopher D. Manning. 2001. Parsing and hypergraphs. In Proceedings of the IWPT, pages 123-134.
15. Terry Koo, Amir Globerson, Xavier Carreras, and Michael Collins. 2007. Structured prediction models via the matrix-tree theorem. In Proceedings of the EMNLP-CoNLL, pages 141-150.
16. Marco Kuhlmann and Giorgio Satta. 2009. Tree-bank grammar techniques for non-projective dependency parsing. In Twelfth Conference of the European Chapter of the Association for Computational Linguistics (EACL), pages 478-486, Athens, Greece.
17. Marco Kuhlmann, Carlos Gómez-Rodríguez, and Giorgio Satta. 2011. Dynamic programming algorithms for transition-based dependency parsers. In Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics (ACL), Portland, Oregon, USA.
18. Bernard Lang. 1974. Deterministic techniques for efficient non-deterministic parsers. In Jacques Loecx, editor, Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, July 29- August 2, 1974, number 14 in Lecture Notes in Computer Science, pages 255-269. Springer.
19. Zhifei Li and Jason Eisner. 2009. First- and second-order expectation semirings with applications to minimum-risk training on translation forests. In Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing (EMNLP), pages 40-51, Singapore.
20. Ryan McDonald and Giorgio Satta. 2007. On the complexity of non-projective data-driven dependency parsing. In Tenth International Conference on Parsing Technologies (IWPT), pages 121-132, Prague, Czech Republic.
21. Ryan McDonald, Fernando Pereira, Kiril Ribarov, and Jan Hajič. 2005. Non-projective dependency parsing using spanning tree algorithms. In Human Language Technology Conference (HLT) and Conference on Empirical Methods in Natural Language Processing (EMNLP), pages 523-530, Vancouver, Canada.
22. Mark-Jan Nederhof. 2003. Weighted deductive parsing and knuth's algorithm. Computational Linguistics, 29(1):135-143.
23. Joakim Nivre and Jens Nilsson. 2005. Pseudo-projective dependency parsing. In 43rd Annual Meeting of the Association for Computational Linguistics (ACL), pages 99-106, Ann Arbor, USA.
24. Joakim Nivre. 2004. Incrementality in deterministic dependency parsing. In Workshop on Incremental Parsing: Bringing Engineering and Cognition Together, pages 50-57, Barcelona, Spain.
25. Joakim Nivre. 2008. Algorithms for deterministic incremental dependency parsing. Computational Linguistics, 34(4):513-553.
26. Joakim Nivre. 2009. Non-projective dependency parsing in expected linear time. In Proceedings of the 47th Annual Meeting of the ACL and the Fourth International Joint Conference on Natural Language Processing of the AFNLP, pages 351-359, Singapore.
27. Stuart M. Shieber, Yves Schabes, and Fernando Pereira. 1995. Principles and implementation of deductive parsing. Journal of Logic Programming, 24(1-2):3-36.
28. Khalil Sima'an. 1996. Computational complexity of probabilistic disambiguation by means of tree-grammars. In Proceedings of COLING, pages 1175-1180.
29. David A. Smith and Noah A. Smith. 2007. Probabilistic models of nonprojective dependency trees. In Proceedings of the EMNLP-CoNLL, pages 132-140.
30. Ivan Titov, James Henderson, Paola Merlo, and Gabriele Musillo. 2009. Online graph planarisation for synchronous parsing of semantic and syntactic dependencies. In Proceedings of IJCAI, pages 281-290.
31. Masaru Tomita. 1986. Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems. Springer.
32. Hiroyasu Yamada and Yuji Matsumoto. 2003. Statistical dependency analysis with support vector machines. In Proceedings of the Eighth International Workshop on Parsing Technologies (IWPT), pages 195-206, Nancy, France.