At step 4 and step 5 standard forwardbackward

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

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Depth can be decided based on some threshold so that we stop when T /bk < , or we choose k so that T /bk ≈ 1 Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-35 (of 180) k-best without the penalty Island Summary Scratch Island Steps Figure step 1 step 2 step 3 step 4 step 5 step 6 step 7 step 8 1 Prof. Jeff Bilmes T/2 EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 T page 9-36 (of 180) k-best without the penalty Island Summary Scratch Island Steps Figure Discussion Previous Figure shows case for b = 2, only the top-level recursion is shown. Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-37 (of 180) k-best without the penalty Island Summary Scratch Island Steps Figure Discussion Previous Figure shows case for b = 2, only the top-level recursion is shown. At step 4 and step 5, standard forward/backward algorithm on a sequence of length T /2 Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-37 (of 180) k-best without the penalty Island Summary Scratch Island Steps Figure Discussion Previous Figure shows case...
View Full Document

This document was uploaded on 04/05/2014.

Ask a homework question - tutors are online