Most ASR systems adopt an all-in-one approach: acoustic model, lexicon and language model are all applied simultaneously, thus forming a single large search space. This way, both lexicon and language model help in constraining the search at an early stage which greatly improves its efficiency. However, such close integration comes at a cost: all resources must be kept simple. Achieving higher accuracy in unconstrained LVCSR tasks will require more complex resources while at the same time the ‘unconstrainedness’ of the task reduces the effectiveness of the all-in-one approach. Therefore, we propose a modular two-layered architecture. First, a pure acoustic-phonemic search generates a dense phone network. Next a robust decoder finds those words from the lexicon that match well with the phone sequences encoded in the phone network. In this paper we investigate the properties the robust word decoder must have and we propose an efficient search algorithm.
Cite as: Demuynck, K., Compernolle, D.V., Van hamme, H. (2006) Robust phone lattice decoding. Proc. Interspeech 2006, paper 1631-Wed1CaP.6, doi: 10.21437/Interspeech.2006-453
@inproceedings{demuynck06_interspeech,
author={Kris Demuynck and Dirk Van Compernolle and Hugo {Van hamme}},
title={{Robust phone lattice decoding}},
year=2006,
booktitle={Proc. Interspeech 2006},
pages={paper 1631-Wed1CaP.6},
doi={10.21437/Interspeech.2006-453}
}