An algorithm for pronominal anaphora resolution
Computational Linguistics
A non-projective dependency parser
ANLC '97 Proceedings of the fifth conference on Applied natural language processing
Anaphora for everyone: pronominal anaphora resoluation without a parser
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
University of Sheffield: description of the LaSIE system as used for MUC-6
MUC6 '95 Proceedings of the 6th conference on Message understanding
CogNIAC: high precision coreference with limited knowledge and linguistic resources
ANARESOLUTION '97 Proceedings of a Workshop on Operational Factors in Practical, Robust Anaphora Resolution for Unrestricted Texts
| Hi-index | 0.00 |
In this paper, a method to solve pronominal anaphora using full parsing is presented. This approach applies, like other traditional approaches do, a set of constraints and preferences to the list of candidates previously appeared in the text. In our approach, for Spanish, semantic criteria for the resolution process is also added. Furthermore, there have been defined some co-position preferences based on the study of the Solution Searching Space. The preliminary results obtained from the evaluation of this method have given an interesting success rate of 79.3% correctly resolved pronouns.