# 6 ee596awinter 2013dgms lecture 9 feb 6th 2013 q2

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: E596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 ∗ q2 (1)} (9.7) page 9-15 (of 180) k-best without the penalty Island Summary Scratch Partition into blocks That is, we partition DQ1:T (1) into T blocks of sequences as follows: ∗ DQ1:T (1, 1) = {q1:T ∈ DQ1:T : q1 = q1 (1)} DQ1:T (1, 2) = {q1:T ∈ DQ1:T : q1 = DQ1:T (1, 3) = {q1:T ∈ DQ1:T : q1 = Prof. Jeﬀ Bilmes ∗ q1 (1), q2 ∗ q1 (1), q2 (9.6) = = EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 ∗ q2 (1)} ∗ q2 (1), q3 (9.7) = ∗ q3 (1)} (9.8) page 9-15 (of 180) k-best without the penalty Island Summary Scratch Partition into blocks That is, we partition DQ1:T (1) into T blocks of sequences as follows: ∗ DQ1:T (1, 1) = {q1:T ∈ DQ1:T : q1 = q1 (1)} DQ1:T (1, 2) = {q1:T ∈ DQ1:T : q1 = DQ1:T (1, 3) = {q1:T ∈ DQ1:T : q1 = ∗ q1 (1), q2 ∗ q1 (1), q2 (9.6) = = ∗ q2 (1)} ∗ q2 (1), q3 (9.7) = ∗ q3 (1)} (9.8) (9.9) ... Prof. Jeﬀ Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-15...
View Full Document

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

Ask a homework question - tutors are online