[Haskell-cafe] Optimizing a title matcher

Bayley, Alistair Alistair_Bayley at invescoperpetual.co.uk
Fri Sep 29 03:42:10 EDT 2006

> From: haskell-cafe-bounces at haskell.org 
> [mailto:haskell-cafe-bounces at haskell.org] On Behalf Of Bulat Ziganshin
> Sent: 28 September 2006 17:29
> To: Lyle Kopnicky
> now i will work on edit-distance algorithm. i'm have an idea of
> checking the real distance between chars - as on my keyboard, so for
> example "sprry" can be mistake for "sorry", but not for "serry"

For English text, the Soundex algorithm (or one of its variations) might
do a good job of matching:


Google doesn't show any Haskell implementations yet.

Confidentiality Note: The information contained in this message,
and any attachments, may contain confidential and/or privileged
material. It is intended solely for the person(s) or entity to
which it is addressed. Any review, retransmission, dissemination,
or taking of any action in reliance upon this information by
persons or entities other than the intended recipient(s) is
prohibited. If you received this in error, please contact the
sender and delete the material from any computer.

More information about the Haskell-Cafe mailing list