[Haskell-cafe] Digrams

I've quickly put this together to measure frequencies of pairs of letters (e.g. 1st and 2nd) in words. It works fine on a small test data sets but I have a feeling that it will perform poorly as it spends a lot of time updating a 26*26 array. Before I throw a dictionary at it, does anyone have any suggestions? Thanks, Dominic.