pick aŷ such that: Unlike Markovian processes, no sub-exponential algorithm exists to find the optimal decoded sequence, and thus we instead use approximations.
arg-max The simplest approach to decoding a likely sequence is to greedily select a word at each timestep:ŷ because this deterministic approach typically yields repetitive and short output sequences, and does not permit generating multiple samples, it is rarely used in language modelling.