Organizations: MoE Key Lab of Artificial Intelligence, AI Institute, X-LANCE Lab, Shanghai Jiao Tong University · School of Intelligence Science and Technology, Nanjing University, Suzhou, China
Prompt-based contextual ASR requires selecting a compact hotword subset from large dynamic inventories, yet existing pre-selection methods rely either on discrete ASR hypotheses that may discard acoustic evidence or on separately trained retrieval models. We propose Viterbi-guided Selection of Hotwords (VISH), a training-free, plug-and-play framework that directly verifies candidate-specific acoustic support over frame-level CTC posteriors. VISH formulates pre-selection as constrained posterior search; M-VISH makes large-list verification scalable through frame-synchronous shared-prefix Viterbi search with bounded top-K pruning, while Bi-MVISH exploits complementary backward evidence for robust verification. Across five benchmarks, M-VISH achieves up to 11.7% absolute improvement in Best-F1 over a strong learned-retrieval baseline and reduces candidate-search latency by 75.2% at 2,000 candidates relative to hypothesis-based filtering. These results demonstrate the effectiveness of posterior-level verification for accurate and scalable hotword pre-selection without additional model training.
Figures & tables
Figure 1: Overview of VISH and the M-VISH search procedure. (a) VISH verifies candidate hotwords using internal or external CTC posteriors and selects a compact subset for contextual prompting without modifying the downstream ASR model. (b) A shared-prefix trie organizes candidate CTC-token sequences to reuse Viterbi computations across candidates. (c) At each retained frame, M-VISH updates constrained Viterbi scores, retains the top- Kp active prefixes, and records scores at terminal nodes for scalable large-list verification. Here, pt(k) denotes the CTC posterior of token k at frame t , and ℓ denotes the trie depth.
Method
STOP1
STOP2
A1-NE
L-clean-2k
L-other-2k
GLCLAP [ 15 ]
–
–
97.0
–
–
CLAR [ 11 ]
–
–
97.0
–
–
GLCLAP [ 15 ] ∗
80.5
81.2
96.6
90.5
82.4
M-VISH
83.1
92.9
97.5
94.4
87.7
Bi-MVISH
83.1
93.8
97.6
95.3
88.8
Table 1: Hotword pre-selection performance. Best-F1 (%) across five benchmarks. A1-NE denotes AISHELL-1-NE; L-clean-2k and L-other-2k denote LibriSpeech test-clean and test-other with 2,000 candidate hotwords, respectively. ∗ denotes our reproduced results; “–” indicates unreported results. Best results are bold.
ASR System
L-clean-2k
L-other-2k
A1-NE
Whisper-medium [ 22 ]
+No Bias
3.1/14.0
7.1/29.9
7.3/21.3
+GT Bias
2.2/6.2
5.6/15.9
4.3/7.4
+CTC-Assistant [ 30 ] ∗
2.4/7.8
6.2/18.8
4.7/9.9
+GLCLAP [ 15 ] ∗
2.4/7.6
6.1/18.2
4.6/9.1
+M-VISH
2.4/7.5
6.0/18.3
4.4 /7.8
Table 2: Downstream contextual ASR performance. WER/B-WER (%) are reported for LibriSpeech and CER/B-CER (%) for AISHELL-1-NE. GT Bias denotes oracle hotword prompting. ∗ denotes our reproduced results. N/A indicates Prompt-SLAM-ASR model does not support Mandarin. Best non-oracle results are bold.
Encoder
Params.
Extra
Test set
Best-F1
WER/B-WER
SenseVoice-Small (external)
234M
+234M
Clean
95.3
1.4 / 3.7
Other
88.8
3.1/ 8.0
WavLM-Large (internal)
315M
0
Clean
94.7
1.4 /3.9
Other
87.8
3.0 /8.6
Table 3: Effect of CTC posterior source. Comparison of internal and external CTC encoders for Bi-MVISH with Prompt-SLAM-ASR using 2,000 candidate hotwords per utterance. Extra denotes additional encoder parameters beyond the ASR backbone. Clean and Other refer to LibriSpeech test-clean and test-other, respectively. Best results are bold.
Bias List Size
100
500
1,000
2,000
CTC-Assistant [ 30 ]
46
206
398
817
GLCLAP [ 15 ]
61
65
74
78
M-VISH
71
85
117
203
Bi-MVISH
131
176
260
400
Table 4: Candidate-search efficiency. Average search latency (ms per utterance) with different bias list sizes, measured as the number of candidate hotwords per utterance. Acoustic representation extraction is excluded.
Figure 2: Forward and backward Bi-MVISH alignments for “liddy” (left) and “smolny” (right). Both directions detect “liddy”, whereas backward search recovers stronger evidence for “smolny” with its weak onset. Yellow dotted lines denote word boundaries.
Contextual automatic speech recognition (ASR) improves rare-entity recognition by supplying candidate hotwords, but retrieved candidates may be incomplete or incorrect. A reliable system must therefore exploit a relevant candidate without allowing unsupported alternatives to override the acoustic evidence. We propose a context-steered reasoning framework that generates a short, audio-grounded caption before transcription. This task-specific representation lets the model assess candidate relevance before making a lexical decision. Supervised fine-tuning establishes the structured caption-to-transcription behavior, while targeted trajectory injection strengthens group relative policy optimization when difficult utterances yield only unsuccessful rollouts. Experiments across diverse context conditions show that the proposed method consistently improves both transcription quality and hotword recognition while remaining robust to irrelevant candidates.
Qihao Wang, Hang Su, Fan Cui +3
Institute of Information Engineering, Chinese Academy of Sciences · School of Cyber Security, University of Chinese Academy of Sciences · MiLM Plus, Xiaomi Inc.
Speech LLM-based ASR often struggles with named entities and long-tail words due to strong internal language-model priors. Retrieval-augmented biasing can help, but its effectiveness depends on accurate hotword localization in full-utterance speech under weak supervision. We propose CLAR, a dual-encoder speech-text retriever that uses Continuous Integrate-and-Fire (CIF) to learn monotonic token-level alignments without timestamps. With length-aware localized matching, CLAR anchors short-entity acoustic cues and reduces representation dilution and attention drift. The retriever is trained with a multi-granularity objective combining global and local segment-level contrastive losses and a CIF quantity constraint. At inference, top-ranked hotwords are injected as contextual prompts for the Speech LLM, improving recognition without shallow fusion. Experiments show that CLAR significantly improves hotword retrieval and reduces both CER and B-WER against strong contextual ASR baselines.
Recognition of domain-specific and low-frequency terms remains challenging for automatic speech recognition (ASR). Although contextual biasing can improve their recognition, directly providing a large terminology dictionary introduces many irrelevant biasing terms. Retrieval-based contextual biasing addresses this issue by selecting candidate terms from an external dictionary, but querying many recognized words requires numerous dictionary lookups and may yield poorly targeted candidates. We propose a training-free contextual ASR framework in which a pretrained speech large language model (SpeechLLM) jointly generates an ASR hypothesis and localizes error spans likely to involve domain-specific terms. Only the localized spans are used to retrieve phonologically similar terms from an external terminology dictionary. The same SpeechLLM then re-recognizes the audio conditioned on the first-pass hypothesis and the retrieved terms, without task-specific model training. To assess applicability across domains, we evaluate the framework on medical, air traffic control, and financial speech. The proposed method substantially reduces dictionary queries while improving the recall and ranking of relevant terminology candidates and second-pass ASR performance across all three domains.
Natsuo Yamashita, Ai Nemoto, Ryosuke Koichi +1
Hitachi, Ltd., Research & Development Group, Japan · Hitachi Advanced Systems Corporation, Japan