Received: from keittlab.bio.sunysb.edu (keittlab.bio.sunysb.edu [129.49.19.70]) by postgresql.org (8.11.3/8.11.4) with ESMTP id f7BJteP82511 for ; Sat, 11 Aug 2001 15:55:40 -0400 (EDT) (envelope-from tklistaddr@keittlab.bio.sunysb.edu) Received: from keittlab-6.keittlab.bio.sunysb.edu ([192.168.1.6] helo=keittlab.bio.sunysb.edu ident=tkeitt) by keittlab.bio.sunysb.edu with esmtp (Exim 3.22 #1 (Debian)) id 15VerB-0006M5-00; Sat, 11 Aug 2001 15:55:37 -0400 Message-ID: <3B758DB9.7040106@keittlab.bio.sunysb.edu> Date: Sat, 11 Aug 2001 15:55:37 -0400 From: "Timothy H. Keitt" Organization: State University of New York at Stony Brook User-Agent: Mozilla/5.0 (X11; U; Linux 2.2.19-smp i686; en-US; rv:0.9.1) Gecko/20010615 X-Accept-Language: en-us MIME-Version: 1.0 To: Peter Eisentraut CC: Josh Berkus , pgsql-sql@postgresql.org Subject: Re: Re: Fuzzy matching? References: Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit X-Archive-Number: 200108/148 X-Sequence-Number: 4369 The Levenshtein-distance code I posted uses the agrep algorithm. Tim Peter Eisentraut wrote: >Josh Berkus writes: > >>For many of my programs, it would be extremely useful to have some form >>of "fuzzy matching" for VARCHAR fields. >> > >For lexical similarity, check out the agrep algorithm. Last I checked the >source code wasn't quite Free(tm), but the algorithm was published in an >academic work. > -- Timothy H. Keitt Department of Ecology and Evolution State University of New York at Stony Brook Stony Brook, New York 11794 USA Phone: 631-632-1101, FAX: 631-632-7626 http://life.bio.sunysb.edu/ee/keitt/