Hi,
Thanks for the suggestions! It looks like the MemoryIndex is worth having a
detailed look at, so that's what I'll start on.
Thanks again, bye,
Jaco.
2009/4/17 Steven A Rowe
> Hi Jaco,
>
> On 4/9/2009 at 2:58 PM, Jaco wrote:
> > I'm struggling with some ideas, maybe somebody can help me w
Hi Jaco,
On 4/9/2009 at 2:58 PM, Jaco wrote:
> I'm struggling with some ideas, maybe somebody can help me with past
> experiences or tips. I have loaded a dictionary into a Solr index,
> using stemming and some stopwords in analysis part of the schema.
> Each record holds a term from the dictionar
On Fri, Apr 17, 2009 at 3:37 AM, Chris Hostetter
wrote:
>
> this is a pretty hard problem in general ... in my mind i call it the
> "longest matching sub-phrase" problem, but i have no idea if it has a real
> name.
>
> the only solution i know of using Lucene is to construct a phrase query
> for
: For instance, my dictionary holds the following terms:
: 1 - a b c d
: 2 - c d e
: 3 - a b
: 4 - a e f g h
:
: If I put the sentence [a b c d f g h] in as a query, I want to recieve
: dictionary items 1 (matching all words a b c d) and 3 (matching words a b)
: as matches
this is a pretty hard
