Beefy Boxes and Bandwidth Generously Provided by pair Networks
"be consistent"
 
PerlMonks  

Re: Re: Re: Spell Check Logic

by dree (Monsignor)
on Jul 31, 2002 at 21:31 UTC ( #186608=note: print w/replies, xml ) Need Help??


in reply to Re: Re: Spell Check Logic
in thread Spell Check Logic

You are right! :)

But an hash (DB_File) with 2/3 millions words+phonetic codes is around 150+Mb.
So to gain some speed-up you have to twice the database: one that has keys as phonetic codes and the second that has keys as correct words.
And this is not always a good thing.

But in this particulary case, with only 100.000+ words, your suggestion is ok :)

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://186608]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others musing on the Monastery: (4)
As of 2019-04-26 05:40 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    I am most likely to install a new module from CPAN if:
















    Results (128 votes). Check out past polls.

    Notices?
    • (Sep 10, 2018 at 22:53 UTC) Welcome new users!