A linguist writes the rule NP → Det N. What is the key advantage of this symbolic representation over writing out every noun phrase in the language?
AIt is shorter and takes less space on the page
BIt captures a generalization that applies to an infinite class of phrases, expressing what they all have in common
CIt prevents ambiguity by specifying exactly which noun phrases are permitted
DIt allows computers to parse sentences faster than natural language descriptions
The rule NP → Det N applies to 'the dog,' 'a tree,' 'every student,' and infinitely many other phrases — it expresses the shared structural fact about all of them at once. This is the algebraic move: replacing a specific instance with a variable that ranges over an infinite class. Without symbolic abstraction, a linguist would need to list each phrase individually, which is impossible and misses the generalization entirely.
Question 2 Multiple Choice
A student says the rule S → NP VP merely describes sentences that already exist rather than predicting which combinations are grammatical. What is wrong with this view?
AThe rule only applies to English, so it cannot make universal predictions
BGenerative rules specify which symbol combinations are well-formed, making predictions about sentences never before uttered
CThe rule is a prescription, not a description, so it cannot describe anything
DRules like S → NP VP are too simple to be predictive in real languages
A grammar in the formal sense is a generative system — it specifies which combinations of symbols are well-formed and which are not. This makes predictions: any sequence that cannot be derived by the rules is predicted to be ungrammatical. The student's view misses that the rules apply to novel sentences never heard before, which is what makes symbolic representation so powerful — it captures productivity and systematicity, not just a catalogue of past utterances.
Question 3 True / False
A phrase structure rule like NP → Det N describes individual noun phrases rather than stating a generalization across an infinite class of phrases.
TTrue
FFalse
Answer: False
The whole point of symbolic abstraction is to move from specific instances to general patterns. NP → Det N applies to every determiner-noun combination in the language — an infinite set of phrases — with a single rule. This is the linguistic parallel to algebraic variables: 'x' doesn't describe one number, it ranges over all of them. Rules describe patterns, not instances.
Question 4 True / False
Feature notation like [+plural] or [CASE: nom] allows agreement and selection restrictions to be stated symbolically rather than as lists of individual word combinations.
TTrue
FFalse
Answer: True
This is precisely what feature notation accomplishes. Instead of listing every subject-verb pair that agrees in number, a feature [±plural] on noun phrases and verbs allows agreement to be stated as a single constraint: matching feature values. The same logic applies to case, animacy, gender, and other grammatical features. Symbolic notation replaces enumerations with constraints on variables.
Question 5 Short Answer
Why does symbolic representation in linguistics function similarly to algebraic variables, and what does this allow linguists to do that enumeration of examples could not?
Think about your answer, then reveal below.
Model answer: Just as the variable x in algebra stands for any number rather than a specific one, symbols like NP or the feature [+plural] stand for a category that ranges over infinitely many specific instances. This abstraction allows linguists to state generalizations — rules, constraints, and patterns — that hold across all members of a category at once. Enumeration is impossible (languages are infinite) and misses the point: what matters is the structural relationship, not the specific items.
The analogy to algebra also highlights what makes symbolic grammar 'formal': it is precise enough to support deduction. From a set of rules, you can derive which sentences are well-formed and which are not, and you can prove properties of the grammar as a whole. This is the foundation for computational linguistics and formal language theory — both depend on treating linguistic structure as a symbolic system rather than a collection of examples.