Aan de slagGa gratis aan de slag

Calculating distance

In the video exercise, you saw how to use Damerau-Levenshtein distance to identify how similar two strings are. As a reminder, Damerau-Levenshtein distance is the minimum number of steps needed to get from String A to String B, using these operations:

  • Insertion of a new character.
  • Deletion of an existing character.
  • Substitution of an existing character.
  • Transposition of two existing consecutive characters.

What is the Damerau-Levenshtein distance between the words "puffin" and "muffins" and which operation(s) gets you there?

Deze oefening maakt deel uit van de cursus

Cleaning Data in R

Cursus bekijken

Praktische interactieve oefening

Zet theorie om in actie met een van onze interactieve oefeningen.

Begin met trainen