5.3. Levenshtein Distance

Try these first

1. 1.

   What is edit distance?

   Hint

   Think about what operations can be used.

2. 2.

   List the three operations involved in calculating edit distance.

   Hint

   Recall the acronym IDS.

3. 3.

   What does edit distance measure?

   • The similarity of two text files
   • The number of edits needed to transform one string into another
   • The length of the longest common subsequence

   Hint

   Consider the operations involved in changing one string to match another.

4. 4.

   True or False: The Levenshtein distance only includes insertion and deletion operations.

   • True
   • False

   Hint

   Remember the three operations used in edit distance.

5. 5.

   Calculate the edit distance between the words 'sunday' and 'saturday' using the algorithm discussed.

   Hint

   Break down the changes step by step, comparing letters at each position.

6. 6.

   Write a detailed explanation of how the Levenshtein distance can impact search engine optimization (SEO).

   Hint

   Consider how common user errors affect the search results presented.