We know string matching algorithm like KMP, horspool\'s and so on, but they can only match exactly.\n\nHow can I find the substrings that Levenshtein Distance <= 1?\n\nFor example, we match the pattern stirng "ware" in string "hereharewereworeherareteartoredeardareearrearehrerheasereseersearrah".\nWe can match [5-7]:are, [19-21]:are, [4-7]:hare, [18-21]:rare, [34-37]:dare and so on, also insertion can be matched like \'dware\'.\n\nplease help me solve the problem^_^

We know string matching algorithm like KMP, horspool\'s and so on, but they can only match exactly.\n\nHow can I find the substrings that Levenshtein Distance <