GB2209418B - Apparatus amd methods for analysing transitions in finite state machines - Google Patents
Apparatus amd methods for analysing transitions in finite state machinesInfo
- Publication number
- GB2209418B GB2209418B GB8824486A GB8824486A GB2209418B GB 2209418 B GB2209418 B GB 2209418B GB 8824486 A GB8824486 A GB 8824486A GB 8824486 A GB8824486 A GB 8824486A GB 2209418 B GB2209418 B GB 2209418B
- Authority
- GB
- United Kingdom
- Prior art keywords
- state
- transitions
- machine
- finite state
- words
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired
Links
Classifications
-
- G—PHYSICS
- G10—MUSICAL INSTRUMENTS; ACOUSTICS
- G10L—SPEECH ANALYSIS OR SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING; SPEECH OR AUDIO CODING OR DECODING
- G10L15/00—Speech recognition
- G10L15/08—Speech classification or search
- G10L15/14—Speech classification or search using statistical models, e.g. Hidden Markov Models [HMMs]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/29—Graphical models, e.g. Bayesian networks
- G06F18/295—Markov models or related models, e.g. semi-Markov models; Markov random fields; Networks embedding Markov models
Abstract
In speech recognition words to be recognised may be represented by finite state machines and recognition is based on analysing transitions through the machines as an utterance occurs. One value which is required for each state of each machine is minimum cumulative distance; that is the smallest value on reaching one of the states from a starting position, considering all possible paths. Since words are spoken one after another, a finite state machine representing one word has transitions to another machine representing another word. The network of such transitions is complex and varies between different pairs of words. In the present invention, rather than use such a network, each finite state machine is given a start state (SD) at the beginning and an end state (ED) at the end. A Viterbi engine finds the minimum cumulative distance for each normal state of each machine and also determines the minimum cumulative distance for each end state. Traceback pointers for each end state are determined which indicate the number of transitions traversed in reaching that end state. A further distance dependent on the traceback pointer for each end state is added to that state to form a word ending score. The best score is then used to update start states selected on a grammatical basis, other start states being updated with a maximum value. <IMAGE>
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
GB8824486A GB2209418B (en) | 1985-11-12 | 1988-10-19 | Apparatus amd methods for analysing transitions in finite state machines |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
GB858527913A GB8527913D0 (en) | 1985-11-12 | 1985-11-12 | Analysing transitions in finite state machines |
GB8824486A GB2209418B (en) | 1985-11-12 | 1988-10-19 | Apparatus amd methods for analysing transitions in finite state machines |
Publications (3)
Publication Number | Publication Date |
---|---|
GB8824486D0 GB8824486D0 (en) | 1988-11-23 |
GB2209418A GB2209418A (en) | 1989-05-10 |
GB2209418B true GB2209418B (en) | 1989-10-11 |
Family
ID=26290001
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
GB8824486A Expired GB2209418B (en) | 1985-11-12 | 1988-10-19 | Apparatus amd methods for analysing transitions in finite state machines |
Country Status (1)
Country | Link |
---|---|
GB (1) | GB2209418B (en) |
Families Citing this family (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6073098A (en) * | 1997-11-21 | 2000-06-06 | At&T Corporation | Method and apparatus for generating deterministic approximate weighted finite-state automata |
JP2000242293A (en) * | 1999-02-23 | 2000-09-08 | Motorola Inc | Method for voice recognition device |
AU2001255338A1 (en) * | 2000-05-04 | 2001-11-12 | Motorola, Inc. | Method of traceback matrix storage in a speech recognition system |
CA2397466A1 (en) | 2001-08-15 | 2003-02-15 | At&T Corp. | Systems and methods for aggregating related inputs using finite-state devices and extracting meaning from multimodal inputs using aggregation |
US7257575B1 (en) | 2002-10-24 | 2007-08-14 | At&T Corp. | Systems and methods for generating markup-language based expressions from multi-modal and unimodal inputs |
Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB2179483A (en) * | 1985-08-20 | 1987-03-04 | Nat Res Dev | Speech recognition |
-
1988
- 1988-10-19 GB GB8824486A patent/GB2209418B/en not_active Expired
Patent Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB2179483A (en) * | 1985-08-20 | 1987-03-04 | Nat Res Dev | Speech recognition |
Also Published As
Publication number | Publication date |
---|---|
GB2209418A (en) | 1989-05-10 |
GB8824486D0 (en) | 1988-11-23 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Wells | The pitch phonemes of English | |
US7881935B2 (en) | Speech recognition device and speech recognition method and recording medium utilizing preliminary word selection | |
KR100883577B1 (en) | Low memory decision tree | |
DE3687815D1 (en) | METHOD AND DEVICE FOR VOICE ANALYSIS. | |
US9858038B2 (en) | Correction menu enrichment with alternate choices and generation of choice lists in multi-pass recognition systems | |
CN106782537A (en) | The method and system of weather is inquired about in robot | |
GB2209418B (en) | Apparatus amd methods for analysing transitions in finite state machines | |
Chow et al. | Speech understanding using a unification grammar | |
EP0285222A3 (en) | Method for detecting associatively pronounced words | |
JP2003515777A (en) | Speech recognition using a complementary language model for typical errors in conversation | |
EP1320086A1 (en) | Method for generating and/or adapting language models | |
Oakey et al. | Inductive Learning of Pronunciation Rules by hypothesis Testing and Correction. | |
Goodman | Analysis of languages for man-machine voice communication | |
Levinson et al. | A new system for continuous speech recognition-Preliminary results | |
Lowerre | The Harpy speech recognition system[Ph. D. Thesis] | |
Hain | A hybrid approach for grapheme-to-phoneme conversion based on a combination of partial string matching and a neural network | |
Ouh-Young et al. | A Chinese text-to-speech system based upon a syllable concatenation model | |
BRAVMANN | ON TWO CASES OF CONSONANT CHANGE IN MODERN ARABIC DIALECTS | |
Hecht et al. | German broadcast news transcription | |
Tappert | Experiments with a tree-search method for converting noisy phonetic representation into standard orthography | |
JP2615643B2 (en) | Word speech recognition device | |
Rivoira et al. | The lexical, syntactic and semantic processing of a speech recognition system | |
JPS60118896A (en) | Voice recognition equipment | |
Uebler | Grapheme-to-phoneme conversion using pseudo-morphological units | |
Datta et al. | Automatic speech recognition in intelligence communication |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PCNP | Patent ceased through non-payment of renewal fee |