Ahhh, you're right. I know there's been some discussion in the past about how to find out the number of terms that matched, but don't remember the outcome off-hand. You might try searching the mail archive for something like "number of matching terms" or some such.
Sorry I'm not more help Erick On Thu, Jun 2, 2011 at 8:48 AM, Jesus Gabriel y Galan <jesus.gabrielyga...@buongiorno.com> wrote: > On 02/06/11 13:32, Erick Erickson wrote: >> >> Say you're trying to match terms A, B, C. Would something like >> >> (A AND B AND C)^1000 OR (A AND B)^100 OR (A AND C)^100 OR (B AND >> C)^100 OR A OR B OR C >> >> work? It wouldn't be an absolute ordering, but it would tend to >> push the documents where all three terms matched toward >> the top. > > The problem with this is that that would give better score to the documents > with most number of matches, but then I have to sort internally those > groups. So I'd need a sort=score,xxx,yyy and the score would not be equal > for the documents which match the same number of keywords. > I would need to have as many groups as keywords, and within each group all > documents need to have the same value for that sorting criteria (score or a > function or whatever), so that they tie, and they move to the next sorting > criteria. > > Thanks, > > Jesus. >
