Improving Word Sense Disambiguation in Lexical Chaining
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.
Cite
Text
Galley and McKeown. "Improving Word Sense Disambiguation in Lexical Chaining." International Joint Conference on Artificial Intelligence, 2003. doi:10.7916/D86M3G58Markdown
[Galley and McKeown. "Improving Word Sense Disambiguation in Lexical Chaining." International Joint Conference on Artificial Intelligence, 2003.](https://mlanthology.org/ijcai/2003/galley2003ijcai-improving/) doi:10.7916/D86M3G58BibTeX
@inproceedings{galley2003ijcai-improving,
title = {{Improving Word Sense Disambiguation in Lexical Chaining}},
author = {Galley, Michel and McKeown, Kathleen R.},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2003},
pages = {1486-1488},
doi = {10.7916/D86M3G58},
url = {https://mlanthology.org/ijcai/2003/galley2003ijcai-improving/}
}