Natural Language Processing · free preview
Smoothing, Interpolation, and Backoff
Why zero counts break perplexity, Laplace and add-k smoothing, mixing n-gram orders by interpolation, and stupid backoff scoring.
1. Smoothing, Interpolation, and Backoff
Smoothing, Interpolation, and Backoff
2. Adding counts, blending orders, backing off
Adding counts, blending orders, backing off
3. Smoothing a bigram table three ways
Smoothing a bigram table three ways
4. Laplace unigram smoothing
A word occurs 29 times in a corpus of 1,089,757 tokens with vocabulary size 5,873. What is its Laplace-smoothed (add-one) unigram probability? Round to six decimal places.
5. Laplace bigram smoothing
In a corpus with vocabulary size 1,534, the word "tide" occurs 120 times and the sequence "tide turns" occurs 18 times. What is the add-one smoothed estimate of ? Use four decimal places.
6. Add-k smoothing
With , vocabulary size 5,733, prefix count and pair count , compute the add-k smoothed . Round to four decimal places.
7. Linear interpolation
A trigram model is smoothed by interpolation with on the unigram estimate, on the bigram estimate, and on the trigram (its count is zero). Suppose and for the word in question. What is the interpolated probability? Use three decimals.
8. Stupid backoff score
A stupid backoff model uses weight and terminates in the unigram distribution. For the next word , the trigram count is zero, the bigram count is positive with relative frequency 0.5 and the bigram estimate is 0.5. Compute the stupid backoff score . Round to four decimal places.
Practice this interactively
Free account · instant grading · spaced review that schedules itself.
Start this course for free