By definition, for each configuration, there is at least one transition with cost 0 with respect to the gold parse.
otherwise, it would entail that there is a tree reachable from C but unreachable from t(C), for any t. we reformulate equation 1: (3) In the transition system, the grammar is left implicit: any reduction is allowed (even if the corresponding grammar rule has never been seen in the training corpus).