DocumentCode
2261957
Title
Viterbi beam search with layered bigrams
Author
Goblirsch, David M.
Author_Institution
NYNEX Sci. & Technol. Inc., White Plains, NY, USA
Volume
4
fYear
1996
fDate
3-6 Oct 1996
Firstpage
2131
Abstract
We outline an implementation of Viterbi beam search that incorporates layered bigrams. Layered bigrams are class bigrams in which some nodes are themselves bigrams, resulting in a recursive structure. The implementation is in C++ and involves a hierarchy of classes. The paper outlines the main concepts and the corresponding C++ classes
Keywords
C language; abstract data types; object-oriented languages; object-oriented programming; search problems; speech recognition; C++ classes; Viterbi beam search; class bigrams; class hierarchy; layered bigrams; recursive structure; Cities and towns; Clocks; Context modeling; Law; Legal factors; Smoothing methods; Speech recognition; Training data; Turning; Viterbi algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Spoken Language, 1996. ICSLP 96. Proceedings., Fourth International Conference on
Conference_Location
Philadelphia, PA
Print_ISBN
0-7803-3555-4
Type
conf
DOI
10.1109/ICSLP.1996.607224
Filename
607224
Link To Document