Paper Info
Title
Semantic Sentence Matching with Densely-Connected Recurrent and Co-Attentive Information
Abstract
Sentence matching is widely used in various natural language tasks such as natural language inference, paraphrase identification, and question answering. For these tasks, understanding logical and semantic relationship between two sentences is required but it is yet challenging. Although attention mechanism is useful to capture the semantic relationship and to properly align the elements of two sentences, previous methods of attention mechanism simply use a summation operation which does not retain original features enough. Inspired by DenseNet, a densely connected convolutional network, we propose a densely-connected co-attentive recurrent neural network, each layer of which uses concatenated information of attentive features as well as hidden features of all the preceding recurrent layers. It enables preserving the original and the co-attentive feature information from the bottommost word embedding layer to the uppermost recurrent layer. To alleviate the problem of an ever-increasing size of feature vectors due to dense concatenation operations, we also propose to use an autoencoder after dense concatenation. We evaluate our proposed architecture on highly competitive benchmark datasets related to sentence matching. Experimental results show that our architecture, which retains recurrent and attentive features, achieves state-of-the-art performances for most of the tasks.
Year
Venue
Field
2019
AAAI
Feature vector,Autoencoder,Question answering,Computer science,Recurrent neural network,Natural language,Natural language processing,Artificial intelligence,Concatenation,Word embedding,Sentence,Machine learning
DocType
Citations 
PageRank 
Conference
2
0.35
References 
Authors
0
3
Name
Order
Citations
PageRank
Seonhoon Kim182.12
Inho Kang220.69
Nojun Kwak386263.79