Due on paper 8:30AM Monday, 5/9.
These questions refer to a small grammar and lexicon restricted to the domain of Ernie's breakfast.
If you run the Earley algorithm on the sentence "Ernie eats a pancake", how many lines of the form "# -> S ." does your chart contain? Explain the parses to which these lines refer.
Give three examples of word sequences that are accepted by our grammar/lexicon/algorithm but that are not grammatically correct English sentences.
After the fashion of the syntax-driven semantic analysis presented in Chapter 15, show semantic attachments for each of the rules in our grammar and lexicon. Then, show the parse tree for "Ernie eats a big pancake" with semantic attachments next to each of the non-terminal constituents in the tree.
Show how to to add enough to our structure to enable us to deal with the sentence "Ernie eats a big pancake slowly in the kitchen." Show the resulting grammar, lexicon, and semantic rule structure. Also show the most natural parse tree for this sentence, including the semantic attachments at each non-terminal node in the tree.