| Challenge: | State-of-the-art relation extraction methods only recognize relationships between mentions of entity arguments stated explicitly in the text. |
| Approach: | They propose a method to identify relations between two entities using unary relations and a common deep learning based representation. |
| Outcome: | The proposed method outperforms state-of-the-art relation extraction technology on a web scale knowledge base population benchmark. |
Similar Papers
Using active learning to expand training data for implicit discourse relation recognition (D18-1)
Copied to clipboard
| Challenge: | Existing methods to determine semantic relations between text spans are limited in the field of discourse-level relation recognition. |
| Approach: | They propose to expand the training data set using the corpus of explicitly-related arguments by arbitrarily dropping the overtly presented discourse connectives. |
| Outcome: | The proposed model expands the training data set using the corpus of explicitly-related arguments, by arbitrarily dropping the overtly presented discourse connectives. |
A Frustratingly Easy Approach for Entity and Relation Extraction (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing work on end-to-end relation extraction models combine two tasks: named entity recognition and relation extraction. |
| Approach: | They propose a pipelined approach for entity and relation extraction that uses two independent encoders to construct the relation model. |
| Outcome: | The proposed approach achieves an 8.16 speedup with a slight reduction in accuracy on standard benchmarks. |
More Data, More Relations, More Context and More Openness: A Review and Outlook for Relation Extraction (2020.aacl-main)
Copied to clipboard
Xu Han, Tianyu Gao, Yankai Lin, Hao Peng, Yaoliang Yang, Chaojun Xiao, Zhiyuan Liu, Peng Li, Jie Zhou, Maosong Sun
| Challenge: | Existing methods for extracting relational facts from text have been successful . but with explosion of Web text, human knowledge is increasing drastically . |
| Approach: | They propose to improve relation extraction methods to extract relational facts from text . they analyze existing methods and show promising directions towards more powerful RE . |
| Outcome: | The proposed methods can extract relational facts from text, but they are still lacking in the current field. |
Novel Relation Detection: Discovering Unknown Relation Types via Multi-Strategy Self-Supervised Learning (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing approaches to relation extraction can only recognize predefined relation types . new or out-of-scope relation types may continually emerge after the model is deployed . |
| Approach: | They propose a novel relation detection task that uses self-supervised learning to handle shallow semantic similarity problem. |
| Outcome: | The proposed method outperforms state-of-the-art methods on two datasets. |
Cluster-aware Pseudo-Labeling for Supervised Open Relation Extraction (2022.coling-1)
Copied to clipboard
| Challenge: | Existing methods to extract novel relations do not achieve effective knowledge transfer . experimental results show that the proposed method is state-of-the-arts . |
| Approach: | They propose a Cluster-aware Pseudo-Labeling method to improve pseudo-labels quality . they firstly pre-trained the relation models with pre-defined relations to learn them . |
| Outcome: | The proposed method improves the pseudo-labels quality and transfer more knowledge for discovering novel relations. |
Employing the Correspondence of Relations and Connectives to Identify Implicit Discourse Relations via Label Embeddings (P19-1)
Copied to clipboard
| Challenge: | Existing models for implicit discourse relation recognition lack the ability to accurately map connectives into discourse relations. |
| Approach: | They propose a multi-task learning framework where relations and connectives are simultaneously predicted and leveraged to transfer knowledge between the two prediction tasks. |
| Outcome: | The proposed framework yields state-of-the-art performance on several settings of the Penn Discourse Treebank dataset. |
Attention for Implicit Discourse Relation Recognition (L18-1)
Copied to clipboard
| Challenge: | Existing approaches to implicit discourse relation recognition reach F1 scores of 9.95% to 37.67% . a neural network exploits the strong correlation between pairs of words that implicitly signal a discourse relation. |
| Approach: | They propose a neural network which exploits strong correlation between pairs of words . they use an encoder-decoder model with attention to detect a latent discourse relation . |
| Outcome: | The proposed model outperforms state-of-the-art models on fine-grained classification and fine-granular classification while computing parameters without pooling and fully connected layers. |
Deep Enhanced Representation for Implicit Discourse Relation Recognition (C18-1)
Copied to clipboard
| Challenge: | Discourse parsing requires understanding of text spans and can't be easily derived from surface features from sentence pairs. |
| Approach: | They propose a model augmented with different grained text representations to improve discourse relation recognition. |
| Outcome: | The proposed model achieves state-of-the-art accuracy with greater than 48% in 11-way and F1 score greater than 50% in 4-way classifications for the first time according to our best knowledge. |
Towards a More Generalized Approach in Open Relation Extraction (2025.acl-long)
Copied to clipboard
| Challenge: | Existing OpenRE methods assume unlabeled data is a mixture of known and novel instances. |
| Approach: | They propose a generalized OpenRE setting that considers unlabeled data as a mixture of known and novel instances. |
| Outcome: | The proposed framework outperforms baselines in relation classification and clustering on three benchmark datasets. |
Implicit Discourse Relation Classification: We Need to Talk about Evaluation (2020.acl-main)
Copied to clipboard
| Challenge: | Lack of consistency in preprocessing and evaluation poses challenges to fair comparison of results in literature. |
| Approach: | They propose an improved evaluation protocol for implicit relation classification on PDTB 2.0 . they report strong baseline results from pretrained sentence encoders . |
| Outcome: | The proposed evaluation protocol improves the existing framework and provides strong baseline results. |