The best parse tree is given by arg max Y q ⇤ (Y).
we define the feasible set as: To measure the distance between two distribution, we use the KL-divergence, and find the best feasible distribution q ⇤ (Y): If the feasible set has the expectation form: Eq.