Challenge: Existing inference models that rely heavily on unsupervised single-word embeddings struggle to learn implied relationships between pairs of words.
Approach: They propose to use word embeddings to learn and use background knowledge about implied relationships between words that are crucial for cross-sentence inference problems.
Outcome: The proposed models gain 2.7% on the recently released SQuAD 2.0 and 1.3% on MultiNLI, and 8.8% on the adversarial SQu AD datasets.

Similar Papers

Enhancing Word Embeddings with Knowledge Extracted from Lexical Resources (2020.acl-srw)

Copied to clipboard

Challenge: In this paper, we present an effective method for semantic specialization of word vector representations.
Approach: They propose a method for semantic specialization of word vector representations using BabelNet.
Outcome: The proposed method improves on word similarity and dialog state tracking tasks.
A Probabilistic Model for Joint Learning of Word Embeddings from Texts and Images (D18-1)

Copied to clipboard

Challenge: Existing approaches combine language and perception to infer word embeddings . however, the embeddables produced by such models do not reflect the actual word representations.
Approach: They propose a probabilistic model that integrates linguistic and perceptual inputs to explain observed word-context pairs in a text corpus.
Outcome: The proposed model achieves competitive or stronger results on tasks of assessing pairwise word similarity and image/caption retrieval compared to other state-of-the-art models.
Learning Word Representations with Cross-Sentence Dependency for End-to-End Co-reference Resolution (D18-1)

Copied to clipboard

Challenge: Existing word embedding models generate word representations by running long short-term memory recurrent neural networks on each sentence of an input article or conversation separately.
Approach: They propose a word embedding model that learns cross-sentence dependency . they use linear sentence linking and attentional sentence linking to learn cross-entry dependency based on context sentences .
Outcome: The proposed model improves end-to-end co-reference resolution by taking knowledge from context sentences and the entire document.
attr2vec: Jointly Learning Word and Contextual Attribute Embeddings with Factorization Machines (N18-1)

Copied to clipboard

Challenge: popular word embeddings are used to learn vector representations from the context of words.
Approach: They propose a framework for jointly learning embeddings for words and contextual attributes based on factorization machines.
Outcome: The proposed framework improves on a text classification task compared to learning embeddings independently.
Quantifying Compositionality of Classic and State-of-the-Art Embeddings (2025.findings-emnlp)

Copied to clipboard

Challenge: Static word embeddings make strong claims about compositionality, but the SOTA generative models go too far in the other direction.
Approach: a new study evaluates the compositionality of word embeddings by canonical correlation analysis . strong compositional signals are observed in later training stages across data modalities .
Outcome: a new evaluation of compositional models shows that they exploit access meanings when justified . strong compositional signals are observed in later training stages and in deeper layers of the transformer-based model before a decline at the top layer.
Querying Word Embeddings for Similarity and Relatedness (N18-1)

Copied to clipboard

Challenge: Word2Vec embeddings have become popular representations of word meaning . similarity between two words is often assumed to be a direction-less measure, whereas relatedness is inherently directional.
Approach: They propose to use word embeddings to predict asymmetric association between words from a dataset of production norms to generate thematically related words.
Outcome: The proposed model predicts asymmetric association between words from a recently published dataset of production norms.
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.
Composing Structure-Aware Batches for Pairwise Sentence Classification (2022.findings-acl)

Copied to clipboard

Challenge: Identifying the relation between two sentences requires datasets with pairwise annotations.
Approach: They propose three batch composition strategies to incorporate such information and measure their performance over 14 heterogeneous pairwise sentence classification tasks.
Outcome: The proposed methods show that the pre-trained language model can benefit from having such structural information in a low-resource setting.
Enhanced Word Representations for Bridging Anaphora Resolution (N18-2)

Copied to clipboard

Challenge: Existing word representations do not capture semantic similarity for bridging anaphora resolution.
Approach: They propose to use word embeddings to capture semantic similarity by exploring syntactic structure of noun phrases.
Outcome: The proposed model achieves 30% of accuracy for bridging anaphora resolution on ISNotes corpus.
One Sentence, Two Embeddings: Contrastive Learning of Explicit and Implicit Semantic Representations (2026.findings-eacl)

Copied to clipboard

Challenge: Existing sentence embedding methods lack the ability to capture the implicit semantics of sentences.
Approach: They propose a sentence embedding method that assigns two embeddables to each sentence . one represents the explicit semantics and the other represents the implicit semantics . results show DualCSE can effectively encode both explicit and implicit meanings - they argue .
Outcome: The proposed method can effectively encode both explicit and implicit meanings and improve the performance of the downstream task.

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