Concise integer linear programming formulations for dependency parsing

ACL-IJCNLP 2009 - Joint Conf. of the 47th Annual Meeting of the Association for Computational Linguistics and 4th Int. Joint Conf. on Natural Language Processing of the AFNLP, Proceedings of the Conf.

Volumn , Issue , 2009, Pages 342-350

  Martins, André F T ^a,b   Smith, Noah A ^a   Xing, Eric P ^a  

^a Carnegie Mellon University   (United States)

^b INSTITUTO SUPERIOR TÉCNICO   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; NATURAL LANGUAGE PROCESSING SYSTEMS;

DEPENDENCY PARSING; INTEGER LINEAR PROGRAMMING FORMULATION; INTEGER LINEAR PROGRAMS; LINEAR PROGRAMMING RELAXATION; MODEL PARAMETERS; NATURAL LANGUAGES; NON-PROJECTIVE DEPENDENCY PARSING; STATE-OF-THE-ART METHODS;

INTEGER PROGRAMMING;

EID: 84859887629     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/1687878.1687928     Document Type: Conference Paper

References (34)

1. E. Boros and P.L. Hammer. 2002. Pseudo-Boolean optimization. Discrete Applied Mathematics, 123(1-3):155-225.
2. S. Buchholz and E. Marsi. 2006. CoNLL-X shared task on multilingual dependency parsing. In Proc. of CoNLL.
3. X. Carreras, M. Collins, and T. Koo. 2008. TAG, dynamic programming, and the perceptron for efficient, feature-rich parsing. In Proc. of CoNLL.
4. X. Carreras. 2007. Experiments with a higher-order projective dependency parser. In Proc. of CoNLL.
5. M. Chang, L. Ratinov, and D. Roth. 2008. Constraints as prior knowledge. In ICML Workshop on Prior Knowledge for Text and Language Processing.
6. Y. J. Chu and T. H. Liu. 1965. On the shortest arborescence of a directed graph. Science Sinica, 14:1396-1400.
7. J. Clarke and M. Lapata. 2008. Global inference for sentence compression an integer linear programming approach. JAIR, 31:399-429.
8. K. Crammer, O. Dekel, J. Keshet, S. Shalev-Shwartz, and Y. Singer. 2006. Online passive-aggressive algorithms. JMLR, 7:551-585.
9. A. Culotta and J. Sorensen. 2004. Dependency tree kernels for relation extraction. In Proc. of ACL.
10. P. Denis and J. Baldridge. 2007. Joint determination of anaphoricity and coreference resolution using integer programming. In Proc. of HLT-NAACL.
11. Y. Ding and M. Palmer. 2005. Machine translation using probabilistic synchronous dependency insertion grammar. In Proc. of ACL.
12. J. Edmonds. 1967. Optimum branchings. Journal of Research of the National Bureau of Standards, 71B:233-240.
13. J. Eisner and G. Satta. 1999. Efficient parsing for bilexical context-free grammars and head automaton grammars. In Proc. of ACL.
14. J. Eisner. 1996. Three new probabilistic models for dependency parsing: An exploration. In Proc. of COLING.
15. S. Kahane, A. Nasr, and O. Rambow. 1998. Pseudoprojectivity: a polynomially parsable non-projective dependency grammar. In Proc. of COLING-ACL.
16. S. Lacoste-Julien, B. Taskar, D. Klein, and M. I. Jordan. 2006. Word alignment via quadratic assignment. In Proc. of HLT-NAACL.
17. T. L. Magnanti and L. A. Wolsey. 1994. Optimal Trees. Technical Report 290-94, Massachusetts Institute of Technology, Operations Research Center.
18. A. F. T. Martins, D. Das, N. A. Smith, and E. P. Xing. 2008. Stacking dependency parsers. In Proc. of EMNLP.
19. A. F. T. Martins, N. A. Smith, and E. P. Xing. 2009. Polyhedral outer approximations with application to natural language parsing. In Proc. of ICML.
20. R. T. McDonald and F. C. N. Pereira. 2006. Online learning of approximate dependency parsing algorithms. In Proc. of EACL.
21. R. McDonald and G. Satta. 2007. On the complexity of non-projective data-driven dependency parsing. In Proc. of IWPT.
22. R. T. McDonald, F. Pereira, K. Ribarov, and J. Hajič. 2005. Non-projective dependency parsing using spanning tree algorithms. In Proc. of HLT-EMNLP.
23. J. Nivre and R. McDonald. 2008. Integrating graphbased and transition-based dependency parsers. In Proc. of ACL-HLT.
24. V. Punyakanok, D. Roth, W. Yih, and D. Zimak. 2004. Semantic role labeling via integer linear programming inference. In Proc. of COLING.
25. M. Richardson and P. Domingos. 2006. Markov logic networks. Machine Learning, 62(1):107-136.
26. S. Riedel and J. Clarke. 2006. Incremental integer linear programming for non-projective dependency parsing. In Proc. of EMNLP.
27. R. T. Rockafellar. 1970. Convex Analysis. Princeton University Press.
28. D. Roth and W. T. Yih. 2005. Integer linear programming inference for conditional random fields. In ICML.
29. A. Schrijver. 2003. Combinatorial Optimization: Polyhedra and Efficiency, volume 24 of Algorithms and Combinatorics. Springer.
30. D. A. Smith and J. Eisner. 2008. Dependency parsing by belief propagation. In Proc. of EMNLP.
31. M. Surdeanu, R. Johansson, A. Meyers, L. Màrquez, and J. Nivre. 2008. The conll-2008 shared task on joint parsing of syntactic and semantic dependencies. Proc. of CoNLL.
32. R. E. Tarjan. 1977. Finding optimum branchings. Networks, 7(1):25-36.
33. M. Wang, N. A. Smith, and T. Mitamura. 2007. What is the Jeopardy model? A quasi-synchronous grammar for QA. In Proceedings of EMNLP-CoNLL.
34. Y. Zhang and S. Clark. 2008. A tale of two parsers: investigating and combining graphbased and transition-based dependency parsing using beam-search. In Proc. of EMNLP.