作者: Nacereddine Hammami , Mouldi Bedda , Nadir Farah
DOI: 10.1007/S10772-012-9141-9
关键词: Word (computer architecture) 、 Tree (data structure) 、 Computer science 、 Speech recognition 、 Pattern recognition 、 Spanning tree 、 Hidden Markov model 、 Artificial intelligence 、 Tree structure 、 SIGNAL (programming language) 、 Graphical model 、 Structure (mathematical logic)
摘要: This paper proposes a new discrete speech recognition method which investigates the capability of graphical models based on tree distributions that are widely used in many optimization areas. A novel spanning structure utilizes temporal nature signal is proposed. The proposed significantly reduces complexity so far can reflect simply few essential relationships rather than all possible structures trees. application this model illustrated with different isolated word databases. Experimentally it has been shown that, approaches compared to conventional hidden Markov (DHMM) yield reduced error rates 2.54 %–12 % and improve speed minimum 3-fold. In addition, an impressive gain learning time observed. overall accuracy was 93.09 %–95.34 %, thereby confirming effectiveness methods.