Re: Recreating index lucene without stopping client applications

2018-07-17 Thread Michael Sokolov
If you create a completely new index, rather than applying updates to an existing index, you will not be able to see that by calling maybeRefresh(), I think, since that is looking for updates to an existing index. Conceivably you could open a writer on the existing index, delete all of its

Re: Lucene scoring components

2018-07-17 Thread Adrien Grand
You could extend this class and provide your own implementation to incorporate term frequency into the final score. For the record, you might want to look into BM25Similarity, which takes term frequency into account, but in a way that gives a much lower score contribution to hits than

Re: Lucene scoring overall score

2018-07-17 Thread Adrien Grand
You could use IndexSearcher#explain, which tells you how the score of a document is computed. Le mar. 17 juil. 2018 à 19:06, a écrit : > Hi,- > > how can i check the contributions from different fields indexed in the > hits doc's score? > > Best regards > > >

Lucene scoring overall score

2018-07-17 Thread baris . kazar
Hi,- how can i check the contributions from different fields indexed in the hits doc's score? Best regards - To unsubscribe, e-mail: java-user-unsubscr...@lucene.apache.org For additional commands, e-mail:

Re: Lucene scoring components

2018-07-17 Thread baris . kazar
i forgot to put the doc that i was referring to: https://lucene.apache.org/core/6_0_1/core/org/apache/lucene/search/similarities/TFIDFSimilarity.html Best regards On 7/17/18 1:01 PM, baris.ka...@oracle.com wrote: Hi,- is there a way to diminish the tf(t in d) component to 1? i dont want

Lucene scoring components

2018-07-17 Thread baris . kazar
Hi,- is there a way to diminish the tf(t in d) component to 1? i dont want the number of times a word appears to affect the scoring for my app. Best regards - To unsubscribe, e-mail: java-user-unsubscr...@lucene.apache.org

LUCENE-8396 performance result?

2018-07-17 Thread alex stark
LUCENE-8396 looks pretty good for LBS use cases, do we have performance result for this approach? It appears to me it would greatly reduce terms to index a polygon, and how about search performance? does it also perform well for complex polygon which has hundreds or more coordinates?