Contextualization is essential for production automatic speech recognition (ASR) systems, where user-provided phrases must be recognized accurately under strict latency constraints. Although many context-biasing methods improve recognition accuracy, they often do not address the practical requirements of modern production ASR systems: streaming inference, efficient batched decoding, user-specific context lists, and low runtime overhead. We propose TurboBias 2.0, a production-oriented framework for efficient phrase boosting in Transducer-based ASR systems. The framework extends GPU-accelerated TurboBias with a case-insensitive boosting graph and per-stream batched decoding, allowing each utterance in a batch to use an independent context-biasing configuration. This enables personalized context biasing for multiple simultaneous users without sharing or mixing their context lists. The proposed framework supports both offline and streaming inference and can be used with greedy and beam-search decoding. Experiments show that TurboBias 2.0 improves contextual phrase recognition while preserving low latency and high throughput.
Figures & tables
Fig. 1: Tokenization graphs for the word hello .
Metric
C-Earnings22
Internal Medical
Domain
Earnings
Medical
Size (hours)
2.63
3.05
Keyword inst.
1,259
2,630
Unique keywords
738
489
Example keywords
Husqvarna, NASDAQ,
linezolid, quinapril,
GlobalSign
abciximab
TABLE I: Statistics of evaluation datasets (test part).
Fig. 2: Contextual Biasing: WER vs F-Score
Decoding
Context
Case
Per-str
F-Score (P/R) ↑
WER ↓
Greedy
–
–
–
65.2 (92.6/50.3)
14.4
Beam
–
–
–
65.9 (92.7/51.2)
14.0
Greedy
Full
lower
–
66.0 (91.7/51.5)
14.4
target
–
74.8 (89.0/64.5)
13.7
case-ins.
–
75.4 (89.9/64.8)
13.7
Beam
Full
lower
–
72.5 (90.9/60.3)
13.3
TABLE II: Case-sensitive vs. case-insensitive boosting under different biasing scenarios on Earnings22 using parakeet-unified-en-0.6b .
Biasing
Cache
Per-stream
F-score ↑
RTFx ↑
Greedy decoding
No biasing
–
–
65.2
1812
Full
–
–
75.4
1726
Full
–
✓
75.4
61
Full
disk
✓
75.4
794
Full
memory
✓
75.4
1493
TABLE III: TurboBias 2.0 decoding speed on Earnings22 using parakeet-unified-en-0.6b with 128 streams.
Contextual biasing supplies an ASR system with a list of expected words at inference time, but existing methods rely on word boundaries that Japanese and Chinese do not provide. We present a boundary-free biasing decoder for frozen public CTC models, built on a character-level Aho-Corasick automaton, with no training and no second pass. Two evidence-based mechanisms replace the boundary: a depth-adaptive gate that sets how hard to push from match depth, and reading-space matching for when the audio is right but the characters are wrong. On Aishell-1 NE's hard R1 subset we reach 66.5% recall, above the trained CLAS baseline (64%), transferring to WenetSpeech and to a second architecture without retuning. We release the first open Japanese contextual-biasing benchmark, where biasing lifts rare-word recall by 25 points at precision above 97%, and still by 19 and 22 points against 1,000-word lists.
Transcribing domain-specific entities and rare proper nouns remains a major challenge in automatic speech recognition (ASR). In this paper, we propose BaLEEN (Biasing with Latent Encoded Entities), a lightweight, hypernetwork-based framework for dynamic contextual adaptation without fine-tuning the underlying ASR model. BaLEEN encodes variable-length contextual keywords using a pretrained language model, compresses them into a fixed sequence of latent vectors via a Perceiver bottleneck, and injects context-dependent bias vectors directly into the intermediate encoder representations of the ASR model. Because both the language model and the backbone ASR model remain entirely frozen during training, BaLEEN operates as a plug-and-play adapter that incurs zero computational overhead at inference time when context biases are precomputed. We evaluate our method on a CTC-based ASR model using a Wikipedia-derived corpus with annotated named entities and synthetic speech. Experimental results demonstrate that BaLEEN reduces keyword miss rate by 8.7% on the test set relative to the unbiased baseline while simultaneously improving overall word error rate by 21% and character error rate by 28%.
Chihiro Taguchi, Yotaro Kubo, Rujikorn Charakorn
University of Notre Dame, Department of Computer Science and Engineering, IN, USA · Sakana AI, Tokyo, Japan
Open Thai automatic speech recognition (ASR) is dominated by offline, Whisper-based models that read the whole utterance before transcribing, ruling out low-latency uses such as live captioning and voice agents. We present a deployable system for streaming Thai ASR that lets a user steer its vocabulary at decode time, without retraining. A widely used open Thai model, trained with full context, collapses when run as a true stream; we restore streaming with a cache-aware encoder, by converting it or adapting a natively streaming one, and add a shallow-fusion layer that re-ranks candidates inside the streaming decoder with a GPU n-gram language model and phrase boosting. Across two Thai benchmarks and two model sizes, the streaming models stay usable where the full-context model fails, cutting character error rate 4.3-4.5x at a one-second look-ahead while running faster than real time. Decode-time steering then lifts keyword recall from 16.6% to 20.7% at no accuracy cost and negligible overhead; most of the gain comes from an n-gram over ordinary training transcripts, which resolves the written form of code-switched words the model hears but spells inconsistently, with phrase boosting adding targeted control over rare domain terms.
Warit Sirichotedumrong, Tanawin Samutsin, Shah Faisal Wani +2