That a simple case, what about languages as norwegian or german? They
has compound words and ispell dictionary can split them to lexemes.
But, usialy there is more than one variant of separation:
forbruksvaremerkelov
forbruk vare merke lov
forbruk vare merkelov
forbruk varemerke lov
On 12/12/05, Marcus Engene [EMAIL PROTECTED] wrote:
That a simple case, what about languages as norwegian or german? They
has compound words and ispell dictionary can split them to lexemes.
But, usialy there is more than one variant of separation:
forbruksvaremerkelov
forbruk
hrm... that is a problem. Though, I think that's a case of how the
compiled expression is built from user input. Unless I'm mistaken
a + ( foo1 | foo2 )
is exactly equal to
(a + foo1) | (a + foo2)
Ahhh... but then there is the more complex example of
a + foonish + bar
becoming
a
On 12/8/05, Teodor Sigaev [EMAIL PROTECTED] wrote:
(a + foo1 + bar) | (a + foo2 + bar)
That a simple case, what about languages as norwegian or german? They has
compound words and ispell dictionary can split them to lexemes. But, usialy
there is more than one variant of separation:
On 12/6/05, Marcus Engene [EMAIL PROTECTED] wrote:
[snip]
A (B | (New OperatorTheNextWordMustFollow York))
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]'
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
That is a long discussed thing. We can't formulate unconflicting rules... For
example:
1) a [dist=2] ( b [dist=3] c )
2) a [dist=2] ( b |[dist=3] c )
3) a [dist=2] !c
4) a [dist=2] ( b |[dist=3] !c )
5) a [dist=2] ( b c )
What does exact they mean? What is tsvectors which should be
On 12/7/05, Teodor Sigaev [EMAIL PROTECTED] wrote:
That is a long discussed thing. We can't formulate unconflicting rules... For
example:
1) a [dist=2] ( b [dist=3] c )
2) a [dist=2] ( b |[dist=3] c )
3) a [dist=2] !c
4) a [dist=2] ( b |[dist=3] !c )
5) a [dist=2] ( b c )
What
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
Mike Rylander wrote:
Mike Rylander wrote:
On 12/6/05, Marcus Engene [EMAIL PROTECTED] wrote:
[snip]
A (B | (New OperatorTheNextWordMustFollow York))
Actually, I love that idea. Oleg, would it be possible to create a
tsquery operator that understands proximity?
Hi,
I use the tsearch full text search with pg 8.0.3. It works great, but I
wonder if it's possible to search for compound words?
Ie if I search for New York i want to get a match on
New York has traffic problems.
but not on
New axe murderer incident in brittish York.
Is this possible?
I
On Mon, 5 Dec 2005, Marcus Engene wrote:
Hi,
I use the tsearch full text search with pg 8.0.3. It works great, but I
wonder if it's possible to search for compound words?
Ie if I search for New York i want to get a match on
New York has traffic problems.
but not on
New axe murderer
Oleg Bartunov wrote:
On Mon, 5 Dec 2005, Marcus Engene wrote:
Hi,
I use the tsearch full text search with pg 8.0.3. It works great, but
I wonder if it's possible to search for compound words?
Ie if I search for New York i want to get a match on
New York has traffic problems.
but not on
On 12/5/05, Marcus Engene [EMAIL PROTECTED] wrote:
Oleg Bartunov wrote:
On Mon, 5 Dec 2005, Marcus Engene wrote:
Hi,
I use the tsearch full text search with pg 8.0.3. It works great, but
I wonder if it's possible to search for compound words?
Ie if I search for New York i want to
On Mon, 5 Dec 2005, Marcus Engene wrote:
I realized from the documentation that I'm not looking for
compound words after all, I meant exact phrase.
I can't see how to make rank tell me which results has an
exact phrase? Like there must be a occurence of 'new' before
'york' (stemmed not
15 matches
Mail list logo
