4th International Conference on Spoken Language Processing

Philadelphia, PA, USA
October 3-6, 1996

Viterbi Beam Search with Layered Bigrams

David M. Goblirsch

NYNEX Science & Technology, Inc., White Plains, NY, USA

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.

Full Paper

Bibliographic reference.  Goblirsch, David M. (1996): "Viterbi beam search with layered bigrams", In ICSLP-1996, 2131-2134.