A Compare-Aggregate Model for Matching Text Sequences

11/06/2016
by   Shuohang Wang, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/13/2019

A Gated Self-attention Memory Network for Answer Selection

Answer selection is an important research problem, with applications in ...
research
02/13/2016

Attention-Based Convolutional Neural Network for Machine Comprehension

Understanding open-domain text is one of the primary challenges in natur...
research
03/09/2020

Matching Text with Deep Mutual Information Estimation

Text matching is a core natural language processing research problem. Ho...
research
08/13/2018

REGMAPR - Text Matching Made Easy

We propose a simple model for textual matching problems. Starting from a...
research
08/16/2021

Non-Local Feature Aggregation on Graphs via Latent Fixed Data Structures

In contrast to image/text data whose order can be used to perform non-lo...
research
03/29/2016

A Parallel-Hierarchical Model for Machine Comprehension on Sparse Data

Understanding unstructured text is a major goal within natural language ...
research
10/15/2020

Wasserstein Distance Regularized Sequence Representation for Text Matching in Asymmetrical Domains

One approach to matching texts from asymmetrical domains is projecting t...

Please sign up or login with your details

Forgot password? Click here to reset