Open Relation Modeling: Learning to Define Relations between Entities (2022.findings-acl)
Copied to clipboard
| Challenge: | Existing systems identify related entities but do not provide features for exploring relations between entities. |
| Approach: | They propose to teach machines to generate definition-like relation descriptions by letting them learn from defining entities. |
| Outcome: | The proposed model can generate definition-like relation descriptions that capture the representative characteristics of entities. |
Similar Papers
VER: Unifying Verbalizing Entities and Relations (2023.findings-emnlp)
Copied to clipboard
| Challenge: | a new model for verbalizing entities and relations is proposed to help understand entities and relationships . a unified model for Verbalizing Entities and Relations is proposed . |
| Approach: | They propose a model that takes any entity or entity set as input and generates a sentence to represent entities and relations. |
| Outcome: | The proposed model can generate sentences describing entities and relations . it can be used to explain entities and relationships, and to perform commonsense reasoning tasks . |
Integrating Lexical Information into Entity Neighbourhood Representations for Relation Prediction (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing methods to predict knowledge base relations are limited by maintenance costs and text-based formats. |
| Approach: | They propose a system that can extend relational database tables with information extracted from a document corpus. |
| Outcome: | The proposed system outperforms existing methods by incorporating embeddings of text-based representations of the entities and relations. |
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. |
Relation Prediction for Unseen-Entities Using Entity-Word Graphs (D19-53)
Copied to clipboard
Yuki Tagawa, Motoki Taniguchi, Yasuhide Miura, Tomoki Taniguchi, Tomoko Ohkuma, Takayuki Yamamoto, Keiichi Nemoto
| Challenge: | Knowledge graphs (KGs) are incomplete and miss some information. |
| Approach: | They propose to learn entity representations via a graph structure that uses Seen-entities, Unseen-Entities and words as nodes created from the descriptions of all entities. |
| Outcome: | The proposed method improves relation prediction for the entity pairs containing Unseen-entities. |
Jointly Learning Entity and Relation Representations for Entity Alignment (D19-1)
Copied to clipboard
| Challenge: | Entity alignment is a viable method for integrating heterogeneous knowledge among different knowledge graphs (KGs). |
| Approach: | They propose a Graph Convolutional Network-based framework for learning relation representations by embedding relation seeds into entities and incorporating relation approximation into entities to iteratively improve alignment. |
| Outcome: | The proposed approach outperforms state-of-the-art methods on three real-world cross-lingual datasets. |
Neural Relation Classification with Text Descriptions (C18-1)
Copied to clipboard
| Challenge: | State-of-the-art methods for relation classification suffer from data sparsity issue greatly. |
| Approach: | They propose a new neural relation classification method which integrates entities’ text descriptions into deep neural networks models. |
| Outcome: | The proposed method achieves much better experimental results than other state-of-the-art methods on the SemEval 2010 dataset. |
Learning Interpretable Relationships between Entities, Relations and Concepts via Bayesian Structure Learning on Open Domain Facts (2020.acl-main)
Copied to clipboard
| Challenge: | Concept graphs are created as universal taxonomies for text understanding in the open domain knowledge. |
| Approach: | They propose to learn interpretable relationships from open-domain facts to enrich concept graphs. |
| Outcome: | The proposed method improves the identification of concepts for entities based on relations between entities on public English and Chinese datasets. |
Modeling Complex Semantics Relation with Contrastively Fine-Tuned Relational Encoders (2025.acl-long)
Copied to clipboard
| Challenge: | Existing methods for learning relational embeddings fail to capture nuanced representations and rich semantics. |
| Approach: | They propose different relational encoders designed to capture diverse relational aspects and semantic properties of entity pairs. |
| Outcome: | The proposed encoders capture diverse relational aspects and semantic properties of entity pairs. |
Mind the Labels: Describing Relations in Knowledge Graphs With Pretrained Models (2023.eacl-main)
Copied to clipboard
| Challenge: | Pretrained language models (PLMs) for data-to-text generation produce inaccurate outputs if labels are ambiguous or incomplete, which is often the case in D2T datasets. |
| Approach: | They propose to use a dataset to descib a relation between two entities using relation labels to train pretrained language models. |
| Outcome: | The proposed models are robust to generalizing to out-of-domain domains on a dataset for descibing a relation between two entities. |
Matching the Blanks: Distributional Similarity for Relation Learning (P19-1)
Copied to clipboard
| Challenge: | Efforts to build general purpose relation extractors that can model arbitrary relations are limited in their ability to generalize. |
| Approach: | They propose to build task-agnostic relation representations solely from entity-linked text to extend Harris’ distributional hypothesis to relations. |
| Outcome: | The proposed representations outperform previous methods on SemEval 2010 Task 8, KBP37, and TACRED even without using any of the task’s training data. |