Challenge: Existing unsupervised methods for learning hypernyms from unlabeled text are not scaled to large vocabularies or yield unacceptably poor accuracy.
Approach: They propose an unsupervised method of hypernym discovery using word contexts . they use word2vec to embed word context distributions without supervision .
Outcome: The proposed method provides double the precision and highest average performance on 11 datasets.

Similar Papers

Data Augmentation for Hypernymy Detection (2021.eacl-main)

Copied to clipboard

Challenge: Existing methods for supervised inference have limited quality training data.
Approach: They propose two techniques which generate new training examples from existing ones . they combine linguistic principles of hypernym transitivity and intersective modifier-noun composition .
Outcome: The proposed techniques generate new training examples from existing datasets.
Using Distributional Thesaurus Embedding for Co-hyponymy Detection (2020.lrec-1)

Copied to clipboard

Challenge: Existing methods to detect lexical relations among distributionally similar words have been proposed to solve this problem.
Approach: They propose to use distributional semantic models to detect co-hyponymy relations by embedding them into the distributional thesaurus.
Outcome: The proposed model outperforms the state-of-the-art models for binary classification of co-hyponymy vs. hypernymy, as well as co-meronymy by huge margins.
Undersampling Improves Hypernymy Prototypicality Learning (L18-1)

Copied to clipboard

Challenge: supervised hypernymy detection suffers from overfitting hypernies in training data.
Approach: They propose a method that can alleviate the problem of overfitting hypernyms in training data by using distributional representations for unknown word pairs.
Outcome: The proposed method alleviates the problem of overfitting hypernyms in training data and improves distributional prototypicality learning for unknown word pairs.
BiRRE: Learning Bidirectional Residual Relation Embeddings for Supervised Hypernymy Detection (2020.acl-main)

Copied to clipboard

Challenge: supervised hypernymy detection has been studied under various frameworks . supervised classifiers are more likely to suffer from "lexical memorization"
Approach: They propose a representation learning framework called Bidirectional Residual Relation Embeddings to model the possibility of a term being mapped to another in the embedding space by hypernymy relations.
Outcome: The proposed model outperforms baselines over evaluation frameworks.
HyperBox: A Supervised Approach for Hypernym Discovery using Box Embeddings (2022.lrec-1)

Copied to clipboard

Challenge: Existing methods for hypernym detection rely on word distribution.
Approach: They propose a model to learn box embeddings for hypernym discovery by using a dataset . they compare the performance of their model on medical and music domains .
Outcome: The proposed model outperforms existing methods on most evaluation metrics on medical and music domains.
Word Relation Autoencoder for Unseen Hypernym Extraction Using Word Embeddings (D18-1)

Copied to clipboard

Challenge: Lexicon relation extraction given distributional representation of words is an important topic in NLP.
Approach: They propose to use a word relation autoencoder to extract hypernyms from vocabularies . they propose to analyze the pollution and construct an indicator to measure it .
Outcome: The proposed model outperforms the competitors on several hypernym-like lexicon datasets.
When Hearst Is not Enough: Improving Hypernymy Detection from Corpus with Distributional Models (2020.emnlp-main)

Copied to clipboard

Challenge: a taxonomy is a semantic hierarchy of words or concepts organized w.r.t. their hypernymy relationships.
Approach: They propose a framework for hypernymy detection using large textual corpora . they quantify the non-negligible existence of specific sparsity cases .
Outcome: The proposed framework quantifies the non-negligible existence of specific sparsity cases on several benchmark datasets.
Unsupervised Learning of Sentence Embeddings Using Compositional n-Gram Features (N18-1)

Copied to clipboard

Challenge: Currently, unsupervised word embeddings are routinely trained on large amounts of raw text data.
Approach: They propose to use unsupervised word embeddings to train distributed representations of sentences.
Outcome: The proposed method outperforms state-of-the-art models on most benchmark tasks and is robust to the produced general-purpose sentence embeddings.
More than just Frequency? Demasking Unsupervised Hypernymy Prediction Methods (2021.findings-acl)

Copied to clipboard

Challenge: Using unsupervised methods of hypernymy prediction, we show that the predictions of three methods overlap and are highly correlated with frequency-based predictions.
Approach: They compare unsupervised methods of hypernymy prediction to supervised methods . they show that the methods overlap and are highly correlated with frequency-based predictions .
Outcome: The proposed methods overlap and are highly correlated with frequency-based predictions across English and German datasets.
A Closer Look on Unsupervised Cross-lingual Word Embeddings Mapping (2020.lrec-1)

Copied to clipboard

Challenge: Existing methods for word embeddings are limited to a single, unannotated corpus, which means that word representations with similar meaning in distinct languages can be very different.
Approach: They propose an unsupervised method for cross-lingual word embedding mapping that uses stochastic initialization and isometric initialization to verify the method's robustness.
Outcome: The proposed method is robust on different embedding representations and new language pairs, particularly those involving Slavic languages like Polish or Czech.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations