Newsgroups: comp.ai.fuzzy,comp.ai.nat-lang
Path: cantaloupe.srv.cs.cmu.edu!rochester!udel!delmarva.com!newsfeed.internetmci.com!howland.reston.ans.net!ix.netcom.com!netcom.com!netcom22!kpm
From: kpm@netcom.com (Keith Morgan)
Subject: Approximate string matching
Message-ID: <KPM.95Oct4175438@netcom22.netcom.com>
Sender: kpm@netcom22.netcom.com
Organization: NETCOM On-line services
Date: Thu, 5 Oct 1995 00:54:38 GMT
Lines: 17
Xref: glinda.oz.cs.cmu.edu comp.ai.fuzzy:5752 comp.ai.nat-lang:3955

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. For example,

bar <-> foobar = 3
foo <-> bar = 0
jean's gip joint <-> jip = 2
moargan <-> maohren = 4

Does anyone have have any references for decent algorithms to do this, or
even better (ahem!), a pointer to some code? Thanks for any help.

--
Keith Morgan | kpm@netcom.com
-- 
Keith Morgan | kpm@netcom.com
