# t the following pm dq1t 1 t prof je bilmes max q1t

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: . Prof. Jeﬀ 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. Do this eﬃciently. Prof. Jeﬀ Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-17 (of 180) k-best without the penalty Island Summary Scratch Find the block with the maximum score Deﬁne block scores, for each t ∈ {1, 2, . . . , T }, the following: ∆ pm (DQ1:T (1, t)) = Prof. Jeﬀ Bilmes max q1:T ∈DQ1:T (1,t) (9.12) p(q1:T , x1:T ) ¯ EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-18 (of 180) k-best without the penalty Island Summary Scratch Find the block with the maximum score Deﬁne block scores, for each t ∈ {1, 2, . . . , T }, the following: ∆ pm (DQ1:T (1, t)) = max q1:T ∈DQ1:T (1,t) (9.12) p(q1:T , x1:T ) ¯ can comput...
View Full Document

Ask a homework question - tutors are online