Edit distance alignment

As you should remember from the theory, the Levenshtein distance is defined as the minimum number of single-character operations, such as insertion, deletion, and replacement, required to transform one sequence of characters into another.
Arrange the suggested words in ascending order according to their Levenshtein distance to the word "string".