To do that, we topologically sort the nodes in V at time t = 0 and maintain a sorted list of nodes as we refine g throughout the search -thus avoiding having to recompute the partial ordering of the nodes at every iteration.
with k < 10 4 both model scores and translation quality can be improved.