Join GitHub today
GitHub is home to over 40 million developers working together to host and review code, manage projects, and build software together.Sign up
It would be nice if when run a percolate CALL PQ() query, to get a basic weight for each match.
This would be useful to 'rank' or sort the returned queries (being able to sort/limit the results in weight order might be nice, but not necessary. ) ... ultimately could have have the percolate contain many fuzzy queries (quorum, or with MAYBE) and so want to then only get the 'best' matching queries, not necessarily all of them.
Even a simple ‘word count’ weight would probably be good enough. (ie wouldnt be able to use full IDF or whatever ranking, because wouldn’t have term frequencies in the document corpus - as percolate query is just supplying the few document(s))
But also lccs (larged commons subsequence) would be useful too.
a bit convoluted example:
In theory the 'orange tree' is a better match, because common phrase. 'fresh apple' does still match, but it not a common phrase.
if supplying multiple documents, guess weight could augment the 'documents' column
sort of thing. Weight per matching document.
I think it needs an option
ranker mode, ranker expression or maybe select list expression that could be user for sorting could be implemented later at another ticket
As it is not quite clear should these (mode, expressions) sould be a part of stored query or document at