pull down to refresh
The problem with levenshtein distance is that it treats changing O to K the same as changing O to 0, it's more about number of operations distance than visual similarity
O
K
0
We added a dictionary for visual similarity, but you're right we should use an algorithm that is purpose built for visual similarity.
The problem with levenshtein distance is that it treats changing
OtoKthe same as changingOto0, it's more about number of operations distance than visual similarity