Hi;
I use Solr 4.5.1 Due to my question is more related to Lucene I wanted to
ask this question here. Is there any example which uses payloads for
boosting at a custom function query?
Thanks;
Furkan KAMACI
I will take a look. Thanks for your help!
On Wed, Nov 27, 2013 at 1:37 PM, Earl Hood wrote:
> On Wed, Nov 27, 2013 at 3:31 PM, Michael Berkovsky wrote:
>
> > My goal is to simply store records term->[doc1, doc2, ] on disk. I
> > tried to get these records through docsEnum but it was too slo
On Wed, Nov 27, 2013 at 3:31 PM, Michael Berkovsky wrote:
> My goal is to simply store records term->[doc1, doc2, ] on disk. I
> tried to get these records through docsEnum but it was too slow. Not sure
> if it possible to get them faster, hence the reason for my enquiry.(Perhaps
> there is
My goal is to simply store records term->[doc1, doc2, ] on disk. I
tried to get these records through docsEnum but it was too slow. Not sure
if it possible to get them faster, hence the reason for my enquiry.(Perhaps
there is some low level API to scan through the posting list?)
Thanks,
mb
: The goal is to construct the iterator
:
: Iterator: term -> [doc1, doc2, ...]
That iterator already exists -- it's a DocsEnum.
Erick's question is what your *end* goal is .. what are you attempting to
do that you are asking about accessing a low level iterator over all thd
docs that contain
Hi;
I've asked same question at Solr mail list but could not get any answer. I
have a payload field at my schema (Solr 4.5.1) When a user searches for a
keyword I will calculate the usual score and "if" a match occurs at that
payload field I will add payload to the general score (payload * normali
Never mind. I figured it out. Thanks anyway.
-Original Message-
From: Scott Smith [mailto:ssm...@mainstreamdata.com]
Sent: Wednesday, November 27, 2013 9:27 AM
To: java-user@lucene.apache.org
Subject: Highlighting phrases
I'm doing some highlighting with the following code fragment:
The goal is to construct the iterator
Iterator: term -> [doc1, doc2, ...]
It would run through the entire Lucene index . The index contains +100 mln
documents
Thanks,
mb
On Wed, Nov 27, 2013 at 5:47 AM, Erick Erickson wrote:
> Probably should explain what your end goal here is.
> Reconstructi
I'm doing some highlighting with the following code fragment:
formatter = new SimpleHTMLFormatter(,
);
Scorer score = new QueryScorer(myQuery);
ht = new Highlighter(formatter, score);
ht.setTextFragmenter(new NullFragmenter());
P.S. Meant to add that it's almost always a win,
if you have the space, to do any pre-computing you
can at index time, you only have to pay the cost
once.
Or you could normalize the field, simply add spaces, i.e.
left-pad each number with the appropriate number of spaces
so all digit sequences are
If this is your complete pattern, can you index two
different fields, one text and one numeric, say
name_text_sort that holds Bay
name_int_sort (make sure it's a number field!)
that holds the 1, 2, 11, etc.
Then just do a primary sort on name_text_sort and
secondary sort on name_int_sort?
FWIW,
E
Probably should explain what your end goal here is.
Reconstructing the entire document? Just finding out
what documents a few words belong to?
The former will be painful and lossy, Luke does that
for instance.
FWIW,
Erick
On Mon, Nov 25, 2013 at 11:54 AM, Michael Berkovsky <
michael.berkov...@g
12 matches
Mail list logo
