2008 JointUnsupCorefResWithMarkovLogic

From GM-RKB
Jump to navigation Jump to search

Subject Headings: Unsupervised Learning Algorithm, Joint Inference Model, Markov Logic, Coreference Resolution Algorithm, Unsupervised Coreferebce Resolution System.

Notes

Cited By

Quotes

Abstract

  • Machine learning approaches to coreference resolution are typically supervised, and require expensive labeled data. Some unsupervised approaches have been proposed (e.g., Haghighi and Klein (2007)), but they are less accurate. In this paper, we present the first unsupervised approach that is competitive with supervised ones. This is made possible by performing joint inference across mentions, in contrast to the pairwise classification typically used in supervised methods, and by using Markov logic as a representation language, which enables us to easily express relations like apposition and predicate nominals. On MUC and ACE datasets, our model outperforms Haghigi and Klein's one using only a fraction of the training data, and often matches or exceeds the accuracy of state-of-the-art supervised models.

References

  • 1. B. Amit, and B. Baldwin. (1998). Algorithms for scoring coreference chains. In: Proceedings. MUC-7.
  • 2. Gükhan H. Bakir, Thomas Hofmann, Bernhard Schölkopf, Alexander J. Smola, Ben Taskar, S. V. N. Vishwanathan, Predicting Structured Data (Neural Information Processing), The MIT Press, 2007
  • 3. A. Culotta, Wick, M.; Hall, R. and McCallum, A. (2007). First-order probabilistic models for coreference resolution. In: Proceedings. NAACL-07.
  • 4. P Denis and J. Baldridge. (2007). Joint determination of anaphoricity and coreference resolution using integer programming. In: Proceedings. NAACL-07.
  • 5. Lise Getoor, Ben Taskar, Introduction to Statistical Relational Learning (Adaptive Computation and Machine Learning), The MIT Press, 2007
  • 6. Haghighi, A.&Klein, D. (2007). Unsupervised coreference resolution in a nonparametric Bayesian model. In: Proceedings. ACL-07.
  • 7. Kautz, H.; Selman, B.; and Jiang, Y. (1997). A general stochastic approach to solving problems with hard and soft constraints. In The Satisfiability Problem: Theory and Applications. AMS.
  • 8. Dan Klein, Christopher D. Manning, Accurate unlexicalized parsing, Proceedings of the 41st Annual Meeting on Association for Computational Linguistics, p.423-430, July 07-12, 2003, Sapporo, Japan doi:10.3115/1075096.1075150
  • 9. Kok, S.; Singla, P.; Matthew Richardson; Pedro Domingos; Sumner, M.; Poon, H.&Lowd, D. (2007). The Alchemy system for statistical relational AI. http://alchemy.cs.washington.edu/.
  • 10. Daniel Lowd, Pedro Domingos, Efficient Weight Learning for Markov Logic Networks, Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases, September 17-21, 2007, Warsaw, Poland doi:10.1007/978-3-540-74976-9_21
  • 11. Xiaoqiang Luo, Abe Ittycheriah, Hongyan Jing, Nanda Kambhatla, Salim Roukos, A mention-synchronous coreference resolution algorithm based on the Bell tree, Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics, p.135-es, July 21-26, 2004, Barcelona, Spain doi:10.3115/1218955.1218973
  • 12. A. McCallum, B. Wellner. (2005). Conditional models of identity uncertainty with application to noun coreference. In: Proceedings. NIPS-04.
  • 13. Vincent Ng, Machine learning for coreference resolution: from local classification to global ranking, Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics, p.157-164, June 25-30, 2005, Ann Arbor, Michigan doi:10.3115/1219840.1219860
  • 14. Hoifung Poon, Pedro Domingos, Sound and efficient inference with probabilistic and deterministic dependencies, Proceedings of the 21st national conference on Artificial intelligence, p.458-463, July 16-20, 2006, Boston, Massachusetts
  • 15. Hoifung Poon, Pedro Domingos, Joint inference in Information Extraction, Proceedings of the 22nd national conference on Artificial intelligence, p.913-918, July 22-26, 2007, Vancouver, British Columbia, Canada
  • 16. Hoifung Poon, Pedro Domingos, Marc Sumner, A general method for reducing the complexity of relational inference and its application to MCMC, Proceedings of the 23rd national conference on Artificial intelligence, p.1075-1080, July 13-17, 2008, Chicago, Illinois
  • 17. Matthew Richardson, Pedro Domingos, Markov logic networks, Machine Learning, v.62 n.1-2, p.107-136, February 2006 doi:10.1007/s10994-006-5833-1
  • 18. Marc Vilain, John Burger, John Aberdeen, Dennis Connolly, Lynette Hirschman, A model-theoretic coreference scoring scheme, Proceedings of the 6th conference on Message understanding, November 06-08, 1995, Columbia, Maryland doi:10.3115/1072399.1072405
  • 19. Wei Wei, Jordan Erenrich, Bart Selman, Towards efficient sampling: exploiting random walk strategies, Proceedings of the 19th national conference on Artifical intelligence, p.670-676, July 25-29, 2004, San Jose, California,


 AuthorvolumeDate ValuetitletypejournaltitleUrldoinoteyear
2008 JointUnsupCorefResWithMarkovLogicPedro Domingos
Hoifung Poon		Joint Unsupervised Coreference Resolution with Markov Logichttp://www.cs.washington.edu/homes/pedrod/papers/emnlp08.pdf
Retrieved from "http://www.gabormelli.com/RKB/index.php?title=2008_JointUnsupCorefResWithMarkovLogic&oldid=639392"