Efficient third-order dependency parsers

ACL 2010 - 48th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference

Volumn , Issue , 2010, Pages 1-11

  Koo, Terry ^a   Collins, Michael ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DEPENDENCY PARSER; DEPENDENCY PARSING; HIGHER ORDER; PRAGUE DEPENDENCY TREEBANK; THIRD-ORDER;

COMPUTATIONAL LINGUISTICS;

FORESTRY;

COMPUTATION; FORESTRY;

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

References (38)

1. th CoNLL, pages 166-170. Association for Computational Linguistics.
2. th meeting of the Acoustical Society of America.
3. th CoNLL, pages 9-16. Association for Computational Linguistics.
4. Xavier Carreras. 2007. Experiments with a Higher-Order Projective Dependency Parser. In Proceedings of the CoNLL Shared Task Session of EMNLPCoNLL, pages 957-961. Association for Computational Linguistics.
5. Eugene Charniak and Mark Johnson. 2005. Coarseto-fine N-best Parsing and MaxEnt Discriminative Reranking. In Proceedings of the 43rd ACL.
6. Y.J. Chu and T.H. Liu. 1965. On the Shortest Arborescence of a Directed Graph. Science Sinica, 14:1396-1400.
7. John Cocke and Jacob T. Schwartz. 1970. Programming Languages and Their Compilers: Preliminary Notes. Technical report, New York University.
8. Michael Collins, Amir Globerson, Terry Koo, Xavier Carreras, and Peter L. Bartlett. 2008. Exponentiated Gradient Algorithms for Conditional Random Fields and Max-Margin Markov Networks. Journal of Machine Learning Research, 9:1775-1822, Aug.
9. th EMNLP, pages 1-8. Association for Computational Linguistics.
10. Jack R. Edmonds. 1967. Optimum Branchings. Journal of Research of the National Bureau of Standards, 71B:233-240.
11. Jason Eisner. 1996. Three New Probabilistic Models for Dependency Parsing: An Exploration. In Proceedings of the 16th COLING, pages 340-345. Association for Computational Linguistics.
12. Jason Eisner. 2000. Bilexical Grammars and Their Cubic-Time Parsing Algorithms. In Harry Bunt and Anton Nijholt, editors, Advances in Probabilistic and Other Parsing Technologies, pages 29-62. Kluwer Academic Publishers.
13. Yoav Freund and Robert E. Schapire. 1999. Large Margin Classification Using the Perceptron Algorithm. Machine Learning, 37(3):277-296.
14. Jan Hajič, Eva Hajičová, Petr Pajas, Jarmila Panevova, and Petr Sgall. 2001. The Prague Dependency Treebank 1.0, LDC No. LDC2001T10. Linguistics Data Consortium.
15. Jan Hajič. 1998. Building a Syntactically Annotated Corpus: The Prague Dependency Treebank. In Eva Hajičová, editor, Issues of Valency and Meaning. Studies in Honor of Jarmila Panevová, pages 12-19.
16. Mark Johnson. 1998. PCFG Models of Linguistic Tree Representations. Computational Linguistics, 24(4):613-632.
17. Tadao Kasami. 1965. An Efficient Recognition and Syntax-analysis Algorithm for Context-free Languages. Technical Report AFCRL-65-758, Air Force Cambridge Research Lab.
18. Terry Koo, Amir Globerson, Xavier Carreras, and Michael Collins. 2007. Structured Prediction Models via the Matrix-Tree Theorem. In Proceedings of EMNLP-CoNLL, pages 141-150. Association for Computational Linguistics.
19. Terry Koo, Xavier Carreras, and Michael Collins. 2008. Simple Semi-supervised Dependency Parsing. In Proceedings of the 46th ACL, pages 595-603. Association for Computational Linguistics.
20. Terry Koo. 2010. Advances in Discriminative Dependency Parsing. Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA, USA, June.
21. John Lafferty, Andrew McCallum, and Fernando Pereira. 2001. Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data. In Proceedings of the 18th ICML, pages 282-289. Morgan Kaufmann.
22. Mitchell P. Marcus, Beatrice Santorini, and Mary Ann Marcinkiewicz. 1993. Building a Large Annotated Corpus of English: The Penn Treebank. Computational Linguistics, 19(2):313-330.
23. th Static Analysis Symposium, pages 312-329. Springer-Verlag.
24. Ryan McDonald and Joakim Nivre. 2007. Characterizing the Errors of Data-Driven Dependency Parsers. In Proceedings of EMNLP-CoNLL, pages 122-131. Association for Computational Linguistics.
25. th EACL, pages 81-88. Association for Computational Linguistics.
26. Ryan McDonald and Giorgio Satta. 2007. On the Complexity of Non-Projective Data-Driven Dependency Parsing. In Proceedings of IWPT.
27. rd ACL, pages 91-98. Association for Computational Linguistics.
28. Ryan McDonald, Fernando Pereira, Kiril Ribarov, and Jan Hajič. 2005b. Non-Projective Dependency Parsing using Spanning Tree Algorithms. In Proceedings of HLT-EMNLP, pages 523-530. Association for Computational Linguistics.
29. Ryan McDonald. 2006. Discriminative Training and Spanning Tree Algorithms for Dependency Parsing. Ph.D. thesis, University of Pennsylvania, Philadelphia, PA, USA, July.
30. th CoNLL, pages 221-225. Association for Computational Linguistics.
31. Slav Petrov and Dan Klein. 2007. Improved Inference for Unlexicalized Parsing. In Proceedings of HLTNAACL, pages 404-411. Association for Computational Linguistics.
32. st EMNLP, pages 133-142. Association for Computational Linguistics.
33. th ACL, pages 577-585. Association for Computational Linguistics.
34. David A. Smith and Noah A. Smith. 2007. Probabilistic Models of Nonprojective Dependency Trees. In Proceedings of EMNLP-CoNLL, pages 132-140. Association for Computational Linguistics.
35. Jun Suzuki, Hideki Isozaki, Xavier Carreras, and Michael Collins. 2009. An Empirical Study of Semi-supervised Structured Conditional Models for Dependency Parsing. In Proceedings of EMNLP, pages 551-560. Association for Computational Linguistics.
36. Ben Taskar, Carlos Guestrin, and Daphne Koller. 2003. Max margin markov networks. In Sebastian Thrun, Lawrence K. Saul, and Bernhard Schölkopf, editors, NIPS. MIT Press.
37. th IWPT, pages 195-206. Association for Computational Linguistics.
38. 3. Information and Control, 10(2):189-208.