Constituency Grammars Flashcards
What does syntax mean?
It is the way words are arranged together
What does syntactic consistency mean?
It is the idea that words can be grouped into single units (e.g. Noun Phrase)
How do we form constituents?
We use evidence from the context of the sentence to group words to form them
What is a constituent?
It is a word or group of words that function as a single unit
How can evidence be encoded?
In rules or grammars
What are some different Grammar types?
Context Free Grammar (CFG)
Dependency Structure Grammar
What are some features of a CFG?
Rules are based on phrasal constituents + phase-structure
Word order is very important
Head terms are embedded into trees making it harder to find
What are some features of a Dependency Structure Grammar?
Rules are based on grammatical dependencies between words
Word order is flexible
(Head → Dependent) approximates the semantic relationship between predicates and arguments
State which of the graphs show a CFG and a Dependency Grammar.
The left is a Dependency Grammar
The right is a CFG
Explain what the graph generated using CFG shows.
The root node, S, is saying we have a sentence, and for this parse tree the sentence will have a noun phrase followed by a verb phrase. We can see that the noun phrase consists of a pronoun, which we can see is ‘I’. We can see that the verb phrase consists of a verb and noun phrase. This continues until we reach all the leaf nodes.
What are the leaf nodes typically in a CFG graph?
They are typically lexical terms (words)
What are dependency grammars based on?
They are based on the subject-object relationship.
What does a context free grammar model?
It models constituent structure
What two things does a CFG have?
A lexicon (of words and symbols)
A set of rules (or productions)
What form are CFG rules equivalent to?
Backus-Naur Form (BNF)
How are CFG rules embedded, and what does it allow them to do?
They are hierarchically embedded, meaning that they can trigger other rules
Explain how the productions work in the image.
Given a left symbol, generate a right set of symbols.
One derivation is where you follow the productions all the way through
The productions can actually be recursive
What are some typical CFG production rules?
Leaf nodes are terminal nodes
Non-terminal nodes define lexical categories (POS)
A node is said to dominate its child nodes
The root node is the start symbol (usually ‘S’)