An alternative to INT is UNI , where we determine distributional compatibility of a co-occurrence by aggregating across the distributional compatibility of the cooccurrence for each of the lexemes being composed.
for all τ ∈ (R ∪ R) * and w ∈ V: Although this clearly achieves co-occurrence embellishment, whether co-occurrence filtering is achieved depends on the weighting scheme being used.