Open-access network science: Investigating phonological similarity networks based on the SUBTLEX-US lexicon

Network science tools are becoming increasingly important to psycholinguistics, but few open-access data sets exist for exploring network properties of even well-studied languages like English. We constructed several phonological similarity networks (neighbors differ in exactly one consonant or vowel phoneme) using words from a lexicon based on the SUBTLEX-US English corpus, distinguishing networks by size and word representation (i.e., lemma vs. word form). The resulting networks are shown to exhibit many familiar characteristics, including small-world properties, broad degree distributions, and robustness to node removal, regardless of network size and word representation. We also validated the SUBTLEX phonological networks by showing that they exhibit contrasts in degree and clustering coefficient comparable to the same contrasts found in prior studies and exhibit familiar trends after extraction of a backbone network of nodes important to network centrality. The data release ( https://github.com/aldo-git-bit/phonological-similarity-networks-SUBTLEX ) includes 17 adjacency lists that can be further explored using the networkX package in Python, a package of files for building new adjacency lists from scratch, and several scripts that allow users to analyze and extend these results.

Authors

Institutions

Publication Details

Journal
Behavior Research Methods
Published
2025-02-18
DOI
https://doi.org/10.3758/s13428-025-02610-9
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Open-access network science: Investigating phonological similarity networks based on the SUBTLEX-US lexicon

S. E. Mann, John Alderete, Paul Tupper
Behavior Research Methods
Complex Network Analysis Techniques
article

Open-access network science: Investigating phonological similarity networks based on the SUBTLEX-US lexicon

S. E. Mann, John Alderete, Paul Tupper
article en

Abstract

Network science tools are becoming increasingly important to psycholinguistics, but few open-access data sets exist for exploring network properties of even well-studied languages like English. We constructed several phonological similarity networks (neighbors differ in exactly one consonant or vowel phoneme) using words from a lexicon based on the SUBTLEX-US English corpus, distinguishing networks by size and word representation (i.e., lemma vs. word form). The resulting networks are shown to exhibit many familiar characteristics, including small-world properties, broad degree distributions, and robustness to node removal, regardless of network size and word representation. We also validated the SUBTLEX phonological networks by showing that they exhibit contrasts in degree and clustering coefficient comparable to the same contrasts found in prior studies and exhibit familiar trends after extraction of a backbone network of nodes important to network centrality. The data release ( https://github.com/aldo-git-bit/phonological-similarity-networks-SUBTLEX ) includes 17 adjacency lists that can be further explored using the networkX package in Python, a package of files for building new adjacency lists from scratch, and several scripts that allow users to analyze and extend these results.

Behavior Research MethodsVol. 57(3)
Simon Fraser University (CA), Université Bourgogne Franche-Comté (FR)
Quality Education
Openalex Percentile: Top 97%
Complex Network Analysis Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.