pull down to refresh

0 sats \ 1 reply \ @SimpleStacker 27 Dec 2025 \ parent \ on: Stacker Saloon

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

write
preview
67 sats \ 0 replies \ @k00b 27 Dec 2025

We added a dictionary for visual similarity, but you're right we should use an algorithm that is purpose built for visual similarity.

reply