by Vincent D. Blondel
Abstract:
We propose a method for automatic synonym extraction in a dictionary. Our method is based on an algorithm that computes similarity measures between vertices in graphs. This algorithm can be thought of as a generalization of Kleinberg’s web search algorithm to structure graphs that are more general than the hub-authority graph used by Kleinberg. We use the 1913 Webster’s Dictionary and apply our method on four synonym queries. The results obtained are analyzed and compared to those obtained with two other methods.
Reference:
Automatic extraction of synonyms in a dictionary (Vincent D. Blondel), In in Proceedings of the SIAM Text Mining Workshop, 2002.
Bibtex Entry:
@inproceedings{Blondel2002,
abstract = {We propose a method for automatic synonym extraction in a dictionary. Our method is based on an algorithm that computes similarity measures between vertices in graphs. This algorithm can be thought of as a generalization of Kleinberg’s web search algorithm to structure graphs that are more general than the hub-authority graph used by Kleinberg. We use the 1913 Webster’s Dictionary and apply our method on four synonym queries. The results obtained are analyzed and compared to those obtained with two other methods.},
author = {Blondel, Vincent D.},
booktitle = {in Proceedings of the SIAM Text Mining Workshop},
keywords = {Kleinberg's method,SML-LIB-BIBLIO,Webster dictionnary,knowledge-based measure},
mendeley-tags = {Kleinberg's method,SML-LIB-BIBLIO,Webster dictionnary,knowledge-based measure},
title = {{Automatic extraction of synonyms in a dictionary}},
url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.64.8476},
year = {2002}
}