Unimodal Aggregation for CTC-based Speech Recognition

Ying Fang, Xiaofei Li
9/15/2023
cs.CLcs.SDeess.AS

No official code found. Best implementation: Audio-WestlakeU/UMA-ASR (35 stars, last commit 2024-12-17).

Abstract

This paper works on non-autoregressive automatic speech recognition. A unimodal aggregation (UMA) is proposed to segment and integrate the feature frames that belong to the same text token, and thus to learn better feature representations for text tokens. The frame-wise features and weights are both derived from an encoder. Then, the feature frames with unimodal weights are integrated and further processed by a decoder. Connectionist temporal classification (CTC) loss is applied for training. Compared to the regular CTC, the proposed method learns better feature representations and shortens the sequence length, resulting in lower recognition error and computational complexity. Experiments on three Mandarin datasets show that UMA demonstrates superior or comparable performance to other advanced non-autoregressive methods, such as self-conditioned CTC. Moreover, by integrating self-conditioned CTC into the proposed framework, the performance can be further noticeably improved.

View on arXivView PDF

Code Implementations(1)

This repository is the official implementation of unimodal aggregation (UMA) for automaticspeech recognition (ASR).

357Shell, PythonSep 14, 20231 years ago
asrspeech-recognition

Similar Papers

Cite this paper

@article{fang2023unimodal,
  title  = {Unimodal Aggregation for CTC-based Speech Recognition},
  author = {Ying Fang and Xiaofei Li},
  year   = {2023},
  eprint = {2309.08150},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2309.08150v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2309.08150.svg)](https://codeofpaper.com/paper/2309.08150)

Discussion