NB This algorithm is of order O(n3) in time. Filling a large table can take a very long time. Furthermore, the normalisation algorithm is of order O(n4) in time. Large tables can take a very long time to normalise, and this can require a large quantity of memory.