Newsgroups: comp.ai
Path: cantaloupe.srv.cs.cmu.edu!bb3.andrew.cmu.edu!newsfeed.pitt.edu!gatech!news.mathworks.com!newsfeed.internetmci.com!anasaz!usenet
From: daves@anasazi.com (Dave Spence)
Subject: Re: String pattern searching and comparison
Content-Type: Text/Plain; charset=US-ASCII
Message-ID: <DwK5rx.A34@anasazi.com>
Followup-To: algorithm for string comp simular
Sender: usenet@anasazi.com (News System)
Organization: Anasazi Inc.
X-Newsreader: WinVN 0.99.6
References: <4vgicq$phf@dsk92.itg.ti.com>
Mime-Version: 1.0
Date: Thu, 22 Aug 1996 21:16:34 GMT
Lines: 31

In article <4vgicq$phf@dsk92.itg.ti.com>, joel@dskd3.itg.ti.com says...
>
>I am not sure whether or not this question belongs in this group; if it 
>does not, please let me know.
>
>I am trying to find some algorithms that can aid in pattern searching and
>string comparisons. Specifically, given two strings "a" and "b", I would
>like to be able to go through an algorithm and be able to tell by a "score"
>how much string "a" looks like "b".
>
>For example:
>
>   a = "123456";
>   b = "123556";
>
>I would like an algorithm that could tell me that a and b look alike -
>probably the product of a typo.
>
>If anyone know of any sources for such information, please let me know.
>
>Thanks,
>
>Joel


Joel   you might want to use an effective text tool like AWK. ( available in 
DOS as well as unix).  simply compareing the strings in a file with a string 
parse command, maintaining order and counting the number of differences between 
the compare string and the next string in the set.  Be creative and give it a 
try.

