Dp levenshtein distance

Recursively computing levenshtein distance takes approximately forever.  Doing it with dynamic programming takes approximately no time at all.

(More precisely, recursively was taking a minute for 17 characters.  DP takes about 0.1 seconds for 3500 characters.)