Therefore, the long jump distance between the sentences is five.
the best Levenshtein path contains one deletion edge, four identity and five consecutive substitution edges; the Levenshtein distance between the two sentences is six.