Abstract
We introduce a novel efficient method, which improves the performance of speech recognition systems by providing the option to partially compile the word lattice into a deterministic finite-state automaton, making it suitable for the rescoring step in the speech recognition process. In contrast to the widely used n-best method our method permits the consideration of significantly larger number of alternatives within the same time-constraint and thus provides better recognition results. In this paper we present a description of the new method and empirical evaluation of its performance in comparison with the n-best method. The achieved WER reduction is up to 3.77 % at a p-value below 3 %. An important advantage of our method is its applicability for real-time applications.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
AComIn “Advanced Computing for Innovation”, grant 316087, funded by the FP7 Capacity Programme (Research Potential of Convergence Regions).
- 2.
For the experiments presented in this paper the time for the determinization procedure is 10 % of the time of the input signal.
- 3.
Let us note that transition weights of the lattice are obtained by combining acoustic weights with 2-gram language weights, which are computed through \( {\mathcal{A}}_{2} \). For this reason \( w = w^{\prime\prime} -\uplambda_{LM} w_{2} + {\lambda^{\prime}}_{LM} w_{3} + ({\lambda^{\prime}}_{WP} - \lambda_{WP} ) \) is always positive.
- 4.
Bulgarian Phonetic Corpus: http://lml.bas.bg/BulPhonC/.
References
Huang, Xuedong, Acero, Alex, Hon, Hsiao-Wuen: Spoken Language Processing: A Guide to Theory, Algorithm, and System Development, 1st edn. Prentice Hall PTR, Upper Saddle River, NJ, USA (2001)
Mohri, M., Riley, M.: An efficient algorithm for the N-best-strings problem. In: Proceedings of the International Conference on Spoken Language Processing 2002 (ICSLP ’02), Denver, Colorado, Sept 2002
Sak, H., Saraclar, M., Güngör, T.: On-the-fly lattice rescoring for real-time automatic speech recognition. INTERSPEECH, ISCA (2010)
Hori, T., Hori, C., Minami, Y., Nakamura, A.: Efficient WFST-based one-pass decoding with on-the-fly hypothesis rescoring in extremely large vocabulary continuous speech recognition. IEEE Trans. Audio Speech Lang. Process. 15, 1352–1365 (2007)
Mitankin, P., Mihov, S., Tinchev, T.: Large vocabulary continuous speech recognition for Bulgarian. In: Proceedings of the RANLP 2009, Sept 2009
Mohri, M.: Finite-state transducers in language and speech processing. Comput. Linguist. 23(2) (1997)
Acknowledgments
The research work reported in the paper is supported by the project AComIn “Advanced Computing for Innovation”, grant 316087, funded by the FP7 Capacity Programme (Research Potential of Convergence Regions). We would like to thank the reviewers for their useful comments and suggestions.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Mitankin, P., Mihov, S. (2016). A New Method for Real-Time Lattice Rescoring in Speech Recognition. In: Margenov, S., Angelova, G., Agre, G. (eds) Innovative Approaches and Solutions in Advanced Intelligent Systems . Studies in Computational Intelligence, vol 648. Springer, Cham. https://doi.org/10.1007/978-3-319-32207-0_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-32207-0_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-32206-3
Online ISBN: 978-3-319-32207-0
eBook Packages: EngineeringEngineering (R0)