Anaphora resolution with word sense disambiguation

Authors:
Judita Preiss
Affiliations:
Computer Laboratory, Cambridge, United Kingdom
Venue:
SENSEVAL '01 The Proceedings of the Second International Workshop on Evaluating Word Sense Disambiguation Systems
Year:
2001

Citing 4
Cited 2

Large lexicons for natural language processing: utilising the grammar coding system of LDOCE

Computational Linguistics - Special issue of the lexicon
An algorithm for pronominal anaphora resolution

Computational Linguistics
Generalized probabilistic LR parsing of natural language (Corpora) with unification-based grammars

Computational Linguistics - Special issue on using large corpora: I
Anaphora for everyone: pronominal anaphora resoluation without a parser

COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1

Comparing Knowledge Sources for Nominal Anaphora Resolution

Computational Linguistics
Using the web in machine learning for other-anaphora resolution

EMNLP '03 Proceedings of the 2003 conference on Empirical methods in natural language processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a simple word sense disambiguation system equipped with the Kennedy and Boguraev (1996) anaphora resolution algorithm, evaluated on the Senseval-2 English all-words task. The system relies on the structure of the WordNet hierarchy to pick optimal senses for nouns in the text. Since anaphoric references are known to indicate the topic of the text (Boguraev et al., 1998), they may aid disambiguation.