When dealing with word representations in a graph it became obvious that practically everything gets connected to everything. Each letter gets connected to each possible letter that followed it at least once. Such a dense structure imposes its limita...
