Presuming that we are searching for strings of |Y | = 16, we obtain the necessary and sufficient condition for the approximate dictionary matching from the inequality 3, τ = 12 ≤ |X ∩ Y |.
we need to search for strings that have at least 12 letter trigrams that overlap with X.