[Haskell-cafe] Spelling checker exercise

[Eduard Sergeev]

Daniel Fischer-4 wrote:
> 
> But that's the point, these checks aren't unnecessary (unless the word 
> under inspection is known). You want to propose the most likely correct 
> word.

I just wanted to rewrite original Nornig's Python code in Haskell :) (maybe
I misunderstood the algorithm?). Of course it is far from being able to
produce 'most likely correct' result.

Btw, where can I find the source for this super-fast 'nLDBSWSpelling'
variant?

-- 
View this message in context: http://old.nabble.com/Spelling-checker-exercise-tp27269320p27324740.html
Sent from the Haskell - Haskell-Cafe mailing list archive at Nabble.com.