Structured prediction models via the Matrix-Tree Theorem

EMNLP-CoNLL 2007 - Proceedings of the 2007 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning

Volumn , Issue , 2007, Pages 141-150

  Koo, Terry ^a   Globerson, Amir ^a   Carreras, Xavier ^a   Collins, Michael ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC FRAMEWORK; DEPENDENCY PARSER; DEPENDENCY STRUCTURES; KIRCHHOFF; MARGINALS; MATRIX-TREE THEOREM; PARTITION FUNCTIONS; SPANNING TREE; STATISTICAL MODELS; STRUCTURED PREDICTION; TRAINING METHODS;

ALGORITHMIC LANGUAGES; ALGORITHMS; COMPUTATIONAL LINGUISTICS; MATHEMATICAL MODELS; PLANT EXTRACTS;

NATURAL LANGUAGE PROCESSING SYSTEMS;

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

References (38)

1. J. Baker. 1979. Trainable grammars for speech recognition. In 97th meeting of the Acoustical Society of America.
2. P. Bartlett, M. Collins, B. Taskar, and D. McAllester. 2004. Exponentiated gradient algorithms for large-margin structured classification. In NIPS.
3. L.E. Baum, T. Petrie, G. Soules, and N. Weiss. 1970. A maximization technique occurring in the statistical analysis of probabilistic functions of markov chains. Annals of Mathematical Statistics, 41:164-171.
4. S. Buchholz and E. Marsi. 2006. CoNLL-X shared task on multilingual dependency parsing. In Proc. CoNLL-X.
5. X. Carreras. 2007. Experiments with a higher-order projective dependency parser. In Proc. EMNLP-CoNLL.
6. S. Chopra. 1989. On the spanning tree polyhedron. Oper. Res. Lett., pages 25-29.
7. Y.J. Chu and T.H. Liu. 1965. On the shortest arborescence of a directed graph. Science Sinica, 14:1396-1400.
8. M. Civit and M.A. MartÍ. 2002. Design principles for a Spanish treebank. In Proc. of the First Workshop on Treebanks and Linguistic Theories (TLT).
9. M. Collins. 2002. Discriminative training methods for hidden markov models: Theory and experiments with perceptron algorithms. In Proc. EMNLP.
10. S. Ďzeroski, T. Erjavec, N. Ledinek, P. Pajas, Z. Žabokrtsky, and A. ̌ Zele. 2006. Towards a Slovene dependency treebank. In Proc. of the Fifth Intern. Conf. on Language Resources and Evaluation (LREC).
11. J. Edmonds. 1967. Optimum branchings. Journal of Research of the National Bureau of Standards, 71B:233-240.
12. J. Eisner. 1996. Three new probabilistic models for dependency parsing: An exploration. In Proc. COLING.
13. A. Globerson, T. Koo, X. Carreras, and M. Collins. 2007. Exponentiated gradient algorithms for log-linear structured prediction. In Proc. ICML.
14. J. Hajič, O. Smrž, P. Zemánek, J. ̌ Snaidauf, and E. Beška. 2004. Prague Arabic dependency treebank: Development in data and tools. In Proc. of the NEMLAR Intern. Conf. on Arabic Language Resources and Tools, pages 110-117.
15. M. Johnson, S. Geman, S. Canon, Z. Chi, and S. Riezler. 1999. Estimators for stochastic unification-based grammars. In Proc. ACL.
16. M. Johnson. 2001. Joint and conditional estimation of tagging and parsing models. In Proc. ACL.
17. Y. Kawata and J. Bartels. 2000. Stylebook for the Japanese treebank in VERBMOBIL. Verbmobil-Report 240, Seminar f̈ur Sprachwissenschaft, Universiẗat T̈ubingen.
18. J. Lafferty, A. McCallum, and F. Pereira. 2001. Conditonal random fields: Probabilistic models for segmenting and labeling sequence data. In Proc. ICML.
19. R. McDonald and F. Pereira. 2006. Online learning of approximate dependency parsing algorithms. In Proc. EACL.
20. R. McDonald and G. Satta. 2007. On the complexity of nonprojective data-driven dependency parsing. In Proc. IWPT.
21. R. McDonald, K. Crammer, and F. Pereira. 2005a. Online large-margin training of dependency parsers. In Proc. ACL.
22. R. McDonald, F. Pereira, K. Ribarov, and J. Hajic. 2005b. Non-projective dependency parsing using spanning tree algorithms. In Proc. HLT-EMNLP.
23. R. McDonald, K. Lerman, and F. Pereira. 2006. Multilingual dependency parsing with a two-stage discriminative parser. In Proc. CoNLL-X.
24. J. Nivre, J. Hall, and J. Nilsson. 2004. Memory-based dependency parsing. In Proc. CoNLL.
25. K. Oflazer, B. Say, D. Zeynep Hakkani-Tür, and G. Tür. 2003. Building a Turkish treebank. In A. Abeilĺe, editor, Treebanks: Building and Using Parsed Corpora, chapter 15. Kluwer Academic Publishers.
26. M.A. Paskin. 2001. Cubic-time parsing and learning algorithms for grammatical bigram models. Technical Report UCB/CSD-01-1148, University of California, Berkeley.
27. J. Pearl. 1988. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference (2nd edition). Morgan Kaufmann Publishers.
28. S. Riezler, R. Kaplan, T. King, J. Maxwell, A. Vasserman, and R. Crouch. 2004. Speed and accuracy in shallow and deep stochastic parsing. In Proc. HLT-NAACL.
29. F. Sha and F. Pereira. 2003. Shallow parsing with conditional random fields. In Proc. HLT-NAACL.
30. N.A. Smith and J. Eisner. 2005. Contrastive estimation: Training log-linear models on unlabeled data. In Proc. ACL.
31. D.A. Smith and N.A. Smith. 2007. Probabilistic models of nonprojective dependency trees. In Proc. EMNLP-CoNLL.
32. B. Taskar, C. Guestrin, and D. Koller. 2004a. Max-margin markov networks. In NIPS.
33. B. Taskar, D. Klein, M. Collins, D. Koller, and C. Manning. 2004b. Max-margin parsing. In Proc. EMNLP.
34. I. Tsochantaridis, T. Hofmann, T. Joachims, and Y. Altun. 2004. Support vector machine learning for interdependent and structured output spaces. In Proc. ICML.
35. W. Tutte. 1984. Graph Theory. Addison-Wesley.
36. L. van der Beek, G. Bouma, R. Malouf, and G. van Noord. 2002. The Alpino dependency treebank. In Computational Linguistics in the Netherlands (CLIN).
37. Y. Matsumoto Y. Cheng, M. Asahara. 2005. Machine learningbased dependency analyzer for chinese. In Proc. ICCC.
38. H. Yamada and Y. Matsumoto. 2003. Statistical dependency analysis with support vector machines. In Proc. IWPT.