Levenshtein distance: how to better handle words swapping positions?

Question

I\'ve had some success comparing strings using the PHP levenshtein function.

However, for two strings which contain substrings that have swapped positions, the algorithm

Answer 1

Its easy. Just use the Damerau-Levenshtein distance on the words instead of letters.