Relation Classification Using Segment-Level Attention-based CNN and Dependency-based RNN (N19-1)
Copied to clipboard
| Challenge: | Recent work on relation classification has gained much success by exploiting deep neural networks. |
| Approach: | They propose a relation classification model using Segment-level Attention-based Convolutional Neural Networks and Dependency-based Recurrent Neural networks. |
| Outcome: | The proposed model is comparable to the state-of-the-art without external lexical features on the SemEval-2010 dataset. |
Similar Papers
Attention Guided Graph Convolutional Networks for Relation Extraction (P19-1)
Copied to clipboard
| Challenge: | Existing approaches for selecting relevant partial dependency structures may not yield optimal results. |
| Approach: | They propose a model which directly takes full dependency trees as inputs and uses them to selectively attend to relevant sub-structures. |
| Outcome: | The proposed model can be understood as a soft-pruning approach that automatically learns how to selectively attend to the relevant sub-structures useful for the relation extraction task. |
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. |
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. |
Neural Relation Classification with Text Descriptions (C18-1)
Copied to clipboard
| Challenge: | State-of-the-art methods for relation classification suffer from data sparsity issue greatly. |
| Approach: | They propose a new neural relation classification method which integrates entities’ text descriptions into deep neural networks models. |
| Outcome: | The proposed method achieves much better experimental results than other state-of-the-art methods on the SemEval 2010 dataset. |
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. |
Structured Minimally Supervised Learning for Neural Relation Extraction (N19-1)
Copied to clipboard
| Challenge: | Recent work shows that distant supervision can cause significant label noise when learning from large quantities of unlabeled text. |
| Approach: | They propose a method that combines the benefits of learning representations and structured learning to predict sentence-level relation mentions given only proposition-level supervision from a KB. |
| Outcome: | The proposed approach outperforms a number of baseline approaches while minimizing label noise. |
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. |
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. |
Recurrent Interaction Network for Jointly Extracting Entities and Classifying Relations (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods to solve the extraction problem learn interactions between the two tasks through a shared network . |
| Approach: | They propose to use multi-task learning to address the joint extraction of entity and relation . they exploit correlation between ER and relation classification tasks to improve performance . |
| Outcome: | Empirical results show that the proposed model improves on two real-world datasets. |
Modular Self-Supervision for Document-Level Relation Extraction (2021.emnlp-main)
Copied to clipboard
| Challenge: | Prior work on information extraction tends to focus on binary relations within sentences . practical applications often require extracting complex relations across large text spans . |
| Approach: | They propose to decompose document-level relation extraction into relation detection and argument resolution, taking inspiration from Davidsonian semantics. |
| Outcome: | The proposed method outperforms state-of-the-art methods in biomedical machine reading for precision oncology by 20 absolute F1 points. |