# Depth can be decided based on some threshold so that

This preview shows page 1. Sign up to view the full content.

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: normal forward/backwards pass. Hence, each such forward/backwards pass can have the same process repeated. Hence, further divide each of the length-T /b subsegments into subsubsegments of length T /b2 . Each of the subsubsegments look again like a standard forward-backwards procedure and so can be still further subdivided into length-T /b3 sequence. The recursion proceeds to a depth of k , leading to segment lengths T /bk (base case) where we perform normal forward-backward. Prof. Jeﬀ Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-35 (of 180) k-best without the penalty Island Summary Scratch Island algorithm: idea, recursion Each length T /b segment at some point looks like a normal forward/backwards pass. Hence, each such forward/backwards pass can have the same process repeated. Hence, further divide each of the length-T /b subsegments into subsubsegments of length T /b2 . Each of the subsubsegments look again like a standard forward-backwards procedure and so can be still further subdivided into length-T /b3 sequence. The recursion proceeds to a depth of k , leading to segment lengths T /bk (base case) where we perform normal forward-backward....
View Full Document

## This document was uploaded on 04/05/2014.

Ask a homework question - tutors are online