From: Ned Konz <ned@...>
Date: 2002-06-07T01:10:00+09:00
Subject: Re: Hashes sensitive to simularity

On Thursday 06 June 2002 08:51 am, Thomas Hurst wrote:
> I'm after something like nilsimsa[1]; a hashing algorithm that
> allow you to determine how similar two strings are.  Ideally
> similar strings would have identical hashes so it's a simple hash
> lookup, otherwise I might have to do some work, and we can't have
> that ;)
>
> Before I try to make use of nilsimsa, can anyone point out similar
> algorithms that might be of use, especially if they're already
> available as Ruby modules :)
>
>
Perhaps Levenshtein distance?
http://www.merriampark.com/ld.htm

-- 
Ned Konz
http://bike-nomad.com
GPG key ID: BEEA7EFE