# Then pq1t 2 x1t pm dq1t 1 t2 916 and

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: time that achieved the maximum. Prof. Jeﬀ Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-19 (of 180) k-best without the penalty Island Summary Scratch The maximum score block Suppose t(2) ∈ argmaxt pm (DQ1:T (1, t)) is time that achieved the maximum. Then ∗ p(q1:T (2), x1:T ) = pm (DQ1:T (1, t(2) )). ¯ (9.16) ∗ and q1:T (2) ∈ DQ1:T (1, t(2) ). Prof. Jeﬀ Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-19 (of 180) k-best without the penalty Island Summary Scratch The maximum score block Suppose t(2) ∈ argmaxt pm (DQ1:T (1, t)) is time that achieved the maximum. Then ∗ p(q1:T (2), x1:T ) = pm (DQ1:T (1, t(2) )). ¯ (9.16) ∗ and q1:T (2) ∈ DQ1:T (1, t(2) ). ∗ We can identify q1:T (2) using the following procedure, part of which is a copy, and part of which is dynamic programming: ∗ ∗ qt (2) ← qt (1) for t = 1, . . . , t(2) − 1 ∗ qt(2) (2) ∈ argmax q =q ∗(2) (1) t ∗ qt (2) Prof. Jeﬀ Bilmes (9.17) ∗ mt−1,t (qt(2)...
View Full Document

## This document was uploaded on 04/05/2014.

Ask a homework question - tutors are online