add suggester that uses shortest path/wFST instead of buckets
-------------------------------------------------------------
Key: LUCENE-3714
URL: https://issues.apache.org/jira/browse/LUCENE-3714
Project: Lucene - Java
Issue Type: New Feature
Components: modules/spellchecker
Reporter: Robert Muir
Currently the FST suggester (really an FSA) quantizes weights into buckets
(e.g. single byte) and puts them in front of the word.
This makes it fast, but you lose granularity in your suggestions.
Lately the question was raised, if you build lucene's FST with
positiveintoutputs, does it behave the same as a tropical semiring wFST?
In other words, after completing the word, we instead traverse min(output) at
each node to find the 'shortest path' to the
best suggestion (with the highest score).
This means we wouldnt need to quantize weights at all and it might make some
operations (e.g. adding fuzzy matching etc) a lot easier.
--
This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators:
https://issues.apache.org/jira/secure/ContactAdministrators!default.jspa
For more information on JIRA, see: http://www.atlassian.com/software/jira
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
