# 2 q and then repeat the following recursion for t 2

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: ture 9 - Feb 6th, 2013 page 9-12 (of 180) k-best without the penalty Island Summary Scratch Computing Viterbi from max-margin - any case We start this process with the singleton max-marginal on the left ∗ q1 (1) ∈ argmax m1 (q ), (9.2) q and then repeat the following recursion, for t = 2 . . . T , as follows ∗ ∗ qt (1) ∈ argmax mt−1,t (qt−1 (1), q ), (9.3) q which, thanks to to Proposition 9.3.1, is guaranteed to be a Viterbi path. Max marginals seem to be powerful. Can we compute k -best using just them? Prof. Jeﬀ Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-12 (of 180) k-best without the penalty Island Summary Scratch Computing 2nd best from max-margin Suppose we have identiﬁed 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)}. Prof. Jeﬀ 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 S...
View Full Document

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

Ask a homework question - tutors are online