Fast sequential decoding algorithm using a stack

Authors:
F. Jelinek
Affiliations:
School of Electrical Engineering, Cornell University, Ithaca, New York
Venue:
IBM Journal of Research and Development
Year:
1969

Citing 0
Cited 19

Fast Lexicon-Based Word Recognition in Noisy Index Card Images

ICDAR '03 Proceedings of the Seventh International Conference on Document Analysis and Recognition - Volume 1
On the use of different loss functions in statistical pattern recognition applied to machine translation

Pattern Recognition Letters
The dawn of statistical asr and mt

Computational Linguistics
Low-complexity decoding via reduced dimension maximum-likelihood search

IEEE Transactions on Signal Processing
Throughput improvement on bidirectional Fano algorithm

Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
A stack decoder approach to approximate string matching

Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval
Application of Sequential Estimation Algorithm Based on Branch Metric to Frequency-Selective Channel Equalization

Wireless Personal Communications: An International Journal
An efficient A* stack decoder algorithm for continuous speech recognition with a stochastic language model

ICASSP'92 Proceedings of the 1992 IEEE international conference on Acoustics, speech and signal processing - Volume 1
Unsupervised cleansing of noisy text

COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics: Posters
The Lincoln large-vocabulary stack-decoder HMM CSR

ICASSP'93 Proceedings of the 1993 IEEE international conference on Acoustics, speech, and signal processing: speech processing - Volume II
Parallel high-throughput limited search trellis decoder VLSI design

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Automatic rule extraction for modeling pronunciation variation

CICLing'11 Proceedings of the 12th international conference on Computational linguistics and intelligent text processing - Volume Part II
Incremental syntactic language models for phrase-based translation

HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Acoustic modeling problem for automatic speech recognition system: conventional methods (Part I)

International Journal of Speech Technology
An english-hindi statistical machine translation system

IJCNLP'04 Proceedings of the First international joint conference on Natural Language Processing
Multi channel sequence processing

Proceedings of the First international conference on Deterministic and Statistical Methods in Machine Learning
Spinal codes

Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
Spinal codes

ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
A novel semantic information retrieval system based on a three-level domain model

Journal of Systems and Software

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper a new sequential decoding algorithm is introduced that uses stack storage at the receiver. It is much simpler to describe and analyze than the Fano algorithm, and is about six times faster than the latter at transmission rates equal to Rcomp the rate below which the average number of decoding steps is bounded by a constant. Practical problems connected with implementing the stack algorithm are discussed and a scheme is described that facilitates satisfactory performance even with limited stack storage capacity. Preliminary simulation results estimating the decoding effort and the needed stack siazree presented.