Formally, this can be written as, DT * = argmax DT P (DT |Θ) Our discourse parser implements a probabilistic CKY-like bottom-up algorithm for computing the most likely parse of a sentence using dynamic programming; see (Jurafsky and Martin, 2008) for a description.
with n number of EDUs in a sentence, we use the upper-triangular portion of the n × n Dynamic Programming Table (DPT).