For prediction, we choose the sequence of dialogue acts with the highest posterior probability: Since the joint probability is decomposed further according to Equation 1, we can make use of dynamic programming to find the highest probability sequence of dialogue acts.
the model endows each latent variable z t with a unary potential P Θ Θ Θ (y t |z t , y t−1 ) and binary potential P Θ Θ Θ (z t |z t−1 , y t−1 ) functions.