Steps 7 and 8 also constitute a length t 2 standard

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: 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 hence, can run the island algorithm recursively on the right-half subsegment. 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 hence, can run the island algorithm recursively on the right-half subsegment. Steps 7 and 8 also constitute a length T /2 standard forward/backward algorithm, so again island can be applied recursively. 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 hence, can run the island algorithm recursively on the right-half subsegment. Steps 7 and 8 also constitute a length T /2 standard forwa...
View Full Document

This document was uploaded on 04/05/2014.

Ask a homework question - tutors are online