Greedy decoding

Greedy decoding is a text generation strategy that always selects the single most probable next token. It is deterministic in principle but can produce repetitive or less natural text.

Greedy decoding sits in the Models part of the Agentik {OS} glossary, which defines the words used to build and run AI agent systems.

Also called Greedy search.