Speech perception: a model of word recognition
arXiv:2410.18590 · doi:10.1140/epjb/s10051-025-00882-w
Abstract
We present a model of speech perception which takes into account effects of correlations between sounds. Words in this model correspond to the attractors of a suitably chosen descent dynamics. The resulting lexicon is rich in short words, and much less so in longer ones, as befits a reasonable word length distribution. We separately examine the decryption of short and long words in the presence of mishearings. In the regime of short words, the algorithm either quickly retrieves a word, or proposes another valid word. In the regime of longer words, the behaviour is markedly different. While the successful decryption of words continues to be relatively fast, there is a finite probability of getting lost permanently, as the algorithm wanders round the landscape of suitable words without ever settling on one.
arXiv comment22 pages, 19 figures, 1 table
References in corpus (9)
- Statistical physics of inference: Thresholds and algorithms
- General non-existence theorem for phase transitions in one-dimensional systems with short range interactions, and physical examples of such transitions
- Probability distribution of magnetization in the one-dimensional Ising model: Effects of boundary conditions
- Metastable States in Spin Glasses and Disordered Ferromagnets
- Domain-wall excitations in the two-dimensional Ising spin glass
- Dynamical diversity and metastability in a hindered granular column near jamming
- Jamming and metastability in one dimension: from the kinetically constrained Ising chain to the Riviera model
- The effects of grain shape and frustration in a granular column near jamming
- Hearings and mishearings: decrypting the spoken word