Dynamic Programming: Segmentation (21)
Michael L. Littman
December 2nd, 1997
ANNOUNCEMENTS
DYNAMIC PROGRAMMING
What?
End-Game Plan
DP Examples
SEGMENTATION
Segmentation
Choices
Count in 1M Tokens (WSJ)
Algorithmic Ideas
Simple Path Example
Problems with Path Approach
Probabilistic Language Models
Unigram Algorithms
Probability of a Segmentation
Maximum Probability Segmentation
Algorithm
Discussion
Correctness
Algorithmic Design
HOMEWORK
Homework 11: Final (incomplete)
Next:
ANNOUNCEMENTS