We use the concatenation of a k , which is the attention-weighted version of the premise for the k th word in the hypothesis, and h t k , the hidden state for the k th word itself, as input to the mLSTM.
let us define We then build the mLSTM as follows: With this mLSTM, finally we use only h m N , the last hidden state, to predict the label y.