๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

The HARPY Speech Recognition System [Ph.D. Thesis]

โœ Scribed by Lowerre, Bruce T.


Publisher
Carnegie-Mellon University
Year
1976
Tongue
English
Leaves
141
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Synopsis


The Harpy connected speech recognition system is the result of an attempt to understand the relative importance of various design choices of two earlier speech recognition systems developed at Carnegie-Mellon University: The Hearsay-1 system and the Dragon system. Knowledge is represented in the Hearsay-1 system as procedures and in the Dragon system as a Markov network with a-priori transition probabilities between states. Systematic performance analysis of various design choices of these two systems resulted in the HARPY system, in which knowledge is represented as a finite state transition network but without the a-priori transition probabilities. Harpy searches only a few 'best' syntactic (and acoustic) paths in parallel to determine the optimal path, and uses segmentation to effectively reduce the utterance length, thereby reducing the number of state probability updates that must be done. Several new heuristics have been added to the HARPY system to improve its performance and speed: detection of common sub-nets and collapsing them to reduce overall network size and complexity, eliminating the need for doing an acoustic match for all phonemic types at every time sample, and semi-automatic techniques for learning the lexical representations (that are needed for a steady-state system of this type) and the phonemic templates from training data, thus automatically accounting for the commonly occurring intra-word coarticulation and juncture phenomena. Inter-word phenomena are handled by the use of juncture rules which are applied at network generation time, thereby eliminating the need for repetitive and time consuming application of phonological rules during the recognition phase.

โœฆ Table of Contents


1 Introduction
2 Features of the HEARSAY-I System
3 Features of the DRAGON System
4 The HARPY System
5 Network Data Representation
6 Conclusion

โœฆ Subjects


communications, speech recognition


๐Ÿ“œ SIMILAR VOLUMES


Gravity illustrated (Ph.D. Thesis)
โœ Rickard Jonsson ๐Ÿ“‚ Library ๐Ÿ“… 2004 ๐Ÿ› Chalmers University of Technology and Goteborg Uni ๐ŸŒ English

This thesis deals with essentially four different topics within general relativity: pedagogical techniques for illustrating curved spacetime, inertial forces, gyroscope precession and optical geometry. Concerning the pedagogical techniques, I investigate two distinctly different methods, the dual an

Automatic Speech Recognition: The Develo
โœ Kai-Fu Lee (auth.) ๐Ÿ“‚ Library ๐Ÿ“… 1989 ๐Ÿ› Springer US ๐ŸŒ English

<p>Speech Recognition has a long history of being one of the difficult problems in Artificial Intelligence and Computer Science. As one goes from problem solving tasks such as puzzles and chess to perceptual tasks such as speech and vision, the problem characteristics change dramatically: knowledge