Note that given a sentence, a graph-based dependency parser has three levels of representations: the model parameters, the scores of dependency edges computed from the parameters, and the parse tree computed from the edge scores.
we propose three different regularization terms to effectively encourage similarity of the two models.