| Challenge: | Existing studies on relation classification have been limited to a very narrow range of datasets, making comparisons between approaches difficult. |
| Approach: | They propose a multi-channel LSTM model combined with a CNN that takes advantage of all currently popular linguistic and architectural features. |
| Outcome: | The proposed model achieves state-of-the-art on two datasets and provides direct insights into the challenges faced by language models on relation classification. |
Similar Papers
Revisiting the Hierarchical Multiscale LSTM (C18-1)
Copied to clipboard
| Challenge: | Hierarchical Multiscale LSTM model learns structure from character input . high complexity of architecture, training and implementations might hinder its applicability . |
| Approach: | They propose to reproduce and ablate hierarchical multiscale LSTM language model and show that simplifying certain aspects of the architecture can improve its performance. |
| Outcome: | The proposed model performs better when simplified and linguistic units are learned by different levels of the model. |
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. |
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. |
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. |
FewRel: A Large-Scale Supervised Few-Shot Relation Classification Dataset with State-of-the-Art Evaluation (D18-1)
Copied to clipboard
| Challenge: | Empirical results show that even the most competitive few-shot learning models struggle on this task, especially as compared with humans. |
| Approach: | They propose a Few-Shot Relation Classification Dataset consisting of 70, 000 sentences on 100 relations derived from Wikipedia and annotated by crowdworkers. |
| Outcome: | The proposed methods perform well on the most competitive few-shot learning models, especially as compared with humans. |
MODE-LSTM: A Parameter-efficient Recurrent Network with Multi-Scale for Sentence Classification (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing models for sentence classification use linear convolution, which may not be sufficient to model the non-consecutive dependency of the phrase and may overfit the sequential information. |
| Approach: | They propose a model that extracts multi-scale n-gram features for understanding the semantic meaning of sentences by some key-phrases located at different positions. |
| Outcome: | The proposed model outperforms existing models on eight benchmark datasets and is competitive against state-of-the-art models. |
Rethinking Complex Neural Network Architectures for Document Classification (N19-1)
Copied to clipboard
| Challenge: | Neural network models for many NLP tasks have grown increasingly complex in recent years . authors of recent papers question the necessity of such architectures and find them quite effective . |
| Approach: | They propose to use regularization techniques borrowed from language modeling to improve model accuracy . they find that a simple biLSTM architecture with appropriate regularization yields competitive results . |
| Outcome: | a simple biLSTM model outperforms the state-of-the-art on four benchmark datasets . authors say that improvements are not real, but are attributed to mundane reasons . |
Best of Both Worlds: A Pliable and Generalizable Neuro-Symbolic Approach for Relation Classification (2024.findings-naacl)
Copied to clipboard
| Challenge: | a novel neuro-symbolic architecture for relation classification combines rule-based methods with deep learning techniques. |
| Approach: | They propose a neuro-symbolic architecture for relation classification that combines rule-based methods with deep learning techniques. |
| Outcome: | The proposed approach outperforms state-of-the-art models in three out of four settings . human interventions boost the performance on the relation org:parents by as much as 26% relative improvement . |
State-of-the-art Chinese Word Segmentation with Bi-LSTMs (D18-1)
Copied to clipboard
| Challenge: | A wide variety of neural-network architectures have been proposed for the task of Chinese word segmentation. |
| Approach: | They propose a bidirectional LSTM model with standard deep learning techniques and best practices for the task of Chinese word segmentation. |
| Outcome: | The proposed model outperforms models based on standard deep learning techniques and best practices on Chinese word segmentation datasets. |
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. |