consider forking levenshtein-search

[fgregg]

the project changed to an incompatible gpl license and it would be nice to have control over binary wheel releases. not actively developed so we would not be losing out on that

[NickCrews]

I'm not sure the exact algorithm that levenshtein-search uses, but perhaps it would be worth investigating using https://github.com/mammothb/symspellpy. For edit distances larger than ~2, symspell starts to become algorithmically much better than naive search methods. It wasn't clear to me exactly what algorithm levenshtein-search uses