At each time step, the decoder LSTM receives c i in addition to the previously-output word.
the hidden state 1 at time i of the decoder is defined as , which is used to predict word w i : where g is an affine transformation.