Jeff Kell ([log in to unmask]) wrote:
: 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.
 
Brings back memories...
 
I wrote such a routine in '73 or so, and might be able to find it (I'll
look).  It was in Burroughs ALGOL.  The algorithm was developed by
me, and Steve Cooper, and a friend or two.
 
It took into account transpositions, dropped characters, and near misses
(e.g.: q instead of w on the keyboard).
 
--
Stan Sieler
[log in to unmask]