| 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. |
Similar Papers
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. |
On the Role of Discriminative Models in Generative Relation Extraction (2026.acl-long)
Copied to clipboard
| Challenge: | Existing methods for relation extraction (RE) are discriminative and generative . previous studies show that discriminative models can support generative RE . |
| Approach: | They propose a framework that leverages discriminative models to produce a top-k set of candidate relations and integrates this knowledge into generative models via in-context or prompt learning. |
| Outcome: | The proposed framework achieves state-of-the-art on five widely used RE benchmarks. |
Retrieval over Classification: Integrating Relation Semantics for Multimodal Relation Extraction (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to multimodal relation extraction ignore structural constraints and lack semantic expressiveness for fine-grained relation understanding. |
| Approach: | They propose a framework that reformulates multimodal relation extraction as a retrieval task driven by relation semantics. |
| Outcome: | The proposed framework achieves state-of-the-art performance on the benchmark datasets MNRE and MORE and exhibits stronger robustness and interpretability. |
GLiREL - Generalist Model for Zero-Shot Relation Extraction (2025.naacl-long)
Copied to clipboard
| Challenge: | Existing approaches to zero-shot named entity recognition rely on distant supervision and training data for unseen labels. |
| Approach: | They propose an efficient architecture and training paradigm for zero-shot relation classification . they use a protocol to generate multiple relation labels in a single forward pass . |
| Outcome: | The proposed architecture and training paradigm achieve state-of-the-art results on the zero-shot relation classification task. |
More Data, More Relations, More Context and More Openness: A Review and Outlook for Relation Extraction (2020.aacl-main)
Copied to clipboard
Xu Han, Tianyu Gao, Yankai Lin, Hao Peng, Yaoliang Yang, Chaojun Xiao, Zhiyuan Liu, Peng Li, Jie Zhou, Maosong Sun
| Challenge: | Existing methods for extracting relational facts from text have been successful . but with explosion of Web text, human knowledge is increasing drastically . |
| Approach: | They propose to improve relation extraction methods to extract relational facts from text . they analyze existing methods and show promising directions towards more powerful RE . |
| Outcome: | The proposed methods can extract relational facts from text, but they are still lacking in the current field. |
Revisiting Unsupervised Relation Extraction (2020.acl-main)
Copied to clipboard
| Challenge: | Unsupervised relation extraction (URE) extracts relations between named entities from raw text without manually-labelled data and existing knowledge bases (KBs). |
| Approach: | They compare unsupervised relation extraction methods to generative and discriminative approaches . they conclude that entity types provide a strong inductive bias for URE . |
| Outcome: | The proposed method outperforms generative and discriminative approaches on two popular datasets. |
A Frustratingly Easy Approach for Entity and Relation Extraction (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing work on end-to-end relation extraction models combine two tasks: named entity recognition and relation extraction. |
| Approach: | They propose a pipelined approach for entity and relation extraction that uses two independent encoders to construct the relation model. |
| Outcome: | The proposed approach achieves an 8.16 speedup with a slight reduction in accuracy on standard benchmarks. |
Connecting Language and Knowledge with Heterogeneous Representations for Neural Relation Extraction (N19-1)
Copied to clipboard
| Challenge: | Knowledge Bases (KBs) require constant updating to reflect changes to the world they represent. |
| Approach: | They propose a framework that unifies learning of RE and KBE models . the framework is based on a relation extraction task that uses a KB relation to a phrase . |
| Outcome: | The proposed framework unifies learning of RE and KBE models, leading to significant improvements over the state-of-the-art RE framework. |
GDA: Generative Data Augmentation Techniques for Relation Extraction Tasks (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing work adopts data augmentation techniques to generate pseudo-annotated sentences . existing methods neither preserve semantic consistency of original sentences nor preserve syntax structure of sentences when expressing relations using seq2seq models, resulting in less diverse augmentations. |
| Approach: | They propose a dedicated augmentation technique for relational texts, named GDA, which uses two complementary modules to preserve both semantic consistency and syntax structures. |
| Outcome: | The proposed technique can bring 2.0% F1 improvements in three datasets under low-resource setting. |
Separating Retention from Extraction in the Evaluation of End-to-end Relation Extraction (2021.emnlp-main)
Copied to clipboard
| Challenge: | State-of-the-art NLP models adopt shallow heuristics that limit their generalization capability. |
| Approach: | They propose to use heuristics that limit their generalization capability to model lexical overlap with the training set in Named-Entity Recognition and Event or Type heuristic in Relation Extraction to test their models. |
| Outcome: | The proposed model can perform better on the two key tasks, while the retention of training relation triples. |