TY - GEN
T1 - Word sense disambiguation as an integer linear programming problem
AU - Panagiotopoulou, Vicky
AU - Varlamis, Iraklis
AU - Androutsopoulos, Ion
AU - Tsatsaronis, George
PY - 2012
Y1 - 2012
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84861700844&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-30448-4_5
DO - 10.1007/978-3-642-30448-4_5
M3 - Contribución a la conferencia
AN - SCOPUS:84861700844
SN - 9783642304477
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 33
EP - 40
BT - Artificial Intelligence
T2 - 7th Hellenic Conference on Artificial Intelligence, SETN 2012
Y2 - 28 May 2012 through 31 May 2012
ER -