Matching algorithms

[Toby Corkindale]

On Mon, Jun 23, 2008 at 09:03:42AM +0300, Yuval Kogman wrote:
[snip useful stuff]
> Another way to do a related form matching is using bloom filters (see
> http://en.wikipedia.org/wiki/Bloom_filter for a detailed
> explanation), which is a similar approach that can be either more or
> less efficient depending on the type of data you are dealing with.
> There are several implementations of bloom filters on the CPAN.
> Bloom filters are like a hash where false positives are allowed, but
> false negatives aren't, and you can control the accuracy. It might
> be efficient to use bloom filters for the elements instead of
> hashes.

Aaah I knew I had seen something like Bloom filters before.
Thanks for that, and the Nilsima hash; both look useful.

Cheers,
Toby