title: The lexical restructuring hypothesis and graph theoretic analyses of networks based on random lexicons.
abstract: OBJECTIVE
  The mental lexicon of words used for spoken word recognition has been modeled as a complex network or graph. Do the characteristics of that graph reflect processes involved in its growth (M. S. Vitevitch, 2008) or simply the phonetic overlap between similar-sounding words?
  
  
  METHODS
  Three pseudolexicons were generated by randomly selecting phonological segments from a fixed set. Each lexicon was then modeled as a graph, linking words differing by one segment. The properties of those graphs were compared with those of a graph based on real English words.
  
  
  RESULTS
  The properties of the graphs built from the pseudolexicons matched the properties of the graph based on English words. Each graph consisted of a single large island and a number of smaller islands and hermits. The degree distribution of each graph was better fit by an exponential than by a power function. Each graph showed short path lengths, large clustering coefficients, and positive assortative mixing.
  
  
  CONCLUSIONS
  The results suggest that there is no need to appeal to processes of growth or language acquisition to explain the formal properties of the network structure of the mental lexicon. These properties emerged because the network was built based on the phonetic overlap of words.
authors.affiliation: Department of Psychological and Brain Sciences, Indiana University, 1101 East 10th Street, Bloomington, IN 47405, USA. tgruenen@indiana.edu
authors.forename: Thomas M
authors.initials: TM
authors.lastname: Gruenenfelder
authors.forename: David B
authors.initials: DB
authors.lastname: Pisoni
mesh_terms: D016000:Cluster Analysis; D003198:Computer Simulation; D006801:Humans; D007804:Language Development; D008960:Models, Psychological; D010700:Phonetics; D014825:Vocabulary