**Edinburgh Associative Thesaurus**

# Edinburgh Associative Thesaurus

## About this network

This is the Edinburgh Associative Thesaurus. Nodes are English words, and a directed link from A to B denotes that the word B was given as a response to the stimulus word A in user experiments. Multiple links are allowed, and the multiplicity of an edge denotes the number of times a word has been given as a response to another word. In some case, the given word itself was given as a response, leading to loops in the network.

## Network info

Code | EA |

Category | ⬤ Lexical |

Data source | http://vlado.fmf.uni-lj.si/pub/networks/data/dic/eat/Eat.htm |

Vertex type | Word |

Edge type | Association |

Format | Directed |

Edge weights | Multiple unweighted |

Metadata | Loop |

Size | 23,132 vertices (words) |

Volume | 511,764 edges (associations) |

Unique volume | 312,310 edges (associations) |

Average degree (overall) | 44.247 edges / vertex |

Fill | 0.00058366 edges / vertex^{2} |

Maximum degree | 1,076 edges |

Reciprocity | 9.57% |

Size of LCC | 23,132 vertices (network is connected) |

Size of LSCC | 7,751 vertices |

Wedge count | 30,388,904 |

Claw count | 2,967,734,991 |

Triangle count | 409,174 |

Square count | 16,682,968 |

4-tour count | 255,613,548 |

Power law exponent (estimated) with d_{min} | 3.2110 (d_{min} = 49) |

Gini coefficient | 69.7% |

Relative edge distribution entropy | 91.2% |

Assortativity | –0.047674 |

Clustering coefficient | 4.04% |

Diameter | 6 edges |

90-percentile effective diameter | 3.85 edges |

Mean shortest path length | 3.43 edges |

Spectral norm | 189.27 |

Algebraic connectivity | 0.96145 |

## Downloads

TSV file: | eat.tar.bz2 (1.11 MiB) |

Extraction code: | eat.tar.bz2 (14.38 KiB) |