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. |
Similar Papers
When Phrases Meet Probabilities: Enabling Open Relation Extraction with Cooperating Large Language Models (2024.acl-long)
Copied to clipboard
| 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. |
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. |
DeepREF: A Framework for Optimized Deep Learning-based Relation Classification (2022.lrec-1)
Copied to clipboard
| Challenge: | Existing frameworks for relation extraction (RE) are limited due to lack of implementation details. |
| Approach: | They propose to use deep learning to develop relation extraction systems using deep learning models. |
| Outcome: | The proposed framework is inspired by the OpenNRE and REflex existing frameworks. |
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. |
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. |
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. |
GPT-RE: In-context Learning for Relation Extraction using Large Language Models (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to in-context learning (ICL) are lacking in relation extraction (RE) . emergence of large language models (LLMs) such as GPT-3 represents a significant advancement in natural language processing. |
| Approach: | They propose to incorporate task-aware representations into demonstration retrieval and enrich the demonstrations with gold label-induced reasoning logic. |
| Outcome: | The proposed model achieves SOTA and competitive performances on the Semeval and SciERC datasets. |
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. |
Semi-automatic Data Enhancement for Document-Level Relation Extraction with Distant Supervision from Large Language Models (2023.emnlp-main)
Copied to clipboard
| Challenge: | Document-level Relation Extraction (DocRE) is a task that aims to extract relations from a long context. |
| Approach: | They propose an automated annotation method that integrates an LLM and a natural language inference module to generate relation triples. |
| Outcome: | The proposed method can extract relations from document-level relation datasets with minimal human effort. |
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. |