Decision-tree based feature-space quantization for fast Gaussian computation

Presents a decision-tree based procedure to quantize the feature-space of a speech recognizer, with the motivation of reducing the computation time required for evaluating Gaussians in a speech recognition system. The entire feature space is quantized into non-overlapping regions, where each region is bounded by a number of hyperplanes. Each region is characterized by the occurrence of only a small number of the total alphabet of allophones (sub-phonetic speech units). By identifying the region in which a test feature vector lies, only the Gaussians that model the density of allophones that exist in that region need be evaluated. The quantization of the feature space is done in a hierarchical manner using a binary decision tree. Each node of the decision tree represents a region of the feature space, and is further characterized by a hyperplane (a vector v_/sub n/ and a scalar threshold value h/sub n/), that subdivides the region corresponding to the current node into two non-overlapping regions corresponding to the two children of the current node. Given a test feature vector, the process of finding the region that it lies in involves traversing this binary decision tree, which is computationally inexpensive. We present results of experiments that show that the Gaussian computation time can be reduced by as much as a factor of 20 with negligible degradation in accuracy. We also examine issues of robustness to different environments.