Challenge: Existing methods for relation classification are limited and lack of low-frequency relations in specific domains.
Approach: They propose a method to learn a classifier on pre-defined relations and discover new relations expressed in texts.
Outcome: The proposed method can classify entities into a finite set of relations and discover relations with high precision and recall.

Similar Papers

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.
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.
More Data, More Relations, More Context and More Openness: A Review and Outlook for Relation Extraction (2020.aacl-main)

Copied to clipboard

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.
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.
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.
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.
Domain Adapted Distant Supervision for Pedagogically Motivated Relation Extraction (2020.lrec-1)

Copied to clipboard

Challenge: Existing systems for question generation based on shallow linguistic information at text level generate questions for reading comprehension.
Approach: They propose a relation extraction system that extracts pedagogically motivated relation types from a text to generate questions for reading comprehension.
Outcome: The proposed system extracts pedagogically motivated relations from a text . it performs better on the subset of relations suitable for pedagical purposes.
Relation Discovery with Out-of-Relation Knowledge Base as Supervision (N19-1)

Copied to clipboard

Challenge: Existing methods to extract relations from text corpus without annotated data are violated by up to 31%.
Approach: They propose to use out-of-relation knowledge bases to supervise the discovery of unseen relations where relations to discover from the text corpus and those in knowledge bases are not overlapped.
Outcome: The proposed method improves the state-of-the-art relation discovery performance by a large margin.
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.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations