| From: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
|---|---|
| To: | Steven Marcus <steven(at)silvertrak(dot)com(dot)au> |
| Cc: | pgsql-novice(at)postgresql(dot)org |
| Subject: | Re: relaxed full text search? |
| Date: | 2016-02-05 03:50:48 |
| Message-ID: | 17780.1454644248@sss.pgh.pa.us |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-novice |
Steven Marcus <steven(at)silvertrak(dot)com(dot)au> writes:
> My first implementation of full text search is generally working -- but I'd
> like to be able to relax the matching rules.
> For example, searching for "salmon" does not find "salmonella" as
> configured out of the box for postgresql 9.3.10.
Hm, well, I don't think most people would think those were the same
word...
You can get that type of result by searching for "salmon:*", but if your
idea of "match" is "prefix string match" then I wonder whether you want
the FTS machinery at all. There are other ways to get that behavior with
less overhead.
regards, tom lane
| From | Date | Subject | |
|---|---|---|---|
| Next Message | bradg | 2016-02-06 17:42:28 | Xcode compile error with postgres.h and pg_type.h |
| Previous Message | Steven Marcus | 2016-02-05 03:35:22 | Re: relaxed full text search? |