Since Enju represented a probabilistic disambiguation model in a packed forest structure, we exploit that structure to represent our probabilistic model.
we redefine p M with feature functions g j on conjunctive nodes as  As described in Section 2, the original model, p E (t|s), is expressed in a packed structure as where Then, p 0 (t|s) is substituted by p E (t|s), and p M (t|s) is formulated as With this form of p M (t|s), a dynamic programing algorithm can be applied.