TY - JOUR
T1 - Finding the most frequent sense of a word by the length of its definition
AU - Calvo, Hiram
AU - Gelbukh, Alexander
N1 - Publisher Copyright:
© Springer International Publishing Switzerland 2014.
PY - 2014
Y1 - 2014
N2 - Most frequent sense (MFS) is a very powerful heuristic in word sense disambiguation, extremely difficult to outperform with sophisticated methods. We show that counting the number of words, characters, or relationships of a word’s sense definitions allows guessing the most frequent sense of the word: the MFS usually has a longer gloss, more examples of usage, and more relationships with other words (synonyms, hyponyms, etc.). In addition, we show that this effect is resource-dependent, making some algorithms to perform differently with different dictionaries.
AB - Most frequent sense (MFS) is a very powerful heuristic in word sense disambiguation, extremely difficult to outperform with sophisticated methods. We show that counting the number of words, characters, or relationships of a word’s sense definitions allows guessing the most frequent sense of the word: the MFS usually has a longer gloss, more examples of usage, and more relationships with other words (synonyms, hyponyms, etc.). In addition, we show that this effect is resource-dependent, making some algorithms to perform differently with different dictionaries.
UR - http://www.scopus.com/inward/record.url?scp=84921785672&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-13647-9_1
DO - 10.1007/978-3-319-13647-9_1
M3 - Artículo
AN - SCOPUS:84921785672
SN - 0302-9743
VL - 8856
SP - 1
EP - 8
JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ER -