With this change in place, let s best (i, j) denote the score of the best subtree spanning (i, j).
for spans of length one, we need only consider the choice of label: for general spans (i, j), we have the following recursion: we can independently select the best label for the current span and the best split point, where the score of a split is the sum of the best scores for the corresponding subtrees.