A Statistical Approach to Anaphora Resolution

Published 1 January 1998

Niyu Ge, John Hale, Eugene Charniak

Citations221

TL;DR

An algorithm for identifying pronominal anaphora and two experiments based upon this algorithm are presented, which incorporate multiple anaphoras resolution factors into a statistical framework specifically the distance between the pronoun and the proposed antecedent, gender/number/animaticity of the proposal, governing head information and noun phrase repetition.

Abstract

This paper presents an algorithm for identifying pronominal anaphora and two experiments based upon this algorithm. We incorporate multiple anaphora resolution factors into a statistical framework -- specifically the distance between the pronoun and the proposed antecedent, gender/number/animaticity of the proposed antecedent, governing head information and noun phrase repetition. We combine them into a single probability that enables hs to identify the referent. Our first experiment shows the relative contribution of each source Of information and demonstrates a success rate of 82.9% for all sources combined. The second experiment investigates a method for unsuper- vised learning of gender/number/animaticity information. We present some experiments illustrating the accuracy of the method and note that with this information added, our pronoun resolution method achieves 84.2% accuracy.

Keywords

Computer Science

C4.5: Programs for Machine Learning

23,665 Citations1992J. R. Quinlan

A complete guide to the C4.5 system as implemented in C for the UNIX environment, which starts from simple core learning methods and shows how they can be elaborated and extended to deal with typical problems such as missing data and over hitting.

Building a Large Annotated Corpus of English: The Penn Treebank

7,528 Citations1993Mitchell P. Marcus

Accurate methods for the statistics of surprise and coincidence

2,688 Citations1993Ted Dunning

Predicting the semantic orientation of adjectives

1,439 Citations1997Vasileios Hatzivassiloglou, Kathleen McKeown

A log-linear regression model uses constraints from conjunctions to predict whether conjoined adjectives are of same or different orientations, achieving 82% accuracy in this task when each conjunction is considered independently.

View PDF

Computational LinguisticsAn algorithm for pronominal anaphora resolution

758 Citations1994Shalom Lappin, Herbert J. Leass

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.

A centering approach to pronouns

540 Citations1987Susan E. Brennan, Marilyn Walker Friedman +1 more

A formalization of the centering approach to modeling attentional structure in discourse is presented and used as the basis for an algorithm to track discourse context and bind pronouns and proposes an extension to these states of continuing, retaining and shifting.

View PDF

Statistical parsing with a context-free grammar and word statistics

535 Citations1997Eugene Charniak

A parsing system based upon a language model for English that is, in turn, based upon assigning probabilities to possible parses for a sentence that outperforms previous schemes is described.

ACM SIGART BulletinPronoun resolution

91 Citations1977Jerry R. Hobbs

Four examples, including the classic examples of Winograd and Charniak, are presented that demonstrate pronoun resolution within the semantic approach.

View PDF

Factors in anaphora resolution: they are not the only things that matter

58 Citations1997Ruslan Mitkov

The paper discusses the significance of factors in anaphora resolution and on the basis of a comparative study argues that what matters is not only a good set of reliable factors but also the strategy for their application.

View PDF