Baum-Welch algorithm most likely results in underflow in practice. In some literatures, such as 'Scaling' algorithm was introduced to solve the problem. In applications, however, some mistakes were found in th...Baum-Welch algorithm most likely results in underflow in practice. In some literatures, such as 'Scaling' algorithm was introduced to solve the problem. In applications, however, some mistakes were found in the equations presented in these literatures. The practical calculations show that the original algorithm often results in poor or even none convergence and rather higher error rate in speech recognition. The mistakes in these literatures and brings forward the correct equations are analysed. The speech recognition system using the revised algorithm can converge well and has lower error rate.展开更多
Provided an algorithm for the distribution search and proves the time complexity of the algorithm. This algorithm uses a mathematical formula to search n elements in the sequence of n elements in O(n)expected time,and...Provided an algorithm for the distribution search and proves the time complexity of the algorithm. This algorithm uses a mathematical formula to search n elements in the sequence of n elements in O(n)expected time,and experimental reesult proves that distribution search is superior to binary search.展开更多
文摘Baum-Welch algorithm most likely results in underflow in practice. In some literatures, such as 'Scaling' algorithm was introduced to solve the problem. In applications, however, some mistakes were found in the equations presented in these literatures. The practical calculations show that the original algorithm often results in poor or even none convergence and rather higher error rate in speech recognition. The mistakes in these literatures and brings forward the correct equations are analysed. The speech recognition system using the revised algorithm can converge well and has lower error rate.
文摘Provided an algorithm for the distribution search and proves the time complexity of the algorithm. This algorithm uses a mathematical formula to search n elements in the sequence of n elements in O(n)expected time,and experimental reesult proves that distribution search is superior to binary search.
