CLApr 18

Efficient Punctuation Restoration via Weighted Lookahead Scoring Method for Streaming ASR Systems

arXiv:2606.0517910.9
Predicted impact top 71% in CL · last 90 daysOriginality Incremental advance
AI Analysis

For streaming ASR systems requiring low-latency punctuation, this method offers a practical solution that avoids generation-based latency and alignment issues.

The paper proposes a non-autoregressive scoring method for punctuation restoration in streaming ASR that uses weighted lookahead and achieves macro F1 of 0.893 without fine-tuning and 0.937 with fine-tuning on IWSLT 2017, outperforming prompt-based and fine-tuned ELECTRA baselines under the same lookahead budget.

Punctuation restoration improves ASR (Automatic Speech Recognition) readability. However streaming ASR requires online decisions with limited future context. In streaming ASR, the system predicts punctuation incrementally, which makes generation-based approaches prone to latency and alignment failures under boundary-wise evaluation. This paper proposes a non-autoregressive scoring method (no free-form generation) that preserves the input transcript and makes a decision at each word boundary. Our method compares punctuation insertion hypotheses against a no-insertion baseline under a bounded K-subword-token lookahead, and calibrates decisions using a weight α and a validation-calibrated threshold τ (no parameter updates during inference). On IWSLT 2017, our scoring method achieves a 4-class macro F1 of 0.893 in the no fine-tuning setting (validation-calibrated, K=2) and 0.937 after fine-tuning (K=2), outperforming the prompt-based baseline (0.566) and a fine-tuned ELECTRA baseline (0.913) under the same lookahead budget. We analyze the impact of the lookahead budget through ablation studies on K.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes