Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
80 tokens/sec
GPT-4o
59 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
7 tokens/sec
GPT-4.1 Pro
50 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

One In A Hundred: Select The Best Predicted Sequence from Numerous Candidates for Streaming Speech Recognition (2010.14791v3)

Published 28 Oct 2020 in eess.AS

Abstract: The RNN-Transducers and improved attention-based encoder-decoder models are widely applied to streaming speech recognition. Compared with these two end-to-end models, the CTC model is more efficient in training and inference. However, it cannot capture the linguistic dependencies between the output tokens. Inspired by the success of two-pass end-to-end models, we introduce a transformer decoder and the two-stage inference method into the streaming CTC model. During inference, the CTC decoder first generates many candidates in a streaming fashion. Then the transformer decoder selects the best candidate based on the corresponding acoustic encoded states. The second-stage transformer decoder can be regarded as a conditional LLM. We assume that a large enough number and enough diversity of candidates generated in the first stage can compensate the CTC model for the lack of LLMing ability. All the experiments are conducted on a Chinese Mandarin dataset AISHELL-1. The results show that our proposed model can implement streaming decoding in a fast and straightforward way. Our model can achieve up to a 20% reduction in the character error rate than the baseline CTC model. In addition, our model can also perform non-streaming inference with only a little performance degradation.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (6)
  1. Zhengkun Tian (24 papers)
  2. Jiangyan Yi (77 papers)
  3. Ye Bai (28 papers)
  4. Jianhua Tao (139 papers)
  5. Shuai Zhang (319 papers)
  6. Zhengqi Wen (69 papers)
Citations (5)