(2017) can be inefficient for large numbers of constraints.
all unsatisfied constraints are expanded at each time step t which increases decoding complexity from O(tk) for normal beam search to O(tk2 c ).