The mid-term exam will be given in class on Tuesday Oct. 23. It will take the entire class hour. It is open book and open notes, but no computers.
The mid-term will cover the material on natural language processing presented in class through Tuesday, Oct. 16.
Natural language processing: Parsing, semantics, ambiguity resolution.
(Russell and Norvig chap. 22 sections 22.1-22.3, 22.5, 22.6, handouts.)
Syntax and semantic of propositional logic.
Conjunctive normal form (CNF). Converting a sentence to CNF.
Compiling problems into satisfiability.
(R&N 194-211, 215, 220-232, plus handouts):
Predicate calculus (first-order logic): Syntax, use in expressing
sentences, backward and forward chaining inference in Datalog.
(R&N chap. 8 through section 8.2, section 9.3 and the beginning of 9.4 (pp. 280-288). Handouts.)
I will not ask about any material in the textbook that I have not discussed in lecture.
You should know the following algorithms well enough to be able to
execute them in an exam problem:
Recursive descent parsing, chart parsing, conversion to CNF, Davis-Putnam algorithm, forward and backward chaining in Datalog.