[
https://issues.apache.org/jira/browse/LUCENE-2507?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=12916763#action_12916763
]
Robert Muir commented on LUCENE-2507:
-------------------------------------
bq. Yes definitely. I was just checking that we weren't doing that at a cost of
reasonable suggestions. But your argument makes clear sense.
Well, aspell has some test data here: http://aspell.net/test/cur/batch0.tab
I could index some wikipedia, and run both spellcheckers?
Additionally I suppose it would be fair to run the correct answers from this
set, and see the results across both spellcheckers as far as spell-correcting
already correct words (and what they suggest if they do!)
> automaton spellchecker
> ----------------------
>
> Key: LUCENE-2507
> URL: https://issues.apache.org/jira/browse/LUCENE-2507
> Project: Lucene - Java
> Issue Type: New Feature
> Components: contrib/spellchecker
> Reporter: Robert Muir
> Assignee: Robert Muir
> Fix For: 4.0
>
> Attachments: LUCENE-2507.patch, LUCENE-2507.patch, LUCENE-2507.patch,
> LUCENE-2507.patch
>
>
> The current spellchecker makes an n-gram index of your terms, and queries
> this for spellchecking.
> The terms that come back from the n-gram query are then re-ranked by an
> algorithm such as Levenshtein.
> Alternatively, we could just do a levenshtein query directly against the
> index, then we wouldn't need
> a separate index to rebuild.
--
This message is automatically generated by JIRA.
-
You can reply to this email to add a comment to the issue online.
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
