Greedy decoding always selects the token with the highest probability at each step. It's the simplest and most deterministic generation method—given the same input, it always produces the exact same output.
While fast and consistent, greedy decoding can miss better overall sequences by making locally optimal choices.