CA261 Computational Linguistics II
Lecture slides
Introductory information on Computational Linguistics II
Finite State Automota
Finite State Transducers
Computational Morphology 1
Computational Morphology 2
Computational Phonology
Spelling Correction
Minimum Edit Distance
(Slightly more user friendly than version Jurafsky & Martin, 2000)
N-grams
Weighted Automata
Dynamic Programming
Markov Models
Trellis Algorithms
POS Tagging
Hidden Markov Tagger
Probabilistic Parsing
Assignments
Assignment 1: DFSAs
Assignment 2: NFSAs/FSTs
Assignment 3: Word counting for spellchecking
Assignment 4: Spellchecking
Assignment 5: Text Prediction
Assignment 6: Dynamic Programming
Lab Notes
Week 3 Lab
Past Exam Papers
2000/2001