Parallel recognizer algorithm for automatic speech recognition
Keywords:Computational methods, Dynamic programming, Heuristic methods, Matrix algebra, Parallel algorithms, Parameter estimation, Signal distortion, Speech processing, Vectors, Automatic speech recognition (ASR), Parallel recognizer algorithms, Phonemes, Two-level dynamic programming (TLDP)
AbstractA parallel recognizer algorithm for automatic speech recognition (ASR) was presented. This algorithm uses the principle of best-fit in an open competition for all phonemes in the Knowledge Base of Reference Phonemes (KBRP). The phonemes were concurrently matched in KBRP to an input T using a set of defined segment entities. This made it possible to convert the matrix computation of two-level dynamic programming (TLDP) to a vector space.
How to Cite
Copyright on articles is held by the author(s). The corresponding author has the right to grant on behalf of all authors and does grant on behalf of all authors, a worldwide exclusive licence (or non-exclusive license for government employees) to the Publishers and its licensees in perpetuity, in all forms, formats and media (whether known now or created in the future)
i) to publish, reproduce, distribute, display and store the Contribution;
ii) to translate the Contribution into other languages, create adaptations, reprints, include within collections and create summaries, extracts and/or, abstracts of the Contribution;
iii) to exploit all subsidiary rights in the Contribution,
iv) to provide the inclusion of electronic links from the Contribution to third party material where-ever it may be located;
v) to licence any third party to do any or all of the above.