lucene-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Andrzej Bialecki (JIRA)" <>
Subject [jira] [Commented] (SOLR-2378) FST-based Lookup (suggestions) for prefix matches.
Date Thu, 31 Mar 2011 11:45:05 GMT


Andrzej Bialecki  commented on SOLR-2378:

bq. I see TSTLookup and JaspellLookup (Andrzej, will you confirm, please?) sorts matches in
a priority queue by their associated value (frequency I guess)

Correct. I agree that the name is so-so, I inherited it from the spellchecker API - feel free
to change it.

bq. the Dictionary can come from various sources, ...

Yes. This is again a legacy of the Lucene SpellChecker API. I tried to extend this API in
Solr without changing it in Lucene (see the *IteratorWrapper classes and TermFreqIterator)
but ultimately it would be better to refactor this.

> FST-based Lookup (suggestions) for prefix matches.
> --------------------------------------------------
>                 Key: SOLR-2378
>                 URL:
>             Project: Solr
>          Issue Type: New Feature
>          Components: spellchecker
>            Reporter: Dawid Weiss
>            Assignee: Dawid Weiss
>              Labels: lookup, prefix
>             Fix For: 4.0
> Implement a subclass of Lookup based on finite state automata/ transducers (Lucene FST
package). This issue is for implementing a relatively basic prefix matcher, we will handle
infixes and other types of input matches gradually.

This message is automatically generated by JIRA.
For more information on JIRA, see:

To unsubscribe, e-mail:
For additional commands, e-mail:

View raw message