A Richer-but-Smarter Shortest Dependency Path with Attentive Augmentation for Relation Extraction (N19-1)
Copied to clipboard
| Challenge: | Existing approaches to extract relationship between entities in sentences suffer from missing or redundant information. |
| Approach: | They propose a deep neural model that combines the advantages of the two approaches to extract the relationship between two entities in a sentence. |
| Outcome: | The proposed model outperforms baseline models on the SemEval-2010 dataset. |
Similar Papers
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 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. |
Three Sentences Are All You Need: Local Path Enhanced Document Relation Extraction (2021.acl-short)
Copied to clipboard
| Challenge: | Document-level relation extraction (RE) is more challenging than sentence RE as it often requires reasoning over multiple sentences. |
| Approach: | They propose a method to heuristically select evidence sentences for document-level relation extraction. |
| Outcome: | The proposed method can be easily combined with BiLSTM to achieve good performance on benchmark datasets even better than fancy graph neural network based methods. |
Improving Long-Tail Relation Extraction with Collaborating Relation-Augmented Attention (2020.coling-main)
Copied to clipboard
| Challenge: | Existing approaches to handle wrong labeling and long-tail relations are labor-intensive and scarce training data. |
| Approach: | They propose a neural network to handle wrong labeling and long-tail relations by collaborating relation-augmented attention. |
| Outcome: | The proposed neural network improves the state-of-the-art on the NYT dataset . |
Graph Enhanced Dual Attention Network for Document-Level Relation Extraction (2020.coling-main)
Copied to clipboard
| Challenge: | Document-level relation extraction requires inter-sentence reasoning capabilities to capture local and global contextual information for multiple relation facts. |
| Approach: | They propose to characterize the interaction between sentences and potential relation instances via a Graph Enhanced Dual Attention network (GEDA) . they also propose a simple yet effective regularizer based on the natural duality of the S2R and R2S attentions, whose weights are also supervised by the supporting evidence of relation instances during training. |
| Outcome: | The proposed model achieves competitive performance on an existing large-scale dataset while the predictions can be interpretable and easily observed. |
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. |
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. |
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. |
Improving Relation Extraction with Knowledge-attention (D19-1)
Copied to clipboard
| Challenge: | Existing attention mechanisms are data-driven, but most are data driven. |
| Approach: | They propose a knowledge-attention encoder which integrates prior knowledge from external lexical resources into deep neural networks for relation extraction task. |
| Outcome: | The proposed system outperforms existing CNN, RNN, and self-attention based models on a large-scale relation extraction dataset. |