P is for Practical PerlMonks

### Re^2: challanging the dictionary

by Limbic~Region (Chancellor)
 on Apr 23, 2006 at 23:11 UTC ( #545167=note: print w/replies, xml ) Need Help??

in reply to Re: challanging the dictionary

This seems to be a relatively fast approximation algorithm (64K words in about 5 seconds):
```#!/usr/bin/perl
use strict;
use warnings;

my \$file = \$ARGV[0] || 'words.txt';
open(my \$fh, '<', \$file) or die "Unable to open '\$file' for reading: \$
+!";

my %freq;
while (<\$fh>) {
tr/a-z//cd;
++\$freq{\$_} for split //;
}

while (%freq) {
my (\$small) = sort {\$freq{\$a} <=> \$freq{\$b}} keys %freq;
seek \$fh, 0, 0;
my (\$max, \$word) = (-1, '');
while (<\$fh>) {
last if \$max == keys %freq;
next if index(\$_, \$small) == -1;
tr/a-z//cd;
my %uniq = map {\$_ => undef} split //;
delete \$uniq{\$small};
my \$cnt = grep defined \$freq{\$_}, keys %uniq;
(\$max, \$word) = (\$cnt, \$_) if \$cnt > \$max;
}
print "\$word\n";
delete @freq{split //, \$word};
}
__END__
photojournalism
quarterbacked
detoxifying
blowzier
aardvark

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

Create A New User
Node Status?
node history
Node Type: note [id://545167]
help
Chatterbox?
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others browsing the Monastery: (7)
As of 2018-04-24 17:15 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
My travels bear the most uncanny semblance to ...

Results (86 votes). Check out past polls.

Notices?