Exam will be CLOSED BOOK, CLOSED NOTES, with NO ELECTRONIC COMPUTING DEVICES

For the exam, you should know...

 How to step through one iteration of the following algorithms:
 - CKY parser
 - Probabilistic CKY parser

 Short answer:
 - What is a context-free grammar, how does it define trees
 - In general terms, why might context-free grammars be too restrictive for NLP
 - In general terms, why might context-free grammars be too expressive for NLP
 - What kind of ambiguity arises in parsing
 - How to construct, compose lambda calculus expressions
 - What kind of ambiguity arises from quantifier scope
 - What is the advantage of quasi-logical form
 - Give some examples of higher/lower-order denotations
 - In general terms, what is good/bad about higher/lower-order denotations
 - In general terms, what are some potential advantages and disadvantages
     of incremental parsing/semantics