ISCA Archive Eurospeech 1999
ISCA Archive Eurospeech 1999

Combining length restrictions and n-best techniques in multiple-pass search strategies

A. R. Fonollosa, Eloi Batlle

Multiple-pass search strategies are a necessary choice to reduce the computational cost and memory requirements of large vocabulary speech recognition systems uisng different kinds or complex modelling of speech and language. In the N-best approach the most efficient knowledge sources (usually acoustic models and a bi/trigram language model) are used first to select a short list (N-best) of alternative hypotheses. Then, the remaining more complex knowledge sources are used to rescore the sequences. In this paper we propose a new algorithm to overcome the problems associated with the simple ''Traceback-Based'' N-best algorithm while conserving its simplicity and low computational cost.


doi: 10.21437/Eurospeech.1999-596

Cite as: Fonollosa, A.R., Batlle, E. (1999) Combining length restrictions and n-best techniques in multiple-pass search strategies. Proc. 6th European Conference on Speech Communication and Technology (Eurospeech 1999), 2713-2716, doi: 10.21437/Eurospeech.1999-596

@inproceedings{fonollosa99_eurospeech,
  author={A. R. Fonollosa and Eloi Batlle},
  title={{Combining length restrictions and n-best techniques in multiple-pass search strategies}},
  year=1999,
  booktitle={Proc. 6th European Conference on Speech Communication and Technology (Eurospeech 1999)},
  pages={2713--2716},
  doi={10.21437/Eurospeech.1999-596}
}