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 `O` to `K` the same as changing `O` to `0`, it's more about number of operations distance than visual similarity


SimpleStacker

We only allow alphanumerics and underscores in nyms, so WeAreAllSatoshi implemented a 

But time is better spent removing friction right now given how friction-full the onboarding is.

Stacker Saloon

saloon

We only allow alphanumerics and underscores in nyms, so WeAreAllSatoshi implemented a [Damerau–Levenshtein distance](https://en.wikipedia.org/wiki/Damerau%E2%80%93Levenshtein_distance) IIRC.

But time is better spent removing friction right now given how friction-full the onboarding is.