A high-performance coreference resolution system using a constraint-based multi-agent strategy
Zhou GuoDong,Su Jian +1 more
- pp 522-528
TLDR
This paper presents a constraint-based multi-agent strategy to coreference resolution of general noun phrases in unrestricted English text and finds that the most recent antecedent always contains little information to directly determine the coreference relationship with the anaphor.Abstract:
This paper presents a constraint-based multi-agent strategy to coreference resolution of general noun phrases in unrestricted English text. For a given anaphor and all the preceding referring expressions as the antecedent candidates, a common constraint agent is first presented to filter out invalid antecedent candidates using various kinds of general knowledge. Then, according to the type of the anaphor, a special constraint agent is proposed to filter out more invalid antecedent candidates using constraints which are derived from various kinds of special knowledge. Finally, a simple preference agent is used to choose an antecedent for the anaphor form the remaining antecedent candidates, based on the proximity principle. One interesting observation is that the most recent antecedent of an anaphor in the coreferential chain is sometimes indirectly linked to the anaphor via some other antecedents in the chain. In this case, we find that the most recent antecedent always contains little information to directly determine the coreference relationship with the anaphor. Therefore, for a given anaphor, the corresponding special constraint agent can always safely filter out these less informative antecedent candidates. In this way, rather than finding the most recent antecedent for an anaphor, our system tries to find the most direct and informative antecedent. Evaluation shows that our system achieves Precision / Recall / F-measures of 84.7% / 65.8% / 73.9 and 82.8% / 55.7% / 66.5 on MUC-6 and MUC-7 English coreference tasks respectively. This means that our system achieves significantly better precision rates by about 8 percent over the best-reported systems while keeping recall rates.read more
Citations
More filters
Journal ArticleDOI
Deterministic coreference resolution based on entity-centric, precision-ranked rules
TL;DR: The two stages of the 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.
Proceedings Article
Easy-first Coreference Resolution
Veselin Stoyanov,Jason Eisner +1 more
TL;DR: An approach to coreference resolution that relies on the intuition that easy decisions should be made early, while harder decisions should been left for later when more information is available, and that automatically learns from training data what constitutes an easy decision.
Proceedings Article
Resolving Object and Attribute Coreference in Opinion Mining
Xiaowen Ding,Bing Liu +1 more
TL;DR: It is shown that some important features related to opinions can be exploited to perform the coreference resolution task more accurately and Experimental results using blog posts demonstrate the effectiveness of the technique.
Journal ArticleDOI
A scaffolding approach to coreference resolution integrating statistical and rule-based models
TL;DR: A scaffolding approach to the task of coreference resolution that incrementally combines statistical classifiers, each designed for a particular mention type, with rule-based models (for sub-tasks well-matched to determinism) and achieves a runtime speedup of 550 per cent without considerable loss of accuracy.
Proceedings ArticleDOI
Employing the Centering Theory in Pronoun Resolution from the Semantic Perspective
TL;DR: The use of both the semantic role features and the relative pronominal ranking feature in pronoun resolution is guided by extending the centering theory from the grammatical level to the semantic level in tracking the local discourse focus.
References
More filters
Book ChapterDOI
Fast effective rule induction
TL;DR: This paper evaluates the recently-proposed rule learning algorithm IREP on a large and diverse collection of benchmark problems, and proposes a number of modifications resulting in an algorithm RIPPERk that is very competitive with C4.5 and C 4.5rules with respect to error rates, but much more efficient on large samples.
Attention, intention, and the structure of discourse
TL;DR: A new theory of discourse structure that stresses the role of purpose and processing in discourse is explored and various properties of discourse are described, and explanations for the behavior of cue phrases, referring expressions, and interruptions are explored.
Journal ArticleDOI
Attention, intentions, and the structure of discourse
TL;DR: In this article, the authors explore a new theory of discourse structure that stresses the role of purpose and processing in discourse, and provide a framework for describing the processing of utterances in a discourse.
Journal ArticleDOI
A machine learning approach to coreference resolution of noun phrases
TL;DR: The learning approach to coreference resolution of noun phrases in unrestricted text is presented, indicating that on the general noun phrase coreference task, the learning approach holds promise and achieves accuracy comparable to that of nonlearning approaches.
Journal ArticleDOI
An algorithm for pronominal anaphora resolution
Shalom Lappin,Herbert J. Leass +1 more
TL;DR: The algorithm applies to the syntactic representations generated by McCord's Slot Grammar parser and relies on salience measures derived from syntactic structure and a simple dynamic model of attentional state and to models of anaphora resolution that invoke a variety of informational factors in ranking antecedent candidates.