Since the parser is running in a garbage-collected environment, it is hard to distinguish required memory from utilized memory.
unlike time and traversals which in practice can diverge, memory requirements match the number of edges in the chart almost exactly, since the large data structures are all proportional in size to the number of edges .