Skip to main content
. Author manuscript; available in PMC: 2017 Oct 26.
Published in final edited form as: Proc Conf Assoc Comput Linguist Meet. 2017 Apr;1:11–21.

Figure 1.

Figure 1

A binary tree form of Neural Tree Indexers (NTI) in the context of question answering and natural language inference. We insert empty tokens (denoted by –) to the input text to form a full binary tree. (a) NTI produces answer representation at the root node. This representation along with the question is used to find the answer. (b) NTI learns representations for the premise and hypothesis sentences and then attentively combines them for classification. Dotted lines indicate attention over premise-indexed tree.