Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things
 
PerlMonks  

Re^2: challanging the dictionary

by Limbic~Region (Chancellor)
on Oct 25, 2006 at 14:28 UTC ( #580584=note: print w/ replies, xml ) Need Help??


in reply to Re: challanging the dictionary
in thread challenging the dictionary

blokhead,
Good luck,...

Thanks, I am sure I will need a bit of that.

But with a huge dictionary, the running time is going to be intractable.

Well fortunately for humans, alphabets are relatively small and very long words that do not repeat letters are uncommon. The number of words that you need consider from a huge (~ 65K words) is quite manageable. See How many words does it take? for an example.

Cheers - L~R


Comment on Re^2: challanging the dictionary

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others contemplating the Monastery: (4)
As of 2014-08-21 06:37 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The best computer themed movie is:











    Results (127 votes), past polls