TY - GEN
T1 - Using Pseudowords for Algorithm Comparison: An Evaluation Framework for Graph-based Word Sense Induction
AU - Cecchini, Flavio Massimiliano
AU - Martin, Riedl
AU - Chris, Biemann
PY - 2017
Y1 - 2017
N2 - In this paper we define two parallel data sets based on pseudowords, extracted from the same corpus. They both consist of word-centered graphs for each of 1225 different pseudowords, and use respectively first-order co-occurrences and secondorder semantic similarities. We propose an evaluation framework on these data sets for graph-based Word Sense Induction (WSI) focused on the case of coarsegrained homonymy: We compare different WSI clustering algorithms by measuring how well their outputs agree with the a priori known ground-truth decomposition of a pseudoword. We perform this evaluation for four different clustering algorithms: the Markov cluster algorithm, Chinese Whispers, MaxMax and a gangplankbased clustering algorithm. To further improve the comparison between these algorithms and the analysis of their behaviours, we also define a new specific evaluation measure. As far as we know, this is the first large-scale systematic pseudoword evaluation dedicated to the induction of coarsegrained homonymous word senses.
AB - In this paper we define two parallel data sets based on pseudowords, extracted from the same corpus. They both consist of word-centered graphs for each of 1225 different pseudowords, and use respectively first-order co-occurrences and secondorder semantic similarities. We propose an evaluation framework on these data sets for graph-based Word Sense Induction (WSI) focused on the case of coarsegrained homonymy: We compare different WSI clustering algorithms by measuring how well their outputs agree with the a priori known ground-truth decomposition of a pseudoword. We perform this evaluation for four different clustering algorithms: the Markov cluster algorithm, Chinese Whispers, MaxMax and a gangplankbased clustering algorithm. To further improve the comparison between these algorithms and the analysis of their behaviours, we also define a new specific evaluation measure. As far as we know, this is the first large-scale systematic pseudoword evaluation dedicated to the induction of coarsegrained homonymous word senses.
KW - Graphs
KW - Pseudowords
KW - Word Sense Induction
KW - Graphs
KW - Pseudowords
KW - Word Sense Induction
UR - http://hdl.handle.net/10807/122036
M3 - Conference contribution
SN - 9789176856017
VL - 131
T3 - LINKÖPING ELECTRONIC CONFERENCE PROCEEDINGS
SP - 105
EP - 114
BT - Proceedings of the 21st Nordic Conference on Computational Linguistics, NoDaLiDa
T2 - Nordic Conference on Computational Linguistics, NoDaLiDa
Y2 - 22 May 2017 through 24 May 2017
ER -