Bitap algorithm
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.
Proper noun
- 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.
Synonyms: Baeza-Yates-Gonnet algorithm