%0 Journal Article %1 Dorow2005Using %A Dorow, Beate %A Widdows, Dominic %A Ling, Katarina %A Eckmann, Jean-Pierre %A Sergi, Danilo %A Moses, Elisha %C Trento %D 2005 %J 2nd Mean. Work. %K clustering graph phd schemdesc %T Using Curvature and Markov Clustering in Graphs for Lexical Acquisition and Word Sense Discrimination %U http://arxiv.org/abs/cond-mat/0403693 %X We introduce two different approaches for clustering semantically similarwords. We accommodate ambiguity by allowing a word to belong to severalclusters.Both methods use a graph-theoretic representation of words and theirparadigmatic relationships. The first approach is based on the concept ofcurvature and divides the word graph into classes of similar words by removingwords of low curvature which connect several dispersed clusters.The second method, instead of clustering the nodes, clusters the links in ourgraph. These contain more specific contextual information than nodesrepresenting just words. In so doing, we naturally accommodate ambiguity byallowing multiple class membership.Both methods are evaluated on a lexical acquisition task, using clustering toadd nouns to the WordNet taxonomy. The most effective method is linkclustering.

@article{Dorow2005Using, abstract = {We introduce two different approaches for clustering semantically similarwords. We accommodate ambiguity by allowing a word to belong to severalclusters.Both methods use a graph-theoretic representation of words and theirparadigmatic relationships. The first approach is based on the concept ofcurvature and divides the word graph into classes of similar words by removingwords of low curvature which connect several dispersed clusters.The second method, instead of clustering the nodes, clusters the links in ourgraph. These contain more specific contextual information than nodesrepresenting just words. In so doing, we naturally accommodate ambiguity byallowing multiple class membership.Both methods are evaluated on a lexical acquisition task, using clustering toadd nouns to the WordNet taxonomy. The most effective method is linkclustering.}, added-at = {2013-12-17T09:48:27.000+0100}, address = {Trento}, author = {Dorow, Beate and Widdows, Dominic and Ling, Katarina and Eckmann, Jean-Pierre and Sergi, Danilo and Moses, Elisha}, biburl = {https://www.bibsonomy.org/bibtex/224e28f837849259cad3e4b527c36a8dc/jullybobble}, interhash = {abf44299d91fc15c0fb5c62c8ed84636}, intrahash = {24e28f837849259cad3e4b527c36a8dc}, journal = {2nd Mean. Work.}, keywords = {clustering graph phd schemdesc}, month = feb, timestamp = {2014-07-27T15:43:19.000+0200}, title = {{Using Curvature and Markov Clustering in Graphs for Lexical Acquisition and Word Sense Discrimination}}, url = {http://arxiv.org/abs/cond-mat/0403693}, year = 2005 }