Word sense disambiguation as an integer linear programming problem

  • Authors:

  • Vicky Panagiotopoulou;Iraklis Varlamis;Ion Androutsopoulos;George Tsatsaronis

  • Affiliations:

  • Department of Informatics, Athens University of Economics and Business, Greece;Department of Informatics and Telematics, Harokopio University, Athens, Greece;Department of Informatics, Athens University of Economics and Business, Greece;Biotechnology Center (BIOTEC), Technische Universität Dresden, Germany

  • Venue:
  • SETN'12 Proceedings of the 7th Hellenic conference on Artificial Intelligence: theories and applications
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present an integer linear programming model of word sense disambiguation. Given a sentence, an inventory of possible senses per word, and a sense relatedness measure, the model assigns to the sentence's word occurrences the senses that maximize the total pairwise sense relatedness. Experimental results show that our model, with two unsupervised sense relatedness measures, compares well against two other prominent unsupervised word sense disambiguation methods.