Hi,
I have a question regarding AnalyzingInfixSuggester.
Suppose I have an indexed term with the word: Lucene
And I query Luc!!!
Even In this case I would want lucene to suggest me Lucene, because at the
analyzer level I am handling cleaning the query part. The Analyzer would remove
the ! and
Hello guys,
i would like to use functionality of lookup/suggest. But i cannot figure
it out, how to match document to LookupResult. I want to open given doc
from which LookupResult is originating. Something similar what is
implemented on example http://jirasearch.mikemccandless.com/
Can you
nts. Also, since you are doing
bulk lookup, you should pre-sort the IDs so it's a sequential scan
through the terms dict.
There is another thread right now, subject "Mapping doc values back to
doc ID (in decent time)", also talking about how to do faster PK
lookup
segment finds a given
ID you should stop testing other segments. Also, since you are doing
bulk lookup, you should pre-sort the IDs so it's a sequential scan
through the terms dict.
There is another thread right now, subject "Mapping doc values back to
doc ID (in decent time)", also talki
ently using the TermsFilter to lookup Documents in
the Lucene index as follows:
List terms = new LinkedList<>();
for (String id : ids) {
terms.add(new Term("uid", id));
}
TermsFilter idFilter = new TermsFilter(terms);
... search logic...
At any time we may
murmur hash, stored in a Lucene field
> named uid. We are currently using the TermsFilter to lookup Documents in
> the Lucene index as follows:
>
> List terms = new LinkedList<>();
> for (String id : ids) {
> terms.add(new Term("uid", id));
unique key is the string representation of a 128 bit murmur hash,
stored in a Lucene field named uid. We are currently using the
TermsFilter to lookup Documents in the Lucene index as follows:
List terms = new LinkedList<>();
for (String id : ids) {
terms.add(ne
> The WhitespaceAnalyzer breaks up text by spaces and tabs and newlines.
> After that, you can wildcards. This will use very little space. I
> believe leading&trailing wildcards are supported now, right?
If leading wildcards take too much time (don't know, really) then one
could also try to index
ge-dependent/-specific.
>
> Thanks,
>
> Ilya
>
> -Original Message-
> From: Dawid Weiss [mailto:dawid.we...@gmail.com]
> Sent: Sunday, August 26, 2012 3:55 AM
> To: java-user@lucene.apache.org
> Subject: Re: Efficient string lookup using Lucene
>
>> Does Luce
/-specific.
Thanks,
Ilya
-Original Message-
From: Dawid Weiss [mailto:dawid.we...@gmail.com]
Sent: Sunday, August 26, 2012 3:55 AM
To: java-user@lucene.apache.org
Subject: Re: Efficient string lookup using Lucene
> Does Lucene support this type of structure, or do I need to somehow im
s in
constant time (in fact, the lookup takes the number of elements of the
matched input string, building the suffix tree/ array is O(n), at
least in theory).
If you already have Lucene integrated in your pipeline then that
n-gram approach will also work. If you know your minimum match
substring l
> implement it outside Lucene?
> > >
> > > By the way, I need this to run on an Android phone so size of memory
> > might
> > > be an issue...
> > >
> > > Thanks,
> > >
> > >
> > > Ilya Zavorin
> > >
&g
wid.we...@gmail.com]
> > Sent: Friday, August 24, 2012 4:50 PM
> > To: java-user@lucene.apache.org
> > Subject: Re: Efficient string lookup using Lucene
> >
> > What you need is a suffix tree or a suffix array. Both data structures
> > will allow you to perform cons
012 4:50 PM
> To: java-user@lucene.apache.org
> Subject: Re: Efficient string lookup using Lucene
>
> What you need is a suffix tree or a suffix array. Both data structures
> will allow you to perform constant-time searches for existence/ occurrence
> of any input pattern. Depending on
: Friday, August 24, 2012 4:50 PM
To: java-user@lucene.apache.org
Subject: Re: Efficient string lookup using Lucene
What you need is a suffix tree or a suffix array. Both data structures will
allow you to perform constant-time searches for existence/ occurrence of any
input pattern. Depending on
Does it mean that the resulting index will be very large?
Thanks,
Ilya
-Original Message-
From: Ahmet Arslan [mailto:iori...@yahoo.com]
Sent: Friday, August 24, 2012 4:59 PM
To: java-user@lucene.apache.org
Subject: Re: Efficient string lookup using Lucene
> search for a string &
Hi,
I have a similar issue.
I need lucene search to work with kanji characters (japanese).
The hits object (or topDocs) returns length = 0 for results but works well
for english.
I know my index contains matches as luke (lucene search tool) renders them.
I tried lace analyser - did not work.
Re
> search for a string "run", I do not need to find "ran" but I
> do want to find it in all of these strings below:
>
> Fox is running fast
> !%#^&$run!$!%@&$#
> run,run
With NGramFilter you can do that. But it creates a lot of tokens. For example
"Fox is running fast" becomes
F
o
rin
Sent: Friday, August 24, 2012 3:48 PM
To: java-user@lucene.apache.org
Subject: Efficient string lookup using Lucene
Hi Everyone,
I have the following task. I have a set of documents in multiple languages.
I don't know what these languages are. Any given doc may contain text in
severa
have a set of documents in multiple languages. I
> don't know what these languages are. Any given doc may contain text in
> several languages mixed up. So to me these are just a bunch of Unicode text
> files.
>
> What I need is to implement an efficient EXACT string lookup
EXACT string lookup. That is, I need
to be able to find ANY Unicode string exactly as it appears. I do not care
about language-specific modifications of the string. That is, if I search for a
string "run", I do not need to find "ran" but I do want to find it in all of
the
#x27;n' terms.
The only problem i see with this route is, i can't get the previous terms
!!!
1. Is there a way to get previous terms from TermEnum ?
2. Is there a better way to model Dictionary Type lookup in Lucene ?
Appreciate your suggestions ?
Thanks
Murali V
--
View this message
The Hits-based search API is optimized for returning earlier hits. If
you want the lowest-scoring matches, then you could reverse-sort the
hits, so that these are returned first. Or you could use the
TopDocs-based API to retrieve hits up to your "toHits". (Hits-based
search is implemented us
Howdy all,
I am having a performance issue. When I do a search for items,
getting more information takes a long time.
Ex. If there are 1M hits (I know, why look for that many or even allow
it, but let's say we return 1M hits). When the user wants to see the
last 25, it takes a LONG time
On 3/2/06, Larry Ogrodnek <[EMAIL PROTECTED]> wrote:
> I do like the idea of breaking on case, this would be especially great
> for finding interface implementations (searching for readers and
> writers, e.g.).
WordDelimiterFilter does this, but it's not in core lucene yet...
you'd have to get it
ostly because it adds a lot to the
results, and I couldn't quite convince myself that I'd really use a
method lookup (but, if you do break on case shifts, it might be more
useful).
Each document contains the classname, the fqcn, and package name. So I
just construct a BooleanQuery across all
Larry Ogrodnek wrote:
Hey, I put together a little ajax / lucene javadoc lookup site that I
just wanted to share I've found it pretty useful to be able to just
type a few letters instead of navigating through the standard javadoc
frames...
http://jdk.representqueens.com:9090/
Nice indeed.
I use IntelliJ for such things when I have it open, but when I don't I
have to click through the SVN repository (I'm normally looking for
source, not javadoc).
Could you add a link to the source as well?
-Yonik
-
To
On Mar 1, 2006, at 6:23 PM, Larry Ogrodnek wrote:
Hey, I put together a little ajax / lucene javadoc lookup site that I
just wanted to share I've found it pretty useful to be able to
just
type a few letters instead of navigating through the standard javadoc
frames...
http://jdk
That is neat... nice work.
On 02/03/2006, at 10:23 AM, Larry Ogrodnek wrote:
Hey, I put together a little ajax / lucene javadoc lookup site that I
just wanted to share I've found it pretty useful to be able to
just
type a few letters instead of navigating through the standard ja
Hey, I put together a little ajax / lucene javadoc lookup site that I
just wanted to share I've found it pretty useful to be able to just
type a few letters instead of navigating through the standard javadoc
frames...
http://jdk.representqueens.com:9090/s/jdk/
31 matches
Mail list logo
