Newsgroups: comp.lang.c++,comp.lang.c,comp.ai,comp.ai.fuzzy
Path: cantaloupe.srv.cs.cmu.edu!rochester!udel!gatech!howland.reston.ans.net!swrinde!cs.utexas.edu!news.cs.utah.edu!dog.ee.lbl.gov!newshub.nosc.mil!news!herman
From: herman@nosc.mil (John W. Herman)
Subject: Re: name matching algorithms
Message-ID: <1995Apr2.224524.17676@nosc.mil>
Sender: news@nosc.mil
Organization: NCCOSC RDT&E Division, San Diego, CA
References: <D67G8o.I44@unx.sas.com> <3let9m$lq1@news.cc.utah.edu>
Date: Sun, 2 Apr 1995 22:45:24 GMT
Lines: 10
Xref: glinda.oz.cs.cmu.edu comp.lang.c++:121188 comp.lang.c:134065 comp.ai:28748 comp.ai.fuzzy:4395

swillden@fcom.cc.utah.edu (Shawn Willden) writes:

>Warren Sarle (saswss@hotellng.unx.sas.com) wrote:
>:    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.

>This may be a very good book, but it's out of print.  Any other ideas?

You might ask archie about agrep.  It does approximate greps.
