Otherwise, we use a simulated annealing strategy where hypotheses with a lower score can still be accepted with a certain probability which depends on the difference between the hypothesis score and Figure 1: Example of a search tree produced by the beam-search decoder for the input In other hands, they might be right.
the highest scoring hypothesis found is they might be right.