Artificial
Intelligence

Fall 2007
course
navigation

nov 29

pg 548 in text * ... with slightly different numbers : P(rain t+1 | rain t) = .7 P(rain t+1 | ! rain t) = .2 P(umbrella | rain) = .9 P(umbrella | ! rain) = .2 * observed umbrella usage days 1 .. 5 = (T, T, F, T T) * start with P(rain) = .1 on day 0 before umbrella seen use Trellis diagram and Viterbi algorithm to find most likely weather sequence. How much storage and run-time does this need as function of number of days ? How many weather sequences are there? How does that grow as number of days ? Given a grammar and a string of text, "parsing" is 1. Identify tokens 2. Generate parse tree 3. Assign meaning
http://cs.marlboro.edu/ courses/ fall2007/ai/ lecture_notes/ nov_29
last modified Thursday November 29 2007 2:16 pm EST