Given an input phoneme string x (i) , we then must find the corresponding y ∈ Σ * that minimizes where threshold is a step function that maps all non-positive reals to −1 and all positive reals to 1.
we seek the phoneme string y that shares the most features with the maximum a posteriori decoded binary vector.