Dynamic Programming: LCS (22)
Michael L. Littman
December 4th, 1997
ANNOUNCEMENTS
SEGMENTATION
Review
Probabilistic Language Models
Unigram Idea
Unigram Algorithms
Count in 1M Tokens (WSJ)
Probability of a Segmentation
Maximum Probability Segmentation
Final Table
Algorithm
Discussion
Correctness
Algorithmic Design
LONGEST COMMON SUBSEQUENCE
Problem
Formal Definition
Algorithmic Ideas
Optimal Substructure Theorem
Recursive Formula
Algorithm
General Running-Time Analysis for Dynamic Programming
Beam Search
Memoization
Homework 11: Final (incomplete)
Next:
ANNOUNCEMENTS