Comparisons of Relatedness Measures through a Word Sense Disambiguation Task

Michael Zock’s work has focussed these last years on finding the appropriate and most adequate word when writing or speaking. The semantic relatedness between words can play an important role in this context. Previous studies have pointed out three kinds of approaches for their evaluation: a theoretical examination of the desirability (or not) of certain mathematical properties, for example in mathematically defined measures: distances, similarities, scores, …; a comparison with human judgement or an evaluation through NLP applications. In this article, we present a novel approach to analyse the semantic relatedness between words that is based on the relevance of semantic relatedness measures on the global level of a word sense disambiguation task. More specifically, for a given selection of senses of a text, a global similarity for the sense selection can be computed, by combining the pairwise similarities through a particular function (sum for example) between all the selected senses. This global similarity value can be matched to other possible values pertaining to the selection, for example the F1 measure resulting from the evaluation with a gold standard reference annotation. We use several classical local semantic similarity measures as well as measures built by our team and study the correlation of the global score compared to the F1 values of a gold standard. Thus, we are able to locate the typical output of an algorithm compared to an exhaustive evaluation, and thus to optimise the measures and the sense selection process in general.

[1]  George Kingsley Zipf,et al.  Human behavior and the principle of least effort , 1949 .

[2]  Iryna Gurevych,et al.  Using Distributional Similarity for Lexical Expansion in Knowledge-based Word Sense Disambiguation , 2012, COLING.

[3]  Felix Naumann,et al.  Data fusion , 2009, CSUR.

[4]  Jérôme Euzenat,et al.  A Feature and Information Theoretic Framework for Semantic Similarity and Relatedness , 2010, SEMWEB.

[5]  Roberto Navigli A Quick Tour of Word Sense Disambiguation, Induction and Related Approaches , 2012, SOFSEM.

[6]  L. R. Dice Measures of the Amount of Ecologic Association Between Species , 1945 .

[7]  D J Rogers,et al.  A Computer Program for Classifying Plants. , 1960, Science.

[8]  Ted Pedersen,et al.  Using WordNet-based Context Vectors to Estimate the Semantic Relatedness of Concepts , 2006 .

[9]  George A. Miller,et al.  A Semantic Concordance , 1993, HLT.

[10]  Michael Zock,et al.  Deliberate word access: an intuition, a roadmap and some preliminary empirical results , 2010, Int. J. Speech Technol..

[11]  Michael Zock,et al.  Storage does not Guarantee Access: The Problem of Organizing and Accessing Words in a Speaker's Lexicon , 2011 .

[12]  Hinrich Schütze,et al.  Automatic Word Sense Discrimination , 1998, Comput. Linguistics.

[13]  Michael E. Lesk,et al.  Automatic sense disambiguation using machine readable dictionaries: how to tell a pine cone from an ice cream cone , 1986, SIGDOC '86.

[14]  Ian Horrocks,et al.  The Semantic Web – ISWC 2010: 9th International Semantic Web Conference, ISWC 2010, Shanghai, China, November 7-11, 2010, Revised Selected Papers, Part I , 2010, SEMWEB.

[15]  Mirella Lapata,et al.  An Experimental Study of Graph Connectivity for Unsupervised Word Sense Disambiguation , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[16]  Roberto Navigli,et al.  Word sense disambiguation: A survey , 2009, CSUR.

[17]  Hwee Tou Ng,et al.  Integrating Multiple Knowledge Sources to Disambiguate Word Sense: An Exemplar-Based Approach , 1996, ACL.

[18]  Graeme Hirst,et al.  Evaluating WordNet-based Measures of Lexical Semantic Relatedness , 2006, CL.

[19]  A. Tversky Features of Similarity , 1977 .

[20]  Didier Schwab,et al.  Ant Colony Algorithm for the Unsupervised Word Sense Disambiguation of Texts: Comparison and Evaluation , 2012, COLING.

[21]  David Yarowsky,et al.  One Sense Per Discourse , 1992, HLT.

[22]  Mirella Lapata,et al.  Good Neighbors Make Good Senses: Exploiting Distributional Similarity for Unsupervised WSD , 2008, COLING.

[23]  Ted Pedersen,et al.  An Adapted Lesk Algorithm for Word Sense Disambiguation Using WordNet , 2002, CICLing.

[24]  Timothy Baldwin,et al.  A Reexamination of MRD-Based Word Sense Disambiguation , 2010, TALIP.

[25]  Yorick Wilks,et al.  Word Sense Disambiguation using Optimised Combinations of Knowledge Sources , 1998, COLING-ACL.

[26]  Graeme Hirst,et al.  Lexical chains as representations of context for the detection and correction of malapropisms , 1995 .

[27]  Louise Guthrie,et al.  Lexical Disambiguation using Simulated Annealing , 1992, COLING.

[28]  Kathleen F. McCoy,et al.  Efficient text summarization using lexical chains , 2000, IUI '00.

[29]  Didier Schwab,et al.  Worst-case complexity and empirical evaluation of artificial intelligence methods for unsupervised word sense disambiguation , 2013, Int. J. Web Eng. Technol..