Perplexity of n-gram and dependency language models
Perplexity of n-gram and dependency language models
Perplexity of n-gram and dependency language models
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Language Models – basics<br />
P(s) = P(w 1, w 2, ... w m) = P(w 1) P(w 2|w 1) … P(w m|w 1,...,w m-1)<br />
P( The dog barked again ) =<br />
P(w1 = The ) ·<br />
P(w2 = | w1 = The ) ·<br />
dog<br />
P(w3 = barked | w1 = The , w2 = dog ) ·<br />
Chain rule<br />
P(w4 = again | w1 = The , w2 = dog , w3 = barked )<br />
6