>A coworker wants me to build a routine that will search a dbf for duplicate addresses. A simple task if we were looking for an exact match. However he wants me to use "fuzzy" logic so that the match doesn't have to be exact, just "pretty close". I haven't a clue how to go about this. Is there a routine around that I could use as a sample to get started?
>Thanks

I have these links:

http://rumkin.com/reference/algorithms/fuzzy_strings/levenshtein.prg.txt

http://www.creativyst.com/Doc/Articles/SoundEx1/SoundEx1.htm

http://fox.wikis.com/wc.dll?Wiki~ImproveSoundex

http://fox.wikis.com/wc.dll?Wiki~MetaphoneImplementation-SoundexAlternative

http://fox.wikis.com/wc.dll?Wiki~DoubleMetaphone-SoundexAlternative