| Edit distance |
- Also known as Levenshtein distance
|
- Used for words and strings
|
- Minimum number of edit operations required to transform word
 to word 
|
- Edit operations on characters are
|
| |
|
| |
|
| |
|
- Insertions and deletions can be treated as substitutions using gap
|
- Example: each edit operation costs 1
|
|
idea
deal |
idea-
-deal |
|
|
|
