Abstract
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.
This paper has been partially supported by the Spanish Government (CICYT) project number TIC2000-0664-C02.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Breck Baldwin. CogNIAC: high precision coreference with limited knowledge and linguistic resources. In Proceedings of ACL/EACL workshop on Operational factors in practical, robust anaphor resolution, pages 38–45, July 1997.
Antonio Ferrández, Manuel Palomar, Lidia Moreno. Slot Unification Grammar and Anaphora Resolution. In N. Nicolovand R. Mitkov, editors, Recent Advances in Natural Language Processing II, pp.155–166, J. Benjamins Publishing Company. 2000.
Robert J. Gaizauskas, Takahiro Wakao, Kevin Humphreys, Hamish Cunningham, and Yorick Wilks. Description of the LaSIE system as used for MUC-6. In Sixth Message Understanding Conference, pages 207–220, 1995.
Jerry R. Hobbs. 38 examples of elusive antecedents from published texts. Research report # 77-2, Department of Computer Sciences. City College, City University of New York. New York, August 1977.
Kevin Humphreys, Robert Gaizauskas, Saliha Azzam, Christian R. Huyck, B. Mitchell, Hamish Cunningham, and Yorick Wilks. Description of the LaSIE-II System as Used for MUC-7. In Seventh Message Understanding Conference, 1998.
Christopher Kennedy and Branimir Boguraev. Anaphora for everyone: pronominal anaphora resolution without a parser. In Proceedings of 16th International Conference on Computational Linguistics, volume I, pages 113–118, 1996.
Shalom Lappin and Herbert Leass. An algorithm for pronominal anaphora resolution. Computational Linguistics, 20(4):535–561, 1994.
Ruslan Mitkov and Malgorzata Stys. Robust reference resolution with limited knowledge: high precision genre-specific approach for English and Polish. In N. Nicolov and R. Mitkov, editors, Recent Advances in Natural Language Processing II, pp.143–154, J. Benjamins Publishing Company. 2000.
Lidia Moreno, Manuel Palomar, Antonio Molina, Antonio Ferrández. Introducción al Procesamiento del Lenguaje Natural. Servicio de Publicaciones de la Universidad de Alicante, Alicante, 1999.
Maximiliano Saiz-Noeda and Manuel Palomar. Semantic Knowledge-driven Method to Solve Pronominal Anaphora in Spanish. In Springer Verlag, editor, NLP’2000 Filling the gap between theory and practice, Lectures Notes In Artificial Intelligence. Springer-Verlag, pages 204–211, Patras, Greece, June 2000.
Maximiliano Saiz-Noeda, Jesús Peral, and Armando Suárez. Semantic Compatibility Techniques for Anaphora Resolution. In Proceedings of ACIDCA’2000, pages 43–48, Monastir, Tunisia, March 2000.
Pasi Tapanainen and Timo Jarvinen. A non-projective dependency parser. In Proceedings of the Fifth Conference on Applied Natural Language Processing, pages 64–71, April 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Saiz-Noeda, M., Palomar, M., Moreno, L. (2001). Pronoun Resolution in Spanish from Full Parsing. In: Matoušek, V., Mautner, P., Mouček, R., Taušer, K. (eds) Text, Speech and Dialogue. TSD 2001. Lecture Notes in Computer Science(), vol 2166. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44805-5_11
Download citation
DOI: https://doi.org/10.1007/3-540-44805-5_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42557-1
Online ISBN: 978-3-540-44805-1
eBook Packages: Springer Book Archive