Natural Language Processing · free preview
N-gram Language Models and the Markov Assumption
Chain-rule factorization of sentence probability, the Markov shortcut, maximum likelihood estimation from counts, and log-space arithmetic.
1. N-gram Language Models and the Markov Assumption
N-gram Language Models and the Markov Assumption
2. Estimating n-gram probabilities by relative frequency
Estimating n-gram probabilities by relative frequency
3. A bigram model over a small logbook corpus
A bigram model over a small logbook corpus
4. One bigram estimate
In a corpus the word "fog" occurs 90 times, and the sequence "fog horn" occurs 12 times. What is the maximum likelihood estimate of ? Give the answer rounded to three decimal places.
5. Multiplying conditionals
A bigram model assigns these probabilities along the sentence "the harbour lights burn": 0.4 0.2 0.25. What probability does the model give the whole sentence? Use five decimal places.
6. Adding log probabilities
A model stores four factor probabilities as natural logs: -3.45, -3.07, -1.7, -3.82. What is the sum of the log probabilities, and hence the log of the sentence probability? Give the log-space total rounded to two decimals.
7. A ratio from a real count table
A corpus consists of these sentences: the tide turns; fog hides the buoys; the fog lifts. Every sentence is padded with a start symbol and an end symbol . Compute under the bigram MLE. Use three decimals.
8. Scoring a padded sentence
With the same corpus (the tide turns; fog hides the buoys; the fog lifts, padded with boundary symbols), what probability does the bigram model assign to the sentence "the fog lifts" including its boundary symbols? Round to four decimals.
Practice this interactively
Free account · instant grading · spaced review that schedules itself.
Start this course for free