summaryrefslogtreecommitdiff
path: root/contrib/README
diff options
context:
space:
mode:
authorBruce Momjian <bruce@momjian.us>2001-08-07 16:47:43 +0000
committerBruce Momjian <bruce@momjian.us>2001-08-07 16:47:43 +0000
commitd8783c512e3c90c705ce61a225df39f962db9ab3 (patch)
tree2d086880b44cdb213de4c9f7553a689c5f7a5e31 /contrib/README
parent0bc291e03cbd0b46414288ea5c94ac5b5a8769fa (diff)
downloadpostgresql-d8783c512e3c90c705ce61a225df39f962db9ab3.tar.gz
Per this discussion, here's a patch to implement both levenshtein() and
metaphone() in a contrib. There seem to be a fair number of different approaches to both of these algorithms. I used the simplest case for levenshtein which has a cost of 1 for any character insertion, deletion, or substitution. For metaphone, I adapted the same code from CPAN that the PHP folks did. A couple of questions: 1. Does it make sense to fold the soundex contrib together with this one? 2. I was debating trying to add multibyte support to levenshtein (it would make no sense at all for metaphone), but a quick search through the contrib directory found no hits on the word MULTIBYTE. Should worry about adding multibyte support to levenshtein()? Joe Conway
Diffstat (limited to 'contrib/README')
-rw-r--r--contrib/README4
1 files changed, 4 insertions, 0 deletions
diff --git a/contrib/README b/contrib/README
index 2e071e2f83..5823520c0f 100644
--- a/contrib/README
+++ b/contrib/README
@@ -55,6 +55,10 @@ fulltextindex -
Full text indexing using triggers
by Maarten Boekhold <maartenb@dutepp0.et.tudelft.nl>
+fuzzystrmatch -
+ Levenshtein and Metaphone fuzzy string matching
+ by Joe Conway <joseph.conway@home.com>
+
intarray -
Index support for arrays of int4, using GiST
by Teodor Sigaev <teodor@stack.net> and Oleg Bartunov