: Rank 3: Documents containing atleast n (n < N, where N is total number of
: query terms) in the same section and in order
that's a non-trivial goal in itself -- even without the "in the same
section" restriction, i can't think of a way to do that off the top of my
head other then a Span query
sog wrote:
>
> I search the index with a group of terms. I want to get every term's
> frequency in each document of the search result.
Are you looking for this?
TermFreqVector vector = IndexReader.getTermFreqVector(docNum, "field");
That gives you the frequency of every term, but you can just
I search the index with a group of terms. I want to get every term's
frequency in each document of the search result.
How can I?
thx,
sog
-
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMA
Hi there. I am new to Lucene and I have been developing a semantic
application for a while and it appears to me Lucene could help me to get
a much needed search with reasonable speed. I have some general question
to start:
1) Since my app is virtually all metadata, what should I store in the
On 2/21/06, Chris Hostetter <[EMAIL PROTECTED]> wrote:
>
>
> your "Aim of the Query formation" got truncated, so it's not entirely
> clear what you are looking for, but if the general idea of what you are
Documents should be ordered as follows
Rank 1: Documents containing section containing all t
On Feb 21, 2006, at 5:39 PM, Eric Jain wrote:
Daniel Noll wrote:
http://tinyurl.com/hzsna
Thanks!
There is some mention of "open issues" with this parser.
Anyone know what these are, and if anyone is still working on this?
I worked on it to a point, but I don't recall what open issues th
: It would have been nice if someone wrote something like indexModifier,
: but with a cache, similar to what Yonik suggested above: deletions will
: not be done immediately, but rather cached and later done in batches.
: Of course, batched deletions should not remember the term to delete,
: but ra
your "Aim of the Query formation" got truncated, so it's not entirely
clear what you are looking for, but if the general idea of what you are
looking for is that you want searches for phrase like "quick brown fox" to
only match if/when the words "quick" "brown" and "fox" all appear in the
same sec
I am trying to adopt lucene for a special IR system. The following scenario
is an approximation of what I am trying to do. Please bear with me if some
things doesnt make sense. I need some suggestions on formulating queries for
the following scenario
Each document consists of a set of fields (stan
Daniel Noll wrote:
http://tinyurl.com/hzsna
Thanks!
There is some mention of "open issues" with this parser.
Anyone know what these are, and if anyone is still working on this?
-
To unsubscribe, e-mail: [EMAIL PROTECTED]
For
Eric Jain wrote:
Searched the mailing list, found something about a
"PrecedenceQueryParser", but this seems to have disappeared?
It's moved:
http://tinyurl.com/hzsna
Daniel
--
Daniel Noll
Nuix Australia Pty Ltd
Suite 79, 89 Jones St, Ultimo NSW 2007, Australia
Phone: (02) 9280 0699
Fax:
Hi,
Thats exactly what I am doing currently. Was just wondering if there is
a lucene way to do what I am doing using QueryFilter etc.
-Thanks.
Dan Armbrust wrote:
Mufaddal Khumri wrote:
When I do a search for example on "batteries" i get 1200+ results. I
would like to show the user lets s
Currently I am doing exactly that. I am boosting relevant docs and I am
sorting in java to get the desired effect. I just was trying to see if I
can do something using QueryFilter or Sorts and do what I am doing.
-Thanks.
John Powers wrote:
Also, if you don't like the tag solution, you could
> Wouldn't this be a good case for the JarDirectory implementation
> somebody asked for?
> The index could then be statically written in a jar file downloaded
> with the applet (the original mail refers to static offline HTML
> files).
I wrote a quick and dirty implementation of a JarDirectory - i
: Hoss, come on, where are you - Filters! ;)
Otis my man, cut me some slack! .. I'm in the Pacific/USA Timezone, I
don't get to work untill 10AM at the earliest, and I'm a little wacked out
from having a really delayed flight last night.
: John, filters are handy for situations where you want to
Also, if you don't like the tag solution, you could borrow something
right from LIA... boost the documents that are "significant" products
with 1.5 (or whatever higher then 1), and the support/ancillary products
boot with .1
If there is nothing relavent in the "significant" products, at least
yo
So by me building a new query instead of a filter, I'm missing this
caching part?Seems pretty fast to me right now. But sounds like I
should use the filter anyway.
Thanks.
-Original Message-
From: Otis Gospodnetic [mailto:[EMAIL PROTECTED]
Sent: Tuesday, February 21, 2006 1:04 P
Mufaddal Khumri wrote:
When I do a search for example on "batteries" i get 1200+ results. I
would like to show the user lets say 300. I can do that by only
extracting the first 300 hits (sorted by decreasing relevance by
default) and displaying those to the user.
If you are only talking ab
Hoss, come on, where are you - Filters! ;)
John, filters are handy for situations where you want to run your query
multiple times against the same sub-set of your indexed documents. For
instance, if you have Documents that span several years, and want to be able to
search individual years, you
It sounds like this is a webapp.
I'd consider playing with HTML DOM a little bit - come up with a system where I
get top N matches by relevance, store them somewhere, and then just re-sort
them using users' criteria, without going back to the Lucene index.
For instance, you could store this data
It seems to me that the "X" then is a problem for you.. like you said
"coming up with the X" is hard. Maybe you want another tag then.
We call those ones you are trying to not return "related items" on our
search system.So you do a search that has +related:0 or something
like that.
T
So yes, if the xth + 1 item happens to be a camera and if its price
happens to be lower than the previous x cameras it wont be included in
this view and that is exactly what we want.
Mufaddal Khumri wrote:
In my case when we search for lets say cameras , my top x results are
all sorts of came
In my case when we search for lets say cameras , my top x results are
all sorts of cameras and then i get documents that match camera casings etc.
As a company we want to show as many cameras as possible and not other
camera
related products for this one web view on a specific page we have. On
I'm sure you've taken care of this, but I am curious myself:
If the 301 document only has a single term "batteries" (and thus is so
far low on the Hits), but has a price of seven cents, then the sort of
all the documents with "batteries" would put this near the top, but by
eliminating all document
When I do a search for example on "batteries" i get 1200+ results. I
would like to show the user lets say 300. I can do that by only
extracting the first 300 hits (sorted by decreasing relevance by
default) and displaying those to the user.
Now on the search results page, I have a drop down bo
I have a set of classes similar in function to IndexModifier but a little
more advanced. The idea is to keep the IndexReaders and IndexWriters open
as long as possible only closing them when absolutely necessary. Using the
concurrency package allows for me to have multiple readers and a singl
"Yonik Seeley" <[EMAIL PROTECTED]> wrote on 21/02/2006 05:13:52 PM:
> On 2/21/06, Pierre Luc Dupont <[EMAIL PROTECTED]> wrote:
> > is it possible to open an IndexWriter and an IndexReader on the
same
> > index, at the same time,
> > to do deleteTerm and addDocument?
>
> No, it's not possible.
Hello,
Before I learned about filters in lucene I was building my initial query
as a stringbuffer and then I use that with a queryparser.Is there
any difference/advantage to separating out the "filter" part of my query
into a proper filter in lucene or does it just add requirements the same
to
Ok, thanks.
That is what I was thinking.
Pierre-Luc
-Original Message-
From: Yonik Seeley [mailto:[EMAIL PROTECTED]
Sent: 2006-02-21 10:14
To: java-user@lucene.apache.org
Subject: Re: Open an IndexWriter in parallel with an IndexReader on the
same index.
On 2/21/06, Pierre Luc Dupont
The way I have solved the problem of allowing exact matches is, for each
field in which it is possible for an exact match to be requested, a
parallel field is created at index time that is unstemmed and has a
specific prefix:
if (fieldData.isSearched() && tokenize && usingStemmingAnalyzer
On 2/21/06, Pierre Luc Dupont <[EMAIL PROTECTED]> wrote:
> is it possible to open an IndexWriter and an IndexReader on the same
> index, at the same time,
> to do deleteTerm and addDocument?
No, it's not possible. You should batch things: do all your
deletions, close the IndexReader, then ope
Hi,
is it possible to open an IndexWriter and an IndexReader on the same
index, at the same time,
to do deleteTerm and addDocument?
Thanks!
Pierre-Luc
Hello,
I'm trying to find a search engine allowing to search through WML (WAP).
Do you know if Lucene enables to do it ? Did you already try it ?
thanx for your answers !
artdivin
-
To unsubscribe, e-mail: [EMAIL PROTECTED]
For ad
Hello all,
Blatantly trying to take advantage of previous mistakes and expertise
experience among all of you, I hereby ask for help in a small issue
dealing with indexing into multiple fields I've run into.
Objective:
To index multiple fields derived from one source field.
e.g. CASE, REVERSE, REV
hi all,
I am using lucene + tomcat to host a web search engine. I want to save the
queries posted to the search engine and the clicked results
returned by the search engine. However, i am unsure if they are any tools
readily available to do that (prefererably open source tools)
I am sure atleast s
I was wondering:
Is there any good reason why
x AND y OR z
is interpreted as
+(+x y z)
rather than
+(+(+x +y) z)
?
If yes, any suggestions how this could be accomplished most easily?
Searched the mailing list, found something about a "PrecedenceQueryParser",
but this seems to have
36 matches
Mail list logo
