Papers
Topics
Authors
Recent
Search
2000 character limit reached

Using Distributional Thesaurus Embedding for Co-hyponymy Detection

Published 24 Feb 2020 in cs.CL | (2002.11506v1)

Abstract: Discriminating lexical relations among distributionally similar words has always been a challenge for NLP community. In this paper, we investigate whether the network embedding of distributional thesaurus can be effectively utilized to detect co-hyponymy relations. By extensive experiments over three benchmark datasets, we show that the vector representation obtained by applying node2vec on distributional thesaurus outperforms the state-of-the-art models for binary classification of co-hyponymy vs. hypernymy, as well as co-hyponymy vs. meronymy, by huge margins.

Citations (3)

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.