Simple window selection strategies for the simplified lesk algorithm for word sense disambiguation

6Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The Simplified Lesk Algorithm (SLA) is frequently used for word sense disambiguation. It disambiguates by calculating the overlap of a set of dictionary definitions (senses) and the context words. The algorithm is simple and fast, but it has relatively low accuracy. We propose simple strategies for the context window selection that improve the performance of the SLA: (1) constructing the window only with words that have an overlap with some sense of the target word, (2) excluding the target word itself from matching, and (3) avoiding repetitions in the context window. This paper describes the corresponding experiments. Comparison with other more complex knowledge-based algorithms is presented. © Springer-Verlag 2013.

Cite

CITATION STYLE

APA

Viveros-Jiménez, F., Gelbukh, A., & Sidorov, G. (2013). Simple window selection strategies for the simplified lesk algorithm for word sense disambiguation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8265 LNAI, pp. 217–227). https://doi.org/10.1007/978-3-642-45114-0_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free