Improving word sense disambiguation in lexical chaining
Year: 2003
Type: article
Abstract: Previous algorithms to compute lexical chains suffer either from a lack of accuracy in word sense disambiguation (WSD) or from computational inefficiency. In this paper, we present a new linear-time algorithm for lexical chaining that adopts the assumption of one sense per discourse. Our results show an improvement over previous algorithms when evaluated on a WSD task.
DOI: 10.7916/d86m3g58
Authors: McKeown, Kathleen, Galley, Michel
Institution: Columbia University
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1565570978
