The best of bothworlds - A graph-based completion model for transition-based parsers

EACL 2012 - 13th Conference of the European Chapter of the Association for Computational Linguistics, Proceedings

Volumn , Issue , 2012, Pages 77-87

  Bohnet, Bernd ^a   Kuhn, Jonas ^a  

^a UNIVERSITY OF STUTTGART   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS; LINGUISTICS;

DEPENDENCY PARSER; EFFICIENT IMPLEMENTATION; GRAPH-BASED; PARTIAL INFORMATION;

COMPUTATIONAL LINGUISTICS;

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

References (39)

1. S. Abney. 1991. Parsing by chunks. In Principle- Based Parsing, pages 257-278. Kluwer Academic Publishers.
2. G. Attardi. 2006. Experiments with a Multilanguage Non-Projective Dependency Parser. In Tenth Conference on Computational Natural Language Learning (CoNLL-X).
3. B. Bohnet. 2009. Efficient Parsing of Syntactic and Semantic Dependency Structures. In Proceedings of the 13th Conference on Computational Natural Language Learning (CoNLL-2009).
4. B. Bohnet. 2010. Top accuracy and fast dependency parsing is not a contradiction. In Proceedings of the 23rd International Conference on Computational Linguistics (Coling 2010), pages 89-97, Beijing, China, August. Coling 2010 Organizing Committee.
5. X. Carreras, M. Collins, and T. Koo. 2008. Tag, dynamic programming, and the perceptron for efficient, feature-rich parsing. In Proceedings of the Twelfth Conference on Computational Natural Language Learning, CoNLL '08, pages 9-16, Stroudsburg, PA, USA. Association for Computational Linguistics.
6. X. Carreras. 2007. Experiments with a Higher-order Projective Dependency Parser. In EMNLP/CoNLL.
7. M. Collins and B. Roark. 2004. Incremental parsing with the perceptron algorithm. In ACL, pages 111- 118.
8. M. Collins. 2002. Discriminative Training Methods for Hidden Markov Models: Theory and Experiments with Perceptron Algorithms. In EMNLP.
9. K. Crammer, O. Dekel, S. Shalev-Shwartz, and Y. Singer. 2006. Online Passive-Aggressive Algorithms. Journal of Machine Learning Research, 7:551-585.
10. J. Eisner. 1996. Three New Probabilistic Models for Dependency Parsing: An Exploration. In Proceedings of the 16th International Conference on Computational Linguistics (COLING-96), pages 340- 345, Copenhaen.
11. Y. Freund and R. E. Schapire. 1998. Large margin classification using the perceptron algorithm. In 11th Annual Conference on Computational Learning Theory, pages 209-217, New York, NY. ACM Press.
12. K. Ganchev and M. Dredze. 2008. Small statistical models by random feature mixing. In Proceedings of the ACL-2008 Workshop on Mobile Language Processing. Association for Computational Linguistics.
13. A. Gesmundo, J. Henderson, P. Merlo, and I. Titov. 2009. A Latent Variable Model of Synchronous Syntactic-Semantic Parsing for Multiple Languages. In Proceedings of the 13th Conference on Computational Natural Language Learning (CoNLL-2009), Boulder, Colorado, USA., June 4-5.
14. Y. Goldberg and M. Elhadad. 2010. An efficient algorithm for easy-first non-directional dependency parsing. In HLT-NAACL, pages 742-750.
15. C. Ǵomez-Rodŕiguez and J. Nivre. 2010. A Transition-Based Parser for 2-Planar Dependency Structures. In ACL, pages 1492-1501.
16. J. Hajǐc, M. Ciaramita, R. Johansson, D. Kawahara, M. Antònia Martí, L.Màrquez, A. Meyers, J. Nivre, S. Padó, J. Sťeṕanek, P. Strǎńak, M. Surdeanu, N. Xue, and Y. Zhang. 2009. The CoNLL-2009 shared task: Syntactic and semantic dependencies in multiple languages. In Proceedings of the Thirteenth Conference on Computational Natural Language Learning (CoNLL 2009): Shared Task, pages 1-18, Boulder, United States, June.
17. L. Huang and K. Sagae. 2010. Dynamic programming for linear-Time incremental parsing. In Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics, pages 1077-1086, Uppsala, Sweden, July. Association for Computational Linguistics.
18. R. Johansson and P. Nugues. 2006. Investigating multilingual dependency parsing. In Proceedings of the Shared Task Session of the Tenth Conference on Computational Natural Language Learning (CoNLL-X), pages 206-210, New York City, United States, June 8-9.
19. R. Johansson and P. Nugues. 2008. Dependencybased Syntactic-Semantic Analysis with Prop Bank and Nom Bank. In Proceedings of the Shared Task Session of CoNLL-2008, Manchester, UK.
20. S. Kahane, A. Nasr, and O. Rambow. 1998. Pseudo-projectivity: A polynomially parsable nonprojective dependency grammar. In COLING-ACL, pages 646-652.
21. T. Koo and M. Collins. 2010. Efficient third-order dependency parsers. In Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics, pages 1-11, Uppsala, Sweden, July. Association for Computational Linguistics.
22. Terry Koo, Xavier Carreras, and Michael Collins. 2008. Simple semi-supervised dependency parsing. pages 595-603.
23. T. Kudo and Y. Matsumoto. 2002. Japanese dependency analysis using cascaded chunking. In proceedings of the 6th conference on Natural language learning - Volume 20, COLING-02, pages 1- 7, Stroudsburg, PA, USA. Association for Computational Linguistics.
24. M. Kuhlmann, C. Ǵomez-Rodŕiguez, and G. Satta. 2011. Dynamic programming algorithms for transition-based dependency parsers. In ACL, pages 673-682.
25. Andre Martins, Noah Smith, Eric Xing, Pedro Aguiar, and Mario Figueiredo. 2010. Turbo parsers: Dependency parsing by approximate variational inference. pages 34-44.
26. R. McDonald and F. Pereira. 2006. Online Learning of Approximate Dependency Parsing Algorithms. In In Proc. of EACL, pages 81-88.
27. R. McDonald, K. Crammer, and F. Pereira. 2005. Online Large-margin Training of Dependency Parsers. In Proc. ACL, pages 91-98.
28. J. Nivre and R. McDonald. 2008. Integrating Graph- Based and Transition-Based Dependency Parsers. In ACL-08, pages 950-958, Columbus, Ohio.
29. J. Nivre and J. Nilsson. 2005. Pseudo-projective dependency parsing. In ACL.
30. J. Nivre, M. Kuhlmann, and J. Hall. 2009. An improved oracle for dependency parsing with online reordering. In Proceedings of the 11th International Conference on Parsing Technologies, IWPT '09, pages 73-76, Stroudsburg, PA, USA. Association for Computational Linguistics.
31. J. Nivre. 2003. An Efficient Algorithm for Projective Dependency Parsing. In 8th International Workshop on Parsing Technologies, pages 149-160, Nancy, France.
32. J. Nivre. 2009. Non-Projective Dependency Parsing in Expected Linear Time. In Proceedings of the 47th Annual Meeting of the ACL and the 4th IJCNLP of the AFNLP, pages 351-359, Suntec, Singapore.
33. K. Sagae and A. Lavie. 2006. Parser combination by reparsing. In NAACL '06: Proceedings of the Human Language Technology Conference of the NAACL, Companion Volume: Short Papers on XX, pages 129-132, Morristown, NJ, USA. Association for Computational Linguistics.
34. Q. Shi, J. Petterson, G. Dror, J. Langford, A. Smola, and S.V.N. Vishwanathan. 2009. Hash Kernels for Structured Data. In Journal of Machine Learning.
35. J. Suzuki, H. Isozaki, X. Carreras, and M Collins. 2009. An empirical study of semi-supervised structured conditional models for dependency parsing. In EMNLP, pages 551-560.
36. I. Titov and J. Henderson. 2007. A Latent Variable Model for Generative Dependency Parsing. In Proceedings of IWPT, pages 144-155.
37. H. Yamada and Y. Matsumoto. 2003. Statistical Dependency Analysis with Support Vector Machines. In Proceedings of IWPT, pages 195-206.
38. Y. Zhang and S. Clark. 2008. A tale of two parsers: investigating and combining graph-based and transition-based dependency parsing using beam-search. In Proceedings of EMNLP, Hawaii, USA.
39. Y. Zhang and J. Nivre. 2011. Transition-based dependency parsing with rich non-local features. In Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, pages 188-193, Portland, Oregon, USA, June. Association for Computational Linguistics.