For phrases pairing a frequent subphrase with infrequent subphrases, we use a merge algorithm whose upper bound complexity is logarithmic in the number of occurrences of the frequent subphrase.
if count(u) is small, and count(v) is big, then we can find uXv in at most O(count(u) • log(count(v))) time.