Edit distance between any two strings m and n is the minimum number of basic operation to convert m to n.
operations will be insert, delete,replace and transpose.
Levenshtein distance: Distance between any two strings is the minimum number of basic operations. and the basic operations are insert, delete and replace.
Levenshtein distance between parrot and parrat is 1
Regards,
Rajasekhar
