| 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. |
Similar Papers
Neural Relation Extraction for Knowledge Base Enrichment (P19-1)
Copied to clipboard
| Challenge: | Existing studies focus on the extraction itself and rely on Named Entity Disambiguation (NED) to map triples into knowledge base (KB) enrichment. |
| Approach: | They propose an end-to-end relation extraction model for knowledge base enrichment based on a neural encoder-decoder model . they propose to extract entities and their relationships from sentences in the form of triples and map the elements of the extracted triples to an existing KB in an end to end manner. |
| Outcome: | The proposed model outperforms state-of-the-art baselines by 15.51% and 8.38% on two real-world 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. |
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. |
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. |
Improving Distantly-Supervised Relation Extraction with Joint Label Embedding (D19-1)
Copied to clipboard
| Challenge: | Existing methods for relation extraction treat labels as independent and meaningless one-hot vectors, which cause a loss of potential label information for selecting valid instances. |
| Approach: | They propose a multi-layer attention-based model to improve relation extraction with joint label embedding by gating integration and using the embeddable entities as an atten- tion. |
| Outcome: | The proposed model significantly outperforms state-of-the-art methods in relation extraction with joint label embedding. |
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. |
Refining Source Representations with Relation Networks for Neural Machine Translation (C18-1)
Copied to clipboard
| Challenge: | Existing neural machine translation frameworks that forget distant information and disregard relationship between source and target words are not effective. |
| Approach: | They propose to use relation networks to learn better representations of the source . they propose to associate source words with each other to help retain their relationships . |
| Outcome: | Experiments show that the proposed approach outperforms the encoder-decoder framework on several datasets. |
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. |
Cross-stitching Text and Knowledge Graph Encoders for Distantly Supervised Relation Extraction (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing bi-encoder architectures do not allow any sharing between text and knowledge graphs . john sutter: experimental results show that enabling full interaction yields strong improvements. |
| Approach: | They propose cross-stitch bi-encoders that allow full interaction between text and KG . they say the amount of sharing is dynamically controlled via cross-attention-based gates . |
| Outcome: | Experimental results show that bi-encoder architectures yield strong improvements . cross-stitch mechanism allows sharing and updating representations between two encoders . |