Word Sense Disambiguation as an Integer Linear Programming Problem

Vicky Panagiotopoulou¹, Iraklis Varlamis², Ion Androutsopoulos¹, and George Tsatsaronis³

¹Department of Informatics, Athens University of Economics and Business, Greece

²Department of Informatics and Telematics, Harokopio University, Athens, Greece

³Biotechnology Center (BIOTEC), Technische Universität Dresden, Germany

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.

LNAI 7297, p. 33 ff.

Full article in PDF | BibTeX

[email protected]
© Springer-Verlag Berlin Heidelberg 2012