Our decoding algorithm first relaxes the global constraints and solves a simpler problem.
we find the best labeling according to the model, ignoring all the constraints in C. Next, we check whether y * 0 satisifies the constraints.