Higher-order Relation Schema Induction using Tensor Factorization with Back-off and Aggregation (P18-1)
Copied to clipboard
| Challenge: | Relation Schema Induction (RSI) is a problem of identifying type signatures of arguments from unlabeled text. |
| Approach: | They propose a framework for inducing higher-order relation schemata from unlabeled text. |
| Outcome: | The proposed framework helps in dealing with sparsity and induces higher-order relation schemata. |
Similar Papers
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. |
HiURE: Hierarchical Exemplar Contrastive Learning for Unsupervised Relation Extraction (2022.naacl-main)
Copied to clipboard
| Challenge: | Existing methods to extract relational feature signals from natural language sentences use self-supervised clustering and classification that cause gradual drift problems. |
| Approach: | They propose a framework that derives hierarchical signals from relational feature space using cross hierarchy attention and effectively optimizes relation representation of sentences under exemplar-wise contrastive learning. |
| Outcome: | The proposed framework can extract the relationship between entities from natural language sentences without prior knowledge on relation scope or distribution. |
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. |
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. |
Semantic Frame Induction from a Real-World Corpus (2025.acl-srw)
Copied to clipboard
| Challenge: | Existing studies on semantic frame induction have demonstrated that pre-trained language models (PLMs) have led to more accurate results. |
| Approach: | They conduct semantic frame induction using the Colossal Clean Crawled Corpus and assess the applicability of existing frame inducing methods to real-world data. |
| Outcome: | The proposed methods outperform existing methods on real-world data and can induce frames corresponding to novel concepts. |
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. |
Zero-Shot On-the-Fly Event Schema Induction (2023.findings-eacl)
Copied to clipboard
| Challenge: | a new approach to event processing uses large language models to generate source documents that can be curated without manual data collection. |
| Approach: | They propose a framework that generates a graphical representation of events in documents . they show that the model is more complete than previous supervised methods . |
| Outcome: | The proposed model is more complete than human-curated schemas in most scenarios. |
Re3Syn: A Dependency-Based Data Synthesis Framework for Long-Context Post-training (2025.acl-long)
Copied to clipboard
| Challenge: | Existing methods for constructing long-context data by concatenating short documents have overlooked a crucial characteristic of long-constituency data quality, semantic dependency. |
| Approach: | They propose a framework called Retrieval, Dependency Recognition, and Reorder for data synthesis which leverages semantic similarity to retrieve relevant documents and form several batches. |
| Outcome: | The proposed framework leverages semantic similarity to retrieve relevant documents and form several batches. |
Improving Relation Extraction through Syntax-induced Pre-training with Dependency Masking (2022.findings-acl)
Copied to clipboard
| Challenge: | Existing studies require modifications to existing baseline architectures to leverage syntactic information. |
| Approach: | They propose to leverage syntactic information to improve relation extraction by training a syntax-induced encoder on auto-parsed data through dependency masking. |
| Outcome: | The proposed approach outperforms baseline models and achieves state-of-the-art results on two English datasets. |
Uncover the Ground-Truth Relations in Distant Supervision: A Neural Expectation-Maximization Framework (D19-1)
Copied to clipboard
| Challenge: | Existing methods for relation extraction assume that text is noisy, but its corresponding labels are clean. |
| Approach: | They propose a framework that combines neural network and probabilistic modelling to denoise noisy relation labels. |
| Outcome: | The proposed framework improves the current art in uncovering the ground-truth relation labels. |