Some constraints on functions from sets and relations to sets are studied. Such constraints are satisfied by anaphoric functions, that is functions denoted by anaphoric determiners. These constraints are generalisations of anaphor conditions known from the study of simpler cases of nominal anaphors. In addition a generalisation of the notion of conservativity as applied to anaphoric functions i...

Coreference resolution systems usually attempt to find a suitable antecedent for (almost) every noun phrase. Recent studies, however, show that many definite NPs are not anaphoric. The same claim, obviously, holds for the indefinites as well. In this study we try to learn automatically two classifications, and , relevant for this problem. We use a small training corpus (MUC-7), but also acquire...

This paper describes the CTB Coreference Annotation Guidelines for annotating pronominal anaphoric expressions in the Penn Chinese Treebank. The goals of the annotation are: to provide training data for learning-based pronoun resolution tools, and to provide a \gold" standard to be used in the evaluation of pronoun resolution algorithms. The choices that were made concerning the coindexing of p...

Knowledge of the anaphoricity of a noun phrase might be profitably exploited by a coreference system to bypass the resolution of non-anaphoric noun phrases. Perhaps surprisingly, recent attempts to incorporate automatically acquired anaphoricity information into coreference systems, however, have led to the degradation in resolution performance. This paper examines several key issues in computi...

We have argued extensively in prior work that discourse connectives can be analyzed as encoding predicate-argument relations whose arguments derived from the interpretation of discourse units. All adverbial connectives we have analyzed to date have expressed binary relations. But they are special in taking one of their two arguments structurally, and the other, anaphorically. As such, interpret...

This paper demonstrates how Drosophila gene name recognition and anaphoric linking of gene names and their products can be achieved using existing information in FlyBase and the Sequence Ontology. Extending an extant approach to gene name recognition we achieved a F-score of 0.8559, and we report a preliminary experiment using a baseline anaphora resolution algorithm. We also present guidelines...

This paper summarizes the Protein Coreference Resolution task of BioNLP Shared Task 2011. After 7 weeks of system development period, the task received final submissions from 6 teams. Evaluation results show that state-of-the-art performance on the task can find 22.18% of protein coreferences with the precision of 73.26%. Analysis of the submissions shows that several types of anaphoric express...

The goal of the research is to make first steps for automated anaphora and co-reference resolution in Lithuanian language with respect to limited preprocessing tools and resources, by combining concepts and algorithms from different text analysis phases for this purpose. Existing resolution methods are created for major languages, e.g., English, and usually are language-specific. On the base of...

This paper addresses the task of predicting the correct French translations of third-person subject pronouns in English discourse, a problem that is relevant as a prerequisite for machine translation and that requires anaphora resolution. We present an approach based on neural networks that models anaphoric links as latent variables and show that its performance is competitive with that of a sy...

Coreference resolution, determining the appropriate discourse referent for an anaphoric expression, is an essential but difficult task in natural language processing. It has been observed that an important source of errors in machine-learning based approaches to this task, is the wrong disambiguation of the third person singular neuter pronoun as either referential or non-referential. In this p...