Our second modification is to do a Viterbi approximation, by replacing the expectations with maximizations.
we compute the most likely sentence extractions for the label facts arg max z p(z|x i , y i ; θ) and the most likely extraction for the input, without regard to the labels, arg max y,z p(y, z|x i ; θ).