Log In Sign Up

Improving Hypernymy Detection with an Integrated Path-based and Distributional Method

by   Vered Shwartz, et al.

Detecting hypernymy relations is a key task in NLP, which is addressed in the literature using two complementary approaches. Distributional methods, whose supervised variants are the current best performers, and path-based methods, which received less research attention. We suggest an improved path-based algorithm, in which the dependency paths are encoded using a recurrent neural network, that achieves results comparable to distributional methods. We then extend the approach to integrate both path-based and distributional signals, significantly improving upon the state-of-the-art on this task.


page 1

page 2

page 3

page 4


Path-based vs. Distributional Information in Recognizing Lexical Semantic Relations

Recognizing various semantic relations between terms is beneficial for m...

Distinguishing Antonyms and Synonyms in a Pattern-based Neural Network

Distinguishing between antonyms and synonyms is a key task to achieve hi...

When Hearst Is not Enough: Improving Hypernymy Detection from Corpus with Distributional Models

We address hypernymy detection, i.e., whether an is-a relationship exist...

On the Compositionality Prediction of Noun Phrases using Poincaré Embeddings

The compositionality degree of multiword expressions indicates to what e...

Using Distributional Thesaurus Embedding for Co-hyponymy Detection

Discriminating lexical relations among distributionally similar words ha...

Searching for PETs: Using Distributional and Sentiment-Based Methods to Find Potentially Euphemistic Terms

This paper presents a linguistically driven proof of concept for finding...