Knowledge / Artificial Intelligence and Data Science / Speech recognition and audio AI

Speech recognition and audio AI

Artificial Intelligence and Data Science (B.E./B.Tech) · AI applications · free study notes for exams, placements and interviews

In short

Speech recognition (ASR) converts an audio waveform into text; audio AI is the wider family of tasks on sound — text-to-speech, speaker identification, diarization, wake-word spotting, emotion and event detection. Technically it is sequence-to-sequence learning over a variable-length signal, so it introduces alignment problems (CTC, transducers, attention) that no other AI topic covers. Indian exams (GATE DA, university AI/DS electives, speech-processing and DSP papers) ask the front end — sampling, framing, windowing, STFT, mel scale, MFCC — plus HMM-GMM theory and modern end-to-end architectures and WER arithmetic. It is used commercially by Bhashini and AI4Bharat, by voice-bot firms (Skit.ai, Gnani.ai, Uniphore, Ozonetel, Exotel), by Sarvam AI and Krutrim, and in bank/insurance call-centre analytics, where interviewers probe WER, latency and code-mixed Hindi-English handling.

Explained

Speech signals and the front end

Classical ASR: the HMM-GMM pipeline

End-to-end ASR

Self-supervised learning and foundation audio models

Evaluation, decoding and deployment

Beyond ASR: synthesis, speaker and general audio

Indian languages, data and law

Key points

Formulas and examples

Nyquist: f_s > 2·f_max (f_s = sampling rate in Hz)
Pre-emphasis: y[n] = x[n] − α·x[n−1], α ≈ 0.97
Frames in a signal: F = ⌊(L_total − L_frame)/L_hop⌋ + 1 (all lengths in samples)
Mel scale: m = 2595·log₁₀(1 + f/700) (f in Hz, m in mel); inverse f = 700·(10m/2595 − 1)
MFCC: c_k = Σ_{j=1..M} log(E_j)·cos[k(j − 0.5)π/M] (E_j = energy of mel filter j, M filters, k = 1…13)
Power in dB: L = 10·log₁₀(P/P_ref); amplitude in dB: L = 20·log₁₀(A/A_ref)
SNR(dB) = 10·log₁₀(P_signal/P_noise)
Uncompressed bit rate: R = f_s × bits per sample × channels (bits per second)
ASR objective: Ŵ = argmax_W P(X|W)·P(W) (acoustic model × language model)
CTC loss: L = −log Σ_{π ∈ B⁻¹(y)} Π_{t=1..T} p_t(π_t) (π = frame-level path, B = collapse map)
Shallow fusion score: log P(y|x) + λ·log P_LM(y) + β·|y| (λ = LM weight, β = length/insertion bonus)
WER = (S + D + I)/N × 100% (S subs, D deletions, I insertions, N reference words)
RTF = processing time / audio duration

Example 1 - framing and feature-tensor size. 16 kHz audio, 2.5 s long, 25 ms window, 10 ms hop, 80 mel filters.

Example 2 - storage and bit rate. One hour of 16 kHz, 16-bit mono speech.

Example 3 - mel spacing. How far apart are 1 kHz and 4 kHz on the mel scale?

Example 4 - WER on a banking utterance.

Example 5 - SNR, RTF and CTC alignments.

ApproachAlignment handlingStreamingNeeds lexiconTypical use
HMM-GMM / DNN-HMMExplicit (Viterbi, WFST)YesYesLegacy, low-resource, embedded
CTCMarginalised over alignmentsYesNoSimple, fast, LM-fused decoding
RNN-T (transducer)Marginalised, with output LMYes (native)NoOn-device assistants, live captions
Attention enc-dec (Whisper)Learnt soft attentionNot nativelyNoOffline, multilingual, best WER
MetricMeasuresGood value (clean read speech)
WERASR accuracy5-10% English; higher for Indic/code-mixed
CERCharacter accuracy2-5%
DERDiarization errorsunder 10% for 2 speakers
EERSpeaker verification1-3%
MOSTTS naturalness4.0-4.5 of 5
RTFSpeedunder 0.3 for a server model

Where it is used

Interview questions

Common mistakes

Related topics

Natural language processing basics · Large language models and prompt engineering · Edge AI and model optimisation · Computer vision basics · Text embeddings and semantic search · Time series forecasting

Open in the Knowledge reader →Find jobs →