Beefy Boxes and Bandwidth Generously Provided by pair Networks
XP is just a number

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
in thread challenging 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

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://545167]
and a log crumbles through the grate...

How do I use this? | Other CB clients
Other Users?
Others having an uproarious good time at the Monastery: (9)
As of 2017-04-25 20:31 GMT
Find Nodes?
    Voting Booth?
    I'm a fool:

    Results (463 votes). Check out past polls.