   Levenshtein distance
  Hy.I'm implemented the Levenshtein distance(http://it.wikipedia.org/wiki/Distanza_di_Levenshtein), an algorithm that return the number of passages to do for a string to another string for reach the equal string.The problem is that these passages are from 0(strings are equals)to infinity.How i create a number that rappresent a value from 0 to 1 from a value from 0 to infinity?thanks   
  Divide by the length of the longer input string.   ;  thanks.I work on a reconition of email string on a db , for a smarty mail validatorand finder, i would find all the combination in the Levenshtein distance of a string and try if the combination string is present on a table of db with my personal mails , so if there is a write mistake , the query find the best simil email string and try it.Naturally i direct the find with other parameters so name , surname ecc.. ad es:email   name  surnamegiuxxseppe.ferrari@yahoo.it giuseppe   ferrariint the tablegiuseppe.ferrari@yahoo.it   giuseppe   ferrarii try all the combination in email and see if a simil mail have a simil name and a simil surname , if the rank of the result is enough i recognize the email.how modify the Levenshtein distance for send me all the combination?   