The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
On coreference resolution performance metrics
Open accessAbstract
The paper proposes a Constrained Entity-Alignment F-Measure (CEAF) for evaluating coreference resolution. The metric is computed by aligning reference and system entities (or coreference chains) with the constraint that a system (reference) entity is aligned with at most one reference (system) entity. We show that the best alignment is a maximum bipartite matching problem which can be solved by the Kuhn-Munkres algorithm. Comparative experiments are conducted to show that the widely-known MUC F-measure has serious flaws in evaluating a coreference system. The proposed metric is also compared with the ACE-Value, the official evaluation metric in the Automatic Content Extraction (ACE) task, and we conclude that the proposed metric possesses some properties such as symmetry and better interpretability missing in the ACE-Value.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
The Hungarian method for the assignment problem
Kuhn, H. W. (1955) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800020109 · Cited by 13,120
Practical Methods of Optimization
Fletcher, R. (2000) · Wiley eBooks · doi:10.1002/9781118723203 · Cited by 7,605
Practical methods of optimization
(1988) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(88)90129-2 · Cited by 5,818
Algorithms for the Assignment and Transportation Problems
Munkres, J. (1957) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0105003 · Cited by 3,986
The Hungarian method for the assignment problem
Kuhn, H. W. (2005) · Naval Research Logistics (NRL) · doi:10.1002/nav.20053 · Cited by 1,260
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
An extension of the Munkres algorithm for the assignment problem to rectangular matrices
Bourgeois, F., & Lassalle, J.-C. (1971) · Communications of the ACM · doi:10.1145/362919.362945 · Cited by 501
Cited by
(2012) · Cited by 618
Deterministic Coreference Resolution Based on Entity-Centric, Precision-Ranked Rules
Lee, H., Chang, A., Peirsman, Y., Chambers, N., Surdeanu, M., & Jurafsky, D. (2013) · Computational Linguistics · doi:10.1162/coli_a_00152 · Cited by 384
Deep Reinforcement Learning for Mention-Ranking Coreference Models
Clark, K., & Manning, C. D. (2016) · Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d16-1245 · Cited by 328
Evaluating the state of the art in coreference resolution for electronic medical records
Uzuner, O., Bodnari, A., Shen, S., Forbush, T., Pestian, J., & South, B. R. (2012) · Journal of the American Medical Informatics Association · doi:10.1136/amiajnl-2011-000784 · Cited by 164
CorefQA: Coreference Resolution as Query-based Span Prediction
Wu, W., Wang, F., Yuan, A., Wu, F., & Li, J. (2020) · Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics · doi:10.18653/v1/2020.acl-main.622 · Cited by 152
Metadata
- Authors
- Luo, X.
- Venue
- Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing - HLT '05
- Published
- 2005
- Pages
- 25-32
- OpenAlex
- W2098345921
- Cited by
- 536
- References
- 7
- FWCI
- 5.96
- Type
- conference paper
- Language
- en
- Open access
- gold
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On coreference resolution performance metrics. https://app.cochat.ai/papers/10.3115/1220575.1220579
- The paper
- Luo, X. (2005). On coreference resolution performance metrics. Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing - HLT '05. https://doi.org/10.3115/1220575.1220579
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.