Je bilmes ee596awinter 2013dgms lecture 9 feb 6th

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: 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. Within each recursive application lies further standard forward/backwards procedures of successively shorter lengths T /4, T / 8, Recurse, until a base-case threshold is reached Bottom out with standard standard forward-backward. 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 Algorithm Animation show island animation and asr case study.pptx animation example Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-38 (of 180) k-best without the penalty Island Summary Scratch Island Analysis Standard forward/backward (linear) inference is O(T ) memory and O(T ) compute (looking only at time for the moment, all costs are really multiplied by the average state cost, O(|DQ |2 ) in the case of time, and O(|DQ |) in the case of space) Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th,...
View Full Document

Ask a homework question - tutors are online