Netzschleuder
network catalogue, repository and centrifuge
Problems with this dataset? Open an issue.
You may also take a look at the source code.
The network in this dataset can be loaded directly from graph-tool with:import graph_tool.all as gt g = gt.collection.ns["adjnoun"]
adjnoun — Word adjacencies of David Copperfield
- Description
A network of word adjacencies of common adjectives and nouns in the novel "David Copperfield" by Charles Dickens.1
- Tags
- Informational Language Unweighted
- Citation
-
- M.E.J. Newman, "Finding community structure in networks using the eigenvectors of matrices." Phys. Rev. E 74, 036104 (2006)., https://doi.org/10.1103/PhysRevE.74.036104 [@sci-hub]
- Upstream URL OK
- http://www-personal.umich.edu/~mejn/netdata/adjnoun.zip
- Networks
-
Tip: hover your mouse over a table header to obtain a legend.
Name Nodes Edges $\left<k\right>$ $\sigma_k$ $\lambda_h$ $\tau$ $r$ $c$ $\oslash$ $S$ Kind Mode NPs EPs gt GraphML GML csv adjnoun 112 425 7.59 6.85 11.54 2.27 -0.13 0.16 5 1.00 Undirected Unipartite label value 3 KiB 4 KiB 4 KiB 3 KiB - Ridiculograms
-