Our augmented-loss function in this case is a simple binary function: 0 if a parse has the correct root dependency and 1 if it does not.
the algorithm will select the first parse in the k-best list that has the correct root as the proxy to a gold standard parse.