SBERT studies Meaning Representations: Decomposing Sentence Embeddings into Explainable Semantic Features
Models based on large-pretrained language models, such as S(entence)BERT, provide effective and efficient sentence embeddings that show high correlation to human similarity ratings, but lack interpretability. On the other hand, graph metrics for graph-based meaning representations (e.g., Abstract Meaning Representation, AMR) can make explicit the semantic aspects in which two sentences are similar. However, such metrics tend to be slow, rely on parsers, and do not reach state-of-the-art performance when rating sentence similarity. In this work, we aim at the best of both worlds, by learning to induce $S$emantically $S$tructured $S$entence BERT embeddings (S$^3$BERT). Our S$^3$BERT embeddings are composed of explainable sub-embeddings that emphasize various semantic sentence features (e.g., semantic roles, negation, or quantification). We show how to i) learn a decomposition of the sentence embeddings into semantic features, through approximation of a suite of interpretable AMR graph metrics, and how to ii) preserve the overall power of the neural embeddings by controlling the decomposition learning process with a second objective that enforces consistency with the similarity ratings of an SBERT teacher model. In our experimental studies, we show that our approach offers interpretability -- while fully preserving the effectiveness and efficiency of the neural sentence embeddings.
Code (1)
Tasks
Abstract Meaning RepresentationNegationSentenceSentence EmbeddingsSentence SimilarityMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
An Unsupervised Sentence Embedding Method by Mutual Information Maximization
BERT is inefficient for sentence-pair tasks such as clustering or semantic search as it needs to evaluate combinatorially many sentence pairs which is very time-consuming. Sentence BERT (SBERT) attempted to solve this ch…
ClusteringSelf-Supervised LearningSemantic Textual SimilaritySentence+4Predicate-Argument Based Bi-Encoder for Paraphrase Identification
Paraphrase identification involves identifying whether a pair of sentences express the same or similar meanings. While cross-encoders have achieved high performances across several benchmarks, bi-encoders such as SBERT h…
Paraphrase IdentificationSentencePredicate-Argument Based Bi-Encoder for Paraphrase Identification
Paraphrase identification involves identifying whether a pair of sentences express the same or similar meanings. While cross-encoders have achieved high performances across several benchmarks, bi-encoders such as SBERT h…
Paraphrase IdentificationSentenceTA-SBERT: Token Attention Sentence-BERT for Improving Sentence Representation
ABSTRACT A sentence embedding vector can be obtained by connecting a global average pooling (GAP) to a pre-trained language model. The problem of such a sentence embedding vector using a GAP is that it is generated wit…
Language ModelingLanguage ModellingSemantic Textual SimilaritySentence+3Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks
BERT (Devlin et al., 2018) and RoBERTa (Liu et al., 2019) has set a new state-of-the-art performance on sentence-pair regression tasks like semantic textual similarity (STS). However, it requires that both sentences are …
ClusteringLinear-Probe ClassificationSemantic SimilaritySemantic Textual Similarity+6