In STAMP, the probability of a token to be generated is calculated as Equation 1, where p z (•) is the probability of the channel z t to be chosen, and p w (•) is the probability distribution of generating a word y t from the selected channel.
(1) the encoder takes a question as the input, uses bidirectional RNN with GRU cells to compute the hidden states, and feeds the concatenation of both ends as the initial state of the decoder.