Anaphora Resolution with Word Sense Disambiguation

Judita Preiss · Meeting of the Association for Computational Linguistics · 2001

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.

Read the paper · More papers on PaperTik