Improving distributional thesauri by exploring the graph of neighbors - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Improving distributional thesauri by exploring the graph of neighbors

Vincent Claveau
Ewa Kijak

Résumé

In this paper, we address the issue of building and improving a distributional thesaurus. We first show that existing tools from the information retrieval domain can be directly used in order to build a thesaurus with state-of-the-art performance. Secondly, we focus more specifically on improving the obtained thesaurus, seen as a graph of k-nearest neighbors. By exploiting information about the neighborhood contained in this graph, we propose several contributions. 1) We show how the lists of neighbors can be globally improved by examining the reciprocity of the neighboring relation, that is, the fact that a word can be close of another and vice-versa. 2) We also propose a method to associate a confidence score to any lists of nearest neighbors (i.e. any entry of the thesaurus). 3) Last, we demonstrate how these confidence scores can be used to reorder the closest neighbors of a word. These different contributions are validated through experiments and offer significant improvement over the state-of-the-art.
Fichier principal
Vignette du fichier
Claveau_Kijak_Ferret_COLING14.pdf (376.76 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01027545 , version 1 (22-07-2014)

Identifiants

  • HAL Id : hal-01027545 , version 1

Citer

Vincent Claveau, Ewa Kijak, Olivier Ferret. Improving distributional thesauri by exploring the graph of neighbors. International Conference on Computational Linguistics, COLING 2014, Aug 2014, Dublin, Ireland. 12 p. ⟨hal-01027545⟩
283 Consultations
209 Téléchargements

Partager

Gmail Facebook X LinkedIn More