| From: | "Timothy H(dot) Keitt" <tklistaddr(at)keittlab(dot)bio(dot)sunysb(dot)edu> |
|---|---|
| To: | Peter Eisentraut <peter_e(at)gmx(dot)net> |
| Cc: | Josh Berkus <josh(at)agliodbs(dot)com>, pgsql-sql(at)postgresql(dot)org |
| Subject: | Re: Re: Fuzzy matching? |
| Date: | 2001-08-11 19:55:37 |
| Message-ID: | 3B758DB9.7040106@keittlab.bio.sunysb.edu |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-patches pgsql-sql |
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/
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Tom Lane | 2001-08-11 20:35:14 | Re: Select parser at runtime |
| Previous Message | Ian Lance Taylor | 2001-08-11 17:01:58 | Re: Select parser at runtime |
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Robert J. Sanford, Jr. | 2001-08-12 03:49:19 | how do i... |
| Previous Message | Allan Engelhardt | 2001-08-10 22:56:48 | Small parser bug? |