I've done a bit of reading after checking out this post, and found out about the
Damerau-Levenshtein distance which I believe would be better suited.
Besides the three operations used in computing the Levenshtein distance - insertion, deletion and substitution - this one comes up with a fourth, the transposition of two adjacent characters, particularly useful in case of misspellings.
Cheers
Claudiu