CMSC 25000 - Artificial Intelligence
Winter 2007
Homework #7: Due March 1, 2007
Goals
Through this assignment you will:
- Explore Weighted Automata/Markov Models as a mechanism for reasoning with uncertainty over time.
- Experiment with the use of these models for pronunciation modeling and
speech recognition.
Problem 1
Implement the "forward" algorithm (NOT the full forward/backward).
For this assignment, you may use a programming language of your
choice. If you prefer to use something other than Scheme, that's
fine. You should carefully document and submit both your code
and its operation on various examples.
Apply your implementation to either the "tomato"(text) or "about"(slides)
automata. Demonstrate the operation of the algorithm on
two pronunciations.