Computing the joint likelihood of the observed parse trees T and sentences w requires summing over all derivations t over split subcategories: Matsuzaki et al. (2005) derive an EM algorithm for maximizing the joint likelihood, and<cite> Petrov et al. (2006)</cite> extend this algorithm to use a split&merge procedure to adaptively determine the optimal number of subcategories for each observed category.