Yonik,
On Friday 16 September 2005 23:30, Yonik Seeley wrote:
> I just updated a bug via JIRA,
> http://issues.apache.org/jira/browse/LUCENE-383
> and I didn't see it come to any mailing list like it used to with bugzilla.
> Should it have? Is there a new mailing list to sign up for?
I had a sim
I know there have been some posts discussing how to integrate Lucene
with Derby recently.
I've added an example project that works with both HSQLDB and Derby
here: http://issues.apache.org/jira/browse/LUCENE-434
The bindings allow you to use SQL that mixes database and Lucene
functionality i
On Friday 16 September 2005 23:32, Gasi wrote:
> After uploading these on a real webserver , it didn't work because for
> every search I had null results. So I found a solution-not a good
> one-but it works: I indexed my data on the webhostingaccount.
There must have been a different problem. Lu
On Friday 16 September 2005 21:51, Matthias Bräuer wrote:
> but
> unstored field and the passed in Reader happens to be a StringReader
> (e.g. when extracting Word documents using the Textmining library) the
> field is not indexed at all. That means Luke shows no terms for this
> field and, conseq
Hello Luc,
You are correct in that case. But if I have a string like manyamreddyvenkat.
If I want to search for reddy, then I can't get that though I index all the
entries in the reverse order. Is there any other way.
Thanx,
MTREDDY
Tirupati Reddy Manyam
24-06-08,
Sundugaullee-24,
791
Hello,
I read the following statement :
Note: You cannot use a * or ? symbol as the first character of a search.
in this page: http://lucene.apache.org/java/docs/queryparsersyntax.html
So that's why I thought of that. And at present I am using QueryParser. So it
is giving error for *redd
Hallo everybody,
I had a problem with lucene demo on my webhosting account. Because I think
more people have the same problem,and perhaps somebody will get the same
problem in the futurek, so now I want describe how I solved it!
Well in my case I used a lucene webdemo on my homepc with windows
I just updated a bug via JIRA,
http://issues.apache.org/jira/browse/LUCENE-383
and I didn't see it come to any mailing list like it used to with bugzilla.
Should it have? Is there a new mailing list to sign up for?
-Yonik
Now hiring -- http://tinyurl.com/7m67g
I think you may be having another problem somewhere, usinga StringReader
works just fine for me (in fact: when you create a field with
a plain String, it is wrapped in a StringReader to pass to
your analyzer.
Note the following demo works just fine...
public static void main(String[] args) t
Hello,
this question seems to have occured in the mailing list before but I
wasn't able to find a satisfying answer. So please excuse if I'm asking
something that has already been discussed.
My problem is as follows:
If I use the Field.Text(String,Reader) method to create an indexed, but
uns
Lucene's WildcardQuery *does* support "postfix" queries - however
QueryParser does not allow such an expression to pass through. You
can create a WildcardQuery with a Term("field", "*whatever") and
search with that. All caveats about WildcardQuery, performance, and
maximum number of boole
On Sep 15, 2005, at 12:55 PM, James Huang wrote:
Thanks Jason.
I wonder if that's the same as
queryString + " publisher:Manning"
and pass on to the query parser?
I will emphasize the other comments made on this regarding the
Analyzer. I recommend against programatically adding to the s
Because when you add a document, the id is going thru an Analyzer, which
in your case uses a low case filter, but when you create a Term object
the term is not lower cased by an Analyzer.
If instead of using Field.Text for your ID, you'll use Keyword, then the
Analyzer will not lower case the ID
If you're indexing a field like this in order to be able to use it as a
reference later, you should normally index it using Field.Keyword
instead of Field.Text - if you use Text, it will go through your
Analyzer, which is probably what's changing the case. (I think this is
right - I'm sure someone
>> What I really want to do is sort by "A * (1-(B/700))", where A is the
>> score, and B is the age (in days) of the document. IE - the score is
>> basically "scaled down" with date.
> Maybe the TSS case study will help, though they rebuild their index
> nightly and can adjust the boost based on
I have a problem when deleting documents.
Lets say I have a Document object doc.
doc.add(Field.Text("id","index1,DML"));
doc.add(Field.Text("contents","some records"));
IndexWriter.addDocument(doc);
Now if I want to delete the document with id:index1,DML I do something like
this:
IndexReader.dele
On Sep 16, 2005, at 10:14 AM, <[EMAIL PROTECTED]>
<[EMAIL PROTECTED]> wrote:
Ah - the one bit of LIA I haven't read yet is the case studies
section!
Many thanks, I'll check it out. Sorting by multiple fields isn't quite
what I want - that sorts entirely by field A, then uses field B for
reco
Ah - the one bit of LIA I haven't read yet is the case studies section!
Many thanks, I'll check it out. Sorting by multiple fields isn't quite
what I want - that sorts entirely by field A, then uses field B for
records where A is identical, correct?
What I really want to do is sort by "A * (1-(B/
Tim, check out p. 155 in LIA where we discuss "Sorting by multiple
fields".
However, what you're really after it seems is boosting documents.
Check out TheServerSide's case study (online or in LIA) - Dion
discusses how he implemented boosting for more recent documents. If
you're indexin
You can write a query and add a date range to it giving the date field a
boost.
For instance you can do "+content:foo date:[{Today's date} TO null]^5
date:[{Yesterday's Date} TO {Today's Date}]^4 date:[{Last Week's Date}
TO Yesterday's Date}]^3 and so on
Aviran
http://www.aviransplace.com
-O
Hi,
I'm working in an industry which is fairly time sensitive, and older
documents are inherently less valuable. I'd like to be able to "weight"
the score of search results, so that older documents score lower. I
don't just want to sort by date, though - I'd still like results to be
ordered by sco
You could also add a field with all the terms reversed during the
indexation.
So documents containing "tirupathireddy" or "venkatreddy" would have
"ydderihtapurit" and "yddertaknev" in the reversed field.
If you detect that the user entered a suffix query like "*reddy",
transform it into a prefix
Legolas Woodland wrote:
Hi
Thank you for reading my post
I have some general question :
Please see http://nutch.org for information about Nutch.
1-does Nutch support multilanguage indexing and searching ?
Yes, to large degree (there are always issues when making assumptions
about the query
Hi
Thank you for reading my post
I have some general question :
1-does Nutch support multilanguage indexing and searching ?
2-does it has capability to index and search more than 500,000 site in a
timely manner?
3-does it have capabilities to add ADs System , sponsored result first and
other feat
On Thu, 2005-09-15 at 11:56 -0700, James Huang wrote:
> Yes, "+" is what I missed! Thanks.
>
> Suppose there is a book published by 3 publishers (I
> don't know how that works in real world):
>
> // At index time:
> doc.add( Field.Keyword("publisher", "Manning") );
> doc.add( Field.Keyword("p
Erik,
It may be worth looking at the code here:
http://issues.apache.org/jira/browse/LUCENE-328
The Bitsets in your example are likely to be very
sparse (I imagine you know only too well how long it
takes to write a book and therefore how many books
there are likely to be per author! :))With such
26 matches
Mail list logo
