>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

Took me a while to find this article because I originally didn't remember the author's name correctly. Once I remembered it, I found it right away

http://portal.dfpug.de/dFPUG/Dokumente/FoxTalk/FoxTalk1999/FT19995_5.PDF

It's an article by Andrew Coates. May be you will be able to find his blog.