research-article

Free access

Joint unsupervised coreference resolution with Markov logic

Authors:

Pedro DomingosAuthors Info & Claims

EMNLP '08: Proceedings of the Conference on Empirical Methods in Natural Language Processing

Pages 650 - 659

Published: 25 October 2008 Publication History

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]

Amit, B.&Baldwin, B. 1998. Algorithms for scoring coreference chains. In Proc. MUC-7.

[2]

Bakir, G.; Hofmann, T.; Schölkopf, B.; Smola, A.; Taskar, B. and Vishwanathan, S. (eds.) 2007. Predicting Structured Data. MIT Press.

Digital Library

[3]

Culotta, A.; Wick, M.; Hall, R. and McCallum, A. 2007. First-order probabilistic models for coreference resolution. In Proc. NAACL-07.

[4]

Denis, P.&Baldridge, J. 2007. Joint determination of anaphoricity and coreference resolution using integer programming. In Proc. NAACL-07.

[5]

Getoor, L.&Taskar, B. (eds.) 2007. Introduction to Statistical Relational Learning. MIT Press.

Digital Library

[6]

Haghighi, A.&Klein, D. 2007. Unsupervised coreference resolution in a nonparametric Bayesian model. In Proc. 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]

Klein, D.&Manning, C. 2003. Accurate unlexicalized parsing. In Proc. ACL-03.

Digital Library

[9]

Kok, S.; Singla, P.; Richardson, M.; Domingos, P.; Sumner, M.; Poon, H.&Lowd, D. 2007. The Alchemy system for statistical relational AI. http://alchemy.cs.washington.edu/.

[10]

Lowd, D.&Domingos, D. 2007. Efficient weight learning for Markov logic networks. In Proc. PKDD-07.

[11]

Luo, X.; Ittycheriah, A.; Jing, H.; Kambhatla, N. and Roukos, S. 2004. A mention-synchronous coreference resolution algorithm based on the bell tree. In Proc. ACL-04.

Digital Library

[12]

McCallum, A.&Wellner, B. 2005. Conditional models of identity uncertainty with application to noun coreference. In Proc. NIPS-04.

[13]

Ng, V. 2005. Machine Learning for Coreference Resolution: From Local Classification to Global Ranking. In Proc. ACL-05.

Digital Library

[14]

Poon, H.&Domingos, P. 2006. Sound and efficient inference with probabilistic and deterministic dependencies. In Proc. AAAI-06.

Digital Library

[15]

Poon, H.&Domingos, P. 2007. Joint inference in information extraction. In Proc. AAAI-07.

Digital Library

[16]

Poon, H.&Domingos, P. 2008. A general method for reducing the complexity of relational inference and its application to MCMC. In Proc. AAAI-08.

Digital Library

[17]

Richardson, M.&Domingos, P. 2006. Markov logic networks. Machine Learning 62:107--136.

Digital Library

[18]

Vilain, M.; Burger, J.; Aberdeen, J.; Connolly, D.&Hirschman, L. 1995. A model-theoretic coreference scoring scheme. In Proc. MUC-6.

Digital Library

[19]

Wei, W.; Erenrich, J. and Selman, B. 2004. Towards efficient sampling: Exploiting random walk strategies. In Proc. AAAI-04.

Digital Library

Cited By

Wu ZRen XXu FLi JHan JChang YZhai CLiu YMaarek Y(2018)Indirect Supervision for Relation Extraction using Question-Answer PairsProceedings of the Eleventh ACM International Conference on Web Search and Data Mining10.1145/3159652.3159709(646-654)Online publication date: 2-Feb-2018
https://dl.acm.org/doi/10.1145/3159652.3159709
(2016)Context-based co-reference resolution for text document using graph model cont-graphInternational Journal of Knowledge Engineering and Data Mining10.5555/3052807.30528084:1(1-17)Online publication date: 1-Jan-2016
https://dl.acm.org/doi/10.5555/3052807.3052808
Han XSun L(2016)Global distant supervision for relation extractionProceedings of the Thirtieth AAAI Conference on Artificial Intelligence10.5555/3016100.3016315(2950-2956)Online publication date: 12-Feb-2016
https://dl.acm.org/doi/10.5555/3016100.3016315
Show More Cited By

Recommendations

Supervised models for coreference resolution
EMNLP '09: Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 2 - Volume 2

Traditional learning-based coreference resolvers operate by training a mention-pair classifier for determining whether two mentions are coreferent or not. Two independent lines of recent research have attempted to improve these mention-pair classifiers, ...
Bootstrapping coreference resolution using word associations
HLT '11: Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1

In this paper, we present an unsupervised framework that bootstraps a complete coreference resolution (CoRe) system from word associations mined from a large unlabeled corpus. We show that word associations are useful for CoRe -- e.g., the strong ...
Unsupervised Coreference Resolution Using a Graph Labeling Approach
Human Language Technology Challenges for Computer Science and Linguistics
Abstract
In this paper, we present a new unsupervised coreference resolution method, that models coreference resolution as a graph labeling problem. The proposed approach uses an incremental graph development method that hierarchically deploys coreference ...

Comments

Information & Contributors

Information

Published In

cover image DL Hosted proceedings

EMNLP '08: Proceedings of the Conference on Empirical Methods in Natural Language Processing

October 2008

1129 pages

Program Chairs:
Mirella Lapata
University of Edinburgh
,
Hwee Tou Ng
National University of Singapore

Publisher

Association for Computational Linguistics

United States

Publication History

Published: 25 October 2008

Qualifiers

Research-article

Acceptance Rates

Overall Acceptance Rate 73 of 234 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

52
Total Citations
View Citations
790
Total Downloads

Downloads (Last 12 months)31
Downloads (Last 6 weeks)10

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Wu ZRen XXu FLi JHan JChang YZhai CLiu YMaarek Y(2018)Indirect Supervision for Relation Extraction using Question-Answer PairsProceedings of the Eleventh ACM International Conference on Web Search and Data Mining10.1145/3159652.3159709(646-654)Online publication date: 2-Feb-2018
https://dl.acm.org/doi/10.1145/3159652.3159709
(2016)Context-based co-reference resolution for text document using graph model cont-graphInternational Journal of Knowledge Engineering and Data Mining10.5555/3052807.30528084:1(1-17)Online publication date: 1-Jan-2016
https://dl.acm.org/doi/10.5555/3052807.3052808
Han XSun L(2016)Global distant supervision for relation extractionProceedings of the Thirtieth AAAI Conference on Artificial Intelligence10.5555/3016100.3016315(2950-2956)Online publication date: 12-Feb-2016
https://dl.acm.org/doi/10.5555/3016100.3016315
Ren XCheng TGangemi ALeonardi SPanconesi A(2015)Synonym Discovery for Structured Entities on Heterogeneous GraphsProceedings of the 24th International Conference on World Wide Web10.1145/2740908.2745396(443-453)Online publication date: 18-May-2015
https://dl.acm.org/doi/10.1145/2740908.2745396
Benammar RTrémeau AMaret P(2015)An Approach for Ontology Population Based on Information Extraction TechniquesProceedings of the Confederated International Conferences on On the Move to Meaningful Internet Systems: OTM 2015 Conferences - Volume 941510.1007/978-3-319-26148-5_26(397-404)Online publication date: 26-Oct-2015
https://dl.acm.org/doi/10.1007/978-3-319-26148-5_26
Chen ZHuang YTian JLiu XFu KHuang T(2015)Joint model for subsentence-level sentiment analysis with Markov logicJournal of the Association for Information Science and Technology10.1002/asi.2330166:9(1913-1922)Online publication date: 1-Sep-2015
https://dl.acm.org/doi/10.1002/asi.23301
Wang WMazaitis KCohen WLi JWang XGarofalakis MSoboroff ISuel TWang M(2014)Structure Learning via Parameter LearningProceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management10.1145/2661829.2662022(1199-1208)Online publication date: 3-Nov-2014
https://dl.acm.org/doi/10.1145/2661829.2662022
Jindal PRoth DGunter CBaldi PWang W(2014)Joint inference for end-to-end coreference resolution for clinical notesProceedings of the 5th ACM Conference on Bioinformatics, Computational Biology, and Health Informatics10.1145/2649387.2649437(192-201)Online publication date: 20-Sep-2014
https://dl.acm.org/doi/10.1145/2649387.2649437
Can BManandhar S(2014)Methods and Algorithms for Unsupervised Learning of MorphologyProceedings of the 15th International Conference on Computational Linguistics and Intelligent Text Processing - Volume 840310.1007/978-3-642-54906-9_15(177-205)Online publication date: 6-Apr-2014
https://dl.acm.org/doi/10.1007/978-3-642-54906-9_15
Chen BSu JTan C(2013)Random walks down the mention graphs for event coreference resolutionACM Transactions on Intelligent Systems and Technology10.1145/2508037.25080554:4(1-20)Online publication date: 8-Oct-2013
https://dl.acm.org/doi/10.1145/2508037.2508055
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents