The algorithm maximizes the logprobability of the entire NomBank labeled parse tree.
assuming we only have two classes "ARG" and "NONE", the log-probability of a NomBank labeled parse tree is defined by Equation 2.