DMCA
An Algorithm for Anaphora Resolution in Spanish Texts (2001)
Cached
Download Links
| Venue: | Computational Linguistics |
| Citations: | 15 - 2 self |
BibTeX
@ARTICLE{Palomar01analgorithm,
author = {Manuel Palomar and Lidia Moreno and Jesús Peral and Rafael Muñoz and Antonio Ferrández and Patricio Martínez-Barco and Maximiliano Saiz-noeda},
title = {An Algorithm for Anaphora Resolution in Spanish Texts},
journal = {Computational Linguistics},
year = {2001},
volume = {27},
pages = {567}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This paper presents an algorithm for identifying noun phrase antecedents of third person personal pronouns, demonstrative pronouns, reflexive pronouns, and omitted pronouns (zero pronouns) in unrestricted Spanish texts. We define a list of constraints and preferences for different types of pronominal expressions, and we document in detail the importance of each kind of knowledge (lexical, morphological, syntactic, and statistical) in anaphora resolution for Spanish. The paper also provides a definition for syntactic conditions on Spanish NP-pronoun noncoreference using partial parsing. The algorithm has been evaluated on a corpus of 1,677 pronouns and achieved a success rate of 76.8%. We have also implemented four competitive algorithms and tested their performance in a blind evaluation on the same test corpus. This new approach could easily be extended to other languages such as English, Portuguese, Italian, or Japanese
Keyphrases
anaphora resolution spanish text pronominal expression spanish np-pronoun noncoreference success rate third person personal pronoun different type noun phrase antecedent new approach unrestricted spanish text competitive algorithm reflexive pronoun demonstrative pronoun syntactic condition test corpus partial parsing blind evaluation
