In the five years since it was proposed, the MATE scheme for anaphoric annotation has been used in a variety of annotation projects, and the resulting corpora have been used to study both anaphora resolution and NL generation. Annotation tools inspired by the proposals have been used in some of these projects. In this paper we discuss these first experiences with the scheme, some lessons that h...

This paper presents a probabilistic model for resolution of non-pronominal anaphora in biomedical texts. The model seeks to find the antecedents of anaphoric expressions, both coreferent and associative ones, and also to identify discourse-new expressions. We consider only the noun phrases referring to biomedical entities. The model reaches state-of-the art performance: 5669% precision and 54-6...

We describe a simple word sense disambiguation system equipped with the Kennedy and Boguraev (1996) anaphora resolution algorithm, evaluated on the SENSEVAL-2 English all-words task. The system relies on the structure of the WordNet hierarchy to pick optimal senses for nouns in the text. Since anaphoric references are known to indicate the topic of the text (Boguraev et al., 1998), they may aid...

Much research in computational linguistics has concentrated on treating the individual phenomena of natural language rather than on how these treatments can be made to work together. This paper discusses four respects in which processes embodying individual treatments must be made to cooperate with one another if anaphoric expressions are to be interpreted correctly. These are the coordination ...

Abstract We investigate the hypothesis that a pronoun is used in discourse, when its antecedent is in the focus of the discourse. We create a corpus of ‘replaced anaphoric definite descriptions’, where occurrences of definite descriptions are replaced with a corresponding pronoun. We use the Lappin and Leass (1994) anaphora resolution algorithm on the new corpus, and obtain a much lower perform...

This document analyses and compares some approaches to the Anaphora Resolution task and describes a Mitkov algorithm based solution adapted to the Portuguese Language. The developed system proposes to resolve pronominal anaphora, namely third person, personal and possessive pronouns, relative and demonstrative pronouns. During the system development a manual annotation tool was created, allowin...

In this paper, we address the problem of predicting one of three functions for the English pronoun ‘it’: anaphoric, event reference or pleonastic. This disambiguation is valuable in the context of machine translation and coreference resolution. We present experiments using a MAXENT classifier trained on gold-standard data and self-training experiments of an RNN trained on silver-standard data, ...

Knowledge of noun phrase anaphoricity might be profitably exploited in coreference resolution to bypass the resolution of non-anaphoric noun phrases. However, it is surprising to notice that recent attempts to incorporate automatically acquired anaphoricity information into coreference resolution have been somewhat disappointing. This paper employs a global learning method in determining the an...