发明名称 |
Efficient pruning algorithm for hidden markov model speech recognition |
摘要 |
A method for efficient pruning which reduces central processing unit loading during real time speech recognition. A CPU uses a predetermined threshold for discarding not useful or necessary information. Useful information is stored in an available scoring buffer slot. A slot is said to be available if its last-time field does not equal the current time-index. To prevent pruning of a slot in the best path, the current time-index has to be propagated to all slots in the best path. This back-propagation increases CPU loading and is alleviated by referring the backpointer of a state within a model to its start state. |
申请公布号 |
US4977598(A) |
申请公布日期 |
1990.12.11 |
申请号 |
US19890337608 |
申请日期 |
1989.04.13 |
申请人 |
TEXAS INSTRUMENTS INCORPORATED |
发明人 |
DODDINGTON, GEORGE R.;PAWATE, BASAVARAJ I. |
分类号 |
G06F3/16;G10L11/00;G10L15/14 |
主分类号 |
G06F3/16 |
代理机构 |
|
代理人 |
|
主权项 |
|
地址 |
|