I once wrote an algorithm to generate a regex to find all matches from a given word with a levenshtein distance of 1 (I did not permute it beyond that though).

I once wrote an algorithm to generate a regex to find all matches from a given word with a levenshtein distance of 1 (I did not permute it beyond that though). Can link it if someone is curious.