Newsgroups: comp.ai
Path: cantaloupe.srv.cs.cmu.edu!bb3.andrew.cmu.edu!nntp.sei.cmu.edu!news.psc.edu!hudson.lm.com!news.math.psu.edu!news.cac.psu.edu!newsserver.jvnc.net!newsserver2.jvnc.net!howland.reston.ans.net!EU.net!sun4nl!news.nic.surfnet.nl!spider.research.ptt.nl!usenet
From: M.J.A.M.vanGerwen@research.ptt.nl (Emile van Gerwen)
Subject: Re: Approximate string matching
Message-ID: <DG1FKv.23E@news.research.ptt.nl>
Sender: usenet@news.research.ptt.nl (USENET News System)
Nntp-Posting-Host: dl8147.research.ptt.nl
Organization: KPN Research, The Netherlands
X-Newsreader: WinVN 0.99.3
References: <KPM.95Oct4180021@netcom22.netcom.com>
Mime-Version: 1.0
Date: Fri, 6 Oct 1995 17:36:31 GMT
Lines: 31

In article <KPM.95Oct4180021@netcom22.netcom.com>, kpm@netcom.com says...
>
>I need an algorithm to approximately match character strings.
>Basically, given two input strings I want the algorithm to compute the
>maximum number of characters the two have in common while respecting
>the order of the characters in both strings.

Some references:

BYTE november 1992 p281 "Approximate Pattern Matching"

SIAM Vol22 april 1993 p243 "Approximate Boyer-Moore string matching"


Good luck!

Emile van Gerwen.





-------------------------------------------------------------------------
-
--  Emile van Gerwen             
--  KPN Research                            P.O.Box 421
--  Tel: +31-70-3326126                     2260 AK Leidschendam
--  Fax: +31-70-3326477                     The Netherlands
-------------------------------------------------------------------------
-

