CoChat

End-to-end Neural Coreference Resolution

Open access
Lee, Kenton, He, Luheng, Lewis, Mike, Zettlemoyer, Luke · 2017 · Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing

The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.

Abstract

We introduce the first end-to-end coreference resolution model and show that it significantly outperforms all previous work without using a syntactic parser or handengineered mention detector.The key idea is to directly consider all spans in a document as potential mentions and learn distributions over possible antecedents for each.The model computes span embeddings that combine context-dependent boundary representations with a headfinding attention mechanism.It is trained to maximize the marginal likelihood of gold antecedent spans from coreference clusters and is factored to enable aggressive pruning of potential mentions.Experiments demonstrate state-of-the-art performance, with a gain of 1.5 F1 on the OntoNotes benchmark and by 3.1 F1 using a 5-model ensemble, despite the fact that this is the first approach to be successfully trained with no external resources.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.18653/v1/d17-1018

Cites

17 of 17 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Research works printed but not linked: 9

  1. [3]3. Eric Bengtson and Dan Roth. 2008. Understanding the value of features for coreference resolution. In Pro- ceedings of the Conference on Empirical Methods in Natural Language Processing, pages 294-303. As- sociation for Computational Linguistics.
  2. [4]4. Anders Björkelund and Jonas Kuhn. 2014. Learn- ing structured perceptrons for coreference resolution with latent antecedents and non-local features. In ACL.
  3. [8]8. Greg Durrett and Dan Klein. 2013. Easy victories and uphill battles in coreference resolution. In EMNLP.
  4. [10]10. Eraldo Rezende Fernandes, Cícero Nogueira Dos San- tos, and Ruy Luiz Milidiú. 2012. Latent structure perceptron with feature induction for unrestricted coreference resolution. In Joint Conference on EMNLP and CoNLL-Shared Task, pages 41-48. As- sociation for Computational Linguistics.
  5. [11]11. Yarin Gal and Zoubin Ghahramani. 2016. A theoret- ically grounded application of dropout in recurrent neural networks. In Advances in Neural Information Processing Systems, pages 1019-1027.
  6. [17]17. Vinod Nair and Geoffrey E Hinton. 2010. Rectified linear units improve restricted boltzmann machines. In Proceedings of ICML.
  7. [18]18. Vincent Ng. 2010. Supervised noun phrase corefer- ence research: The first fifteen years. In Proceed- ings of the 48th annual meeting of the association for computational linguistics, pages 1396-1411. As- sociation for Computational Linguistics.
  8. [22]22. Karthik Raghunathan, Heeyoung Lee, Sudarshan Ran- garajan, Nathanael Chambers, Mihai Surdeanu, Dan Jurafsky, and Christopher Manning. 2010. A multi- pass sieve for coreference resolution. In Proceed- ings of the 2010 Conference on Empirical Methods in Natural Language Processing, pages 492-501. Association for Computational Linguistics.
  9. [26]26. Sam Wiseman, Alexander M. Rush, Stuart M. Shieber, and Jason Weston. 2015. Learning anaphoricity and antecedent ranking features for coreference resolu- tion. In ACL.

Cited by

See all 1,008

Metadata

Authors
Lee, K., He, L., Lewis, M., & Zettlemoyer, L.
Affiliations
  • University of Washington (US)
  • Google (United States) (US)
  • University of Pittsburgh (US)
Venue
Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing
Published
2017
Pages
188-197
OpenAlex
W2738152205
Cited by
869
References
15
Citations by year
2026: 13 · 2025: 27 · 2024: 43 · 2023: 120 · 2022: 115 · 2021: 203 · 2020: 143 · 2019: 135 · 2018: 65 · 2017: 5
FWCI
43.41
Type
conference paper
Language
en
Open access
Licence
cc-by
Locations
  • Conference on Empirical Methods in Natural Language Processing (EMNLP) (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • National Science Foundation (1252835, 1562364)
  • Tencent
  • Defense Advanced Research Projects Agency (FA8750-13-2-0019, FA8750)
  • Army Research Office (W911NF-16-1-, W911NF)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Natural Language Processing Techniques
  • Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
  • Physical Sciences › Computer Science › Artificial Intelligence › Speech and dialogue systems
Keywords
coreference resolution, end-to-end learning, mention detection, marginal likelihood, model pruning, OntoNotes, ensemble learning

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.