Following<cite> Martins et al. (2011)</cite> , the problem of obtaining the best-scored tree can be written as follows: where the equality constraint ensures that the partial views "glue" together to form a coherent parse tree.