Simple Window Selection Strategies for the Simplified Lesk Algorithm for Word Sense Disambiguation

  • Francisco Viveros-Jiménez
  • Alexander Gelbukh
  • Grigori Sidorov
Conference paper

DOI: 10.1007/978-3-642-45114-0_17

Volume 8265 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Viveros-Jiménez F., Gelbukh A., Sidorov G. (2013) Simple Window Selection Strategies for the Simplified Lesk Algorithm for Word Sense Disambiguation. In: Castro F., Gelbukh A., González M. (eds) Advances in Artificial Intelligence and Its Applications. MICAI 2013. Lecture Notes in Computer Science, vol 8265. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Francisco Viveros-Jiménez
    • 1
  • Alexander Gelbukh
    • 1
    • 2
  • Grigori Sidorov
    • 1
    • 2
  1. 1.Centro de Investigación en Computación, Instituto Politécnico NacionalMexico CityMexico
  2. 2.Institute for Modern Linguistic Research“Sholokhov” Moscow State University for HumanitiesMoscowRussia