2009 ConciseIntegerLinearProgramming

• (Martins et al., 2009) ⇒ André Martins, Noah A. Smith, and Eric P. Xing. (2009). “Concise Integer Linear Programming Formulations for Dependency Parsing.” In: Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP.

Subject Headings: Integer Linear Program.

Cited By

• http://scholar.google.com/scholar?q=%22Concise+integer+linear+programming+formulations+for+dependency+parsing%22+2009
• http://dl.acm.org/citation.cfm?id=1687878.1687928&preflayout=flat#citedby

Quotes

Abstract

We formulate the problem of non-projective dependency parsing as a polynomial-sized integer linear program. Our formulation is able to handle non-local output features in an efficient manner; not only is it compatible with prior knowledge encoded as hard constraints, it can also learn soft constraints from data. In particular, our model is able to learn correlations among neighboring arcs (siblings and grandparents), word valency, and tendencies toward nearly-projective parses. The model parameters are learned in a max-margin framework by employing a linear programming relaxation. We evaluate the performance of our parser on data in several natural languages, achieving improvements over existing state-of-the-art methods.

References

,

	Author	volume	Date Value	title	type	journal	titleUrl	doi	note	year
2009 ConciseIntegerLinearProgramming	Eric P. Xing André Martins Noah A. Smith			Concise Integer Linear Programming Formulations for Dependency Parsing