Neural Tree Indexers for Text Understanding

By Tsendsuren Munkhdalai, Hong Yu. 2016

106 citations recorded by the source corpus.

Recurrent neural networks (RNNs) process input text sequentially and model the conditional transition between word tokens. In contrast, the advantages of recursive networks include that they explicitly model the compositionality and the recursive structure of natural language. However, the current recursive architecture is limited by its dependence on syntactic tree. In this paper, we introduce a robust syntactic parsing-independent tree structured model, Neural Tree Indexers (NTI) that provides a middle ground between the sequential RNNs and the syntactic treebased recursive models. NTI constructs a full n-ary tree by processing the input text with its node function in a bottom-up fashion. Attention mechanism can then be applied to both structure and node function. We implemented and evaluated a binary tree model of NTI, showing the model achieved the state-of-the-art performance on three different NLP tasks: natural language inference, answer sentence selection, and sentence classification, outperforming state-of-the-art recurrent and recursive neural networks.

Subfields: Artificial Intelligence, Natural Language Processing

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Mohit Bansal
  2. Caiming Xiong
  3. Jianfeng Gao
  4. Yonatan Belinkov
  5. Yejin Choi
  6. Samuel R. Bowman
  7. Luke S. Zettlemoyer
  8. Richard Socher

In Natural Language Processing

  1. Mohit Bansal
  2. Caiming Xiong
  3. Richard Socher
  4. Samuel R. Bowman
  5. Yonatan Belinkov
  6. Yejin Choi
  7. Jianfeng Gao
  8. Luke S. Zettlemoyer

Citations in the corpus