NVIDIA Conformer-Transducer Large (Kabyle)

| | |

This model transcribes speech into lowercase Latin alphabet including space and apostrophe and is trained on around 131 hours of Kabyle speech data. It is a non-autoregressive "large" variant of Conformer, with around 120 million parameters. See the model architecture section and NeMo documentation for complete architecture details.

Usage

The model is available for use in the NeMo toolkit [3] and can be used as a pre-trained checkpoint for inference or for fine-tuning on another dataset.

To train, fine-tune or play with the model, you need to install NVIDIA NeMo. We recommend you install it after you've installed the latest PyTorch version.

pip install nemo_toolkit['all']

Automatically instantiate the model

import nemo.collections.asr as nemo_asr
asr_model = nemo_asr.models.EncDecRNNTBPEModel.from_pretrained("nvidia/stt_kab_conformer_transducer_large")

Transcribing using Python

Simply do:

asr_model.transcribe(['<your_audio>.wav'])

Transcribing many audio files

python [NEMO_GIT_FOLDER]/examples/asr/transcribe_speech.py 
 pretrained_name="nvidia/stt_kab_conformer_transducer_large" 
 audio_dir="<DIRECTORY CONTAINING AUDIO FILES>"

Input

This model accepts 16 kHz mono-channel Audio (wav files) as input.

Output

This model provides transcribed speech as a string for a given audio sample.

Model Architecture

Conformer-Transducer model is an autoregressive variant of the Conformer model [1] for Automatic Speech Recognition which uses Transducer loss/decoding. You may find more info on the detail of this model here: Conformer-Transducer Model.

Training

The NeMo toolkit [3] was used for training the models for over several hundred epochs. These model are trained with this example script and this base config.

The vocabulary we use contains 39 characters including space:

['a', 'b', 'c', 'č', 'd', 'ḍ', 'e', 'ɛ', 'f', 'g', 'ǧ', 'ɣ', 'h', 'ḥ', 'i', 'j', 'k', 'l', 'm', 'n', 'q', 'r', 'ř', 'ṛ', 's', 'ṣ', 't', 'ṭ', 'u', 'w', 'x', 'y', 'z', 'ẓ', ' ', 'o', 'p', 'γ', 'v']

Rare symbols with diacritics were replaced during preprocessing.

The tokenizers for these models were built using the text transcripts of the train set with this script. For vocabulary of size 128 we restrict the maximum subtoken length to 4 symbols to avoid populating vocabulary with specific frequent words from the dataset. This does not affect the model performance and potentially helps to adapt to other domain without retraining tokenizer.

Full config can be found inside the .nemo files.

Datasets

All the models in this collection are trained on the MCV-10.0 Kabyle dataset, which contains around 131 hours of training data, 14.74 hours of development, and 15.67 hours of testing speech audio.

Performance

The list of the available models in this collection is shown in the following table. Performances of the ASR models are reported in terms of Word Error Rate (WER%) with greedy decoding.

Version	Tokenizer	Vocabulary Size	Dev WER	Test WER	Train Dataset
1.12.0	SentencePiece BPE, maxlen=4	128	18.12	18.86	MCV-10.0 Train set

Limitations

Since this model was trained on publicly available speech datasets, the performance of this model might degrade for speech which includes technical terms, or vernacular that the model has not been trained on. The model might also perform worse for accented speech.

Deployment with NVIDIA Riva

NVIDIA Riva, is an accelerated speech AI SDK deployable on-prem, in all clouds, multi-cloud, hybrid, on edge, and embedded. Additionally, Riva provides:

World-class out-of-the-box accuracy for the most common languages with model checkpoints trained on proprietary data with hundreds of thousands of GPU-compute hours
Best in class accuracy with run-time word boosting (e.g., brand and product names) and customization of acoustic model, language model, and inverse text normalization
Streaming speech recognition, Kubernetes compatible scaling, and enterprise-grade support

Although this model isn’t supported yet by Riva, the list of supported models is here.
Check out Riva live demo.