Graph-theoretic Properties of the Class of Phonological Neighbourhood Networks

Rory Turnbull


Abstract
This paper concerns the structure of phonological neighbourhood networks, which are a graph-theoretic representation of the phonological lexicon. These networks represent each word as a node and links are placed between words which are phonological neighbours, usually defined as a string edit distance of one. Phonological neighbourhood networks have been used to study many aspects of the mental lexicon and psycholinguistic theories of speech production and perception. This paper offers preliminary graph-theoretic observations about phonological neighbourhood networks considered as a class. To aid this exploration, this paper introduces the concept of the hyperlexicon, the network consisting of all possible words for a given symbol set and their neighbourhood relations. The construction of the hyperlexicon is discussed, and basic properties are derived. This work is among the first to directly address the nature of phonological neighbourhood networks from an analytic perspective.
Anthology ID:
2021.cmcl-1.27
Volume:
Proceedings of the Workshop on Cognitive Modeling and Computational Linguistics
Month:
June
Year:
2021
Address:
Online
Venue:
CMCL
SIG:
Publisher:
Association for Computational Linguistics
Note:
Pages:
233–240
Language:
URL:
https://aclanthology.org/2021.cmcl-1.27
DOI:
10.18653/v1/2021.cmcl-1.27
Bibkey:
Cite (ACL):
Rory Turnbull. 2021. Graph-theoretic Properties of the Class of Phonological Neighbourhood Networks. In Proceedings of the Workshop on Cognitive Modeling and Computational Linguistics, pages 233–240, Online. Association for Computational Linguistics.
Cite (Informal):
Graph-theoretic Properties of the Class of Phonological Neighbourhood Networks (Turnbull, CMCL 2021)
Copy Citation:
PDF:
https://preview.aclanthology.org/ingestion-script-update/2021.cmcl-1.27.pdf