Definition
Greedy decoding selects the highest-probability token at every generation step.
Distinguish it from nearby terms
Sampling draws from a distribution and beam search retains multiple candidate sequences; greedy decoding keeps only one local choice.
Check your understanding
Explain why the locally most likely token sequence need not be the globally most likely or best sequence.