Continuous Speech Recognition Based on Deterministic Finite Automata Machine using Utterance and Pitch Verification
M. Tharun Prasath

TL;DR
This paper presents novel acoustic modeling techniques for utterance verification in continuous speech recognition, utilizing likelihood ratios and finite-state transducers to significantly improve verification accuracy.
Contribution
It introduces two UV techniques based on likelihood ratios and pitch recognition with finite-state transducers, enhancing UV performance in continuous speech recognition systems.
Findings
Likelihood ratio based parameter estimation improves UV performance
Use of weighted finite-state transducers yields up to 11% accuracy improvement
Finite state machine performance depends heavily on LR criterion in training
Abstract
This paper introduces a set of acoustic modeling techniques for utterance verification (UV) based continuous speech recognition (CSR). Utterance verification in this work implies the ability to determine when portions of a hypothesized word string correspond to incorrectly decoded vocabulary words or out-of-vocabulary words that may appear in an utterance. This capability is implemented here as a likelihood ratio (LR). There are two UV techniques that are presented here. The first is voice verification along with the vocabulary testing, at the same time the parameters for UV models are generated based on the optimization criterion which is directly related to the LR measure. The second technique is a pitch recognition based on weighted finite-state transducers. These transducers provide a common and natural representation for major components of speech recognition systems, including…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNetwork Packet Processing and Optimization · Algorithms and Data Compression · semigroups and automata theory
