Newsgroups: comp.ai.fuzzy
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news4.ner.bbnplanet.net!cam-news-hub1.bbnplanet.com!howland.erols.net!newsfeed.internetmci.com!guitar.sound.net!news.sprintlink.net!news-chi-13.sprintlink.net!interpath!news.interpath.net!sas!newshost.unx.sas.com!saswss
From: saswss@hotellng.unx.sas.com (Warren Sarle)
Subject: Re: Fuzzy Matching
Originator: saswss@hotellng.unx.sas.com
Sender: news@unx.sas.com (Noter of Newsworthy Events)
Message-ID: <DwI8rq.636@unx.sas.com>
Date: Wed, 21 Aug 1996 20:26:14 GMT
X-Nntp-Posting-Host: hotellng.unx.sas.com
References:  <4vd5r1$7li@ict.cec.uchile.cl>
Organization: SAS Institute Inc.
Keywords: fuzzy match
Lines: 25


In article <4vd5r1$7li@ict.cec.uchile.cl>, lbrahm@cipres.cec.uchile.cl writes:
|> I'm looking for a basic fuzzy algorith to match patterns.
|> ... So an object can be represented by a string 
|> like :
|>     AAcBaCA 
|> But maybe there was an error finding the primitives and the resulting 
|> primitives are 
|>     AAcbacA 
|> 
|> so I need to compare these two strings and find out how similar (from 0 to 
|> 100%) they are.

This has nothing to do with fuzzy logic. The classic reference on
string comparison is:

   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.
