Re: Solr 4.0 Levenshtein distance algorithm for DirectSpellChecker

2011-11-29 Thread Robert Muir
On Tue, Nov 29, 2011 at 9:21 AM, elisabeth benoit wrote: > ok, thanks. > > I think it would be a nice improvment to consider inversion as distance = > 1, since it's a so common mistake. The distance = 2 makes it difficult to > correct transpositions on small words (for instance, the DirectSpellChe

Re: Solr 4.0 Levenshtein distance algorithm for DirectSpellChecker

2011-11-29 Thread elisabeth benoit
ok, thanks. I think it would be a nice improvment to consider inversion as distance = 1, since it's a so common mistake. The distance = 2 makes it difficult to correct transpositions on small words (for instance, the DirectSpellChecker couldn't make the right suggestion for "joile" given for 'joli

Re: Solr 4.0 Levenshtein distance algorithm for DirectSpellChecker

2011-11-29 Thread Robert Muir
On Tue, Nov 29, 2011 at 8:07 AM, elisabeth benoit 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 a

Solr 4.0 Levenshtein distance algorithm for DirectSpellChecker

2011-11-29 Thread elisabeth benoit
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? Thanks, Elisabeth