Teodor Sigaev writes:
>> Why does the phrase distance operator assume <1> means adjacent words,
>> and not <0>. (FYI, <-> is the same as <1>.)
> Because
> 1 it is a result of subtruction of word's positions
> 2 <0> could be used as special case like a word with two
On Fri, Sep 23, 2016 at 05:07:26PM +0300, Teodor Sigaev wrote:
> >Sorry to be asking another phrase search syntax question, and so close
> >to final release, but ...
> Really close...
> >
> >Why does the phrase distance operator assume <1> means adjacent words,
> >and not <0>. (FYI, <-> is the
Sorry to be asking another phrase search syntax question, and so close
to final release, but ...
Really close...
Why does the phrase distance operator assume <1> means adjacent words,
and not <0>. (FYI, <-> is the same as <1>.)
Because
1 it is a result of subtruction of word's positions
2
Sorry to be asking another phrase search syntax question, and so close
to final release, but ...
Why does the phrase distance operator assume <1> means adjacent words,
and not <0>. (FYI, <-> is the same as <1>.)
For example:
select to_tsvector('park a a house') @@ to_tsquery('park <3>
On Tue, Aug 9, 2016 at 3:35 PM, David G. Johnston
wrote:
> I don't follow why LposStart is needed so I removed it...
That doesn't seem very reasonable.
> Not compiled or in any way tested...
Please do not bother submitting patches that you aren't prepared to
compile
Hackers,
The attached attempts to make comprehension of the code in
"TS_phrase_execute" a bit easier. I posted similar on the "typo patch"
thread of July 2nd/5th but my comments there reflected my mis-understanding
of the distance operator being exact as opposed to the expected
Hi,
I saw the slides at:
http://www.sai.msu.su/~megera/postgres/talks/2009.pdf
describing the phrase search algebra for the proposed tsquery $
operator, and the wiki at:
http://www.sai.msu.su/~megera/wiki/2009-08-12
Has there been progress on this front? Has the patch
phrase_search-0.7.gz
1. What is the meaning of such a query operator?
foo #5 bar - true if the document has word foo followed by bar at
5th position.
foo #5 bar - true if document has word foo followed by bar with in
5 positions
foo #5 bar - true if document has word foo followed by bar after 5
positions
Sounds
Sushant,
the problem of phrase search not in implementation, but in the theoretical
basis. tsearch is query rich and phrase search should support all query
operations, so we need algebra for query operations. We need more time
to investigate this problem, but just have no spare time for this.
If
I looked at query operators for tsquery and here are some of the new
query operators for position based queries. I am just proposing some
changes and the questions I have.
1. What is the meaning of such a query operator?
foo #5 bar - true if the document has word foo followed by bar at
5th
I can add index support and support for arbitrary distance between
lexeme.
It appears to me that supporting arbitrary boolean expression will be
complicated. Can we pull out something from TSQuery?
I don't very like an idea to have separated interface for phrase search. Your
patch may be a
This is far more complicated than I thought.
Of course, phrase search should be able to use indexes.
I can probably look into how to use index. Any pointers on this?
src/backend/utils/adt/tsginidx.c, if you invent operation # in tsquery then you
will have index support with minimal effort.
On Tue, 2008-06-03 at 22:16 +0400, Teodor Sigaev wrote:
This is far more complicated than I thought.
Of course, phrase search should be able to use indexes.
I can probably look into how to use index. Any pointers on this?
src/backend/utils/adt/tsginidx.c, if you invent operation # in
I have attached a patch for phrase search with respect to the cvs head.
Basically it takes a a phrase (text) and a TSVector. It checks if the
relative positions of lexeme in the phrase are same as in their
positions in TSVector.
Ideally, phrase search should be implemented as new operator in
On Mon, 2008-06-02 at 19:39 +0400, Teodor Sigaev wrote:
I have attached a patch for phrase search with respect to the cvs head.
Basically it takes a a phrase (text) and a TSVector. It checks if the
relative positions of lexeme in the phrase are same as in their
positions in TSVector.
I have attached a patch for phrase search with respect to the cvs head.
Basically it takes a a phrase (text) and a TSVector. It checks if the
relative positions of lexeme in the phrase are same as in their
positions in TSVector.
If the configuration for text search is simple, then this will
16 matches
Mail list logo