A naïve solution to this task is to compute similarity values |V | times, i.e., between x and every string y ∈ V .
these values indicate that the proposed algorithm can solve τ -overlap join problems by checking only 50.3% (IMDB), 53.6% (Web1t), and 51.9% of the total inverted lists re-  Numerous studies have addressed approximate dictionary matching.