In a similar line of thought as Corion's I would rather consider distance than similarity. You could use the square root of sum of square of the differences of entries in your list (a.k.a. Euklidean distance) and then call the ones similar that are close with respect to that measure of distance.
In reply to Re: Hashes: Find similar entries!
by hdb
in thread Hashes: Find similar entries!
by Trace On
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |