The lexical restructuring hypothesis and graph theoretic analyses of networks based on random lexicons

Thomas M. Gruenenfelder, David Pisoni

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

Purpose: 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? Method: 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. Conclusion: 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.

Original languageEnglish
Pages (from-to)596-609
Number of pages14
JournalJournal of Speech, Language, and Hearing Research
Volume52
Issue number3
DOIs
StatePublished - Jun 1 2009

Fingerprint

Phonetics
Islands
restructuring
phonetics
Growth
Cluster Analysis
Language
language acquisition
appeal
Lexicon
Graph

Keywords

  • Complex systems
  • Graph theory
  • Lexical restructuring
  • Mental lexicon
  • Spoken word recognition

ASJC Scopus subject areas

  • Speech and Hearing

Cite this

The lexical restructuring hypothesis and graph theoretic analyses of networks based on random lexicons. / Gruenenfelder, Thomas M.; Pisoni, David.

In: Journal of Speech, Language, and Hearing Research, Vol. 52, No. 3, 01.06.2009, p. 596-609.

Research output: Contribution to journalArticle

@article{1d04531da3184923b8502684e1a8e512,
title = "The lexical restructuring hypothesis and graph theoretic analyses of networks based on random lexicons",
abstract = "Purpose: 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? Method: 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. Conclusion: 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.",
keywords = "Complex systems, Graph theory, Lexical restructuring, Mental lexicon, Spoken word recognition",
author = "Gruenenfelder, {Thomas M.} and David Pisoni",
year = "2009",
month = "6",
day = "1",
doi = "10.1044/1092-4388(2009/08-0004)",
language = "English",
volume = "52",
pages = "596--609",
journal = "Journal of Speech, Language, and Hearing Research",
issn = "1092-4388",
publisher = "American Speech-Language-Hearing Association (ASHA)",
number = "3",

}

TY - JOUR

T1 - The lexical restructuring hypothesis and graph theoretic analyses of networks based on random lexicons

AU - Gruenenfelder, Thomas M.

AU - Pisoni, David

PY - 2009/6/1

Y1 - 2009/6/1

N2 - Purpose: 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? Method: 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. Conclusion: 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.

AB - Purpose: 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? Method: 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. Conclusion: 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.

KW - Complex systems

KW - Graph theory

KW - Lexical restructuring

KW - Mental lexicon

KW - Spoken word recognition

UR - http://www.scopus.com/inward/record.url?scp=66649138056&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=66649138056&partnerID=8YFLogxK

U2 - 10.1044/1092-4388(2009/08-0004)

DO - 10.1044/1092-4388(2009/08-0004)

M3 - Article

VL - 52

SP - 596

EP - 609

JO - Journal of Speech, Language, and Hearing Research

JF - Journal of Speech, Language, and Hearing Research

SN - 1092-4388

IS - 3

ER -