A Linear Programming Formulation for Global Inference in Natural Language Tasks
作者： Wen-tau Yih , Dan Roth
DOI:
关键词:
摘要: … We develop a linear programming formulation for this problem and evaluate it in the context of simultaneously learning named entities and relations. Our approach allows us to …
aclweb.org参考文章(19)
Thomas G. Dietterich, Machine Learning for Sequential Data: A Review Lecture Notes in Computer Science. pp. 15- 30 ,(2002) , 10.1007/3-540-70659-3_2
Christopher M. Bishop, Neural networks for pattern recognition ,(1995)
Gautam Appa, Gerard Sierksma, Linear and integer programming; Theory and practice The Mathematical Gazette. ,vol. 83, pp. 560- 561 ,(1999) , 10.2307/3621017
Dan Roth, Learning to resolve natural language ambiguities: a unified approach national conference on artificial intelligence. pp. 806- 813 ,(1998)
Adwait Ratnaparkhi, Learning to Parse Natural Language with Maximum Entropy Models Machine Learning. ,vol. 34, pp. 151- 175 ,(1999) , 10.1023/A:1007502103375
Alexander Schrijver, Theory of Linear and Integer Programming ,(1986)
Chandra Chekuri, Joseph (Seffi) Naor, Sanjeev Khanna, Leonid Zosin, Approximation algorithms for the metric labeling problem via a new linear programming formulation symposium on discrete algorithms. pp. 109- 118 ,(2001) , 10.5555/365411.365426
Dan Klein, Joseph Smarr, Huy Nguyen, Christopher D. Manning, Named entity recognition with character-level models north american chapter of the association for computational linguistics. pp. 180- 183 ,(2003) , 10.3115/1119176.1119204
Dan Roth, Wen-tau Yih, Probabilistic reasoning for entity & relation recognition Proceedings of the 19th international conference on Computational linguistics -. pp. 1- 7 ,(2002) , 10.3115/1072228.1072379
Jon Kleinberg, Éva Tardos, Approximation algorithms for classification problems with pairwise relationships Journal of the ACM. ,vol. 49, pp. 616- 639 ,(2002) , 10.1145/585265.585268