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. |
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. |
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. |
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. |
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. |
Exploiting the Syntax-Model Consistency for Neural Relation Extraction (2020.acl-main)
Copied to clipboard
| Challenge: | Existing deep learning models for Relation Extraction (RE) have limited generalization beyond the syntactic structures of the input sentences. |
| Approach: | They propose a deep learning model that uses dependency trees to extract syntactic importance of words for Relation Extraction. |
| Outcome: | The proposed model outperforms existing models on three RE benchmark datasets. |
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. |
CrossRE: A Cross-Domain Dataset for Relation Extraction (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Relation Extraction (RE) evaluation is limited to in-domain setups . despite the drought of research on cross-domain RE, its practical importance remains . |
| Approach: | They propose a cross-domain benchmark for relation extraction which includes multi-label annotations and meta-data to include explanations and flags of difficult instances. |
| Outcome: | The proposed model includes explanations and flags of difficult instances. |
What Do You Mean by Relation Extraction? A Survey on Datasets and Study on Scientific Relation Classification (2022.acl-srw)
Copied to clipboard
| Challenge: | Existing RE surveys focus on modeling techniques, but there are few that are based on real-world scenarios. |
| Approach: | They propose to survey RE datasets and revisit the task definition and its adoption by the community. |
| Outcome: | The proposed approach improves the reliability of RE evaluations across multiple datasets and reveals significant discrepancies in annotations. |
Relation Extraction using Explicit Context Conditioning (N19-1)
Copied to clipboard
| Challenge: | Existing methods for relation extraction fail to capture complex and long dependencies . end-to-end models that learn both NER and RE can solve this problem . |
| Approach: | They propose to use second-order relations to compute relation scores for relation extraction (RE) . they propose to combine second- and first-order relation scores to obtain final relation scores . |
| Outcome: | The proposed method leads to state-of-the-art performance over two biomedical datasets. |
DuRE: Dual Contrastive Self Training for Semi-Supervised Relation Extraction (2024.naacl-long)
Copied to clipboard
| Challenge: | Existing document-level relation extraction methods require manual training and labeled data to obtain supervised learning. |
| Approach: | They propose a document-level relation extraction framework that integrates RE and text generation as a dual process. |
| Outcome: | The proposed framework significantly boosts recall and F1 score with comparable precision on two document-level RE tasks against several strong baselines. |