The cell [i, j] in the DPT represents the span containing EDUs i through j and stores the probability of a constituent R[i, m, j], where m = argmax i≤k≤j P (R[i, k, j]).
to HILDA which implements a greedy algorithm, our approach finds a DT that is globally optimal.