I saw Michael Sparks's very interesting dissection of Peter Norvig's Spell Checker at the SO DevDays in London and it got me wondering if anyone has attempted to implement this piece of code in another language, say Perl or maybe C++?
There's a list of implementations in other languages at the end of the article, including one in Perl.
I did this presentation at the Boston DevDays, and I'm kind of disappointed how people focus on the number of lines of code. For example, the C# implementation has a low line count also, but I can't see the algorithm at all for all the noise words in the code.
The point I was emphasizing in the presentation was Python's noise-free nature that let me express an algorithm without a lot of throat-clearing and compiler-consoling.
I understand that people will disagree on that point, though, and that there's a bit of "no accounting for taste" involved here.
Uh, I did it as an exercise. Had to use hashes instead of them nifty dict objects; yep, it is a little cumbersome, but not that much.