This page introduces you to part-of-speech tagging . We will discuss the part-of-speech tagging problem and introduce a probabilistic model suitable for the task (hidden Markov model, HMM). We will discuss how to estimate the model, and how to predict the most likely sequence, without having to enumerate all the possibilities (a dynamic programming algorithm).
Please do the required reading and attempt the quiz. If there is anything you don't understand, then please ask questions in the lecture or on piazza.
Slides and required reading
Reading: Sections 6.1-6.4 in Jurafsky & Martin (2nd edition).
Quiz 12: Part-of-speech tagging
These questions are designed to test your understanding of the above course content; doing this quiz does not contribute to your overall grade. Some questions require a text answer. You can ask for formative feedback on these from your tutor or on piazza. Other questions are multiple choice or they require a numeric answer: you will get immediate feedback for these. Please don't attempt this quiz until you have acquainted yourself with this lecture and the required reading.
You must be logged onto Learn to do this quiz.