Perplexity of n-gram and dependency language models

More documents

Recommendations

Info

Dependency LM ● exploit the topology of dependency trees The dog barked again MALT parser 22
Dependency LM ● exploit the topology of dependency trees The dog barked P( The dog barked again ) = P( The | dog ) · P( dog | barked ) · h i = parent( w i ) again P( barked | NONE ) · P( again | barked ) 23
Page 1 and 2: Perplexity of n-gram and dependency
Page 3 and 4: P(s) = ? Language Models - basics P
Page 5 and 6: Language Models - basics P(s) = P(w
Page 13 and 14: Language Models - design decisions
Page 15 and 16: Language Models - design decisions
Page 17 and 18: Post-ngram LM In general: P(s) = P(
Page 19 and 20: Post-ngram LM In general: P(s) = P(
Page 21: Dependency LM ● exploit the topol
Page 25 and 26: Dependency LM Motivation for usage
Page 27 and 28: ● Model wp word form of parent P(
Page 29 and 30: ● Model E,wp edge direction, word
Page 31 and 32: ● Model N,wp the word is N th chi
Page 33 and 34: Dependency LM Examples of additiona
Page 35 and 36: Dependency LM Examples of additiona
Page 37 and 38: Evaluation ● Train and test data
Page 39 and 40: Findings confirmed for all seven la
Page 41: Thank you 41

Perplexity of n-gram and dependency language models

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?