SememeLM: A Sememe Knowledge Enhanced Method for Long-tail Relation Representation
Not on the map. Why?
Abstract (arXiv)
Recognizing relations between two words is a fundamental task with the broad applications. Different from extracting relations from text, it is difficult to identify relations among words without their contexts. Especially for long-tail relations, it becomes more difficult due to inadequate semantic features. Existing approaches based on language models (LMs) utilize rich knowledge of LMs to enhance the semantic features of relations. However, they capture uncommon relations while overlooking less frequent but meaningful ones since knowledge of LMs seriously relies on trained data where often represents common relations. On the other hand, long-tail relations are often uncommon in training data. It is interesting but not trivial to use external knowledge to enrich LMs due to collecting corpus containing long-tail relationships is hardly feasible. In this paper, we propose a sememe knowledge enhanced method (SememeLM) to enhance the representation of long-tail relations, in which sememes can break the contextual constraints between wors. Firstly, we present a sememe relation graph and propose a graph encoding method. Moreover, since external knowledge base possibly consisting of massive irrelevant knowledge, the noise is introduced. We propose a consistency alignment module, which aligns the introduced knowledge with LMs, reduces the noise and integrates the knowledge into the language model. Finally, we conducted experiments on word analogy datasets, which evaluates the ability to distinguish relation representations subtle differences, including long-tail relations. Extensive experiments show that our approach outperforms some state-of-the-art methods.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 19 of its 35 references that are in the map. First posted on arXiv 13 Jun 2024.
Builds on
19 of 35 references.
References · 19
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
- 2017Graph Attention Networkscited by 8,923
- 2022Learn to Explain: Multimodal Reasoning via Thought Chains for Science Question Answeringcited by 1,919
- 2019Composition-based Multi-Relational Graph Convolutional Networkscited by 396
- 2020K-Adapter: Infusing Knowledge into Pre-Trained Models with Adapterscited by 319
- 2019Knowledge Enhanced Contextual Word Representationscited by 296
- 2019Inducing Relational Knowledge from BERTcited by 75
- 2021BERT is to NLP what AlexNet is to CV: Can Pre-Trained Language Models Identify Analogies?cited by 56
- 2022E-KAR: A Benchmark for Rationalizing Natural Language Analogical Reasoningcited by 28
- 2021LET: Linguistic Knowledge Enhanced Graph Transformer for Chinese Short Text Matchingcited by 15
- 2021Distilling Relation Embeddings from Pre-trained Language Modelscited by 15
7 more
- 2021Enhancing Multilingual Language Model with Massive Multilingual Knowledge Triplescited by 13
- 2021Distantly-Supervised Long-Tailed Relation Extraction Using Constraint Graphscited by 9
- 2020Learning Relation Prototype from Unlabeled Texts for Long-tail Relation Extractioncited by 8
- 2022Rescue Implicit and Long-tail Cases: Nearest Neighbor Relation Extractioncited by 7
- 2019Towards Building a Multilingual Sememe Knowledge Base: Predicting Sememes for BabelNet Synsetscited by 6
- 2020KEML: A Knowledge-Enriched Meta-Learning Framework for Lexical Relation Classificationcited by 3
- 2022Measuring the Feasibility of Analogical Transfer using Complexitycited by 2
Built on by
Not cited yet.