The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
What Can Graph Theory Tell Us About Word Learning and Lexical Retrieval?
Open accessAbstract
Purpose: Graph theory and the new science of networks provide a mathematically rigorous approach to examine the development and organization of complex systems. These tools were applied to the mental lexicon to examine the organization of words in the lexicon and to explore how that structure might influence the acquisition and retrieval of phonological word-forms. Method: Pajek, a program for large network analysis and visualization (V. Batagelj & A. Mvrar, 1998), was used to examine several characteristics of a network derived from a computerized database of the adult lexicon. Nodes in the network represented words, and a link connected two nodes if the words were phonological neighbors. Results: The average path length and clustering coefficient suggest that the phonological network exhibits small-world characteristics. The degree distribution was fit better by an exponential rather than a power-law function. Finally, the network exhibited assortative mixing by degree. Some of these structural characteristics were also found in graphs that were formed by 2 simple stochastic processes suggesting that similar processes might influence the development of the lexicon. Conclusions: The graph theoretic perspective may provide novel insights about the mental lexicon and lead to future studies that help us better understand language development and processing.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
Classes of small-world networks
Amaral, L. A. N., Scala, A., Barthélémy, M., & Stanley, H. E. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.200327197 · Cited by 3,051
Rethinking Innateness: A Connectionist Perspective on Development
Elman, J., Bates, E., Johnson, M. H., Karmiloff-Smith, A., Parisi, D., & Plunkett, K. (1996) · doi:10.7551/mitpress/5929.001.0001 · Cited by 1,511
Cited by
Investigating the structure of semantic networks in low and high creative persons
Kenett, Y. N., Anaki, D., & Faust, M. (2014) · Frontiers in Human Neuroscience · doi:10.3389/fnhum.2014.00407 · Cited by 392
Baronchelli, A., Ferrer-i-Cancho, R., Pastor-Satorras, R., Chater, N., & Christiansen, M. H. (2013) · Trends in Cognitive Sciences · doi:10.1016/j.tics.2013.04.010 · Cited by 333
Siew, C. S. Q., Wulff, D. U., Beckage, N. M., & Kenett, Y. N. (2019) · Complexity · doi:10.1155/2019/2108423 · Cited by 325
Approaching human language with complex networks
Cong, J., & Liu, H. (2014) · Physics of Life Reviews · doi:10.1016/j.plrev.2014.04.004 · Cited by 212
When pumpkin is closer to onion than to squash: the structure of the second language lexicon
Borodkin, K., Kenett, Y. N., Faust, M., & Mashal, N. (2016) · Cognition · doi:10.1016/j.cognition.2016.07.014 · Cited by 112
Metadata
- Authors
- Vitevitch, M. S.
- Venue
- Journal of Speech, Language, and Hearing Research
- Published
- 2008-04
- Volume
- 51
- Issue
- 2
- Pages
- 408-422
- ISSN
- 1092-4388 (ISSN-L)
- 1558-9102
- DOI
- 10.1044/1092-4388(2008/030
- OpenAlex
- W2074079067
- Cited by
- 304
- References
- 4
- FWCI
- 15.69
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: What Can Graph Theory Tell Us About Word Learning and Lexical Retrieval? https://app.cochat.ai/papers/10.1044/1092-4388(2008/030
- The paper
- Vitevitch, M. S. (2008). What Can Graph Theory Tell Us About Word Learning and Lexical Retrieval? Journal of Speech, Language, and Hearing Research. https://doi.org/10.1044/1092-4388(2008/030
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.