pith. sign in

arxiv: 1811.02320 · v1 · pith:HGXCKFSInew · submitted 2018-11-06 · 💻 cs.CL · cs.LG

Hierarchical Neural Network Architecture In Keyword Spotting

classification 💻 cs.CL cs.LG
keywords complexitycomputationcontradictionhierarchicalkeywordmodelnetworkneural
0
0 comments X
read the original abstract

Keyword Spotting (KWS) provides the start signal of ASR problem, and thus it is essential to ensure a high recall rate. However, its real-time property requires low computation complexity. This contradiction inspires people to find a suitable model which is small enough to perform well in multi environments. To deal with this contradiction, we implement the Hierarchical Neural Network(HNN), which is proved to be effective in many speech recognition problems. HNN outperforms traditional DNN and CNN even though its model size and computation complexity are slightly less. Also, its simple topology structure makes easy to deploy on any device.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.