Re: MultiFieldQueryParser - BooleanClause.Occur

2008-03-03 Thread JensBurkhardt
Hey, Thanks a lot! Everything works pretty well :-) . Greetings Jens Donna L Gresh wrote: Paul- Thanks (that was one of my ulterior motives for answering the question; I figured if there was something inefficient or unnecessary about my approach, I'd hear about it :) ) Donna Gresh

Re: explain() - fieldnorm

2008-03-03 Thread JensBurkhardt
Okay, thanks a lot. Maybe I should change my indexing behavior ;-) . Greetings Jens hossman wrote: : As my subject is telling, i have a little problem with analyzing the : explain() output. : I know, that the fieldnorm value consists out of documentboost, fieldboost : and lengthNorm.

Avoid stemming to get exact word in search results

2008-03-03 Thread secou
Hi, I’m using RSS Bandit feed reader (HYPERLINK http://www.rssbandit.orgwww.rssbandit.org) whose search engine is based on Lucene. I understand the interest of stemming but I sometimes want the exact word and not the stemmed one. For example a search with OFS (a company) gives

Re: Avoid stemming to get exact word in search results

2008-03-03 Thread Mathieu Lecarme
There's no syntax to restore stemmed word. Stemming is done while reading the news, so the index never knows the complete word. I submit a patch for that : https://issues.apache.org/jira/browse/LUCENE-1190 Be careful, rssbandit use .net lucene, not the java version. M. secou a écrit : Hi,

Re: Does Lucene support partition-by-keyword indexing?

2008-03-03 Thread Mathieu Lecarme
The trouble is to keep information up to date in different nodes. Each node should contains some very small index. When a new node enter, it can fetch this index from other node, just like chunk in file sharing p2p. The smallest index should be one Term, so, searching will only ask one node

Re: how do i search clause

2008-03-03 Thread Erick Erickson
Well, you can use PhraseQuery or, if you're using the usual QueryParser, enclose your phrase in quotes. You should probably look at the syntax explanations on the Lucene site... Best Erick On Mon, Mar 3, 2008 at 1:56 AM, anjana m [EMAIL PROTECTED] wrote: Rats give clue to

Re: bigram analysis

2008-03-03 Thread Grant Ingersoll
On Mar 3, 2008, at 5:40 AM, John Byrne wrote: Hi, I need to use stop-word bigrams, liike the Nutch analyzer, as described in LIA 4.8 (Nutch Analysis). What I don't understand is, why does it keep the original stop word intact? I can see great advantage to being able to search for a

Re: bigram analysis

2008-03-03 Thread Mathieu Lecarme
Not sure, you might want to ask on Nutch. From a strict language standpoint, the notion of a stopword in my mind is a bit dubious. If the word really has no meaning, then why does the language have it to begin with? In a search context, it has been treated as of minimal use in the early

Re: bigram analysis

2008-03-03 Thread Grant Ingersoll
Yep, still good reasons like I said, but becoming less important as the hardware, etc. gets faster and cheaper, IMO, especially in the context of more advanced search capabilities. On Mar 3, 2008, at 10:49 AM, Mathieu Lecarme wrote: Not sure, you might want to ask on Nutch. From a strict

Re: bigram analysis

2008-03-03 Thread John Byrne
Yes, this makes sense to me. I think I'll just keep all words, including stop words, and if performance ever becomes an issue, I'll look at bigrams again. But I think there's a good chance that I'll never see significant impact either way. Thanks guys! Grant Ingersoll wrote: Yep, still good

Re: Security filtering from external DB

2008-03-03 Thread Jake Mannix
Gabriel, You can make this search much more efficient as follows: say that you have a method public BooleanQuery createQuery(CollectionString allowedUUIDs); that works as you describe. Then you can easily create a useful reusable filter as follows: Filter filter = new

get.sameer has invited you to Spokeo

2008-03-03 Thread get . sameer
Dear java-user@lucene.apache.org,br/br/ [EMAIL PROTECTED] has invited you to Spokeo, which finds your friends' updates across the Web. Click http://www.spokeo.com/public/join?c=bfa835cfcec57bcc76987aff8364cba43dc7638a to accept your invitation. On average, Spokeo finds 87 friends across 30

Apologies for the Spokeo Spam

2008-03-03 Thread Sameer Shisodia
I apologise for any spam sent on my behalf by Spokeo. I was totally unaware of clicking any link that could've sent the spam. Please avoid the service. Rgds, Sameer -- Sameer Shisodia Bangalore (c) +91-98451-80207