Florian Weimer [EMAIL PROTECTED] writes:
http://citeseer.ist.psu.edu/1593.html suggests that this uninteresting
(too much of the database is examined) once you go past an edit distance
of 1. I don't know if this is a problem in your case (it is in mine).
Did you see the test results in
Hi,
In an address search framework of a company, we need to deal with
queries including potential spelling errors. After some external
address space constraints (e.g. match first letters, word length,
etc.) we're still ending up with a huge data set to filter through
Levenshtein like distance
* Volkan YAZICI:
[1] Some approaches to best-match file searching
http://portal.acm.org/citation.cfm?id=362003.362025
http://citeseer.ist.psu.edu/1593.html suggests that this uninteresting
(too much of the database is examined) once you go past an edit distance
of 1. I don't know if this
Have you seen contrib/pg_trgm module ?
Oleg
On Sun, 28 Oct 2007, Volkan YAZICI wrote:
Hi,
In an address search framework of a company, we need to deal with
queries including potential spelling errors. After some external
address space constraints (e.g. match first letters, word length,
etc.)
