This allows us to trivially find the most likely target sequence by taking arg max yt p(y t |X) for each t, effectively bypassing the computational overhead and suboptimality of decoding from an autoregressive sequence model.
the original input X is padded or shortned to fit the length of the reference target sequence before being fed to Decoder 1.