On Wednesday 11 January 2006 00:09, Eric Jain wrote:
> Is there an efficient way to determine if two or more terms frequently
> appear next to each other sequence? For a query like:
>
> a b c
>
> one or more of the following suggestions could be generated:
>
> "a b c"
> "a b" c
> a "b c"
>
> I
Hi Friend...
I have two questions for you
I am doing indexing using Lucene. I am taking data from database
But for updation in index there is problem. How can I come to know that
a row or a single data cell is get changed from row ? How can I index
only
For changes in the database, you can:
- use the server side business object that also does the update of the BO in
the database, and which currently does also the indexing in lucene
- use the front-end (browser I presume if I see AJAX, which is nothing more
than XmlHttp), but would not be my prefer
Hi Friend...
I have two questions for you
I am doing indexing using Lucene. I am taking data from database
But for updation in index there is problem. How can I come to know that
a row or a single data cell is get changed from row ? How can I index
only
: to index remote HTML files. Can I use Nutch to crawl for the remote HTML
: files and use the index for the Lucene code I have already written? Or do
: I have to redo the whole thing using the Nutch API? I am using boosting
: during the indexing. I hope Nutch can boost fields, too. Any help
FYI:
open source web crawler:
http://java-source.net/open-source/crawlers
Thanks,
Koji
-
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
I am using lucene to index local HTML files. The requirement just changed
to index remote HTML files. Can I use Nutch to crawl for the remote HTML
files and use the index for the Lucene code I have already written? Or do
I have to redo the whole thing using the Nutch API? I am using boosting
d
Is there an efficient way to determine if two or more terms frequently
appear next to each other sequence? For a query like:
a b c
one or more of the following suggestions could be generated:
"a b c"
"a b" c
a "b c"
I could of course just run a search with all possible combinations, but
perh
Paul Elschot wrote:
In case you prefer to use the maximum score over the clauses you
can use the DisjunctionMaxQuery from the development version.
Yes, that may help! I'll need to have a look...
-
To unsubscribe, e-mail: [EMAI
Ohh, I see now. That's perfect. I hadn't realized that was in the API.
thanks...
> I think you want to use the MultiFieldQueryParser instead of the
> QueryParser.
>
> [EMAIL PROTECTED] wrote:
>
>>Is there a way to make the default search to go across all fields?
>>
>>For example, suppose I have
I think you want to use the MultiFieldQueryParser instead of the
QueryParser.
[EMAIL PROTECTED] wrote:
Is there a way to make the default search to go across all fields?
For example, suppose I have two fields "title" & "content", and we have
the following:
String queryText = "dogs cats";
Que
Is there a way to make the default search to go across all fields?
For example, suppose I have two fields "title" & "content", and we have
the following:
String queryText = "dogs cats";
QueryParser qParser = ...;
Query query = qParser.parse(queryText); // uses DFLT field.
But what if you want
On Tuesday 10 January 2006 07:32, Eric Jain wrote:
> Paul Elschot wrote:
> >>For example, a query for "europe" should rank:
> >>
> >>1. title:"Europe"
> >>2. title:"History of Europe"
> >>3. title:"Travel in Europe, Middle East and Africa"
> >>4. subtitle:"Fairy Tales from Europe"
> >
> > Perhaps
I think this will work because in number 1 europe is the only word in the title
which means it has a higher weight than the word Europe in number 2. In number
2 there are more words around Europe and so on with number 3.
As I can remember the scoring algorithm should exactly reproduce this result
Hi Dick,
I agree with you. Now I cannot understand why your
original code didn't work.
If you find the answer, please let me know!
regrads,
Koji
> -Original Message-
> From: Dick de Jong [mailto:[EMAIL PROTECTED]
> Sent: Tuesday, January 10, 2006 6:41 PM
> To: java-user@lucene.apache.o
Hi Koji,
I might not agree with you ... I did the following: I create new function
which invokes FSDirectory.getDirectory(dir,true) twice . The result I
compare (fs1==fs2). In my situation the (fs1==fs2) = true. So even in my
situation, i have two references to the same Directory object.
If I loo
Hi Dick,
> I only see one difference in the constructor of the IndexWriter class:
> "closeDir" is 'true' in my scenario and 'false' in your scenario. What is
> reason for this difference? And if there is a valid reason, it might be
> useful to add this to the javaDoc of the IndexWriter class.
The
Hi Koji,
Thanks for your help, would not have found that soon ... You are right, if I
apply your code, the IOException comes.
I only see one difference in the constructor of the IndexWriter class:
"closeDir" is 'true' in my scenario and 'false' in your scenario. What is
reason for this difference
18 matches
Mail list logo
