BibSonomy :: publication ::

tag user group author concept BibTeX key search:all search:diego_ma

The blue social bookmark and publication sharing system.

entry of diego_ma:

(0)

This publication has not been reviewed yet.

rating distribution

average user rating

The average rating is computed over all reviews. However, some of them may be invisible to you due to the visibility setting chosen by the reviewers.

(0.0 of 5.0 based on 0 reviews)

Anaphora Resolution in ExtrAns

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

In: Proceedings 2003 International Symposium on Reference Resolution and Its Applications to Question Answering and Summarization (2003) .

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.

BibTeX record

@inproceedings{Molla:2003,
  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.},
  added-at = {2008-02-20T02:26:16.000+0100},
  author = {Moll{\'a}, Diego and Schwitter, Rolf and Rinaldi, Fabio and Dowdall, James and Hess, Michael},
  biburl = {http://www.bibsonomy.org/bibtex/29d716a9f33e87299d7bf2edfd2c1eefb/diego_ma},
  booktitle = {Proceedings 2003 International Symposium on Reference Resolution and Its Applications to Question Answering and Summarization},
  interhash = {b6594f59f0fa5a2ffb4327449718bec1},
  intrahash = {9d716a9f33e87299d7bf2edfd2c1eefb},
  keywords = {anaphora ExtrAns},
  timestamp = {2008-02-20T02:26:16.000+0100},
  title = {Anaphora Resolution in ExtrAns},
  year = 2003
}

Endnote record

%0 Conference Paper
%1 Molla:2003
%A Moll{\'a}, Diego
%A Schwitter, Rolf
%A Rinaldi, Fabio
%A Dowdall, James
%A Hess, Michael
%B Proceedings 2003 International Symposium on Reference Resolution and Its Applications to Question Answering and Summarization
%D 2003
%K 
%T Anaphora Resolution in ExtrAns
%X 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.