2 docs tagged with "Levenshtein Distance"

Bitap Algo is defined as: Algorithm to Fuzzy Search by transform string to Bitmask & compute # Bitwise Ops for Levenshtein distance. Topics on: Bitmask, Bitwise

Levenshtein distance is defined as: Algorithm to compute Edit Distance by # single char ins/sub/del ops to transform string to another. Topics on: . Read more: