Naive cooccurrence computation runs out of memory
The naive implementation creates a (n_l\times n_l)
array of int.
It is symmetric, so one could first, only compute half of the array.
It may contains lots of 0s, so one could avoid storing them.
Other improvements can be found in the following:
4___Implementation_Details.odt