Re: 3.0.3 Contrib Query Parser : Custom Field Name Builder

I created a JIRA to fix this problem: https://issues.apache.org/jira/browse/LUCENE-2855 On Sat, Jan 8, 2011 at 1:32 AM, Adriano Crestani wrote: > Hi Christopher, > > Thanks for raising this problem, I always thought a little bit strange to > use CharSequence as map key. Then a just did a little b

Re: 3.0.3 Contrib Query Parser : Custom Field Name Builder

Hi Christopher, Thanks for raising this problem, I always thought a little bit strange to use CharSequence as map key. Then a just did a little bit of research and found this on CharSequence javadoc: "This interface does not refine the general contracts of the equals

Re: Creating an index with multiple values for a single field

Hi Ryan, You should try the synonym filter. That should help you with this kinda problem. You could also look at turning off norms for the name field, or turning off tf or idf. -- Anshum Gupta http://ai-cafe.blogspot.com On Sat, Jan 8, 2011 at 6:03 AM, Ryan Aylward wrote: > Our business has a

3.0.3 Contrib Query Parser : Custom Field Name Builder

I'm trying to: StandardQueryTreeBuilder b = …; b.setBuilder( "myfield", fieldSpecificBuilder); In the debugger I see that the builder is registered in the QueryTreeBuilder's fieldNameBuilders map. When parsing, QueryTreeBuilder.getBuilder tries to look up the builder by using the FieldableNode

Creating an index with multiple values for a single field

Our business has a need to allow for multiple values for a single field. For example, we have an index of employers where an employer often has multiple ways people refer to it. For example, the company "Wal-mart" is referred to as: 1) Wal-mart 2) Wal-mart Stores 3) Walmart I wo

RE: is OpenBitSet / SortedVIntList compressed bit map index?

I don't recall how we decided to use it, but we are using http://code.google.com/p/compressedbitset/ and it seems to be pretty efficient in terms of memory. -Original Message- From: Federico Fissore [mailto:feder...@fissore.org] Sent: Friday, January 07, 2011 3:12 PM To: java-user@lucen

Re: is OpenBitSet / SortedVIntList compressed bit map index?

First Last, il 07/01/2011 20:55, ha scritto: Hi, is OpenBitSet / SortedVIntList a compressed bit map index? Which one is better if memory usage is the primary concern ? SortedVIntList is compressed, OpenBitSet is not Our filters are sparse. So is SortedVIntList better in that case? Yes

Re: Where to find non-English dictionaries, thesaurus, synonyms

Somehow, I had the impression that the TrebleCLEF and EuroMatrix european projects are meant to gather this kind of information sources. But honestly, it's not as homogeneous as in OpenOffice. Mozilla also has dictionaries. Wiktionary can also be helpful. paul Le 7 janv. 2011 à 22:26, Robert M

Re: Where to find non-English dictionaries, thesaurus, synonyms

On Thu, Jan 6, 2011 at 11:53 AM, Pulkit Singhal wrote: > Hello, > > What's a good source to get dictionaries (for spellcorrections) and/or > thesaurus (for synonyms) that can be used with Lucene for non-English > languages such as Fresh, Chinese, Korean etc? if you can't find a wordlist of correc

is OpenBitSet / SortedVIntList compressed bit map index?

Hi, is OpenBitSet / SortedVIntList a compressed bit map index? Which one is better if memory usage is the primary concern ? Our filters are sparse. So is SortedVIntList better in that case? Are there any other compressed bitmap index implementations which offer bit map compression at a decent pe

wrong fieldNorm when title is empty

I recognized when the title of a document inside an index is empty, then the fieldNorm value is set to 7.5161928E9. This would lead to a big unwanted boost of documents with an empty title I imagine. Is this a bug? -- View this message in context: http://lucene.472066.n3.nabble.com/wrong-fieldNo