Newsgroups: comp.lang.c++,comp.lang.c,comp.ai,comp.ai.fuzzy
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!news.mathworks.com!news.ultranet.com!news.sprintlink.net!redstone.interpath.net!sas!mozart.unx.sas.com!saswss
From: saswss@hotellng.unx.sas.com (Warren Sarle)
Subject: Re: name matching algorithms
Originator: saswss@hotellng.unx.sas.com
Sender: news@unx.sas.com (Noter of Newsworthy Events)
Message-ID: <D67G8o.I44@unx.sas.com>
Date: Wed, 29 Mar 1995 14:00:24 GMT
X-Nntp-Posting-Host: hotellng.unx.sas.com
References:  <3la79m$d39@interport.net>
Organization: SAS Institute Inc.
Lines: 24
Xref: glinda.oz.cs.cmu.edu comp.lang.c++:120301 comp.lang.c:133384 comp.ai:28606 comp.ai.fuzzy:4335


In article <3la79m$d39@interport.net>, raiff@interport.net (Jonathan Raiff) writes:
|> Hi.  I need to implement a set of routines that will allow me to compare two
|> names (or more generically, alphanumeric strings) for "equality".  These names
|> are based on hand entered data, so there will be an assortment of differences
|> between two names that are really the same.
|>
|> For instance, "Jonathan Raiff" and "Jonathan Riaff" and "Jonathan Raif" when
|> compared using strcmp() would not find these strings identical.  I am looking
|> for some routines that will allow me to selectively set the tolerance for
|> "sameness" and then test for it.
|>
|> If anyone has done some work in this area, or better yet has code they are
|> willing to share, please e-mail me.  Thanks...

   Sankoff, D. and Kruskal, J.B. (1983) _Time Warps, String Edits,
   And Macromolecules: The Theory And Practice of Sequence Comparison_,
   Reading, MA: Addison-Wesley, ISBN 0-201-07809-0.

-- 

Warren S. Sarle       SAS Institute Inc.   The opinions expressed here
saswss@unx.sas.com    SAS Campus Drive     are mine and not necessarily
(919) 677-8000        Cary, NC 27513, USA  those of SAS Institute.
