Levenshtein distance is a dynamically computed distance between two strings, accounting for the number of deletions, insertions, and substitutions needed to transform the one string into the other.
we use syntactic trees for deriving instances, partly at the constituent level and partly at the word level.