1988 | OriginalPaper | Buchkapitel
Use of Procedural Knowledge for Spoken Letters and Digits Recognition
verfasst von : Ettore Merlo
Erschienen in: Recent Advances in Speech Understanding and Dialog Systems
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
A Procedural Network (PN) can be described with a formalism similar to that used for an Augmented Transition Network Grammar (ATNG). This formalism has been successfully used for Natural Language and Pattern Recognition [8]. A PN is a 5-tuple (1)$$PN\, = \,\left\{ {j,Q,A,q_0 ,q_f } \right\}$$ where j is the network identifier, Q is a finite set of states, A is a finite set of directed arcs, q 0 ∈Q is the initial state and q f is the final state. Without any loss of generality we consider only PNs with a single initial state and a single final state.