Systems and methods for determinization and minimization a finite state transducer for speech recognition
US6243679A · kind A · utility
Assignee
Inventors
Key dates
| Filing date | Oct 2, 1998 |
| Grant date | Jun 5, 2001 |
| Priority date | — |
| Expiry date | Oct 2, 2018 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG10L15/193
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A pattern recognition system and method for optimal reduction of redundancy and size of a weighted and labeled graph presents receiving speech signals, converting the speech signals into word sequences, interpreting the word sequences in a graph where the graph is labeled with word sequences and weighted with probabilities and determinizing the graph by removing redundant word sequences. The size of the graph can also be minimized by collapsing some nodes of the graph in a reverse determinizing manner. The graph can further be tested for determinizability to determine if the graph can be determinized. The resulting word sequence in the graph may be shown in a display device so that recognition of speech signals can be demonstrated.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.