An algorithm for pronominal anaphora resolution
Computational Linguistics
Constraint Grammar: A Language-Independent System for Parsing Unrestricted Text
Constraint Grammar: A Language-Independent System for Parsing Unrestricted Text
A syntax-based part-of-speech analyser
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Automatic processing of large corpora for the resolution of anaphora references
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Robust method of pronoun resolution using full-text information
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
An integrated model for anaphora resolution
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Anaphora for everyone: pronominal anaphora resoluation without a parser
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
Coreference resolution in dialogues in English and Portuguese
CorefApp '99 Proceedings of the Workshop on Coreference and its Applications
| Hi-index | 0.00 |
The paper raises for discussion a proposal for the semi-automatic annotation of pronoun-antecedent pairs in corpora. The proposal is based on robust knowledge-poor pronoun resolution followed by post-editing. The paper is structured as follows. The introduction comments on the fact that automatic identification of referential links in corpora has lagged behind in comparison with similar lexical, syntactical and even semantic tasks. The second section of the paper outlines the author's practical and robust knowledge-based approach to pronoun resolution which will subsequently be put forward as the core of a larger architecture proposed for the automatic tagging of referential links. Section 3 briefly presents other related knowledge-poor approaches, while section 4 discusses the limitations and advantages of the practical approach. The main argument of the paper is to be found in section 5, where we present the idea of developing a semi-automatic environment for annotating anaphoric links and outline the components of such a program. Finally, the conclusion looks at the anticipated success rate of the approach.