To overcome this difficulty, we instead find the optimal semantic tree using the following equation: We essentially replace the operation by the max operation inside the arg max.
we first find the best latent relaxed hybrid tree h * that contains the input sentence n, and next we extract the optimal semantic tree m * from h * .