REGMAPR - A Recipe for Textual Matching

Anonymous

May 24, 2018 (modified: May 24, 2018) OpenReview Anonymous Preprint Blind Submission readers: everyone Show Bibtex
  • Abstract: We propose a simple model for textual matching problems. Starting from a Siamese architecture, we augment word embeddings with two features based on exact and paraphrase match between words in the two sentences being considered. We train the model using four types of regularization on datasets for textual entailment, paraphrase detection and semantic relatedness. Our model performs comparably or better than more complex architectures; achieving state-of-the-art results for paraphrase detection on the SICK dataset and for textual entailment on the SNLI dataset.

Loading