the optimal sense sequence of the sentence) that minimize the energy function in Equation 1: We use dynamic programming to do inference which is similar to the Viterbi algorithm of the hidden Markov model.
for every valid assignment as the energy of the best sense sequence up to position i − 1 that is consistent with the assignment A i−2k , .