word_assoc — Edinburgh word associations (1968-1971)
- Description
A network of word associations from the Edinburgh Associative Thesaurus (EAT), a set of empirical word association norms collected by George Kiss and collaborators between June 1968 and May 1971. Subjects, mostly undergraduates from a wide range of British universities (aged 17 to 22), were shown a stimulus word and asked to give the first word that came to mind. Each stimulus word was presented to 100 different subjects, each of whom received 100 words. The network was grown from a nucleus set of words: the responses to these were used as new stimuli, and so on, about three times, until 8,400 stimulus words had been used. The data were obtained from the version of the EAT distributed by the Rutherford Appleton Laboratory (derived from the MRC Psycholinguistic Database version), from its stimulus–response file.
Nodes are words (or short phrases, as given by the subjects; words longer than 19 characters were truncated, with a
%as 20th character; the empty word represents blank responses), and a directed edge points from a stimulus word to a response given to it. The file contains 8,210 stimuli; the last line of the file lists a response without its stimulus word, and is ignored. Self-loops denote stimulus words given as their own response.The network has the following properties:
- (Node)
name: the word. - (Node)
stimulus: whether the word was used as a stimulus. - (Edge)
count: the number of subjects who gave the response to the stimulus.
- (Node)
- Tags
- Informational Language Weighted Metadata
- Added
- 2020-08-11
- Citation
-
- G. R. Kiss, C. Armstrong, R. Milroy, J. Piper, "An associative thesaurus of English and its computer analysis." In A. J. Aitken, R. W. Bailey, N. Hamilton-Smith (Eds.), The Computer and Literary Studies, 153-165. Edinburgh University Press (1973) web.archive.org
- Upstream URL OK
- https://web.archive.org/web/20111228191351/http://www.eat.rl.ac.uk/
- Networks
-
Tip: hover over a column header for a description.
Column legend
- $\left<k\right>$
- Mean degree
- $\sigma_k$
- Standard deviation of the degrees
- $\lambda_h$
- Largest eigenvalue of the Hashimoto (non-backtracking) matrix
- $\tau$
- Random walk mixing time
- $r$
- Degree assortativity
- $c$
- Global clustering coefficient
- $\oslash$
- (Pseudo-) diameter
- $S$
- Relative size of the largest component
- NPs
- Node properties
- EPs
- Edge properties
- Ridiculograms*
-