Non-adjacent constraints are difficult for string-based approaches because of the exponential number of possible relationships across non-adjacent segments.
the Wolof results show that by learning violations directly, IBPOT does not encounter problems with non-adjacent constraints.