----- Цитат от Sushant Sinha (sushant354@gmail.com), на 27.01.2012 в 18:32 ----- <br /><br />> The rank counts
1/coversize.So bigger covers will not have much impact <br />> anyway. What is the need of the patch? <br />> <br
/>>-Sushant. <br />> <br /><br />If you want to find only combinations of words that are close one to another,
withthe patch you could use something as: <br /><br />WITH a AS (SELECT to_tsvector('a b c d e g h i j k') AS vec,
to_tsquery('a&d')AS query) <br />SELECT * FROM a WHERE vec @@ query AND ts_rank_cd(3,vec,query)>0; <br /><br />I
couldnot find another way to make this type of queries. If there is an alternative, I am open to suggestions <br /><br
/>Bestregards <br />-- <br />Luben Karavelov