Exploiting Order-Preserving Minimum Perfect Hashing to Speedup N-gram Language Model Lookahead

Minimum Perfect Hashing (MPH) has recently been shown successful in reducing Language Model (LM) lookahead time in LVCSR decoding. In this paper we propose to exploit the order-preserving (OP) property of a string-key based MPH function to further reduce hashing operation and speed up LM lookahead. A subtree structure is proposed for LM lookahead and an order-preserving MPH is integrated into the structure design. Subtrees are generated on demand and stored in caches. Experiments were performed on Switchboard data. By using the proposed method of OP MPH and subtree cache structure for both trigrams and backoff bigrams, the LM lookahead time was reduced by a factor of 2.9 in comparison with the baseline case of using MPH alone.

eurospeech2003_paper.pdf
PDF file

In  Proceedings of 8th European Conference on Speech Communication and Technology (EuroSpeech'03)

Publisher  International Speech Communication Association
© 2007 ISCA. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the ISCA and/or the author.

Details

TypeInproceedings
Pages2281-2284
> Publications > Exploiting Order-Preserving Minimum Perfect Hashing to Speedup N-gram Language Model Lookahead