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: uppose we have identified the Viterbi (1st best) path, i.e., ∗ q1:T (1) ∈ DQ1:T such that ∗ p(¯1:T , q1:T (1)) ≥ p(¯1:T , q1:T ) x x (9.4) ∗ for all q1:T ∈ DQ1:T \ {q1:T (1)}. 2nd best path must exist within the set of sequences ∆ ∗ DQ1:T (1) = DQ1:T \ {q1:T (1)} Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 (9.5) page 9-13 (of 180) k-best without the penalty Island Summary Scratch Computing 2nd best from max-margin Suppose we have identified the Viterbi (1st best) path, i.e., ∗ q1:T (1) ∈ DQ1:T such that ∗ p(¯1:T , q1:T (1)) ≥ p(¯1:T , q1:T ) x x (9.4) ∗ for all q1:T ∈ DQ1:T \ {q1:T (1)}. 2nd best path must exist within the set of sequences ∆ ∗ DQ1:T (1) = DQ1:T \ {q1:T (1)} (9.5) ∗ i.e., 2nd best path q1:T (2) must have some difference with the 1st ∗ (1). best path q1:T Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-13 (of 180) k-best without the penalty Island Summary Scratch Computing 2nd best from max-margin partition DQ1:T (1) into separate sets of paths based on where difference between 1st...
View Full Document

Ask a homework question - tutors are online