### shivwits paiute legends

**Edit**

**Distance**. As one might guess from our example (E1), computing

**edit**

**distance**involves a nontrivial algorithm. We have to somehow figure out the fewest number of operations that are needed to transform one string to the other. The

**Levenshtein**algorithm uses an algorithmic technique called dynamic programming. Let's illustrate the.