- Цитат от Oleg Bartunov (o...@sai.msu.su), на 28.01.2012 в 21:04 -
> I suggest you work on more general approach, see
> http://www.sai.msu.su/~megera/wiki/2009-08-12 for example.
>
> btw, I don't like you changed ts_rank_cd arguments.
Hello Oleg,
Thanks for the feedback.
Is it O
I suggest you work on more general approach, see
http://www.sai.msu.su/~megera/wiki/2009-08-12 for example.
btw, I don't like you changed ts_rank_cd arguments.
Oleg
On Fri, 27 Jan 2012, karave...@mail.bg wrote:
Hello,
I have developed a variation of cover density ranking functions that count
- Цитат от karave...@mail.bg, на 27.01.2012 в 18:48 -
> - Цитат от Sushant Sinha (sushant...@gmail.com), на 27.01.2012 в 18:32
> -
>
>> The rank counts 1/coversize. So bigger covers will not have much impact
>> anyway. What is the need of the patch?
>>
>> -Sushant.
>>
>
> If yo
- Цитат от Sushant Sinha (sushant...@gmail.com), на 27.01.2012 в 18:32 -
> The rank counts 1/coversize. So bigger covers will not have much impact
> anyway. What is the need of the patch?
>
> -Sushant.
>
If you want to find only combinations of words that are close one to another,
with
The rank counts 1/coversize. So bigger covers will not have much impact
anyway. What is the need of the patch?
-Sushant.
On Fri, 2012-01-27 at 18:06 +0200, karave...@mail.bg wrote:
> Hello,
>
> I have developed a variation of cover density ranking functions that
> counts only covers that are le
And here is the patch, that I forgot to attach
> Hello,
>
> I have developed a variation of cover density ranking functions that counts
> only covers that are lesser than a specified limit. It is useful for finding
> combinations of terms that appear nearby one another. Here is an example of
>
Hello,
I have developed a variation of cover density ranking functions that counts
only covers that are lesser than a specified limit. It is useful for finding
combinations of terms that appear nearby one another. Here is an example of
usage:
-- normal cover density ranking : not changed
luben
