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

comment on

( [id://3333]=superdoc: print w/replies, xml ) Need Help??
And here's a sub version that I've actually been using for testing, using the test data code you posted. It finds 3-at-once in under 6 seconds and 4-at-once in under 11.5 seconds on my laptop, using the supplied test data.
sub countcomb { my $nwordsatonce = shift; my ($k,$v); my %totals = (); local $" = ' '; # just in case while (($k,$v) = each %Items) { next unless $nwordsatonce <= @$v; do {$totals{"@$_"} += 1;} for combine($nwordsatonce,sort @$v); } my @comb = sort {$totals{$b} <=> $totals{$a} or $a cmp $b} keys %tot +als; my $topn = 5; my $toptot = $totals{$comb[$topn-1]}; while ($toptot <= $totals{$comb[$topn]}) {$topn++;} print "Top $nwordsatonce - word combinations: (cuttoff $toptot)\n"; do {print "$_ ($totals{$_})\n";} for @comb[0..$topn-1]; }
Unfortunately, it does have a tendency to die of out-of-memory errors if you up either the number of keywords or the average length of a set, and tieing %totals to a db file doesn't seem to prevent it, so there must be some other sort of memory leak going on. (I suppose that it could also be the sort exploding, but working around that should be relatively straightforward)
-- @/=map{[/./g]}qw/.h_nJ Xapou cets krht ele_ r_ra/; map{y/X_/\n /;print}map{pop@$_}@/for@/

In reply to Re^2: algorithm for 'best subsets' by fizbin
in thread algorithm for 'best subsets' by halley

Title:
Use:  <p> text here (a paragraph) </p>
and:  <code> code here </code>
to format your post; it's "PerlMonks-approved HTML":



  • Are you posting in the right place? Check out Where do I post X? to know for sure.
  • Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
    <code> <a> <b> <big> <blockquote> <br /> <dd> <dl> <dt> <em> <font> <h1> <h2> <h3> <h4> <h5> <h6> <hr /> <i> <li> <nbsp> <ol> <p> <small> <strike> <strong> <sub> <sup> <table> <td> <th> <tr> <tt> <u> <ul>
  • Snippets of code should be wrapped in <code> tags not <pre> tags. In fact, <pre> tags should generally be avoided. If they must be used, extreme care should be taken to ensure that their contents do not have long lines (<70 chars), in order to prevent horizontal scrolling (and possible janitor intervention).
  • Want more info? How to link or How to display code and escape characters are good places to start.
Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others browsing the Monastery: (3)
As of 2024-04-20 01:35 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found