Do you have other code you are not showing us? For example, what could are
you using to get the text of the parsed query?
Make sure your quotes are true ASCII quotes (double quote) and not the
curly quotes that word processors like to insert.
What is this Repository Manager? I mean, I see no code
Hello.
My main aim is following:
a. Index both on line and doc basis (Line basis for providing phrase
suggestions/infix suggestions. Doc basis for Firing
booleanquery/wildcard query etc.)
b. Yeah for boolean/wildcard etc user input will be "xxx" and "yyy" and
I will show document name.
c. W
On 08/21/2013 09:51 AM, Ankit Murarka wrote:
> Yeah..I eventually DID THIS
>
> Just a small question : Knowing that BooleanQuery/PrefixQuery/WildCardQuery
> might also run fine even if I index the complete document as opposed to doing
> it Line by Line. Shouldn't I do it this way rather tha
Yeah..I eventually DID THIS
Just a small question : Knowing that
BooleanQuery/PrefixQuery/WildCardQuery might also run fine even if I
index the complete document as opposed to doing it Line by Line.
Shouldn't I do it this way rather than indexing each line for
Boolean/Prefix/Wildcard als
On 08/21/2013 08:38 AM, Ankit Murarka wrote:
> Hello.
> I tried with
>
> doc.add(new Field("contents",line,Field.Store.YES,Field.Index.ANALYZED));
>
> The BooleanQuery/PrefixMatch/WildCard all started Running fine..
>
> But it broke the Existing code for Phrase Suggestion/InfixSuggester. Now
>
Hello.
I tried with
doc.add(new Field("contents",line,Field.Store.YES,Field.Index.ANALYZED));
The BooleanQuery/PrefixMatch/WildCard all started Running fine..
But it broke the Existing code for Phrase Suggestion/InfixSuggester. Now
these suggesters are returning Word suggestion instead of Phr
On 08/19/2013 08:17 AM, Ankit Murarka wrote:
> doc.add(new StringField("contents",line,Field.Store.YES));
Did you try with:
doc.add(new Field("contents",line,Field.Store.YES));
?
--
Roberto Ragusamail at robertoragusa.it
Hello All,
The smallest possible self contained program using RAMDirectory and no
external classes is being mentioned below.kindly assist me in what might
be wrong.
**package example;
import org.apache.lucene.analysis.Analyzer;
import org.apache.lucene.analysis.standard.StandardAnalyzer;
imp
Hello. Reference to CustomAnalyzer is what I had mentioned.
I created a custom analyzer by using the StandardAnalyzer code. Only
change I made was to comment the LowerCaseFilter in StandardAnalyzer to
create my own analyzer.
Yeah.I am trying to provide a smallest possible self contained prog
If you're using StandardAnalyzer what's the reference to
CustomAnalyzerForCaseSensitive all about? Someone else with more
patience or better diagnostic skill may well spot your problem but I
can't.
My final suggestion is that you build and post the smallest possible
self-contained program, using
Hello. I gave the complete code sample so that anyone can try and let me
know. This is because this issue is really taking a toll on me.
I am so close yet so far.
Yes, I am using analyzer to index the document. The Analyzer is
StandardAnalyzer but I have commented the LowerCaseFilter code from
I was rather hoping for something smaller!
One suggestion from a glance is that you're using some analyzer
somewhere but building a BooleanQuery out of a TermQuery or two. Are
you sure (test it and prove it) that the strings you pass to the
TermQuery are EXACTLY what has been indexed?
--
Ian.
Hello. The problem is as follows:
I have a document containing information in lines. So I am indexing all
files line by line.
So If I say in my document I have,
INSIDE POST OF SERVER\
and in my index file created I have,
INSIDE POST OF SERVER\
and I fire a boolean qu
Well, you have supplied a bit more info - good - but I still can't
spot the problem. Unless someone else can I suggest you post a very
small self-contained program that demonstrates the problem.
--
Ian.
On Wed, Aug 14, 2013 at 2:50 PM, Ankit Murarka
wrote:
> Hello.
> The problem does
Hello.
The problem does not seem to be getting solved.
As mentioned, I am indexing each line of each file.
The sample text present inside LUKE is
\
\
java.lang.Thread.run(Thread.java:619)
>>Size of list array::0\
at java.lang.reflect.Method.invoke(Method.java:597)
org.com.dummy,INFO,<<
remedialaction != "remedial action"?
Show us your query. Show a small self-contained sample program or
test case that demonstrates the problem. You need to give us
something more to go on.
--
Ian.
On Tue, Aug 13, 2013 at 11:13 AM, Ankit Murarka
wrote:
> Hello,
> I am aware of that l
Hello,
I am aware of that link and I have been through that link many
number of times.
Problem I have is:
1. Each line is indexed. So indexed line looks something like
"\"
2. I am easily firing a phrase query on this line. It suggest me the
possible values. No problem,.
3. If I fire
Should be straightforward enough. Work through the tips in the FAQ
entry at
http://wiki.apache.org/lucene-java/LuceneFAQ#Why_am_I_getting_no_hits_.2F_incorrect_hits.3F
and post back if that doesn't help, with details of how you are
analyzing the data and how you are searching.
--
Ian.
On Tue,
Try detailing both your expected behavior and the actual behavior. Try
providing an actual code snippet and actual index and query data. Is it
failing for all types and titles or just for some?
-- Jack Krupansky
-Original Message-
From: saisantoshi
Sent: Tuesday, February 26, 2013 6:
Will be great if someone can show how to do it..
For my application, I donot care about any score (just vanilla boolean
search is sufficient)
In the mean while, I experimented with some workaround and would like to
share the findings:
Problem details:
On a collection on 10 million documents, I wa
This is possible, using the ScorerVisitor (3.6) / getChildren (4.0).
You need a custom collector that when it collects a competitive hit,
visits the sub-scorers of your BooleanQuery and saves away which ones
matched the current doc.
But this is very expert and there are real challenges (eg not all
9 jul 2008 kl. 07.37 skrev Cam Bazz:
Hello,
Is it possible to make a boolean query where a word is equal to
fieldA or
fieldB?
in other words, I like to search a word in two fields, if word
passes in
fieldA or fieldB, then it is a hit.
XOR?
+(A B) -(+A +B)
karl
-
Sorry, The first mail I forgot to add the line for setting default
QueryParser operator. I have Included that too.
> This is the code I am using for search.
>
> public void doSearch(String userQuery, int stemFlag, int sortFlag, String[]
> sortFileds) throws Exception {
>
> PerFieldAna
Hi,
This is the code I am using for search.
public void doSearch(String userQuery, int stemFlag, int sortFlag, String[]
sortFileds) throws Exception {
PerFieldAnalyzerWrapper analyzer;
if (stemFlag == 1) {
analyzer = new PerFieldAnalyzerWrapper(new
Stemmin
You need to include your code I think. This makes no sense on a quick
look, so unless we see some code it'll be hard to know whether
we're looking at anything relevant.
Best
Erick
On Mon, Jun 2, 2008 at 1:19 AM, Sonu Sudhakar <[EMAIL PROTECTED]> wrote:
> Hi,
>
> I have done some more analysis on
Hi,
I have done some more analysis on this issue. I think it is related to
lucene's default operator.
I am getting excat results, when I sets the default operator as 'OR', but
facing problem when setting the default operator as 'AND'.
The following are the lucene QueryParser outputs for both case
Erick,
Thanks for your reply.
I am working with approximately 1 million documents. They are indexed in 4
servers. Each document has multiple fields. I am using ParallelMultiSearcher
for searching purpose.
I tried a few queries in the title(TTL) field.
i started with a simple query without boole
It's unclear what you *should* expect. How is your data
distributed?
In other words, how many documents do you have? In this example,
for instance,
1. TTL:data AND TTL:store OR TTL:variable => 3,733 results
it considered the TTL:data part only.
it's perfecily reasonable if every document that had
Message-
From: Chris Hostetter [mailto:[EMAIL PROTECTED]
Sent: Friday, March 07, 2008 3:23 PM
To: java-user@lucene.apache.org
Subject: Re: Boolean Query search performance
: > additional parens normally indicates that you are actually creating
an
: > extra layer of BooleanQueries
: > additional parens normally indicates that you are actually creating an
: > extra layer of BooleanQueries (ie: a BooleanQuery with only one clause for
: look here,
: parens will also be add is each term has a boost value larger than 1.0.
i think you are missreading that code. the "needParens
Thanks for all replies.
Today when I printed out the query that's generated it does not have the
extra paren's. And query.rewrite(reader).toString() now gives the same
result as query.toString(). All I can figure is I must have changed
something between starting the email and sending it out. The o
2008/3/6, Chris Hostetter <[EMAIL PROTECTED]>:
>
>
> : If I do a query.toString(), both queries give different results, which
>
> : is probably a clue (additional paren's with the BooleanQuery)
> :
> : Query.toString the old way using queryParser:
> : +(id:1^2.0 id:2 ... ) +type:CORE
> :
> : Qu
: If I do a query.toString(), both queries give different results, which
: is probably a clue (additional paren's with the BooleanQuery)
:
: Query.toString the old way using queryParser:
: +(id:1^2.0 id:2 ... ) +type:CORE
:
: Query.toString the new way using BooleanQuery:
: +((id:1^2.0)
Beard, Brian skrev:
I'm using lucene 2.2.0.
I'm in the process of re-writing some queries to build BooleanQueries
instead of using query parser.
Bypassing query parser provides almost an order of magnitude improvement
for very large queries, but then the search performance takes 20-30%
longer.
On Thursday 25 May 2006 21:08, Crump, Michael wrote:
> Hello,
>
>
>
> I'm working on a search application and I need to know if it is possible
> to get the number of terms that actually matched a Boolean query. For
> example let's say I have field test with values aaa bbb ccc d e f and I
> con
: BooleanQuery query = new BooleanQuery();
: for(Term t: terms)
: {
: query = new TermQuery(t);
: query.add(t, false, false); // ist his wrong?
: }
:
: If I construct the query as a string like "A a OR B b OR C" I get much more
: results. I assume that the Boolean query uses an AND oper
Hi,
> From: Steven Pannell [mailto:[EMAIL PROTECTED]
> I want to create a boolean query like:
>
> 'book' AND ( 'fred' OR 'ginger')
>
>
> TermQuery t1 = new TermQuery(new Term("type","book"));
> TermQuery t2 = new TermQuery(new Term("author","fred"));
> TermQuery t3 = n
: java-user@lucene.apache.org
Subject: Re: Boolean Query - TooManyClauses Exception
On Thursday 19 May 2005 14:39, Jayakumar.V wrote:
> I'm getting a TooManyClauses Exception when I try to query for a
> particular date range.
See
http://wiki.apache.org/jakarta-lucene/Luc
Any reason why Range query doesn't just iterate over the terms of the
field instead of creating a large BooleanQuery with term queries?
Are there any specific difficultites in doing so or any other impacts?
Thanks
-John
On 5/19/05, Jayakumar.V <[EMAIL PROTECTED]> wrote:
> Hi,
>
> I'm getting a
On Thursday 19 May 2005 14:39, Jayakumar.V wrote:
> I'm getting a TooManyClauses Exception when I try to query for a
> particular date range.
See
http://wiki.apache.org/jakarta-lucene/LuceneFAQ#head-06fafb5d19e786a50fb3dfb8821a6af9f37aa831
--
http://www.danielnaber.de
-
40 matches
Mail list logo
