paper-with-me

Papers

Powerful and Extensible WFST Framework for RNN-Transducer Losses

2023-03-18 · Aleksandr Laptev, Vladimir Bataev, Igor Gitman, Boris Ginsburg

This paper presents a framework based on Weighted Finite-State Transducers (WFST) to simplify the development of modifications for RNN-Transducer (RNN-T) loss. Existing implementations of RNN-T use CUDA-related code, which is hard to extend and debug. WFSTs are easy to construct and extend, and allow debugging through visualization. We introduce two WFST-powered RNN-T implementations: (1) "Compose-Transducer", based on a composition of the WFST graphs from acoustic and textual schema -- computationally competitive and easy to modify; (2) "Grid-Transducer", which constructs the lattice directly for further computations -- most compact, and computationally efficient. We illustrate the ease of extensibility through introduction of a new W-Transducer loss -- the adaptation of the Connectionist Temporal Classification with Wild Cards. W-Transducer (W-RNNT) consistently outperforms the standard RNN-T in a weakly-supervised data setup with missing parts of transcriptions at the beginning and end of utterances. All RNN-T losses are implemented with the k2 framework and are available in the NeMo toolkit.

📄 PDF Abstract BibTeX arXiv:2303.10384

Code (1)

NVIDIA/NeMo 공식 구현 pytorch

Methods 이 논문이 사용한 방법론

WFST 설명 없음

Similar Papers 제목 키워드 기반

Differentiable Weighted Finite-State Transducers

2020-10-02 · Awni Hannun, Vineel Pratap, Jacob Kahn, Wei-Ning Hsu

We introduce a framework for automatic differentiation with weighted finite-state transducers (WFSTs) allowing them to be used dynamically at training time. Through the separation of graphs from operations on graphs, thi…

Handwriting Recognitionspeech-recognitionSpeech Recognition

Shallow Fusion of Weighted Finite-State Transducer and Language Model for Text Normalization

2022-03-29 · Evelina Bakhturina, Yang Zhang, Boris Ginsburg

Text normalization (TN) systems in production are largely rule-based using weighted finite-state transducers (WFST). However, WFST-based systems struggle with ambiguous input when the normalized form is context-dependent…

Automatic Speech RecognitionAutomatic Speech Recognition (ASR)Language ModelingLanguage Modelling+3

Tropical Modeling of Weighted Transducer Algorithms on Graphs

2018-11-01 · Emmanouil Theodosis, Petros Maragos

Weighted Finite State Transducers (WFSTs) are versatile data structures that can model a great number of problems, ranging from Automatic Speech Recognition to DNA sequencing. Traditional computer science algorithms are …

Automatic Speech RecognitionAutomatic Speech Recognition (ASR)speech-recognitionSpeech Recognition

Integration of TensorFlow based Acoustic Model with Kaldi WFST Decoder

2019-06-21 · Minkyu Lim, Ji-Hwan Kim

While the Kaldi framework provides state-of-the-art components for speech recognition like feature extraction, deep neural network (DNN)-based acoustic models, and a weighted finite state transducer (WFST)-based decoder,…

Decoderspeech-recognitionSpeech Recognition

CTC Variations Through New WFST Topologies

2021-10-06 · Aleksandr Laptev, Somshubra Majumdar, Boris Ginsburg

This paper presents novel Weighted Finite-State Transducer (WFST) topologies to implement Connectionist Temporal Classification (CTC)-like algorithms for automatic speech recognition. Three new CTC variants are proposed:…

Automatic Speech RecognitionAutomatic Speech Recognition (ASR)speech-recognitionSpeech Recognition