By Topic

Decoding for channels with insertions, deletions, and substitutions with applications to speech recognition

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

A model for channels in which an input sequence can produce output sequences of varying length is described. An efficient computational procedure for calculating Pr {Y\mid X} is devised, where X = x_1,x_2,\cdots ,x_M and Y = y_1,y_2,\cdots ,y_N are the input and output of the channel. A stack decoding algorithm for decoding on such channels is presented. The appropriate likelihood function is derived. Channels with memory are considered. Some applications to speech and character recognition are discussed.

Published in:

Information Theory, IEEE Transactions on  (Volume:21 ,  Issue: 4 )