On Tue, Nov 29, 2011 at 8:07 AM, elisabeth benoit <elisaelisael...@gmail.com> wrote: > Hello, > > I'd like to know if the Levensthein distance algorithm used by Solr 4.0 > DirectSpellChecker (working quite well I must say) is considering an > inversion as distance = 1 or distance = 2? > > For instance, if I write Monteruil and I meant Montreuil, is the distance 1 > or 2? >
the algorithm is just levenshtein, so 2. its possible to also support a modified form where transpositions count as 1, but its not implemented. -- lucidimagination.com
