Fast and Parallel Decoding for Transducer
Authors:
- 4 June 2023
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Abstract
The transducer architecture is becoming increasingly popular in the field of speech recognition, because it is naturally streaming as well as high in accuracy. One of the drawbacks of transducer is that it is difficult to decode in a fast and parallel way due to an unconstrained number of symbols that can be emitted per time step.In this work, we introduce a constrained version of transducer loss to learn strictly monotonic alignments between the sequences; we also improve the standard greedy search and beam search algorithms by limiting the number of symbols that can be emitted per time step in transducer decoding, making it more efficient to decode in parallel with batches. Furthermore, we propose an finite state automaton-based (FSA) parallel beam search algorithm that can run with graphs on GPU efficiently. The experiment results show that we achieve slight word error rate (WER) improvement as well as significant speedup in decoding. Our work is open-sourced and publicly available 1 .Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Less is More: Improved RNN-T Decoding Using Limited Label Context and Path Merging2021
- A Streaming On-Device End-To-End Model Surpassing Server-Side Conventional Model Quality and Latency2020
- Rnn-Transducer with Stateless Prediction Network2020
- Monotonic Recurrent Neural Network Transducer and Decoding Strategies2019
- SpecAugment: A Simple Data Augmentation Method for Automatic Speech Recognition2019
- Streaming End-to-end Speech Recognition for Mobile Devices2019
- ESPnet: End-to-End Speech Processing Toolkit2018
- SentencePiece: A simple and language independent subword tokenizer and detokenizer for Neural Text Processing2018
- Audio augmentation for speech recognition2015
- Librispeech: An ASR corpus based on public domain audio books2015