Akemashite omedetou gozaimasu!
Glueckliches neues Jahr!
A happy new year!

In message "[ruby-talk:8413] Re: speedup of anagram finder"
    on 00/12/31, David Alan Black <dblack / candle.superlink.net> writes:

>So.... I think for general anagram-finding, the unpack one is still
>the one to beat.  (Of course, it is not impossible that one would want
>to find anagrams of 5-letter words.  My first Ruby program of any size
>was a Jotto implementation.  Maybe it's time to have another look at
>that :-)

Thank you for interesting measurements.  Looking that, I'm feeling
difficulty of the average cost analysis in pragmatic sense.  As Guy
said [ruby-talk:8414], we should consider about also frequency of GC.

I've counted the distribution of word length in /usr/share/dict/words.
It looks like a non-sharp version of Poisson.  By your measurement,
pack may well be faster than Shultz-Goedel-Abel index :-) roughly
because the average length is 9.585, where pack is faster.

-- Gotoken

  len #occur
 ------------
    1     52
    2    155
    3   1351
    4   5110
    5   9989
    6  17478
    7  23736
    8  29926
    9  32382
   10  30867
   11  26012
   12  20461
   13  14937
   14   9763
   15   5924
   16   3377
   17   1813
   18    842
   19    428
   20    198
   21     82
   22     41
   23     17
   24      5