TY - JOUR
T1 - Is the most frequent sense of a word better connected in a semantic network?
AU - Calvo, Hiram
AU - Gelbukh, Alexander
N1 - Publisher Copyright:
© Springer International Publishing Switzerland 2015.
PY - 2015
Y1 - 2015
N2 - In this paper we show several experiments motivated by the hypothesis that counting the number of relationships each synset has in WordNet 2.0 is related to the senses that are the most frequent (MFS), because MFS usually has a longer gloss, more examples of usage, more relationships with other words (synonyms, hyponyms), etc. We present a comparison of finding the MFS through the relationships in a semantic network (WordNet) versus measuring only the number of characters, words and other features in the gloss of each sense. We found that counting only inbound relationships is different to counting both inbound and outbound relationships, and that second order relationships are not so helpful, despite restricting them to be of the same kind. We analyze the contribution of each different kind of relationship in a synset; and finally, we present an analysis of the different cases where our algorithm is able to find the correct sense in SemCor, being different from the MFS listed in WordNet.
AB - In this paper we show several experiments motivated by the hypothesis that counting the number of relationships each synset has in WordNet 2.0 is related to the senses that are the most frequent (MFS), because MFS usually has a longer gloss, more examples of usage, more relationships with other words (synonyms, hyponyms), etc. We present a comparison of finding the MFS through the relationships in a semantic network (WordNet) versus measuring only the number of characters, words and other features in the gloss of each sense. We found that counting only inbound relationships is different to counting both inbound and outbound relationships, and that second order relationships are not so helpful, despite restricting them to be of the same kind. We analyze the contribution of each different kind of relationship in a synset; and finally, we present an analysis of the different cases where our algorithm is able to find the correct sense in SemCor, being different from the MFS listed in WordNet.
UR - http://www.scopus.com/inward/record.url?scp=84983684803&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-22053-6_52
DO - 10.1007/978-3-319-22053-6_52
M3 - Artículo de la conferencia
AN - SCOPUS:84983684803
SN - 0302-9743
VL - 9227
SP - 491
EP - 499
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)
T2 - 11th International Conference on Intelligent Computing, ICIC 2015
Y2 - 20 August 2015 through 23 August 2015
ER -