>Anybody know if a 'Fuzzy Search' can be done in Foxpro.

It might mean checking the Levenshtein distance, which is how many character changes it would take to turn one string into another.
http://fox.wikis.com/wc.dll?Wiki~LevenshteinAlgorithm~VFP

FuzzyMatch("Kitten", "Sitting") = 3 (K=>S, e=>i, +g)

I did a blog post documenting my building an FLL to do this at least an order of magnitude faster than Fox code:
http://blog.donnael.com/2008/04/creating-an-fll/