Constrained Arc-Eager Dependency Parsing

Computational Linguistics

Volumn 40, Issue 2, 2014, Pages 249-257

  Nivre, Joakim ^a   Goldberg, Yoav ^b   Mcdonald, Ryan ^c  

^a UPPSALA UNIVERSITY   (Sweden)

^b BAR ILAN UNIVERSITY   (Israel)

^c GOOGLE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BEAM SEARCH; DEPENDENCY GRAPHS; DEPENDENCY PARSER; DEPENDENCY PARSING; LINEAR TIME COMPLEXITY; SUBTREES; TRANSITION SYSTEM;

SYNTACTICS;

EID: 84903471409     PISSN: 08912017     EISSN: 15309312     Source Type: Journal    
DOI: 10.1162/COLI_a_00184     Document Type: Article

References (17)

1. Ballesteros, Miguel and Joakim Nivre. 2013. Getting to the roots of dependency parsing. Computational Linguistics, 39:5-13.
2. Eisner, Jason 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, pages 457-464, Santa Cruz, CA.
3. Eisner, Jason M. 1996. Three new probabilistic models for dependency parsing: An exploration. In Proceedings of the 16th International Conference on Computational Linguistics (COLING), pages 340-345, Copenhagen.
4. Goldberg, Yoav and Joakim Nivre. 2012. A dynamic oracle for arc-eager dependency parsing. In Proceedings of the 24th International Conference on Computational Linguistics, pages 959-976, Shanghai.
5. Goldberg, Yoav and Joakim Nivre. 2013. Training deterministic parsers with non-deterministic oracles. Transactions of the Association for Computational Linguistics, 1:403-414.
6. th International Joint Conference on Natural Language Processing, pages 749-757, Chiang Mai.
7. Karttunen, Lauri, Jean-Pierre Chanod, Gregory Grefenstette, and Anne Schiller. 1996. Regular expressions for language engineering. Natural Language Engineering, 2(4):305-328.
8. Koo, Terry and Michael Collins. 2010. Efficient third-order dependency parsers. In Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics, pages 1-11, Uppsala.
9. McDonald, Ryan, Koby Crammer, and Fernando Pereira. 2005. Online large-margin training of dependency parsers. In Proceedings of the 43rd Annual Meeting of the Association for Computational Linguistics, pages 91-98, Ann Arbor, MI.
10. McDonald, Ryan, Joakim Nivre, Yvonne Quirmbach-Brundage, Yoav Goldberg, Dipanjan Das, Kuzman Ganchev, Keith Hall, Slav Petrov, Hao Zhang, Oscar Täckström, Claudia Bedini, Núria Bertomeu Castelló, and Jungmee Lee. 2013. Universal dependency annotation for multilingual parsing. In Proceedings of the 51st Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers), pages 92-97, Sofia.
11. Nivre, Joakim. 2003. An efficient algorithm for projective dependency parsing. In Proceedings of the 8th International Workshop on Parsing Technologies, pages 149-160, Nancy.
12. Nivre, Joakim. 2008. Algorithms for deterministic incremental dependency parsing. Computational Linguistics, 34:513-553.
13. Nivre, Joakim, Johan Hall, and Jens Nilsson. 2004. Memory-based dependency parsing. In Proceedings of the 8th Conference on Computational Natural Language Learning, pages 49-56, Boston, MA.
14. Petrov, Slav and Ryan McDonald. 2012. Overview of the 2012 shared task on parsing the web. In Notes of the First Workshop on Syntactic Analysis of Non-Canonical Language (SANCL), Montreal.
15. Yamada, Hiroyasu and Yuji Matsumoto. 2003. Statistical dependency analysis with support vector machines. In Proceedings of the 8th International Workshop on Parsing Technologies, pages 195-206, Nancy.
16. Zhang, Yue and Stephen Clark. 2008. A tale of two parsers: Investigating and combining graph-based and transition-based dependency parsing. In Proceedings of the Conference on Empirical Methods in Natural Language Processing (EMNLP), pages 562-571, Honolulu, HI.
17. Zhang, Yue and Joakim Nivre. 2011. Transition-based parsing with rich non-local features. In Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics, pages 188-193, Portland, OR.