Will be great if someone can show how to do it..
For my application, I donot care about any score (just vanilla boolean
search is sufficient)
In the mean while, I experimented with some workaround and would like to
share the findings:
Problem details:
On a collection on 10 million documents, I wa
This is possible, using the ScorerVisitor (3.6) / getChildren (4.0).
You need a custom collector that when it collects a competitive hit,
visits the sub-scorers of your BooleanQuery and saves away which ones
matched the current doc.
But this is very expert and there are real challenges (eg not all
