Papers for

speech recognition developers

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Consonant importance to word understanding varies across languages and sounds

Quantifying Consonant Contributions to Word Intelligibility via Acoustic Masking

Abstract: Consonants contribute unequally to whether a word is understood. Given the limited time available for therapy, ranking consonants by contribution to intelligibility helps prioritize intervention targets in motor speech disorders. However, measuring this contribution relies on perceptual studies that are difficult to scale. This paper presents a scalable method that measures consonant contribution using acoustic masking. We silence one consonant at a time in an isolated word and test whether an automatic speech recognition (ASR) model still recognizes the word. We define a consonant's contribution score as the proportion of its masked instances for which the word becomes misrecognized, which we refer to as the mask-induced misrecognition rate (MMR). We validate MMR against two linguistic factors previously reported to correlate with consonant contribution, namely phoneme frequency and functional load. We apply this analysis across four languages, English, Spanish, German, and Czech, using three ASR architectures, MMS (encoder-only), Whisper (encoder-decoder), and Qwen3-ASR (LLM-based). Using partial Spearman correlations, we find that phoneme frequency correlates negatively with MMR while functional load correlates positively. In other words, more frequent consonants are less disruptive when masked, whereas consonants carrying more lexical contrast are more disruptive. Further cross-language analysis shows that consonant rankings are not consistent, indicating that consonant contribution is language-dependent.

Thu 10 SeptComputation and Language
The gist
Not all consonant sounds contribute equally to how well we understand spoken words. The authors developed a way to measure how much each consonant matters by digitally silencing one sound at a time and seeing if speech recognition software still gets the word right. They found that common consonants tend to be less critical, while those that make bigger differences between words are more important. This varies across languages, meaning the impact of each consonant depends on the language spoken.
Open 2609.12122v1

ZipCodec compresses speech using ultra-low frame rate and bitrate

ZipCodec: Ultra-Low-Frame-Rate Streaming Speech Coding

Abstract: Neural audio codecs are a fundamental component of modern speech generation systems. While recent codecs achieve increasingly low bitrates, reducing frame rate remains challenging, as each token must preserve more information while maintaining reconstruction quality. We present ZipCodec, a streaming neural speech codec operating at 6.25 Hz and 0.80 kbps with a theoretical latency of 160 ms. Our approach combines large-scale WavLM distillation with a redesigned transformer-based architecture, a scalar spherical quantizer, and a latency-aware streaming decoder. Experiments show that ZipCodec substantially outperforms existing streaming codecs at comparable bitrates in both reconstruction and downstream tasks, while operating at a significantly lower frame rate. Despite its 842M parameters, ZipCodec achieves real-time single-stream inference on a consumer-grade CPU. Demo samples, code and checkpoints are available at https://lucadellalib.github.io/zipcodec-web/.

Thu 10 SeptSoundArtificial IntelligenceMachine Learning
The gist
Compressing speech for streaming usually requires sending many small pieces quickly, which is hard to do well at very low frame rates. The authors present ZipCodec, a new technology that sends fewer pieces of speech data per second while keeping sound quality good enough to understand. They built ZipCodec using advanced methods like a special transformer design and clever data compression techniques. ZipCodec works fast enough to run in real time on regular computers and is better than other tools at similar data rates.
Open 2609.11642v1

Speech models encode word identity beyond phonemes in later layers

Do speech foundation models really learn words?

Abstract: Self-supervised speech foundation models are now used in a wide array of downstream applications, including traditional speech recognition and as the basis for tokens in speech-aware language models. Attempts to understand their usefulness have largely focused on probing their representations' ability to discriminate phonemes and words. However, discriminative ability for words need not imply specialized representation of words per se. Good discrimination of words may be explained by good encoding of word form (phonemes) rather than form-independent word representations encoding identity or syntactic/semantic properties. By partialling out phoneme information using residualization, we show that, in later layers, HuBERT and wav2vec 2.0 do in general learn representations which encode words with reasonable fidelity independently of local phonetic content. We show that this simple approach to disentanglement can enhance higher-order linguistic information in word discovery tasks.

Wed 9 SeptComputation and LanguageSound
The gist
Speech models like HuBERT and wav2vec 2.0 can recognize individual words, but this could just mean they identify sounds rather than the words themselves. The authors found that these models do actually learn representations of whole words that are separate from the sounds they contain, especially in later layers of the model. They used a method to remove the influence of phonemes and showed that the models still keep important word information. This helps improve tasks that try to find words in speech based on meaning and structure, not just sound.
Open 2609.10434v1

Speech to text becomes more reliable across different noisy settings

NOPE-HYPE: A Structured Simulation Workflow for Robust Speech-to-Text Across Diverse Acoustic Environments

Abstract: Robust speech-to-text translation systems should perform reliably across diverse acoustic conditions, yet practical pipelines lack controllable tools for systematic environment exploration. Large speech models remain sensitive to unseen acoustic conditions, as training data rarely cover the full range of real environments.We present NOPEHYPE, a structured training workflow that combines a controllable environment simulator, coverage-optimal environment reduction on Power Spectral Density (PSD) templates, and a small, interpretable hyperparameter search over simulator knobs. We show that simulator-generated noise achieves performance comparable to balanced realnoise training across Whisper and SeamlessM4T models, provide principled environment prototype sets, and identify practical default simulator configurations from a structured 27-run hyperparameter sweep.

Wed 9 SeptSoundArtificial IntelligenceComputation and Language
The gist
Speech-to-text systems often struggle to understand speech in different noisy places because they haven’t trained on every kind of background noise. The authors created a new way to simulate various acoustic environments so that these systems can be trained more effectively. Their method uses a controlled noise simulator and tests a few settings to find good defaults. They showed that training with simulated noise performs as well as training with real noisy recordings on popular speech models. This makes speech recognition more robust in many different real-world noises.
Open 2609.10058v1

Recurrent models improved to handle much longer sequence lengths

Learning Length-Extrapolatable Recurrent Models

Abstract: Recurrent models provide a natural path to long-context modeling, yet models trained with backpropagation through time (BPTT) often fail beyond their training horizon. Classical analyses emphasize gradients that vanish or explode along temporal paths. However, dense per-token losses can still train a shared recurrent rule despite severe decay, showing that decay alone does not determine whether learning fails. We instead study state credit: the signal through which future losses reach earlier recurrent states before contributing to parameter updates. Accordingly, we intervene directly on state credit and propose Credit Stabilization through Time (CST). During backward propagation, CST locally rescales the state-credit signal to stabilize its norm without rotating the component being corrected, while leaving the forward computation unchanged. Because controlled synthetic tasks and real data exhibit different credit dynamics, we specialize CST to each regime. In both settings, CST improves performance beyond the training horizon, with gains observed at up to 128x the training length.

Tue 8 SeptMachine LearningComputation and Language
The gist
Recurrent neural networks struggle to learn from sequences longer than they were trained on. The authors found that the usual ideas about gradient decay don’t fully explain this problem. Instead, they focused on how feedback signals are passed back in time to earlier states, calling this 'state credit.' They introduced a technique that stabilizes these feedback signals during training, without changing how the model processes data forward. This method helps the models perform better on sequences up to 128 times longer than they saw during training.
Open 2609.09157v1