Abstract

We propose a new deterministic approach to coreference resolution that combines the global information and precise features of modern machine-learning models with the transparency and modularity of deterministic, rule-based systems. Our sieve architecture applies a battery of deterministic coreference models one at a time from highest to lowest precision, where each model builds on the previous model's cluster output. The two stages of our sieve-based architecture, a mention detection stage that heavily favors recall, followed by coreference sieves that are precision-oriented, offer a powerful way to achieve both high precision and high recall. Further, our approach makes use of global information through an entity-centric model that encourages the sharing of features across all mentions that point to the same real-world entity. Despite its simplicity, our approach gives state-of-the-art performance on several corpora and genres, and has also been incorporated into hybrid state-of-the-art coreference systems for Chinese and Arabic. Our system thus offers a new paradigm for combining knowledge in rule-based systems that has implications throughout computational linguistics.

Keywords

CoreferenceComputer scienceArtificial intelligenceNatural language processingTransparency (behavior)Precision and recallModularity (biology)Resolution (logic)Machine learning

Affiliated Institutions

Related Publications

Publication Info

Year
2013
Type
article
Volume
39
Issue
4
Pages
885-916
Citations
392
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

392
OpenAlex

Cite This

Heeyoung Lee, Anne Lynn S. Chang, Yves Peirsman et al. (2013). Deterministic Coreference Resolution Based on Entity-Centric, Precision-Ranked Rules. Computational Linguistics , 39 (4) , 885-916. https://doi.org/10.1162/coli_a_00152

Identifiers

DOI
10.1162/coli_a_00152