Re: Tsearch2 lexeme position

Started by Peter Schmelzerabout 21 years ago3 messagesgeneral
Jump to latest
#1Peter Schmelzer
peter.schmelzer@desian.de

Hi,

this is an answer of thread
http://archives.postgresql.org/pgsql-general/2003-08/msg00694.php

You say it exist a funktion to fin positions an frequency of lexems for
own calculate of an ranking since this time.
But where is the description of this?
May Im to blind but I spend a lot of time to search in internet for this.

http://www.sai.msu.su/~megera/postgres/gist/tsearch/V2/docs/tsearch-V2-intro.html
http://www.sai.msu.su/~megera/postgres/gist/tsearch/V2/docs/tsearch2-guide.html
http://www.sai.msu.su/~megera/postgres/gist/tsearch/V2/docs/tsearch2-ref.html
has to less examples to see it.
May it is'nt in?..

I need it to serch terms with more than one lexem and later for an
ranking for nearst lexems.

greeds
Peter Schmelzer

#2Oleg Bartunov
oleg@sai.msu.su
In reply to: Peter Schmelzer (#1)

On Thu, 12 May 2005, Peter Schmelzer wrote:

Hi,

this is an answer of thread
http://archives.postgresql.org/pgsql-general/2003-08/msg00694.php

You say it exist a funktion to fin positions an frequency of lexems for own
calculate of an ranking since this time.
But where is the description of this?
May Im to blind but I spend a lot of time to search in internet for this.

http://www.sai.msu.su/~megera/postgres/gist/tsearch/V2/docs/tsearch-V2-intro.html
http://www.sai.msu.su/~megera/postgres/gist/tsearch/V2/docs/tsearch2-guide.html
http://www.sai.msu.su/~megera/postgres/gist/tsearch/V2/docs/tsearch2-ref.html
has to less examples to see it.
May it is'nt in?..

I need it to serch terms with more than one lexem and later for an ranking
for nearst lexems.

ranking functions is already aware of this. See tsearch2.sql in
contrib/tsearch2/sql for examples. We don't have API to specify your own
ranking function. Do you really need it ?

greeds
Peter Schmelzer

---------------------------(end of broadcast)---------------------------
TIP 8: explain analyze is your friend

Regards,
Oleg
_____________________________________________________________
Oleg Bartunov, sci.researcher, hostmaster of AstroNet,
Sternberg Astronomical Institute, Moscow University (Russia)
Internet: oleg@sai.msu.su, http://www.sai.msu.su/~megera/
phone: +007(095)939-16-83, +007(095)939-23-83

#3Peter Schmelzer
peter.schmelzer@desian.de
In reply to: Oleg Bartunov (#2)

Hello Oleg Bartunov,

Oleg Bartunov schrieb:

On Thu, 12 May 2005, Peter Schmelzer wrote:

Hi,

this is an answer of thread

http://archives.postgresql.org/pgsql-general/2003-08/msg00694.php

You say it exist a funktion to fin positions an frequency of lexems

for own calculate of an ranking since this time.

But where is the description of this?
May Im to blind but I spend a lot of time to search in internet for

this.

http://www.sai.msu.su/~megera/postgres/gist/tsearch/V2/docs/tsearch-V2-intro.html

http://www.sai.msu.su/~megera/postgres/gist/tsearch/V2/docs/tsearch2-guide.html

http://www.sai.msu.su/~megera/postgres/gist/tsearch/V2/docs/tsearch2-ref.html

has to less examples to see it.
May it is'nt in?..

I need it to serch terms with more than one lexem and later for an

ranking for nearst lexems.

ranking functions is already aware of this. See tsearch2.sql in

contrib/tsearch2/sql for examples. We don't have API to specify your own

ranking function. Do you really need it ?

Yes, i do. Me is given a real komplicatet concept for an ranking.
I dont need only a ranking for one, two or tree terms.
What I need is a system for give different terms diferent weights
and to search terms with more than one word. How near they are and there
frequency is important to.
I dont have seen rules to use the 'rank()' function for this.
I dont have seen any rules to use the 'rank()' as the one example on
youre webside.

I need the benefit of performance of an full text search and postgres is
the only non commercial DB-Syste can handle greater data sizes.
If u dont have an API for this, what can i do?
[humor]*panic!* :\[/humor]

greeds
Peter Schmelzer

Show quoted text

greeds
Peter Schmelzer

---------------------------(end of broadcast)---------------------------
TIP 8: explain analyze is your friend

Regards,
Oleg
_____________________________________________________________
Oleg Bartunov, sci.researcher, hostmaster of AstroNet,
Sternberg Astronomical Institute, Moscow University (Russia)
Internet: oleg@sai.msu.su, http://www.sai.msu.su/~megera/
phone: +007(095)939-16-83, +007(095)939-23-83