Challenge: Existing work on relation extraction focuses on constructing explicit structured features using knowledge graph and dependency tree.
Approach: They propose a method to extract multi-granularity features based solely on the original input sentences.
Outcome: The proposed method outperforms state-of-the-art models that even use external knowledge on three public benchmarks: SemEval 2010 Task 8, Tacred, and Tacred Revisited.

Similar Papers

Hierarchical Relation Extraction with Coarse-to-Fine Grained Attention (D18-1)

Copied to clipboard

Challenge: Existing methods for relation extraction use knowledge graphs to automatically label training data . but, it suffers from the wrong labeling problem because not all sentences containing two entities can express their relations in KGs .
Approach: They propose a distant supervision approach to automatically label training instances . they integrate hierarchical information of relations into distantly supervised relation extraction .
Outcome: The proposed model outperforms baseline models on a large-scale dataset.
Reasoning with Latent Structure Refinement for Document-Level Relation Extraction (2020.acl-main)

Copied to clipboard

Challenge: Existing methods for document-level relation extraction capture non-local interactions but are not able to capture rich non-linguistic interactions.
Approach: They propose a document-level relation extraction model that empowers relational reasoning across sentences by automatically inducing the latent document- level graph.
Outcome: The proposed model achieves an F1 score of 59.05 on a large-scale document-level dataset (DocRED), significantly improving over the previous results.
Fact-level Extractive Summarization with Hierarchical Graph Mask on BERT (2020.coling-main)

Copied to clipboard

Challenge: Existing extractive summarization models generate summaries by selecting salient sentences, but there is a gap between the human-written gold summary and oracle sentence labels.
Approach: They propose to extract fact-level semantic units for better extractive summarization by incorporating a hierarchical structure into the model and incorporate it with BERT using a Hierarchical graph mask.
Outcome: The proposed model achieves state-of-the-art on the CNN/DaliyMail dataset.
Document-Level N-ary Relation Extraction with Multiscale Representation Learning (N19-1)

Copied to clipboard

Challenge: Existing work on cross-sentence relation extraction is limited to three consecutive sentences, which severely limits recall.
Approach: They propose a multiscale neural architecture for document-level n-ary relation extraction that combines representations learned over various text spans throughout the document and across the subrelation hierarchy.
Outcome: The proposed system outperforms existing methods on biomedical machine reading.
Span-Level Model for Relation Extraction (P19-1)

Copied to clipboard

Challenge: Recent approaches for this span-level task have inherent limitations.
Approach: They propose a model which directly models all possible spans and performs joint entity mention detection and relation extraction.
Outcome: The proposed model performs joint entity mention detection and relation extraction on the ACE2005 dataset.
Hierarchical Relation-Guided Type-Sentence Alignment for Long-Tail Relation Extraction with Distant Supervision (2022.findings-naacl)

Copied to clipboard

Challenge: Distant supervision uses triple facts to label corpus for relation extraction, leading to wrong labeling and long-tail problems.
Approach: They propose a model to enrich distantly-supervised sentences with entity types by injecting context-free and -related backgrounds into sentences to alleviate sentence-level wrong labeling.
Outcome: The proposed model achieves state-of-the-art on benchmarks and in overall and long-tail performance.
Chinese Relation Extraction with Multi-Grained Information and External Linguistic Knowledge (P19-1)

Copied to clipboard

Challenge: Existing methods for Chinese relation extraction suffer from segmentation errors and ambiguity of polysemy.
Approach: They propose a multi-grained lattice framework for Chinese relation extraction . they incorporate word-level information into character sequence inputs to avoid segmentation errors .
Outcome: The proposed model outperforms existing models on three real-world datasets in distinct domains.
Document-Level Event Role Filler Extraction using Multi-Granularity Contextualized Encoding (2020.acl-main)

Copied to clipboard

Challenge: Document-level event extraction requires a view of a larger context to determine which spans of text correspond to event role fillers.
Approach: They propose a multi-granularity reader to dynamically aggregate information captured by neural representations learned at different levels of granularities.
Outcome: The proposed model performs substantially better than previous models on the MUC-4 event extraction dataset.
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.
Exploring Multimodal Relation Extraction of Hierarchical Tabular Data with Multi-task Learning (2025.acl-long)

Copied to clipboard

Challenge: Existing studies overlook the need of mining relations among multiple columns rather than just the semantic relation between two specific columns in real-world practice.
Approach: They propose a Chain-of-Thought distillation framework with self-correction mechanism to enhance MLLMs’ reasoning capabilities without increasing parameter scale.
Outcome: The proposed method significantly outperforms baselines on wide 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