Greedy decoding picks the single most likely token at each step: fast and deterministic but can be repetitive and miss better overall sequences.
Beam search keeps the top several partial sequences and picks the best overall; common in translation, but it tends to produce bland, repetitive text in open-ended generation.
Sampling (with temperature, top-k or top-p) adds randomness for diverse, natural text. Repetition penalties and stop sequences give further control.
Loading…