Hi all,
I need the ability to match documents that have two terms that occur
within n paragraphs of each other. I had a look through the archives,
and although many people have explained ways to implement per-sentence
or per-paragraph indexing & searching, no seems to have tackeled this
one y
I implemented this for my qsol query parser: myhardshadow.com/qsol
Uses a modified SpanNotQuery that takes another parameter saying how
many times the span can cross the specified marker. Index a special
paragraph marker with your text to delimit paragraphs and then the rest
is easy.
- Mark
Thanks for that, that's exactly what I needed.
Actually, I hadn't heard of qsol, but it seems to solve a few other
problems I have as well - correct highlighting, configurable operators,
sentence recogition. Is it distributed under the Apache license? and is
it currently stable enough to use o
It is stable...give it a whirl. I use it at about 5 or 6 different
heavily used installs at the moment and know of about a dozen others
that use it (many others have downloaded, but who knows what for). If
you notice anything off with it, I will fix immediately as I use it
heavily in production
heir text because the language
it's in doesn't collate in the same order as the default compareTo.
-Hoss
-
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
__
Hi Guys,
I have made tests with the CJKAnalyzer and the results show something
that seems very strange to me. First I have to say that I do not
understand non of the CJK languages.
What I do is the following I write some text in English and translate it
using an on-line tool, which give me the
Hi,
For a chinese token like ABCD (where A,B,C and D are chinese signs),
CJKAnalyzer will generate the following overlapping bigrams: AB BC CD.
Thus issuing a query containing one chinese sign will not retrieve any
documents. To overcome this, you have to index chinese characters as single
toke
I am seeing a problem reported in the archives last december; I'm getting
the same one, also on a redhat java--same version
gcj as his
It does not appear on our windows systems or another linux system. Hoss
suggested that it may be a duplicate defination of lucene core in the
classpath, but I
hmmm, that seems a shame, esp. if a term matches in a non-most-hits-occur-here
field, and then that field's boost doesn't get called in computing the score...
so, not a bug, then -- but i question the design of the class...
i'd much rather see:
conceptSearch:foo abstract:foo conceptSearch:blah
Hi,
I wanted to make use of a range query to find out data within the range.
eg. minexp : 3 maxexp: 7 if a persons exp: is between 3 and 7 then I can get
his details.
The problem is that if in the index the minexp or the maxexp is null/ empty
i don't want to use the range query for the field whi
10 matches
Mail list logo
