A Decomposable Attention Model for Natural Language Inference
Ankur P. Parikh Affiliation: Google Affiliation: New York, NY Oscar Täckström Affiliation: Google Affiliation: New York, NY Dipanjan Das Affiliation: Google Affiliation: New York, NY Jakob Uszkoreit Affiliation: Google Affiliation: Mountain View, CA
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:1606.01933;中英对照 + 大白话阅读 https://aha.fim.ai/paper/1606.01933v2