Two-pass search strategy for large list recognition on embedded speech recognition platforms

Abstract

This paper presents an efficient algorithm for a speech recognition system which can process large lists of items. The described two-pass search implementation focuses on maximizing the speed and minimizing the memory footprint of the search engine. The algorithm is designed to handle thousands or tens of thousands of words in a search space restricted by a grammar. A typical example of such a task is stock name recognition, street name finding, song selection etc. The intended application of this algorithm is in embedded ASR system in portable devices (e.g. iPAQ) or cars.