We follow the following strategy prof je bilmes

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: ( 1) ... ∗) q 1(1 q1 = q2 = q2∗( 1) t=1 DQ1:T (1, t). q1 = q1∗( 1) ∗ DQ1:T (1, 1) = {q1:T ∈ DQ1:T : q1 = q1 (1)} ∗ ∗ DQ1:T (1, 2) = {q1:T ∈ DQ1:T : q1 = q1 (1), q2 = q2 (1)} ∗ ∗ ∗ DQ1:T (1, 3) = {q1:T ∈ DQ1:T : q1 = q1 (1), q2 = q2 (1), q3 = q3 (1)} ∗ DQ1:T (1, T ) = {q1:T ∈ DQ1:T : q1 = q1 (1), . . . , ∗ ∗ qT −1 = qT −1 (1), qT = qT (1) Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-16 (of 180) k-best without the penalty Island Summary Scratch Strategy 2nd best path must exist in one of the above blocks. We follow the following strategy: Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-17 (of 180) k-best without the penalty Island Summary Scratch Strategy 2nd best path must exist in one of the above blocks. We follow the following strategy: Find the block with the maximum score Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-17 (of 180) k-best without the penalty Island Summary Scratch Strategy 2nd best path must exist in one of the above blocks. We follow the following strategy: Find the block with the maximum score Find the best path within that discovered block...
View Full Document

Ask a homework question - tutors are online