Thus, our goal is to construct a better function p(y i |x, θ) given training data D. Each instance in D is a triple (x, E, y), where E is a matrix to rep-resent the discourse dependency tree of x.
element E k,l equals 1 if the edge from x k to x l exists in the discourse tree; otherwise E k,l = 0.