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.
|Title of host publication||Proceedings of the 2003 International Symposium on Reference Resolution and Its Applications to Question Answering and Summarization|
|Number of pages||8|
|Publication status||Published - 2003|
|Event||International Symposium on ARQAS Anaphora Resolution in Question Answering and Summarization - Venice|
Duration: 23 Jul 2003 → 24 Jul 2003
|Conference||International Symposium on ARQAS Anaphora Resolution in Question Answering and Summarization|
|Period||23/07/03 → 24/07/03|