Challenge: Existing clustering-based open relation extraction methods use pre-trained language models . embeddings from language models are high-dimensional and anisotropic, so there is a gap .
Approach: They propose a framework that makes two LLMs work collaboratively to achieve clustering.
Outcome: The proposed framework outperforms existing methods by 1.4%3.13% on different datasets.

Similar Papers

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.
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.
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.
AutoRE: Document-Level Relation Extraction with Large Language Models (2024.acl-demos)

Copied to clipboard

Challenge: Existing methods for relation extraction are limited to Sentence-level Relation Extraction (SentRE) tasks.
Approach: They propose an end-to-end DocRE model that adopts a novel RE extraction paradigm named RHF (Relation-Head-Facts) Unlike existing approaches, AutoRE does not rely on the assumption of known relation options, making it more reflective of real-world scenarios.
Outcome: The proposed model surpasses TAG by 10.03% and 9.03% on the dev and test set.
Towards a More Generalized Approach in Open Relation Extraction (2025.acl-long)

Copied to clipboard

Challenge: Existing OpenRE methods assume unlabeled data is a mixture of known and novel instances.
Approach: They propose a generalized OpenRE setting that considers unlabeled data as a mixture of known and novel instances.
Outcome: The proposed framework outperforms baselines in relation classification and clustering on three benchmark datasets.
Open Relation Extraction: Relational Knowledge Transfer from Supervised Data to Unsupervised Data (D19-1)

Copied to clipboard

Challenge: Existing methods to extract relational facts from open domain corpora are time-consuming and human-intensive.
Approach: They propose a framework to learn similarity metrics of relations from labeled data . they propose to transfer relational knowledge to identify novel relations in unlabeled data.
Outcome: Experiments on two real-world datasets show that the proposed framework improves compared with state-of-the-art methods.
Rethinking the Role of LLMs for Document-level Relation Extraction: a Refiner with Task Distribution and Probability Fusion (2025.naacl-long)

Copied to clipboard

Challenge: Document-level relation extraction (DocRE) provides a broad context for extracting relations for entities.
Approach: They propose a method that utilizes LLMs as a refiner and task distribution and probability fusion to refine LLM-based relation extraction methods.
Outcome: The proposed method outperforms existing LLM-based methods without fine-tuning by 25.2% F1.
LLM4RE: A Data-centric Feasibility Study for Relation Extraction (2025.coling-main)

Copied to clipboard

Challenge: Relation Extraction (RE) is a critical step in information extraction due to its wide-scale applicability for downstream applications such as Knowledge Base creation and Question Answering (QA).
Approach: They propose to conduct the first feasibility analysis to explore the viability of Large Language Models for RE by investigating their robustness to various RE scenarios stemming from data-specific characteristics.
Outcome: The proposed models are robust to various RE scenarios stemming from data-specific characteristics, but their performance is not yet fully understood.
MatchPrompt: Prompt-based Open Relation Extraction with Semantic Consistency Guided Clustering (2022.emnlp-main)

Copied to clipboard

Challenge: Existing methods for open relation extraction (OpenRE) focus on labeled and pre-defined instances, which are costly to acquire in reality.
Approach: They propose a framework that can extract relations without pre-defined types from open-domain corpus with efficient knowledge transfer from a few pre-determined relational instances.
Outcome: The proposed framework achieves the new SOTA results for OpenRE on different datasets.
M-BRe: Discovering Training Samples for Relation Extraction from Unlabeled Texts with Large Language Models (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods to extract training instances from unlabeled texts are expensive . sentences that contain the target relations in texts can be scarce and difficult to find .
Approach: They propose a framework that can automatically extract training instances from unlabeled texts for RE.
Outcome: The proposed method can extract training instances from unlabeled texts for RE.

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