Challenge: Existing methods for relation classification have been used in natural language processing.
Approach: They propose a relation classification task for Chinese literature text using a new dataset.
Outcome: The proposed model outperforms the state-of-the-art methods on Chinese literature text.

Similar Papers

Chinese Relation Classification using Long Short Term Memory Networks (L18-1)

Copied to clipboard

Challenge: Relation classification is the task to predict semantic relations between pairs of entities in a given text.
Approach: They propose to extract relations between entities in Chinese text using a long-term memory network.
Outcome: The proposed system achieves state-of-the-art F-measure on ACE 2005 corpus . it predicts relations between head entity e h and tail entity t from sentence .
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.
Exploratory Neural Relation Classification for Domain Knowledge Acquisition (C18-1)

Copied to clipboard

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.
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.
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.
Every Document Owns Its Structure: Inductive Text Classification via Graph Neural Networks (2020.acl-main)

Copied to clipboard

Challenge: Existing graph-based methods for text classification cannot capture contextual word relationships within each document nor can they produce inductive learning of new words.
Approach: They propose to use Graph Neural Networks to learn the local word representations and then aggregate the word nodes as the document embeddings.
Outcome: The proposed method outperforms state-of-the-art methods on four benchmark datasets.
Global-to-Local Neural Networks for Document-Level Relation Extraction (2020.emnlp-main)

Copied to clipboard

Challenge: Relation extraction (RE) aims to identify the semantic relations between named entities in text.
Approach: They propose a novel relation extraction model that encodes document information in terms of entity global and local representations and context relation representations.
Outcome: The proposed model achieves superior performance on two public datasets for document-level RE.
Adaptive Learning of Local Semantic and Global Structure Representations for Text Classification (C18-1)

Copied to clipboard

Challenge: Existing representation models for text classification learn little structure information or rely on pre-defined structures.
Approach: They propose a sandwich neural network to learn local semantic and global structure representations without relying on parsers.
Outcome: The proposed approach achieves competitive performance on several text classification tasks.
A Walk-based Model on Entity Graphs for Relation Extraction (P18-2)

Copied to clipboard

Challenge: Existing models treat each relation in a sentence individually, but a graph-based model needs to consider multiple relations between entities to model the dependencies among them.
Approach: They propose a graph-based neural network model that treats multiple pairs in a sentence simultaneously and considers interactions among them.
Outcome: The proposed model performs comparable to the state-of-the-art systems on the ACE 2005 dataset without external tools.
Semi-supervised URL Segmentation with Recurrent Neural Networks Pre-trained on Knowledge Graph Entities (2020.coling-main)

Copied to clipboard

Challenge: Domain names such as openresearch are being added to a growing set of tokens that an NLP system may need to deal with.
Approach: They propose a tagging model that uses characters as input to break domain names into component words . they propose taagging methods that use concatenated entity names in a large knowledge database .
Outcome: The proposed model improves on concatenated entity names in a knowledge database by 33% . the proposed model can be used for a wide range of languages, including Chinese and Japanese .

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