A Linear Programming Formulation for Global Inference in Natural Language Tasks

A Linear Programming Formulation for Global Inference in Natural Language Tasks (2004)

Cached

Download Links

by Dan Roth , Wen-tau Yih

Venue:	In Proceedings of CoNLL-2004
Citations:	91 - 26 self

BibTeX

@INPROCEEDINGS{Roth04alinear,
    author = {Dan Roth and Wen-tau Yih},
    title = {A Linear Programming Formulation for Global Inference in Natural Language Tasks},
    booktitle = {In Proceedings of CoNLL-2004},
    year = {2004},
    pages = {1--8}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

The typical processing paradigm in natural language processing is the "pipeline" approach, where learners are being used at one level, their outcomes are being used as features for a second level of predictions and so one. In addition to accumulating errors, it is clear that the sequential processing is a crude approximation to a process in which interactions occur across levels and down stream decisions often interact with previous decisions. This work develops a general...

Citations

1548	BConditional random fields: Probabilistic models for segmenting and labeling sequence data - Lafferty, McCallum, et al.
905	Fast approximate energy minimization via graph cuts - Boykov, Veksler, et al.
291	Parsing by chunks - Abney - 1991
276	D: Discriminative probabilistic models for relational data - Taskar, Abbeel, et al. - 2002
198	Integer programming - Wolsey - 1998
196	Markov Random Field Modeling in Image Analysis - Li - 2001
154	Learning to resolve natural language ambiguities: A unified approach - Roth - 1998
136	Learning to Parse Natural Language with Maximum Entropy Models’. Machine Learning 34:151–175 - Ratnaparkhi - 1999
131	Approximation algorithms for classification problems with pairwise relationships: Metric labeling and markov random fields - Kleinberg, Tardos - 1999
87	Introduction to the conll-2003 shared task: Languageindependent named entity recognition - Sang, Meulder - 2003
83	The use of classifiers in sequential inference - Punyakanok, Roth - 2001
54	Approximation algorithms for the metric labeling problem via a new linear programming formulation - Chekuri, Khanna, et al. - 2001
47	Probabilistic Reasoning for Entity & Relation Recognition - Roth, Yih - 2002
44	Named entity recognition with character-level models - Klein, Smarr, et al. - 2003
34	Neural networks for pattern recognition (Chapter 6.4: Modelling conditional distributions - Bishop - 1995
30	Learning to perceive transparency from the statistics of natural scenes - Levin, Zomet, et al. - 2002
15	Theory of linear and integer programming. Wiley Interscience series in discrete mathmatics - Schrijver - 1986
13	Reasoning with classifiers - Roth - 2001
11	Linear and integer programming: theory and practice - Sierksma - 2001
5	Discriminative Probabilistic Models for Relational Data - Tasker, Abbeel, et al. - 2002
5	A cutting plane method for integer programming problems with binary variables - Wang, Regan - 2000