The parsing task is to find the most probable semantic graph G * such that where the sum is taken over all dependency derivations D for a sentence S. Similar to the model given by Ge and Mooney (2009), we assume that the dependency parse we obtain from a third party parser (here C&C) is correct.
we assume that the probability distribution over dependency structure derivations given a sentence S densely locates at the derivation D S yielded by the used syntactic dependency parser, i.e.