Patterns in syntactic dependency networks from authored and randomised texts

摘要: The syntactic relationships between words allow a communicator to express virtually endless array of thoughts by finite set elements. co-occurrence in sentence reflects the dependency words, and can be represented as directed graph. In this account we compiled grammar networks 86 texts from 11 well known English authors. an analysis common specific features these try attribute network properties individual A pointwise defined measure shows no significant groups which could identified with Further, comparison randomized versions same systematic, but very small difference constructed for originals randomisations, respectively. This suggests, that scale-free world-like nature explained underlying regularity word frequency distribution, Zipf’s law. stochastic model, allows construction arbitrary distributions, illustrates idea.