HP3000-L Archives

January 1995, Week 4

HP3000-L@RAVEN.UTC.EDU

Options: Use Monospaced Font
Show Text Part by Default
Show All Mail Headers

Message: [<< First] [< Prev] [Next >] [Last >>]
Topic: [<< First] [< Prev] [Next >] [Last >>]
Author: [<< First] [< Prev] [Next >] [Last >>]

Print Reply
Subject:
From:
Paul Carmody <[log in to unmask]>
Reply To:
Paul Carmody <[log in to unmask]>
Date:
Fri, 27 Jan 1995 17:03:08 GMT
Content-Type:
text/plain
Parts/Attachments:
text/plain (15 lines)
In article <[log in to unmask]>, Jeff Kell
<[log in to unmask]> says:
>
>Does anyone have, know of, or have source code for a "fuzzy" string
>match?  Not just a phonetic key (Soundex), but rather one which could
>tell you "how closely" two strings match?
>
>Ideally it would be "sort of" like a spelling checker, but extended to
>a string.  Simple transpositional errors (2 letters reversed), spelling,
>omitted substrings, etc., would be accounted for.
>
>[\] Jeff Kell, [log in to unmask]
 
You might try asking at comp.al.fuzzy.  Someone there should know.

ATOM RSS1 RSS2