This quizz covers material from the ninth lecture on Syntactic Parsing.
Give an example demonstrating human speakers share a sense of syntactic structure as a hierarchical set of relations among words within sentence that contradicts a purely sequential account of sentences.
Show the dependency parse tree of the following English sentence (without labels on the edges):
The little girl reads a book about NLP.
Show the constituency structure of the same sentence - where the pre-terminals (part of speech categories) are Det, Adj, N, V, Prep
and the non-terminal categories are NP (noun phrase), VP (verb phrase), PP (prepositional phrase) and S (sentence).
Provide the formal definition of a CFG:
A CFG is defined by a 4-tuple (NT, T, S, R) where:
When generating random sequences according to a CFG, what are the 2 primitive computational operations that must be used
to implement the semantics of the CFG?
What are the possible forms of rules for a CFG in Chomsky Normal Form (CNF)?
What is the complexity of parsing a sentence of n words according to a CFG grammar in CNF using the CKY algorithm?