Weighted Finite-State Transducers in Speech and Natural Language Processing: Course Outline
May 7, 2009
1
Lectures
• 2009.05.07: Graph Algorithms – Basic definitions – Proof by induction – Breadth first search – Depth first search – Topological sorting – Strongly connected components • 2009.05.11: Conventional Finite-State Automata – Basic definitions – Nondeterministic automata – Deterministic automata – Power set construction – Transitive closure – -closure – Automata intersection • 2009.05.18: Finite-State Automata and Regular Expressions – Regular sets and regular expressions – Pumping lemma – Equivalence of finite automata and regular expressions – Closure properties of regular sets – Semirings 1
• 2009.05.25: Mimization and All-Pairs Shortest Paths – All-pairs shortest paths – Myhill-Nerode theorem and minimization of finite automata • 2009.06.01: Context-Free Grammars – – – – – Basic definitions Derivation trees Characteristic machine Chomsky normal form Griebach normal form
• 2009.06.08: Weighted Finite-State Transducers – – – – Basic definitions Weighted composition Weighted composition with -symbols Mohri’s theorem
• 2009.06.15: Weighted Determinization – Weighted determinization – Non-determinizability • 2009.06.22: Weight Pushing and Weighted Minimization – Weight pushing – Weighted minimization – removal • 2009.06.29: Automatic Speech Recognition I – Representation of Knowledge Sources – Search graph construction – Reducing search graph size • 2009.07.06: Automatic Speech Recognition II – Modeling context dependency – Reduction of search graph size – Fast On-the-Fly Composition • 2009.07.13: Approximation of CFGs with WFSTs I • 2009.07.20: Approximation of CFGs with WFSTs II • 2009.07.27: Machine Translation • 2009.07.30: Review 2
2
¨ Ubungen
• 2009.05.14: Graph Algorithms – Depth-first search – Topological sorting – Proof by induction • 2009.05.21: Power Set Construction – Power set construction – -closure • 2009.05.28: Automata Intersection • 2009.06.04: Automata Minimization – All-pairs shortest path – Automata minimization • 2009.06.11: Weighted Composition • 2009.06.18: Weighted Determinization • 2009.06.25: Weighted Minimization – Weight pushing – Weighted minimization • 2009.07.02: Epsilon Removal • 2009.07.16: Static Speech Recognizer • 2009.07.09: Fence Construction • 2009.07.23: On-the-Fly Composition
3