Phoneme, Grapheme, Lexicon & Design Choices for ASR
Definitions: Phoneme – Distinct sounds in a language Grapheme – Distinct unit written in a language Lexicon – Dictionary that maps phoneme to graph(i.e. Arpabet) …
Definitions: Phoneme – Distinct sounds in a language Grapheme – Distinct unit written in a language Lexicon – Dictionary that maps phoneme to graph(i.e. Arpabet) …
CBOW learns to predict the word by the context window(+nt -nt words) around it by taking the max probability of the word that fits this …
During inference, precision in floats is not needed and can be reduced to using 8 bits instead of 32 bits this allows to bin continuous …
After training we can optimize a frozen graph or even a dynamic graph by removes training-specific and debug-specific nodes, fusing common operations, and removes code …
In prediction/inference mode, variable types are unnecessary, so by freezing the graph we convert all variables in a graph and checkpoint into constants. Also there …
Hidden Markov Model (HMM) is a statistical Markov model in which the system being modeled is assumed to be a Markov process with unobservable (i.e. …
Hidden states are the unknowns we try to detect or predict. The Hidden states have a relationship amongst themselves called the transition probabilities. Observations are …
A Markov chain is a stochastic model describing a sequence of possible events in which the probability of each event depends only on the state …
The Viterbi algorithm (using the maximum likelihood decoding (MLD) algorithm) is a dynamic programming algorithm for finding the most likely sequence of hidden states – …
A variational autoencoder provides a probability distribution for describing an observation/attribute in latent/hidden space.