Re: Using analyzer while constructing Lucene queries

2009-01-14 Thread Jack Stahl
Hi Rajesh, TermQueries (and likewise other queries) take a Term object, which in turn takes a String. That String should be the analyzed version ("play") of your originaly query word ("playing"). To get that, you need to feed your analyzer a Reader of the string you wish to parse ("playing"). I

Re: Google finance-like suggestible search field

2009-01-14 Thread Jack Stahl
Eric, I don't think that will work. The PrefixQuery generates a giant BooleanQuery that ORs one TermQuery for each matching term in the index for that prefix. So the problem isn't the number of fields, but that PrefixQueries dont scale to large indices. Jack On Wed, Jan 14, 2009 at 6:18 PM, An

Re: exponential boosts

2009-04-10 Thread Jack Stahl
Perhaps you'd find it easier to implement the equivalent: log(s1(d, q))*a1 + ... + log(sN(d, q))*aN On Fri, Apr 10, 2009 at 12:56 PM, Steven Bethard wrote: > I need to have a scoring model of the form: > >s1(d, q)^a1 * s2(d, q)^a2 * ... * sN(d, q)^aN > > where "d" is a document, "q" is a que