Anaphora resolution in ExtrAns

Diego Mollá, Rolf Schwitter, Fabio Rinaldi, James Dowdall, Michael Hess

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

9 Downloads (Pure)

Abstract

The true power of anaphora resolution algorithms can only be gauged when embedded into specific Natural Language Processing (NLP) applications. In this paper we describe the anaphora resolution module from ExtrAns, an answer extraction system. The anaphora resolution module is based on Lappin and Leass’ original algorithm, which used McCord’s Slot Grammar as the inherent parser. We report how to port Lappin and Leass’ algorithm to Link Grammar, a freely available dependency-based parsing system that is used in a range of NLP applications. Finally, we report on how the equivalence classes that result from the anaphora resolution algorithm are incorporated into the logical forms used by ExtrAns.
Original languageEnglish
Title of host publicationProceedings of the 2003 International Symposium on Reference Resolution and Its Applications to Question Answering and Summarization
PublisherARQAS
Pages67-74
Number of pages8
Publication statusPublished - 2003
EventInternational Symposium on ARQAS Anaphora Resolution in Question Answering and Summarization - Venice
Duration: 23 Jul 200324 Jul 2003

Conference

ConferenceInternational Symposium on ARQAS Anaphora Resolution in Question Answering and Summarization
CityVenice
Period23/07/0324/07/03

Fingerprint Dive into the research topics of 'Anaphora resolution in ExtrAns'. Together they form a unique fingerprint.

Cite this