The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Improving Coreference Resolution by Learning Entity-Level Distributed Representations
Open accessAbstract
A long-standing challenge in coreference resolution has been the incorporation of entity-level information - features defined over clusters of mentions instead of mention pairs. We present a neural network based coreference system that produces high-dimensional vector representations for pairs of coreference clusters. Using these representations, our system learns when combining clusters is desirable. We train the system with a learning-to-search algorithm that teaches it which local decisions (cluster merges) will lead to a high-scoring final coreference partition. The system substantially outperforms the current state-of-the-art on the English and Chinese portions of the CoNLL 2012 Shared Task dataset despite using few hand-engineered features.
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.
Integrity signals
Registry
Cites
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.
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
Hochreiter, S., & Schmidhuber, J. (1997) · Neural Computation · doi:10.1162/neco.1997.9.8.1735 · Cited by 102,318
Distributed Representations of Words and Phrases and their Compositionality
Mikolov, T., Sutskever, I., Chen, K., Corrado, G., & Dean, J. (2013) · arXiv · doi:10.48550/arxiv.1310.4546 · Cited by 24,533
(2010) · International Conference on Machine Learning · Cited by 13,995
Improving neural networks by preventing co-adaptation of feature detectors
Hinton, G. E., Srivastava, N., Krizhevsky, A., Sutskever, I., & Salakhutdinov, R. R. (2012) · arXiv · doi:10.48550/arxiv.1207.0580 · Cited by 6,382
A Machine Learning Approach to Coreference Resolution of Noun Phrases
Soon, W. M., Ng, H. T., & Lim, D. C. Y. (2001) · Computational Linguistics · doi:10.1162/089120101753342653 · Cited by 982
Hovy, E., Marcus, M., Palmer, M., Ramshaw, L., & Weischedel, R. (2006) · Proceedings of the Human Language Technology Conference of the NAACL, Companion Volume: Short Papers on XX - NAACL '06 · doi:10.3115/1614049.1614064 · Cited by 806 · cited 1×
“, 2012), which is derived from the OntoNotes corpus (Hovy et al., 2006).”
BackgroundImproving machine learning approaches to coreference resolution
Ng, V., & Cardie, C. (2001) · Proceedings of the 40th Annual Meeting on Association for Computational Linguistics - ACL '02 · doi:10.3115/1073083.1073102 · Cited by 702
A model-theoretic coreference scoring scheme
Vilain, M., Burger, J., Aberdeen, J., Connolly, D., & Hirschman, L. (1995) · Proceedings of the 6th conference on Message understanding - MUC6 '95 · doi:10.3115/1072399.1072405 · Cited by 683
(2012) · Cited by 618
On coreference resolution performance metrics
Luo, X. (2005) · Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing - HLT '05 · doi:10.3115/1220575.1220579 · Cited by 536
Search-based structured prediction
Daumé, H., Langford, J., & Marcu, D. (2009) · Machine Learning · doi:10.1007/s10994-009-5106-x · Cited by 465
A Multi-Pass Sieve for Coreference Resolution
Raghunathan, K., Lee, H., Rangarajan, S., Chambers, N., Surdeanu, M., Jurafsky, D., & Manning, C. D. (2010) · Cited by 335
Self-citationUnderstanding the value of features for coreference resolution
Bengtson, E., & Roth, D. (2008) · Proceedings of the Conference on Empirical Methods in Natural Language Processing - EMNLP '08 · doi:10.3115/1613715.1613756 · Cited by 254
Joint unsupervised coreference resolution with Markov logic
Poon, H., & Domingos, P. (2008) · Proceedings of the Conference on Empirical Methods in Natural Language Processing - EMNLP '08 · doi:10.3115/1613715.1613796 · Cited by 204
Unsupervised models for coreference resolution
Ng, V. (2008) · Proceedings of the Conference on Empirical Methods in Natural Language Processing - EMNLP '08 · doi:10.3115/1613715.1613795 · Cited by 197
Easy Victories and Uphill Battles in Coreference Resolution
Durrett, G., & Klein, D. (2013) · Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d13-1203 · Cited by 189
Learning to Search Better Than Your TeacherPreprint
Chang, K.-W., Krishnamurthy, A., Agarwal, A., Daumé, H., & Langford, J. C. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1502.02206 · Cited by 176
Learning Anaphoricity and Antecedent Ranking Features for Coreference Resolution
Wiseman, S., Rush, A. M., Shieber, S. M., & Weston, J. (2015) · doi:10.3115/v1/p15-1137 · Cited by 173
Learning Global Features for Coreference Resolution
Wiseman, S., Rush, A. M., & Shieber, S. M. (2016) · Proceedings of the 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies · doi:10.18653/v1/n16-1114 · Cited by 172
Entity-Centric Coreference Resolution with Model Stacking
Clark, K., & Manning, C. D. (2015) · Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers) · doi:10.3115/v1/p15-1136 · Cited by 159
Self-citationBjörkelund, A. J., & Kuhn, J. (2014) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.3115/v1/p14-1005 · Cited by 147
Coreference Resolution in a Modular, Entity-Centered Model
Haghighi, A., & Klein, D. (2010) · Cited by 141
Latent Structure Perceptron with Feature Induction for Unrestricted Coreference Resolution
Fernandes, E. R., dos Santos, C., & Milidiú, R. L. (2012) · Cited by 103
Daumé, H., & Marcu, D. (2005) · doi:10.3115/1220575.1220588 · Cited by 86
Latent Structures for Coreference Resolution
Martschat, S., & Strube, M. (2015) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00147 · Cited by 79
A ranking approach to pronoun resolution
Denis, P., & Baldridge, J. (2007) · HAL · Cited by 65
A Joint Framework for Coreference Resolution and Mention Head Detection
Peng, H., Chang, K.-W., & Roth, D. (2015) · Conference on Computational Natural Language Learning · doi:10.18653/v1/k15-1002 · Cited by 60
Efficient programmable learning to search.Preprint
Daumé, H., Langford, J. C., & Ross, S. (2014) · arXiv (Cornell University) · Cited by 17
Cited by
End-to-end Neural Coreference Resolution
Lee, K., He, L., Lewis, M., & Zettlemoyer, L. (2017) · Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d17-1018 · Cited by 869
Luan, Y., He, L., Ostendorf, M., & Hajishirzi, H. (2018) · arXiv · doi:10.48550/arxiv.1808.09602 · Cited by 714
Deep Learning for Entity Matching: A Design Space Exploration
Mudgal, S., Li, H., Rekatsinas, T., Doan, A., Park, Y., Krishnan, G., Deep, R., Arcaute, E., & Raghavendra, V. (2018) · Proceedings of the 2018 International Conference on Management of Data · doi:10.1145/3183713.3196926 · Cited by 550
Gender Bias in Coreference Resolution
Rudinger, R., Naradowsky, J., Leonard, B., & Van Durme, B. (2018) · Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 2 (Short Papers) · doi:10.18653/v1/n18-2002 · Cited by 443
“Neural The move to deep neural models led to more powerful antecedent scoring functions, and the subsequent learned feature combinations resulted in new state-of-the-art performance (Wiseman et al., 2015; Clark and Manning, 2016b).”
BackgroundLuan, Y., He, L., Ostendorf, M., & Hajishirzi, H. (2018) · Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d18-1360 · Cited by 422
Metadata
- Authors
- Clark, K., & Manning, C. D.
- Venue
- Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
- Published
- 2016
- Pages
- 643-653
- OpenAlex
- W2410503294
- Cited by
- 303
- References
- 28
- FWCI
- 22.51
- Type
- conference paper
- Language
- en
- Open access
- hybrid
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.