Hearst Patterns Revisited: Automatic Hypernym Detection from Large Text Corpora

06/08/2018
by   Stephen Roller, et al.
0

Methods for unsupervised hypernym detection may broadly be categorized according to two paradigms: pattern-based and distributional methods. In this paper, we study the performance of both approaches on several hypernymy tasks and find that simple pattern-based methods consistently outperform distributional methods on common benchmark datasets. Our results show that pattern-based models provide important contextual constraints which are not yet captured in distributional methods.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/10/2020

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...
research
02/14/2018

Distributional Term Set Expansion

This paper is a short empirical study of the performance of centrality a...
research
12/09/2022

Closed pattern mining of interval data and distributional data

We discuss pattern languages for closed pattern mining and learning of i...
research
10/11/2012

Distributional Framework for Emergent Knowledge Acquisition and its Application to Automated Document Annotation

The paper introduces a framework for representation and acquisition of k...
research
01/11/2017

Distinguishing Antonyms and Synonyms in a Pattern-based Neural Network

Distinguishing between antonyms and synonyms is a key task to achieve hi...
research
12/14/2016

Hypernyms under Siege: Linguistically-motivated Artillery for Hypernymy Detection

The fundamental role of hypernymy in NLP has motivated the development o...
research
11/09/2017

Weakly-supervised Relation Extraction by Pattern-enhanced Embedding Learning

Extracting relations from text corpora is an important task in text mini...

Please sign up or login with your details

Forgot password? Click here to reset