We assume that every possible headdependent pair ¨ is described by a feature vector Eisner's algorithm achieves optimal tree packing by storing partial structures in two matrices and .
in the extended model, is updated as defined in eq.