On Tue, 8 Oct 2002, alex wrote:
> so, in your particular example you could try a 26 dimensional space where
> each dimension is the frequency of a particular letter in the alphabet. if
This will fail for the same reason that this is a crappy hash algorithm.
All English sentences tend to have the same number of each letter (per
length).
S.
--
Shevek
I am the Borg.
sub AUTOLOAD{my$i=$AUTOLOAD;my$x=shift;$i=~s/^.*://;print"$x\n";eval
qq{*$AUTOLOAD=sub{my\$x=shift;return unless \$x%$i;&{$x}(\$x);};};}
foreach my $i (3..65535) { &{'2'}($i); }
