Apache
/
lucene
mirror of https://github.com/apache/lucene.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

LUCENE-3662: add note 

git-svn-id: https://svn.apache.org/repos/asf/lucene/dev/trunk@1224823 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
Robert Muir 2011-12-26 21:36:16 +00:00
parent b096910a82
commit 7c7c7bd077
1 changed files with 6 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
modules/suggest/src/java/org/apache/lucene/search/spell/LuceneLevenshteinDistance.java
View File

@ -45,6 +45,12 @@ public final class LuceneLevenshteinDistance implements StringDistance {
IntsRef otherPoints; IntsRef otherPoints;
int n; int n;
int d[][]; // cost array int d[][]; // cost array
// NOTE: if we cared, we could 3*m space instead of m*n space, similar to
// what LevenshteinDistance does, except cycling thru a ring of three
// horizontal cost arrays... but this comparator is never actually used by
// DirectSpellChecker, its only used for merging results from multiple shards
// in "distributed spellcheck", and its inefficient in other ways too...
// cheaper to do this up front once // cheaper to do this up front once
targetPoints = toIntsRef(target); targetPoints = toIntsRef(target);