Adaptive Decoding for Efficient Automatic Speech Recognition
The latency and computation demand of End-to-end (E2E) automatic speech recognition (ASR) models hinder their deployment on lightweight devices. Despite there are many methods proposed for efficiency, the computational burden of the output layer with a large vocabulary is still a major challenge for decoders. In this paper, we propose an adaptive decoding method (ADD) to reduce the latency. Based on the vocal features of words like phonemes or speech units, we cluster the original vocabulary into small sets, allowing the model to inference more efficiently with a smaller search space. Experimental results demonstrate that our method significantly reduces the calculation FLOPs while maintaining performance. We also provide a deeper understanding of speech units from the perspective of phonemes.
Authors
- Kaiqi Kou
- Peizhuo Liu
- Xiangnan Ma
- Yuhao Zhang (ORCID: https://orcid.org/0000-0002-8848-5924)
- Jingbo Zhu (ORCID: https://orcid.org/0000-0002-6537-7007)
- Tong Xiao (ORCID: https://orcid.org/0000-0002-5842-6501)
- Chenghao Gao (ORCID: https://orcid.org/0000-0002-8942-3100)
Institutions
- Chinese University of Hong Kong, Shenzhen (CN)
- Northeastern University (CN)
Publication Details
- Published
- 2025-03-12
- DOI
- https://doi.org/10.1109/icassp49660.2025.10890369
- Primary Topic
- Speech Recognition and Synthesis
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Science Foundation
- Natural Science Foundation of Liaoning Province
- Fundamental Research Funds for the Central Universities