Re: fts, compond words?

As Teodor already pointed there is no non-ambiguous solution, or
at least, we don't know it.

Oleg

On Wed, 7 Dec 2005, Andrew J. Kopciuch wrote:

>>> A & (B | (New OperatorTheNextWordMustFollow York))
>>
>
> I had thought about this before myself. Alas I have never had the time to
> properly investigate implementing such a feature.
>
> :(
>
> A & (B | (New + York))
>
> Something like that?
>
>> Actually, I love that idea. Oleg, would it be possible to create a
>> tsquery operator that understands proximity? Or, how allowing a
>> predicate to the current '&' op, as in '&[dist<=1]' meaning "next
>> token follows with a max distance of 1". I imagine that it would
>> only be useful on unstripped tsvectors, but if the lexem position is
>> already stored ...
>>
>
> Would the proximity go in both directions? Or just forward? What about tokens
> that come before? Just a thought.
>
>
>
> Andy
>
> ---------------------------(end of broadcast)---------------------------
> TIP 4: Have you searched our list archives?
>
> http://archives.postgresql.org
>

Regards,
Oleg
_____________________________________________________________
Oleg Bartunov, Research Scientist, Head of AstroNet (www.astronet.ru),
Sternberg Astronomical Institute, Moscow University, Russia
Internet: oleg(at)sai(dot)msu(dot)su, http://www.sai.msu.su/~megera/
phone: +007(495)939-16-83, +007(495)939-23-83