[SOLR-2378] FST-based Lookup (suggestions) for prefix matches.

• Type: New Feature
• Status: Closed
• Priority: Major
• Resolution: Fixed
• Fix Version/s: 3.3, 4.0-ALPHA
• Component/s: spellchecker
• Labels: lookup prefix
• Assignee: Dawid Weiss
• Reporter: Dawid Weiss
• Created: 22/Feb/11 09:01
• Updated: 02/Jul/11 02:43
• Resolved: 14/Apr/11 11:15

Description

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. Impl. phases:

• write a DFA based suggester effectively identical to ternary tree based solution right now,
• baseline benchmark against tern. tree (memory consumption, rebuilding speed, indexing speed; reuse Andrzej's benchmark code)
• modify DFA to encode term weights directly in the automaton (optimize for onlyMostPopular case)
• benchmark again
• benchmark again
• modify the tutorial on the wiki http://wiki.apache.org/solr/Suggester

Issue Links

• is related to: SOLR-1316 Create autosuggest component
• is related to: LUCENE-3011 FST serialization and deserialization from plain DataInput/DataOutput streams.
• relates to: LUCENE-2995 factor out a shared spellchecking module