HackerPapers

arXiv:1606.01933cs.CL

A Decomposable Attention Model for Natural Language Inference

Ankur P. Parikh, Oscar Täckström, Dipanjan Das, Jakob Uszkoreit

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

We propose a simple neural architecture for natural language inference. Our approach uses attention to decompose the problem into subproblems that can be solved separately, thus making it trivially parallelizable. On the Stanford Natural Language Inference (SNLI) dataset, we obtain state-of-the-art results with almost an order of magnitude fewer parameters than previous work and without relying on any word-order information. Adding intra-sentence attention that takes a minimum amount of order into account yields further improvements.

arXiv comments
7 pages, 1 figure, Proceeedings of EMNLP 2016
Journal reference
DOI
Subjects
cs.CLComputation and Language

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Dec 2017 to Dec 2017.

Comments linking this paper, per year.

Discussed in comments1 thread

  1. Attention Is All You Need 1 comment
    • This paper has a lot of prerequisites to understand. A good paper to read is precursor to this paper released a year ago: https://arxiv.org/abs/1606.01933

      eggie5View on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.