reesesWeb

Part of another toy emacs project required a string similarity calculation. I was lazy and didn't want to learn any new ones, so I picked Levenshtein, which is probably like saying,"I needed to sort some stuff, but all I know is quicksort, so I used that." That is, it's good enough for the vast majority of cases, and better than most algorithms in many cases.

Anyway, if you have a need, you can grab it here, or from my software page.

Bookmark/Search this post with:

delicious | digg | reddit | technorati