Well, it occurs to me that searching in a VFP table, containing valid words, would be very fast in comparison.
The real challenge, of course, would be to get a list of words.
Normally, Word does the spell-checking gradually, in the background, while you type - so you don't really notice the slowness.
Also: Word, and the Word spell-checer, include a lot of features which you don't really need, if all you want is to simply return words that are not in the dictionary.
>I have this code for returning each individual word that contain errors:
>
>
>* Assign the text to the document and check spelling
>loDocument.Content.Text='The long bridge faiiled in the middle. Then, Michel Fournier '+;
> 'came in and sayd, who are you? Rorlf Bingo! They were winning the billa game.'
>
>lnCount=loDocument.SpellingErrors.Count
>IF lnCount>0
> loErrors=loDocument.SpellingErrors
> FOR EACH loError IN loErrors
> ? loError.Text
> ENDFOR
>ENDIF
>
>
>But, this is extremely slow. There is about .25 second between each word that is being displayed. Is there a way to accelerate that? I thought I would get the list of words in a flash.
Difference in opinions hath cost many millions of lives: for instance, whether flesh be bread, or bread be flesh; whether whistling be a vice or a virtue; whether it be better to kiss a post, or throw it into the fire... (from Gulliver's Travels)