On Fri, Mar 16, 2012 at 8:38 PM, Carlos Gonzalez-Cadenas <
c...@experienceon.com> wrote:
> On Fri, Mar 16, 2012 at 9:26 AM, Mikhail Khludnev <
> mkhlud...@griddynamics.com> wrote:
>
>> Hello Carlos,
>>
>
>> so, search all terms with MUST first, you've got the best result in terms
>> of precision a
On Fri, Mar 16, 2012 at 9:26 AM, Mikhail Khludnev <
mkhlud...@griddynamics.com> wrote:
> Hello Carlos,
>
Hello Mikhail:
Thanks for your answer.
>
> I have two concerns about your approach. First-K (not top-K honestly)
> collector approach impacts recall of your search and using disjunctive
> q
Hello Carlos,
I have two concerns about your approach. First-K (not top-K honestly)
collector approach impacts recall of your search and using disjunctive
queries impacts precision e.g. I want to find some fairly small and quiet,
and therefore unpopular "Lemond Hotel" you parse my phrase into Lemo
Hello all,
We have a SOLR index filled with user queries and we want to retrieve the
ones that are more similar to a given query entered by an end-user. It is
kind of a "related queries" system.
The index is pretty big and we're using early-termination of queries (with
the index sorted so that th
Hello all,
We have a SOLR index filled with user queries and we want to retrieve the
ones that are more similar to a given query entered by an end-user. It is
kind of a "related queries" system.
The index is pretty big and we're using early-termination of queries (with
the index sorted so that th
