Anaphora resolution has been a widely studied problem in natural language processing almost since work in the field began (see [Hirst 1981, Mitkov 1999] for summaries). However, most work focuses on the resolution of pronouns, or, at best, on a wider range of anaphoric expressions which co-refer with their antecedents. Real natural language texts exhibit a much richer range of anaphoric phenome...

One of the types of semantic interpretation processes that may help ‘crossing the barriers’ in text summarization is anaphora resolution. In this paper, we show that summarization is a good task for evaluating the performance of an anaphoric resolver, in the sense that it encourages developing anaphoric resolvers that build good-quality discourse models, and the performance of the anaphoric res...

Clustering step in the mention-pair paradigm for coreference resolution, forms the chain of coreferent mentions from the mention pairs classified as coreferent. Clustering methods including best-first clustering considers each antecedent candidate individually, while selecting the antecedent for an anaphoric mention. Here we introduce an easyto-implement modification to best-first clustering to...

In this work a connectionist model used in the resolution of a well-known linguistic phenomenon as pronominal anaphoric reference is presented. The model is composed of two neural networks: a simple recurrent neural network (parser) and a feedforward neural network (segmenter). These networks are trained and tested simultaneously. With this model it is possible to solve anaphoric references wit...

We extend Zhao and Ng's (2007) Chinese anaphoric zero pronoun resolver by (1) using a richer set of features and (2) exploiting the coreference links between zero pronouns during resolution. Results on OntoNotes show that our approach significantly outperforms two state-of-the-art anaphoric zero pronoun resolvers. To our knowledge, this is the first work to report results obtained by an end-toe...

Anaphora resolution is still a challenging research field in natural language processing, lacking an algorithm that correctly resolves anaphoric pronouns. Anaphoric zero pronouns pose an even greater challenge, since this category is not lexically realised. Thus, their resolution is conditioned by their prior identification stage. This paper reports on the distribution of zero pronouns in Roman...

bination of anaphoric and metonymic inferences is chosen. Another problem with Norvig' s approach relates to the fact that insufficient results from the inference processes do not trigger additional computations in order to try yet another, perhaps not so obvious analysis. If, e.g., for reasons whatsoever no anaphoric inference is found for a definite noun phrase, Norvig' s system does not atte...

Deictic and anaphoric expressions frequently cause problems for natural language analysis. In this paper we present a single model that accounts for referent resolution of deictic and anaphoric expressions in a research prototype of a multimodal user interface called EDWARD. The linguistic expressions are keyed in by a user and are possibly accompanied by pointing gestures. The proposed model f...