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!howland.reston.ans.net!news.sprintlink.net!EU.net!CERN.ch!mxsld2.pd.infn.it!LORETI
From: loreti@mxsld2.pd.infn.it (Maurizio Loreti)
Subject: Re: name matching algorithms
X-Nntp-Posting-Host: mxsld2.pd.infn.it
Message-ID: <D693xC.8uH@news.cern.ch>
Sender: news@news.cern.ch (USENET News System)
Reply-To: loreti@mxsld2.pd.infn.it
Organization: I.N.F.N. Padova - CDF/CMS VAXcluster
References: <3la79m$d39@interport.net>,<3ldr13$lao@nyx10.cs.du.edu>
Date: Thu, 30 Mar 1995 12:29:35 GMT
Lines: 18
Xref: glinda.oz.cs.cmu.edu comp.lang.c++:120489 comp.lang.c:133543 comp.ai:28645 comp.ai.fuzzy:4350

In article <3ldr13$lao@nyx10.cs.du.edu>, fburton@nyx10.cs.du.edu (Francis Burton) writes:
>In article <3la79m$d39@interport.net>,
>Jonathan Raiff <raiff@interport.net> wrote:
>>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.
>
>If you want a phonetic match solution (rather than an edit distance
>solution or some other) you might do an archie search for "soundex".
>
>Francis

If you want to allow some mismatch, try an archie search for 'agrep'. 
Comes with source; portable; maybe from the FSF.

Maurizio Loreti                       http://mvxpd5.pd.infn.it/wwwcdf/mlo.html
Un. of Padova, Dept. of Physics - Padova, Italy          loreti@padova.infn.it
