You can use the algorithm to determine the edit distance between the two strings and if that distance is less than a certain threshold you would consider it a match. The trick would be determining the threshold.
I have not played with this much, but one option that comes to mind is if the edit distance is less than a certain percentage of the length of the longest of the two strings, then consider that a match. Not very scientific, but a starting point for further research.