![]() |
|
Think about Loose Coupling | |
PerlMonks |
Re^2: challanging the dictionaryby Limbic~Region (Chancellor) |
on Apr 23, 2006 at 23:11 UTC ( #545167=note: print w/replies, xml ) | Need Help?? |
blokhead,
This seems to be a relatively fast approximation algorithm (64K words in about 5 seconds):
The algorithm is quite simple. Start with the rarest letter and look for words containing that letter that have the most unique letters not found so far. Wash-Rinse-Repeat. Cheers - L~R
In Section
Seekers of Perl Wisdom
|
|