maybe this code can be useful for you
http://issues.apache.org/bugzilla/show_bug.cgi?id=34629
nicolas
On 8/11/05, John Smith <[EMAIL PROTECTED]> wrote:
> Thank you . That does look like what I want
>
> JS
>
> Eyal <[EMAIL PROTECTED]> wrote:
> Run a search on "Lucene ParallelReader" in google
hy,
i would just know what is the index compression technique used in
lucene. where can i find some information about this ?
thanks in advance,
nicolas
-
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail
NumDoc_e_t = number of doc with element e containing the term t.
NumDoc_e_t=docFreq(new Term(e, t))
NumDoc_e = number of documents with the element el ( = number of
documents with some values in the search field el )
How do you compute the numDoc_e with the lucene API ?.
thanks,
nicolas m
]> wrote:
> On Wed, 2005-03-09 at 18:29 +0100, Nicolas Maisonneuve wrote:
> > I would like use a index with structured search field.
> >
> > - flat index (lucene type)
> > searchfield1
> > searchfield2
> > searchffield3
> > ...
> > -stru
oups ..
2- According to the table , a new Query is created with just non zero
boost search field search2:coco^search2_boost
search4:coco^search4_boost
On Wed, 9 Mar 2005 18:53:41 +0100, Nicolas Maisonneuve
<[EMAIL PROTECTED]> wrote:
> hmm a idea would be to create dynamically a bo
st=0.7)
2- According to the table , a new Query is created with just non zero
boost search field search2:coco^search1_boost
search4:coco^search2_boost
WDYT ?
other proposals more flexible, clever, faster ?
nicolas maisonneuve
On Wed, 9 Mar 2005 18:29:12 +0100, Nicolas Maisonneuve
<[EMAI
cene to integrated easily this notion of
structured field ? (no fuzzy methods allow because of the
performance) ?
thanks in advance,
Nicolas Maisonneuve
-
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
