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.

Similar Papers

pair2vec: Compositional Word-Pair Embeddings for Cross-Sentence Inference (N19-1)

Copied to clipboard

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.
Improving Compositional Generalization in Classification Tasks via Structure Annotations (2021.acl-short)

Copied to clipboard

Challenge: Compositional generalization is the ability to generalize systematically to a new data distribution by combining known components.
Approach: They propose to convert a natural language sequence-to-sequence dataset into a classification dataset that requires compositional generalization.
Outcome: The proposed model can generalize compositionally by providing hints on the structure of the input.
Finding needles in a haystack: Sampling Structurally-diverse Training Sets from Synthetic Data for Compositional Generalization (2021.emnlp-main)

Copied to clipboard

Challenge: Recent research shows that automatic generation of synthetic utterance-program pairs can alleviate the first problem, but its potential for the second has thus far been under-explored.
Approach: They propose to generate synthetic utterance-program pairs for improving compositional generalization in semantic parsing by using structurally-diverse examples.
Outcome: The proposed approach leads to dramatic improvements in compositional generalization and moderate improvements in the traditional i.i.d setup.
Learning Joint Semantic Parsers from Disjoint Data (N18-1)

Copied to clipboard

Challenge: Various formal meaning representations have been developed corresponding to different semantic theories.
Approach: They propose a method to learn a semantic parser from multiple datasets by treating annotations for unobserved formalisms as latent structured variables.
Outcome: The proposed approach improves on existing methods using unobserved formalisms and underlying corpora.
Pretrained Language Models for Sequential Sentence Classification (D19-1)

Copied to clipboard

Challenge: Recent successful models for document-level understanding have used hierarchical encoding and CRFs to capture dependencies between subsequent labels.
Approach: They propose a pretrained language model that captures contextual dependencies without hierarchical encoding nor a CRF.
Outcome: The proposed model captures contextual dependencies without hierarchical encoding nor a CRF on four datasets, including a new dataset of structured scientific abstracts.
BERT Has More to Offer: BERT Layers Combination Yields Better Sentence Embeddings (2023.findings-emnlp)

Copied to clipboard

Challenge: Obtaining sentence representations from BERT-based models is valuable as it takes less time to pre-compute a one-time representation of the data and then use it for the downstream tasks.
Approach: They propose to combine certain layers of a BERT-based model rested on the data set and model to achieve substantially better results.
Outcome: The proposed method outperforms baseline models on seven semantic textual similarity datasets and on eight transfer data sets.
Contrasting distinct structured views to learn sentence embeddings (2021.eacl-srw)

Copied to clipboard

Challenge: Existing methods to build sentence embeddings rely on a similar Recurrent Neural Network (RNN) heterogeneity of performances across models and tasks makes us assume some structures might be better adapted given the considered task or sentence.
Approach: They propose a self-supervised method that builds sentence embeddings from syntactic structures . they hypothesize that some linguistic representations might be better adapted given the task .
Outcome: The proposed method outperforms comparable methods on several tasks from standard sentence embedding benchmarks.
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.
Incorporating Contextual and Syntactic Structures Improves Semantic Similarity Modeling (D19-1)

Copied to clipboard

Challenge: Semantic similarity modeling is central to many NLP problems such as question answering.
Approach: They propose a pairwise word interaction model with syntactic structure priors to explore their effectiveness.
Outcome: Extensive evaluations on eight benchmark datasets show that incorporating structural information improves over strong baselines.
AMR Parsing with Latent Structural Information (2020.acl-main)

Copied to clipboard

Challenge: Abstract Meaning Representations (AMRs) capture sentence-level semantics structural representations to broad-coverage natural sentences.
Approach: They investigate parsing AMR with explicit dependency structures and interpretable latent structures.
Outcome: The proposed model achieves best results on both AMR 2.0 and AMR 1.0 . the proposed model has been adopted in downstream NLP tasks, including text summarization and question answering.

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