Challenge: Existing methods for open relation extraction give sub-optimal results on specific topics.
Approach: They propose a method that leverages the built-in knowledge of large language models to maintain a dynamic seed relation dictionary for the topic.
Outcome: The proposed approach empowers better topic-oriented control over the generated relations and improves ORE performance along the five dimensions, especially on specialized and narrow topics.

Similar Papers

Grasping the Essentials: Tailoring Large Language Models for Zero-Shot Relation Extraction (2024.emnlp-main)

Copied to clipboard

Challenge: Existing Relation extraction models require extensive annotated training data, which is costly and labor-intensive to collect.
Approach: They propose a new zero-shot RE task where only relation definitions are provided instead of seen-unseen relation instances.
Outcome: The proposed task significantly improves cost-effective zero-shot performance by large margins.
GenRES: Rethinking Evaluation for Generative Relation Extraction in the Era of Large Language Models (2024.naacl-long)

Copied to clipboard

Challenge: Existing relation extraction methods rely on exact matching with human-annotated reference relations, while GRE methods produce diverse and semantically accurate relations.
Approach: They propose a multi-dimensional assessment of relation extraction methods using human-annotated reference relations.
Outcome: The proposed method is consistent with human preferences for RE quality.
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.
A Relation-Oriented Clustering Method for Open Relation Extraction (2021.emnlp-main)

Copied to clipboard

Challenge: Existing methods for open relation extraction (OpenRE) are designed for predefined relations, which cannot deal with new emerging relations in the real world.
Approach: They propose a relation-oriented clustering model that leverages readily available labeled data to learn a relationship-oriented representation.
Outcome: The proposed model reduces error rate by 29.2% and 15.7% on two datasets compared with current SOTA methods.
More Data, More Relations, More Context and More Openness: A Review and Outlook for Relation Extraction (2020.aacl-main)

Copied to clipboard

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.
Element Intervention for Open Relation Extraction (2021.acl-long)

Copied to clipboard

Challenge: Current OpenRE models are often trained on the datasets generated from distant supervision, which often results in instability and makes the model easily collapsed.
Approach: They propose to use a causal model to identify relation instances referring to the same relation . they propose to perform Element Interventions on context and entities respectively .
Outcome: The proposed method outperforms existing methods and is robust across datasets.
UOREX: Towards Uncertainty-Aware Open Relation Extraction (2025.naacl-long)

Copied to clipboard

Challenge: Existing methods for relation extraction are limited by their inability to accurately self-assess their performance.
Approach: They propose an approach that effectively models a part of the epistemic uncertainty within OpenRE by preventing overconfident errors.
Outcome: The proposed approach improves OpenRE reliability by preventing overconfident errors.
Cluster-aware Pseudo-Labeling for Supervised Open Relation Extraction (2022.coling-1)

Copied to clipboard

Challenge: Existing methods to extract novel relations do not achieve effective knowledge transfer . experimental results show that the proposed method is state-of-the-arts .
Approach: They propose a Cluster-aware Pseudo-Labeling method to improve pseudo-labels quality . they firstly pre-trained the relation models with pre-defined relations to learn them .
Outcome: The proposed method improves the pseudo-labels quality and transfer more knowledge for discovering novel relations.
LLM-OREF: An Open Relation Extraction Framework Based on Large Language Models (2025.emnlp-main)

Copied to clipboard

Challenge: Existing studies focus on building models that can only handle predefined relations . however, their reliance on human annotation limits their practicality .
Approach: They propose an open relation extraction framework that can generalize to new relations not encountered during training.
Outcome: The proposed framework can generalize to new relations not encountered during training.
DORE: Document Ordered Relation Extraction based on Generative Framework (2022.findings-emnlp)

Copied to clipboard

Challenge: Existing generative methods do not fit document-level relation extraction tasks where there are multiple entities and relational facts.
Approach: They propose to generate a symbolic and ordered sequence from relation matrix which is easier to learn and introduce several negative sampling strategies to improve the performance with balanced signals.
Outcome: The proposed method can improve the performance of the generative DocRE models on four datasets.

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