Hi all,
I have a special use case to implement, and I couldn't achieve it with a a
solution combining expected behavior and performance.
My goal is to identify specific terms inside the user query, to restrict
following queries.
To be more factual : if the user queries "walmart black socks", I woul
; > need to search them to see if they certain terms.
>
> You might consider, instead of performing reverse search, just querying all
> of your locations against one document at a time using Lucene's MemoryIndex,
> which is very fast:
>
> <
> http://lucene.apach
Hi Mark,
On 03/01/2010 at 3:35 PM, Mark Ferguson wrote:
> I will be processing short bits of text (Tweets for example), and
> need to search them to see if they certain terms.
You might consider, instead of performing reverse search, just querying all of
your locations against one documen
MoreLikeThis in contrib may help.
DIGY
-Original Message-
From: Mark Ferguson [mailto:mark.a.fergu...@gmail.com]
Sent: Monday, March 01, 2010 10:35 PM
To: java-user@lucene.apache.org
Subject: Reverse Search
Hello,
I am trying to figure out the best search strategy for my situation and
st of locations which is stable and searchable.
My thought is to do some kind of reverse search, in which I index the
locations, and then I pass each Tweet to that index as my query. I am not
exactly sure how to go about this though in a way that will do the search in
the way I want. I am also conc
28 mar 2007 kl. 13.22 skrev mark harwood:
Odd. I'm sure it used to have a getReader method somewhere.
Still, you can use MemoryIndex.createSearcher().getIndexReader()
I've wrapped MemoryIndex in the unison index facade of LUCENE-550,
just as I did with all the other index implemementations
dexing.
Mélanie
-Original Message-
From: markharw00d [mailto:[EMAIL PROTECTED]
Sent: Wednesday, March 28, 2007 4:34 PM
To: java-user@lucene.apache.org
Subject: Re: Reverse search
>>I just want to make sure there is no API either
No, but your code looks like it should do the job. That
lanie
-Original Message-
From: markharw00d [mailto:[EMAIL PROTECTED]
Sent: Wednesday, March 28, 2007 4:34 PM
To: java-user@lucene.apache.org
Subject: Re: Reverse search
>>I just want to make sure there is no API either
No, but your code looks like it should do the job. That code can be
rectly.
Thanks
Mélanie
-Original Message-
From: markharw00d [mailto:[EMAIL PROTECTED]
Sent: Monday, March 26, 2007 12:36 AM
To: java-user@lucene.apache.org
Subject: Re: Reverse search
On app startup:
1) parse all Queries and place in an array.
2) Create a RAMIndex containing a doc fo
);
}
I just want to make sure there is no API either create the document from term
or to index the term directly.
Thanks
Mélanie
-Original Message-
From: markharw00d [mailto:[EMAIL PROTECTED]
Sent: Monday, March 26, 2007 12:36 AM
To: java-user@lucene.apache.org
Subject: Re: Reverse search
Hi Mark,
Thanks, it does help. I will try that.
Mélanie
-Original Message-
From: markharw00d [mailto:[EMAIL PROTECTED]
Sent: Monday, March 26, 2007 12:36 AM
To: java-user@lucene.apache.org
Subject: Re: Reverse search
On app startup:
1) parse all Queries and place in an array.
2
m in a separate index?
Thanks,
Mélanie Langlois
-Original Message-
From: mark harwood [mailto:[EMAIL PROTECTED]
Sent: Friday, March 23, 2007 11:19 PM
To: java-user@lucene.apache.org
Subject: Re: Reverse search
Bear in mind that the million queries you run on the MemoryIndex c
-how can I select the queries? Should I index them in a separate index?
Thanks,
Mélanie Langlois
-Original Message-
From: mark harwood [mailto:[EMAIL PROTECTED]
Sent: Friday, March 23, 2007 11:19 PM
To: java-user@lucene.apache.org
Subject: Re: Reverse search
Bear in mind tha
tin <[EMAIL PROTECTED]>
To: java-user@lucene.apache.org
Sent: Friday, 23 March, 2007 12:54:36 PM
Subject: Re: Reverse search
23 mar 2007 kl. 09.57 skrev Melanie Langlois:
> Well, I though to use the PerFieldAnalyzerWrapper which contains as
> basic the snowballAnalyzer with English st
2007 12:46 PM
To: java-user@lucene.apache.org
Subject: Re: Reverse search
23 mar 2007 kl. 03.07 skrev Melanie Langlois:
Thanks Karl, the performances graph is really amazing!
I have to say that it would not have think this way around would be
faster, but sounds nice if I can use this, make
ubject: Re: Reverse search
23 mar 2007 kl. 03.07 skrev Melanie Langlois:
> Thanks Karl, the performances graph is really amazing!
> I have to say that it would not have think this way around would be
> faster, but sounds nice if I can use this, make everything easier
> to manage. I
karl wettin [mailto:[EMAIL PROTECTED]
Sent: Friday, March 23, 2007 10:35 AM
To: java-user@lucene.apache.org
Subject: Re: Reverse search
23 mar 2007 kl. 02.12 skrev Melanie Langlois:
I want to manage user subscriptions to specific documents. So I
would like to store the subscription (query) int
ssage-
From: karl wettin [mailto:[EMAIL PROTECTED]
Sent: Friday, March 23, 2007 10:35 AM
To: java-user@lucene.apache.org
Subject: Re: Reverse search
23 mar 2007 kl. 02.12 skrev Melanie Langlois:
> I want to manage user subscriptions to specific documents. So I
> would like t
23 mar 2007 kl. 02.12 skrev Melanie Langlois:
I want to manage user subscriptions to specific documents. So I
would like to store the subscription (query) into the lucene
directory, and whenever I receive a new document, I will search all
the matching subscriptions to send the documents to
Hello,
I want to manage user subscriptions to specific documents. So I would like to
store the subscription (query) into the lucene directory, and whenever I
receive a new document, I will search all the matching subscriptions to send
the documents to all subcribers. For instance if a user s
How fast is MemoryIndex? For examples, I have a
webpage indexed, and I have 10 queries with
negative keywords to match against this webpage. How
much faster is it comparing to using normal method to
match the same 10 queries to this webpage?
--- Erik Hatcher <[EMAIL PROTECTED]> wrote:
>
yes, but I will have to do it for each ad as I stated
previously.
webpage www.mysite.com --match--> ad1.ad101
> >
> > Then I match each ad with the webpage.
> > But due to negative keywords:
> > ad1ad100 --NOT match--> www.mysite.com
> > ad101 --match--> www.mysite.com
> >
> > # of queries
two document fields one named positive one called negative
you query have to look somehow like this:
positive: (keyword1 keywordN) AND NOT negative:(keyword1 keywordN)
Am 23.10.2005 um 20:50 schrieb Sam Lee:
Yes, I thought of that. But since the ads have
negative keywords, it's very possible f
Yes, I thought of that. But since the ads have
negative keywords, it's very possible for the webpage
to match the ads but not the other way around because
of the negative keywords. So the system cannot be
sure that the ads match the webpage until it uses ads'
keyword and negative keywords to rema
Index the keywords of your ads with lucene.
Extract all words from your page (ajax), remove stop words, build a
query from the page words by connect the words with OR and you will
find the best matching ad.
You may need to limit the words per page or set the maximum clauses
to a much higher
ok, I am implementing a google adsense/adwords-like
system. For examples, the website has keywords "nike
red shoe", so it can match text ad with keywords "nike
shoe -blue". Of course, I can always use the text ad
keywords to match the website's keywords. But it will
take too much resource to hav
Sam - I'm not quite sure I follow you, but let's see if this fits...
you want to have a document and see if a query matches it? Please
elaborate more on what you're after. Maybe what you're looking for
is the contrib/memory and the MemoryIndex within that Subversion area.
Erik
On 22
Hi,
Normally, lucene or Nutch can match query "nike shoe
-blue" with "red nike shoe".
But what about matching "red nike shoe" with query
"nike shoe -blue"? It is the other way around. Can I
do it with a combinations of API?
Many thanks.
__
Do Yo
28 matches
Mail list logo
