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.
|Assignee||Robert Muir [ rcmuir ]|
|Status||Open [ 1 ]||Resolved [ 5 ]|
|Resolution||Fixed [ 1 ]|
|Workflow||jira [ 12513934 ]||Default workflow, editable Closed status [ 12564270 ]|
|Workflow||Default workflow, editable Closed status [ 12564270 ]||jira [ 12584089 ]|
|Status||Resolved [ 5 ]||Closed [ 6 ]|