A linear programming formulation for global inference in natural language tasks

Proceedings of the 8th Conference on Computational Natural Language Learning, CoNLL 2004 - Held in cooperation with HLT-NAACL 2004

Volumn , Issue , 2004, Pages

  Roth, Dan ^a   Yih, Wen Tau ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NATURAL LANGUAGE PROCESSING SYSTEMS;

DECISION TIME; DISCRETE RANDOM VARIABLES; HUMAN LIKE; LINEAR PROGRAMMING FORMULATION; NAMED ENTITIES; NATURAL LANGUAGES; SEQUENTIAL CONSTRAINTS;

LINEAR PROGRAMMING;

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

References (20)

1. S. Abney. 1991. Parsing by chunks. In S. Abney R. Berwick and C. Tenny, editors, Principle-based parsing: Computation and Psycholinguistics, pages 257–278. Kluwer, Dordrecht.
2. C. Bishop, 1995. Neural Networks for Pattern Recognition, chapter 6.4: Modelling conditional distributions, page 215. Oxford University Press.
3. Y. Boykov, O. Veksler, and R. Zabih. 2001. Fast approximate energy minimization via graph cuts. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23(11):1222–1239, November.
4. C. Chekuri, S. Khanna, J. Naor, and L. Zosin. 2001. Approximation algorithms for the metric labeling problem via a new linear programming formulation. In Symposium on Discrete Algorithms, pages 109–118.
5. CPLEX. 2003. ILOG, Inc. CPLEX. http://www.ilog.com/products/cplex/.
6. T. Dietterich. 2002. Machine learning for sequential data: A review. In Structural, Syntactic, and Statistical Pattern Recognition, pages 15–30. Springer-Verlag.
7. J. Kleinberg and E. Tardos. 1999. Approximation algorithms for classification problems with pairwise relationships: Metric labeling and markov random fields. In IEEE Symposium on Foundations of Computer Science, pages 14–23.
8. J. Lafferty, A. McCallum, and F. Pereira. 2001. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In Proc. 18th International Conf. on Machine Learning, pages 282–289. Morgan Kaufmann, San Francisco, CA.
9. A. Levin, A. Zomet, and Yair Weiss. 2002. Learning to perceive transparency from the statistics of natural scenes. In NIPS-15; The 2002 Conference on Advances in Neural Information Processing Systems.
10. S. Li. 2001. Markov Random Field Modeling in Image Analisys. Springer-Verlag.
11. V. Punyakanok and D. Roth. 2001. The use of classifiers in sequential inference. In NIPS-13; The 2000 Conference on Advances in Neural Information Processing Systems, pages 995–1001. MIT Press.
12. D. Roth and W. Yih. 2002. Probabilistic reasoning for entity & relation recognition. In COLING 2002, The 19th International Conference on Computational Linguistics, pages 835–841.
13. D. Roth. 1998. Learning to resolve natural language ambiguities: A unified approach. In Proc. of AAAI, pages 806–813.
14. D. Roth. 2002. Reasoning with classifiers. In Proc. of the European Conference on Machine Learning, pages 506–510.
15. A. Schrijver. 1986. Theory of Linear and Integer Programming. Wiley Interscience series in discrete mathmatics. John Wiley & Sons, December.
16. B. Taskar, A. Pieter, and D. Koller. 2002. Discriminative probabilistic models for relational data. In Proc. of Uncertainty in Artificial Intelligence, pages 485–492.
17. E. Tjong Kim Sang and F. De Meulder. 2003. Introduction to the CoNLL-2003 shared task: Language-independent named entity recognition. In Proc. of CoNLL-2003, pages 142–147. Edmonton, Canada.
18. X. Wang and A. Regan. 2000. A cutting plane method for integer programming problems with binary variables. Technical Report UCI-ITS-WP-00-12, University of California, Irvine.
19. L. Wolsey. 1998. Integer Programming. John Wiley & Sons, Inc.
20. Xpress-MP. 2003. Dash Optimization. Xpress-MP. http://www.dashoptimization.com/products.html.