On Wed, Aug 5, 2009 at 10:51 AM, gwe...@gmail.com wrote:
(Full source attached; or alternately, grab it: darcs get
http://community.haskell.org/~gwern/hcorpus )
So I have this little program which hopefully will help me learn French by
Probably off-topic, but also, I'm willing to help anyone
-- based on http://jtauber.com/blog/2008/02/10/a_new_kind_of_graded_reader/
-- TODO: read knownwords from file
-- print out matching sentences as well (make optional)
-- fix performance; goal: handle Frank Herbert corpus in under 5 minutes
import Data.Ord
import Data.Char
-- based on http://jtauber.com/blog/2008/02/10/a_new_kind_of_graded_reader/
-- TODO: read knownwords from file
-- print out matching sentences as well (make optional)
-- fix performance; goal: handle Frank Herbert corpus in under 5 minutes
-- benchmark parallelism; is it gaining
Hi Gwern,
gwern0 wrote:
...efficiency is an issue.
Here are a few efficiency issues that I noticed in your algorithm
after a quick look (none of these have to do with Haskell really):
o ranks sorts the entire set, then discards all but the maximum.
It would be better to use maximum or
