In this work, we choose greedy decoding at test time.
the most likely word from the decoder output p(θ) at each time stamp is selected as the baseline output, as shown on the right-hand side of Figure 1.