scispace - formally typeset
Journal ArticleDOI

Pronoun resolution

Reads0
Chats0
TLDR
Four examples, including the classic examples of Winograd and Charniak, are presented that demonstrate pronoun resolution within the semantic approach.
Abstract
Two approaches to the problem of pronoun resolution are presented. The first is a naive algorithm that works by traversing the surface parse trees of the sentences of the text in a particular order looking for noun phrases of the correct gender and number. The algorithm is shown to incorporate many, though not all, of the constraints on co-referentiality between a nonreflective pronoun and a possible antecedent, which have been discovered recently by linguists. The algorithm clearly does not work in all cases, but the results of an examination of several hundred examples from published texts show that it performs remarkably well.In the second approach, it is shown how pronoun resolution is handled in a comprehensive system for semantic analysis of English texts. The system consists of four basic semantic operations which work by accessing a data base of 'World knowledge" inferences, which are drawn selectively and in a context-dependent way in response to the operations. The first two operations seek to satisfy the demands made by predicates on the nature of their arguments and to discover the relations between sentences. The third operation - knitting - recognizes and merges redundant expressions. These three operations frequently result in a pronoun reference being resolved as a by-product. The fourth operation seeks to resolve those pronouns not resolved by the first three. It involves a bidirectional search of the text and 'World knowledge" for an appropriate chain of inference and utilizes the efficiency of the naive algorithm.Four examples, including the classic examples of Winograd and Charniak, are presented that demonstrate pronoun resolution within the semantic approach.

read more

Citations
More filters
Journal ArticleDOI

Coherence and Coreference

TL;DR: In this paper, formal definitions are given for several coherence relations, based on the operations of an inference system; that is, the relations between successive portions of a discourse are characterized in terms of the inferences that can be drawn from each.
Journal ArticleDOI

Resolving pronoun references

TL;DR: In this article, two approaches to resolving pronoun references are presented: a naive algorithm that works by traversing the surface parse trees of the sentences of the text in a particular order looking for noun phrases of the correct gender and number, and a comprehensive system for semantic analysis of English texts.
Proceedings Article

Stanford’s Multi-Pass Sieve Coreference Resolution System at the CoNLL-2011 Shared Task

TL;DR: The coreference resolution system submitted by Stanford at the CoNLL-2011 shared task was ranked first in both tracks, with a score of 57.8 in the closed track and 58.3 in the open track.
Journal ArticleDOI

TEAM: an experiment in the design of transportable natural-language interfaces

TL;DR: Several general problems of natural-language processing that were faced in constructing the TEAM system are discussed, including quantifier scoping, various pragmatic issues, and verb acquisition.
Proceedings ArticleDOI

A Mention-Synchronous Coreference Resolution Algorithm Based On the Bell Tree

TL;DR: A new approach for coreference resolution is proposed which uses the Bell tree to represent the search space and casts the coreference Resolution problem as finding the best path from the root of theBell tree to the leaf nodes.
Related Papers (5)