Hi Craig,
Thanks for the FLL code which is incredibly fast on long strings. I failed to mention (my bad) in my original post that the strings I'm trimming are word sized chunks. In this case, the VFP code you posted on Profox provides the fastest solution.
Hopefully all this code will make it back to your open source VFP spellchecker project.
If you're following this thread, check out Craig's free open source VFP spellchecker project and get involved! Version 1.0 rocks!
http://www.sweetpotatosoftware.com/SPSBlog/PermaLink,guid,8800bdb9-a9c2-484f-942f-6a08947d903a.aspxMalcolm
