My first FLL
A couple of years ago, I was excited when Bob Calco posted an implementation of the Levenshtein distance to the ProFox list. It’s an algorithm that calculates how many characters you have to change to get from one string to another — very useful for catching minor typos. The only problem is that it’s pretty slow.
So, over the weekend, I created my first FLL to calculate the Levenshtein distance. Using Visual C++ Express, some very useful tips from Tek-Tips, and an implementation from the Free Software Foundation, I was able to cobble it together. I’ll be posting it pretty soon: I just need to clean it up a bit first.
Posted by Garrett on November 19th, 2007 in Programming, VFP | 1 Comment
