Edit distance (Levenshtein)

How many changes turn one word into another?

Every cell is computed once, from three neighbours that are already done.


Optimal binary search tree

Put the words that are searched most often near the top.