Relation Induction in Word Embeddings Revisited (C18-1)

Copied to clipboard

Challenge: Existing approaches to relation induction are based on vector translations, but they are often inadequate for knowledge base completion.
Approach: They propose to use Gaussian to explicitly model the variability of translations and Bayesian linear regression to encode the assumption that there is a linear relationship between the vector representations of related words.
Outcome: The proposed models are based on translations but use Gaussian to model the variability of translations and encode soft constraints on the source and target words that may be chosen.

Similar Papers

Entity or Relation Embeddings? An Analysis of Encoding Strategies for Relation Extraction (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing approaches to relation extraction use concatenating embeddings of head and tail entities . however, such representations capture the types of the entities involved, leading to false positives and confusion between relations involving entities of the same type.
Approach: They propose a model which combines [MASK] embeddings with entity embedds to learn relation embeddations.
Outcome: The proposed model outperforms the state-of-the-art on several benchmarks . it uses a self-supervised pre-training strategy which further improves the results.
Distilling Relation Embeddings from Pretrained Language Models (2021.emnlp-main)

Copied to clipboard

Challenge: Pre-trained language models capture a surprisingly rich amount of lexical knowledge, but it is unclear to what extent relation embeddings can be used to encode relational knowledge.
Approach: They found that word vector differences capture lexical relations . relationship embeddings can be used to encode relational knowledge .
Outcome: The results are highly competitive on analogy (unsupervised) and relation classification (supervised) benchmarks, even without any task-specific fine-tuning.
Revisiting the Context Window for Cross-lingual Word Embeddings (2020.acl-main)

Copied to clipboard

Challenge: Existing approaches to mapping-based cross-lingual word embeddings are based on the assumption that the source and target embeddable spaces are structurally similar.
Approach: They propose to use different context windows to evaluate bilingual word embeddings in various languages, domains, and tasks.
Outcome: The size of both the source and target window improves bilingual lexicon induction, especially on frequent nouns.
Embedding Learning Through Multilingual Concept Induction (P18-1)

Copied to clipboard

Challenge: Existing methods for learning vector space representations of words are based on word-context information.
Approach: They propose a method for estimating vector space representations of words by concept induction.
Outcome: The proposed method performs better on crosslingual word similarity and sentiment analysis on a parallel corpus.
How to represent a word and predict it, too: Improving tied architectures for language modelling (D18-1)

Copied to clipboard

Challenge: Recent state-of-the-art models use word embeddings as input and output mappings instead of tied models.
Approach: They propose to decouple hidden state from word embedding prediction . they extend their proposed modification to word2vec models .
Outcome: The proposed architectures achieve comparable or better results compared to previous models without tying . the proposed architecture reduces parameters, enabling more compact models and faster learning.
A Deeper Look into Dependency-Based Word Embeddings (N18-4)

Copied to clipboard

Challenge: Word embeddings trained with dependency contexts excel at different tasks, and enhanced dependencies often improve performance.
Approach: They propose to use dependency-based word embeddings to capture semantic similarity rather than relatedness.
Outcome: The results show that word embeddings trained with Universal and Stanford dependencies excel at different tasks and that enhanced dependencies often improve performance.
Conditional Word Embedding and Hypothesis Testing via Bayes-by-Backprop (D18-1)

Copied to clipboard

Challenge: Whether word's meaning varies across contexts has become a major focus of research in recent years.
Approach: They propose a word embedding model that incorporates document covariates to estimate conditional word embeds.
Outcome: The proposed model estimates word embedding distributions based on document covariates . if word embeds are statistically significant, hypothesis tests can be performed .
Global Relation Embedding for Relation Extraction (N18-1)

Copied to clipboard

Challenge: Existing methods to extract textual relations with distant supervision are limited by their reliance on supervised training data.
Approach: They propose to embed relations with global statistics of relations to combat the wrong labeling problem of distant supervision.
Outcome: The proposed method is more robust to training noise introduced by distant supervision and improves relation extraction models.
Relational Word Embeddings (P19-1)

Copied to clipboard

Challenge: Existing approaches to learn word embeddings rely on external knowledge bases . however, they are limited by the amount of available relational knowledge .
Approach: They propose to encode relational knowledge in a separate word embedding . this is complementary to a standard word embedded from co-occurrence statistics .
Outcome: The proposed word embedding is complementary to a standard word embed.
Evaluating bilingual word embeddings on the long tail (N18-2)

Copied to clipboard

Challenge: Bilingual word embeddings are useful for bilingual lexicon induction, but they focus on frequent words in general domains.
Approach: They propose to evaluate bilingual word embeddings on rare words in different domains . they propose to use a multilingual dataset to build and combine BWEs based on a single word .
Outcome: The proposed evaluations show that state-of-the-art methods fail on rare words . the proposed evaluation is based on a gold standard dataset and code .

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