here is figure 7.14 down below

7.5 Implement the Stack decoding algorithm of Figure 7.14 on 256 . Pick a very simple h function like an estimate of the number of words remaining in the sentence. function STACK-DECODING() returns min-distance Initialize the priority queue with a null sentence. Pop the best (highest score) sentence s off the queue. If ( s is marked end-of-sentence (EOS) ) output s and terminate. Get list of candidate next words by doing fast matches. For each candidate next word w : Create a new candidate sentence s+w. Use forward algorithm to compute acoustic likelihood L of s+w Compute language model probability P of extended sentence s+w Compute "score" for s+w (a function of L,P, and ???) if (end-of-sentence) set EOS flag for s+w. Insert s+w into the queue together with its score and EOS flag Figure 7.14 The A decoding algorithm (modified from Paul (1991) and Jelinek (1997)). The evaluation function that is used to compute the score for a sentence is not completely defined here; possibly evaluation functions are discussed below