Instead of directly computing the summation over all possible latent text-math structures, we essentially replace the by the max operation inside the arg max.
we first find the latent text-math tree t * which yields the highest score and contains the input text x.