Bitap algorithm

Proper noun

 * 1)  An algorithm that determines whether a given text contains a substring that is "approximately equal" to a given pattern, defined in terms of Levenshtein distance, and working by means of bitmasks.