Copyright | (c) Sean Gillespie, 2015 |
---|---|
License | OtherLicense |
Maintainer | Sean Gillespie <sean@mistersg.net> |
Stability | Experimental |
Safe Haskell | Safe-Inferred |
Language | Haskell2010 |
Generate a letter frequency trigraph, based on a dictionary
- findFrequency :: String -> Maybe [Rational]
- frequencies :: [(String, [Rational])]
Documentation
findFrequency :: String -> Maybe [Rational] Source
Search for the character frequencies based on the first a two-letter string
frequencies :: [(String, [Rational])] Source
A map of character frequencies, based on a dictionary. The key is a two-letter string, and the value is a list of probabilities (a-z). It's form is:
[("aa", [2,0,3,0,0,0,1,0,0,0,0,1,1,1,0,0,0,3,2,0,0,0,0,0,0,0]), ... ("zz", [7,0,0,0,1,0,0,0,7,0,0,17,0,0,2,0,0,0,0,0,0,0,1,0,5,0])]