Relation Extraction with Type-aware Map Memories of Word Dependencies (2021.findings-acl)
Copied to clipboard
| Challenge: | Existing studies focus on the dependency connections between words with limited attention paid to exploiting dependency types. |
| Approach: | They propose a neural approach for relation extraction with type-aware map memories . they map all associated words along with dependencies among them to memory slots . |
| Outcome: | The proposed approach achieves state-of-the-art on two English benchmark datasets. |
Similar Papers
Leveraging Dependency Forest for Neural Medical Relation Extraction (D19-1)
Copied to clipboard
| Challenge: | Existing methods for medical relation extraction use dependency syntax as a source of features. |
| Approach: | They propose a method to extract relational information from medical literature by using dependency forests. |
| Outcome: | The proposed method outperforms the standard tree-based methods in the medical domain. |
Dependency Position Encoding for Relation Extraction (2022.findings-naacl)
Copied to clipboard
| Challenge: | Existing methods to extract relation extraction from sentence are limited in focusing on leveraging dependency information. |
| Approach: | They propose dependency position encoding (DPE) that incorporates dependency connections and dependency types into the self-attention mechanism to distinguish the importance of different word dependencies. |
| Outcome: | The proposed method significantly outperforms the previous methods on SemEval 2010 Task 8, KBP37, and TACRED. |
Relation Extraction with Word Graphs from N-grams (2021.emnlp-main)
Copied to clipboard
| Challenge: | Recent studies for relation extraction (RE) leverage the dependency tree of the input sentence to improve performance. |
| Approach: | They propose to use a graph convolutional network to build a context graph without dependency parsers. |
| Outcome: | The proposed approach improves neural RE methods without dependency parsers on English benchmark datasets. |
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. |
Dependency-driven Relation Extraction with Attentive Graph Convolutional Networks (2021.acl-long)
Copied to clipboard
| Challenge: | Existing studies suffer from noise in dependency trees, which can cause confusions in relation extraction. |
| Approach: | They propose a dependency-driven approach for relation extraction with attentive graph convolutional networks . they apply an attention mechanism upon graph convolutional networks to different word dependencies . |
| Outcome: | The proposed approach outperforms previous studies on two English datasets and achieves state-of-the-art performance. |
Graph Convolution over Pruned Dependency Trees Improves Relation Extraction (D18-1)
Copied to clipboard
| Challenge: | Existing dependency-based models neglect crucial information (e.g., negation) by pruning the dependency trees too aggressively. |
| Approach: | They propose an extension of graph convolutional networks that is tailored for relation extraction by pruning dependency trees too aggressively. |
| Outcome: | The proposed model outperforms existing sequence and dependency-based models on the large-scale TACRED dataset and has complementary strengths to sequence models. |
Improving Relation Extraction by Sequence-to-sequence-based Dependency Parsing Pre-training (2025.coling-main)
Copied to clipboard
| Challenge: | Existing studies show that dependency information is used only for encoder-only-based relation extraction tasks. |
| Approach: | They propose a syntax-aware seq2seq pre-trained model for relation extraction that incorporates dependency information into a seq2-trained language model by continual pre-training with a dependency parsing task. |
| Outcome: | The proposed model incorporates dependency information into a seq2seq pre-trained language model by continual pre-training with a generative sequence-to-sequence (sequ2sq)-based dependency parsing task. |
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. |
Neural Relation Extraction via Inner-Sentence Noise Reduction and Transfer Learning (D18-1)
Copied to clipboard
| Challenge: | Existing methods for extracting relations are slow and lack precision . a novel approach to extract relations is proposed to reduce noise between sentences . |
| Approach: | They propose a word-level distant supervised approach for relation extraction using New York Times and Freebase. |
| Outcome: | The proposed method improves the area of precision/call(PR) from 0.35 to 0.39 over the state-of-the-art methods. |
TTM-RE: Memory-Augmented Document-Level Relation Extraction (2024.acl-long)
Copied to clipboard
| Challenge: | Existing methods for document-level relation extraction are ineffective in exploiting the full potential of large amounts of training data with varied noise levels. |
| Approach: | They propose a novel approach that integrates a trainable memory module with a noisy-robust loss function that accounts for the positive-unlabeled setting to unlock the full potential of large-scale noisy training data. |
| Outcome: | The proposed model outperforms existing methods on a ReDocRED benchmark dataset with an absolute F1 score improvement of over 3%. |