Implementing a Reverse Dictionary, based on word definitions, using a Node-Graph Architecture

Sushrut Thorat, Varad Choudhari


Abstract
In this paper, we outline an approach to build graph-based reverse dictionaries using word definitions. A reverse dictionary takes a phrase as an input and outputs a list of words semantically similar to that phrase. It is a solution to the Tip-of-the-Tongue problem. We use a distance-based similarity measure, computed on a graph, to assess the similarity between a word and the input phrase. We compare the performance of our approach with the Onelook Reverse Dictionary and a distributional semantics method based on word2vec, and show that our approach is much better than the distributional semantics method, and as good as Onelook, on a 3k lexicon. This simple approach sets a new performance baseline for reverse dictionaries.
Anthology ID:
C16-1263
Volume:
Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers
Month:
December
Year:
2016
Address:
Osaka, Japan
Editors:
Yuji Matsumoto, Rashmi Prasad
Venue:
COLING
SIG:
Publisher:
The COLING 2016 Organizing Committee
Note:
Pages:
2797–2806
Language:
URL:
https://aclanthology.org/C16-1263
DOI:
Bibkey:
Cite (ACL):
Sushrut Thorat and Varad Choudhari. 2016. Implementing a Reverse Dictionary, based on word definitions, using a Node-Graph Architecture. In Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers, pages 2797–2806, Osaka, Japan. The COLING 2016 Organizing Committee.
Cite (Informal):
Implementing a Reverse Dictionary, based on word definitions, using a Node-Graph Architecture (Thorat & Choudhari, COLING 2016)
Copy Citation:
PDF:
https://aclanthology.org/C16-1263.pdf
Code
 novelmartis/RD16demo