This process takes as its input an utterance and outputs a weighted graph of words, which represents the probability distribution p(W t |A).
each full path in the graph of words (from the initial to the ending node) is a candidate translation of the input utterance, and is weighted with the probability of the translation given the utterance.