Hi Richard,
My application is basically just to take a text file as a command line
argument and run the spellchecker on it, showing an alert for each word
that is not found in the dictionary and giving the user some options.
After a bit of experimentation I concluded that one way to speed
On Wed, Jul 23, 2014 at 6:18 PM, Philip Bennefall
wrote:
> I have to amend my last message. The timings I just gave was for looking
> up that word 10 times, not 1. So the longest time I've seen would be about
> 150 ms. However, if you have a document with a few thousand
I have to amend my last message. The timings I just gave was for looking
up that word 10 times, not 1. So the longest time I've seen would be
about 150 ms. However, if you have a document with a few thousand words
we would still be looking at a significant total searching time. Is this
to be
Hi all,
I have been running some tests with spellfix using a table containing
about 30 words, extracted from the Moby project's single word list
as well as names and places. Moby can be found at:
http://icon.shef.ac.uk/Moby/
I have noticed that searching for medium length to very long
4 matches
Mail list logo