Interpreting anaphors in natural language texts
Interpreting anaphors in natural language texts
An algorithm for pronominal anaphora resolution
Computational Linguistics
Anaphora for everyone: pronominal anaphora resoluation without a parser
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
Natural Language Understanding
Proceedings of the 2009 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the Eighth SoMeT_09
Proceedings of the 2010 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the 9th SoMeT_10
| Hi-index | 0.00 |
Intelligent information processing systems, including search, question answering, and summarization systems, must be able to handle pronouns, i.e. elements that do not have independent reference. We thus, focus on pronominal anaphora resolution (Mitkov [20], Kennedy and Boguraev [18], Lappin and Leass [19]), and identify the main features of an intelligent software design that includes the identification of minimal domains of interpretation based on asymmetric relations. We show that the identification of domains of interpretation based on asymmetric agreement (Di Sciullo [9]) opens new avenues in intelligent systems design.