preprint Open access

A Compare-Aggregate Model for Matching Text Sequences

  • arXiv (Cornell University)
  • Cornell University
Research footprint

At a glance

Citations
59
References
0
Comments
0
Paper overview

Abstract

Many NLP tasks including machine comprehension, answer selection and text entailment require the comparison between sequences. Matching the important units between sequences is a key to solve these problems. In this paper, we present a general "compare-aggregate" framework that performs word-level matching followed by aggregation using Convolutional Neural Networks. We particularly focus on the different comparison functions we can use to match two vectors. We use four different datasets to evaluate the model. We find that some simple comparison functions based on element-wise operations can work better than standard neural network and neural tensor network.

Record transparency

Publication details

DOI
10.48550/arxiv.1611.01747
OpenAlex
W2556553881
Document type
preprint
Language
EN
Source
arXiv (Cornell University)
Last metadata update
Community

Comments

Log in to join the discussion.

  1. No comments yet. Start the discussion.