For simplicity, we drop y <i and x in p(y i | a i ) and p(a i | a i−1 ).
for completeness, we include the recursive definition of the forward probability: computation of the likelihood in our Decoding at test time, however, is hard and we resort to a greedy scheme, described in Alg.