Thanks for your responses.
Best,
Modassar
On Wed, Jan 6, 2016 at 9:27 PM, Jack Krupansky
wrote:
> The motivation for the constant-score rewrite is simply performance. As per
> the Javadoc:
>
> "*This method is faster than the BooleanQuery rewrite methods when the
> number of matched terms or ma
The motivation for the constant-score rewrite is simply performance. As per
the Javadoc:
"*This method is faster than the BooleanQuery rewrite methods when the
number of matched terms or matched documents is non-trivial. Also, it will
never hit an errant BooleanQuery.TooManyClauses exception.*"
S
Hi Modassar,
It usually helps if you analyze extreme case: e.g. fl:a*
What terms should be better match? Those who are shorter or all should
be equally good?
What should be top document? Assuming standard TF/IDF scoring is used,
that would be one with the most terms that start with 'a' especiall
Please help me understand why queries like wildcard, prefix and few others
are re-written into constant score query?
Why the scoring factors are not taken into consideration in such queries?
Please correct me if I am wrong that this behavior is per the query type
irrespective of the parser used.
Thanks for your response Ahmet.
Best,
Modassar
On Mon, Jan 4, 2016 at 5:07 PM, Ahmet Arslan
wrote:
> Hi,
>
> I think wildcard queries fl:networ* are re-written into Constant Score
> Query.
> fl=*,score should returns same score for all documents that are retrieved.
>
> Ahmet
>
>
>
> On Monday,
Hi,
I think wildcard queries fl:networ* are re-written into Constant Score Query.
fl=*,score should returns same score for all documents that are retrieved.
Ahmet
On Monday, January 4, 2016 12:22 PM, Modassar Ather
wrote:
Hi,
Kindly help me understand how will relevance ranking differ int f
