blokhead,
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.
Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
Read Where should I post X? if you're not absolutely sure you're posting in the right place.
Please read these before you post! —
Posts may use any of the Perl Monks Approved HTML tags:
- a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
Outside of code tags, you may need to use entities for some characters:
| |
For: |
|
Use: |
| & | | & |
| < | | < |
| > | | > |
| [ | | [ |
| ] | | ] |
Link using PerlMonks shortcuts! What shortcuts can I use for linking?
See Writeup Formatting Tips and other pages linked from there for more info.
|
|