A computational mechanism for pronominal reference

Abstract

the syntactically impossible antecedents. This latter This paper describes an implemented mechanism for handling bound anaphora, disjoint reference, and pronominal reference. The algorithm maps over every node in a parse tree in a left-to-right, depth first manner. Forward and backwards coreference, and disjoint reference are assigned during this tree walk. A semantic interpretation procedure is used to deal with multiple antecedents.

A language-independent anaphora resolution system for understanding multilingual texts

“…Our discourse module is similar to Carbonell and Brown [6] and Rich and LuperFoy's [16] work in using multiple KS's rather than a monolithic approach (cf. Grosz, Joshi and Weinstein [9], Grosz and Sidner [8], Hobbs [12], Ingria and Stallard [13]) for anaphora resolution. However, the main difference is that our system can deal with multiple languages as well as multiple discourse phenomena 5 because of our more fine-grained and hierarchically organized KS's.…”

Computational aspects of discourse in the context of MUC-3

“…The discourse components of those systems, which were developed primarily for question-answering applications in limited domains, are able to take advantage of having complete analyses of the input sentences . For example , syntactic information is used to constrain intra-sentential anaphora [19] ; complete semantic representation s (including quantification information) are used in generating discourse entities in a principled way [2] ; and centering heuristics [7,12] are used for tracking focus, improving anaphora resolution .…”

A syntactic filter on pronominal anaphora for Slot Grammar

“…The other two proposals are presented in Correa (1988), and in lngria and Stallard (1989). Both of these models are implementations oI Chomsky's Binding theory which make use of Government Binding type parsers.…”