lucene-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Robert Muir (Commented) (JIRA)" <>
Subject [jira] [Commented] (LUCENE-3714) add suggester that uses shortest path/wFST instead of buckets
Date Sun, 19 Feb 2012 17:04:34 GMT


Robert Muir commented on LUCENE-3714:

I ran the benchmarks, no measurable difference, makes it easy. Will commit 
the backport soon after ant test/javadocs with java5 are finished.
> add suggester that uses shortest path/wFST instead of buckets
> -------------------------------------------------------------
>                 Key: LUCENE-3714
>                 URL:
>             Project: Lucene - Java
>          Issue Type: New Feature
>          Components: modules/spellchecker
>            Reporter: Robert Muir
>         Attachments: LUCENE-3714.patch, LUCENE-3714.patch, LUCENE-3714.patch, LUCENE-3714.patch,
LUCENE-3714.patch, LUCENE-3714.patch,, out.png
> 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:!default.jspa
For more information on JIRA, see:


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

View raw message