:
http://people.apache.org/~digy/SingleCharAnalyzer.cs
DIGY
-Original Message-
From: Matthew Hall [mailto:mh...@informatics.jax.org]
Sent: Thursday, July 16, 2009 4:36 PM
To: java-user@lucene.apache.org
Subject: Re: Search in non-linguistic text
Assuming your dataset isn't incredibly
Assuming your dataset isn't incredibly large, I think you could.. cheat
here, and optimize your data for searching.
Am I correct in assuming that BC, should also match on ABCD?
If so, then yes your current thoughts on the problems that you face are
correct, and everything you do will be turnin
onal wildcards. I'm concerned that the
> performance of this will be disappointing, though.
>
> Any help would be much appreciated. Thanks!
>
> - Jes
> --
> View this message in context:
> http://www.nabble.com/Search-in-non-linguistic-te
t the
> performance of this will be disappointing, though.
>
> Any help would be much appreciated. Thanks!
>
> - Jes
> --
> View this message in context:
> http://www.nabble.com/Search-in-non-linguistic-text-tp24515936p24515936.html
> Sent from the Lucene - Java Users mailing
a "like '%blah%' search, with rules to treat all special
characters as single-character, optional wildcards. I'm concerned that the
performance of this will be disappointing, though.
Any help would be much appreciated. Thanks!
- Jes
--
View this message in context:
http://www.
