To avoid this, models often resort to greedy search which only allows them to explore a limited portion of the latent space.
its decoding complexity is where B is beam size, m is a constant proportional to the tag set size and N is output size.