ng a good static or terminal evaluation function, we are forced to use alternative sampling schemes that are much less sophisticated. The most trivial is <em>greedy</em> sampling, which involves choosing the most likely token at each point and moving on. As you might guess from the name, this does not work too well. Next is <em>beam search</em>, which grows multiple writing fragments and maintains a fixed-sized set of the most likely. Looking at language statistics, it turns out that people rarely say the m