[Haskell-beginners] Fwd: Implementing a spellchecker - problem with Data.HashTable performance

[Osager Prairie]

Hi:

Your post is very interesting.
I'm also a beginner so can not offer you much suggestions.
Only that I saw this book the other day and think it might be helpful for
you.

Computational Semantics with Functional
Programming<http://www.amazon.com/Computational-Semantics-Functional-Programming-Eijck/dp/0521760305>

This book use haskell as the programming language

Best regards

On Sun, Apr 22, 2012 at 4:58 PM, Radosław Szymczyszyn <lavrin at gmail.com>wrote:

> Thank you all for thoughts and suggestions. I've been tracking them as
> they appeared, but being busy with university assignments, couldn't
> try them out yet.
>
> In the meantime, however, Karol Samborski investigated the issue
> further and found the cause of poor performance -- somehow using
> HashTable.newHint doesn't play well with HashTable.update. Simply
> changing newHint to hint gives me execution time of about 12s (on my
> rather slowish AMD Fusion 1.6GHz laptop) with a dataset of ~1.35mln
> words.
>
> It's evidently a bug, as newHint would hardly be expected to slow
> things down. I'm yet to discover how to properly report it.
>
> Thanks again to all who responded and especially to Karol for solving
> the problem.
>
> Best regards,
> Radek Szymczyszyn
>
> _______________________________________________
> Beginners mailing list
> Beginners at haskell.org
> http://www.haskell.org/mailman/listinfo/beginners
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/beginners/attachments/20120423/b99f771c/attachment.htm>