Discovering the structure of a reactive environment by exploration
Neural Computation
Neural Networks and Speech Processing
Neural Networks and Speech Processing
Computation: finite and infinite machines
Computation: finite and infinite machines
Finite state automata and simple recurrent networks
Neural Computation
Hi-index | 0.00 |
RNN's have a very powerful capability to generalize and to model strings with indefinite number of symbols. In some way RNN's combine information from past grammar states S[t-i], and actual inputs I[t]. for defining the set of the allowed next words W[t+1], or the context in which they can appear. If we want to extract the states of the FSA, we can use a heuristic algorithm as proposed in [2]. But we can add some extra information to the inputs of the RNN and use in keyword spotting. This contribution presents some experiments that show the capabilities of using RNN's in conjunction with Hidden Markov Models (HMM) into a Keyword Recognizer. In the proposed scheme a RNN performs both the decoding search of a null-grammar HMM network and the secondary process to determine true keywords or false alarms.