Questions: Derivation Versus Generation in Formal Grammar

Question 1

A linguist using a derivational grammar (like early Transformational-Generative grammar) and a linguist using a constraint-based grammar (like HPSG) both analyze the same ungrammatical sentence. How does each explain why the sentence is ill-formed?

• A. The derivational linguist identifies violated constraints; the constraint-based linguist traces the failed derivation step
• B. The derivational linguist shows no valid derivation produces the structure; the constraint-based linguist identifies which constraints the structure fails to satisfy
• C. Both approaches explain ill-formedness identically — derivation and constraint are interchangeable formal tools
• D. Only derivational grammars can explain ill-formedness; constraint-based grammars only describe well-formed sentences

Answer: (B)

The key difference is in what 'explanation' means in each framework. Derivational explanation is procedural: a sentence is ill-formed because no valid sequence of rule applications can produce it — some step in the derivation fails or cannot apply. Constraint-based explanation is declarative: a sentence is ill-formed because it violates one or more well-formedness conditions that all grammatical structures must simultaneously satisfy. The same empirical fact (the sentence is bad) receives different theoretical explanations that reflect the framework's fundamental commitments about what grammar is — a procedure or a set of conditions.

Question 2

Constraint-based frameworks like HPSG and LFG represent a fundamentally different conception of grammatical knowledge than derivational frameworks. Which of the following best captures the nature of that difference?

• A. Constraint-based grammars are more powerful because they can describe sentences that derivational grammars cannot
• B. Derivational grammars describe a process; constraint-based grammars describe a state — one is procedural, the other is declarative
• C. Derivational grammars apply rules in parallel; constraint-based grammars apply them sequentially
• D. Constraint-based grammars replace phrase structure rules entirely; derivational grammars retain them

Answer: (B)

The fundamental distinction is procedural versus declarative. A derivational grammar specifies a procedure: start with a symbol, apply rules in sequence to expand it, until a string of words is produced. The derivation is the grammar's knowledge representation. A constraint-based grammar specifies conditions: here is a set of requirements that any well-formed structure must simultaneously satisfy. There is no ordered procedure — constraints evaluate candidate structures in parallel. This same procedural/declarative split appears in programming (imperative vs. declarative languages), logic (proof-theoretic vs. model-theoretic), and elsewhere. The two approaches can often describe the same data, making the debate partly about which better represents human linguistic competence.

Question 3

In a derivational grammar, the sequence of rule applications that builds a syntactic structure from an initial symbol down to a string of words is called a derivation.

• T. True
• F. False

Answer: True

True. In derivational frameworks (such as early Transformational Grammar), grammar is represented as a set of rewrite rules: S → NP VP, NP → Det N, and so on. Beginning with the start symbol S, rules are applied in sequence to expand non-terminal symbols into further symbols or into words. The ordered sequence of these steps is the derivation, and the resulting tree records its history. This sequential, procedural character is the defining feature that distinguishes derivational from constraint-based frameworks.

Question 4

Constraint-based grammars are empirically more powerful than derivational grammars — they can describe a strictly larger set of grammatical phenomena.

• T. True
• F. False

Answer: False

False. The debate between derivational and constraint-based frameworks is not primarily about expressive power or empirical coverage — both types of formalism are capable of modeling the same linguistic phenomena. The differences lie in how knowledge is organized (procedural vs. declarative), how explanation is structured (failed derivation steps vs. violated constraints), and which architecture is claimed to better reflect actual mental grammar. Choosing a framework is a theoretical commitment about the nature of linguistic knowledge, not a claim that one framework can describe phenomena the other cannot. Particular formalisms may differ in computational properties, but the general dichotomy is not a power hierarchy.

Question 5

How does the distinction between derivation and constraint-based grammar parallel the distinction between procedural and declarative representations in computer science? What does this isomorphism reveal?

Model answer: A derivational grammar is procedural: it specifies a step-by-step process that produces grammatical structures from initial symbols. A constraint-based grammar is declarative: it specifies conditions that any well-formed structure must satisfy, without specifying how that structure is constructed. This mirrors the programming distinction between imperative languages (which specify operations to perform in sequence) and declarative languages like Prolog or SQL (which specify what must be true of the output). The isomorphism reveals that the derivation/constraint split is a general tension in formal systems — not unique to linguistics — between building-by-procedure and filtering-by-condition. Recognizing it lets intuitions transfer across domains.

The same split appears in logic (proof-theoretic vs. model-theoretic semantics), machine learning (generative vs. discriminative models), and database querying (procedural vs. set-based retrieval). In each case the procedural approach emphasizes how an output is constructed; the declarative approach emphasizes what conditions the output must satisfy. The grammar debate is a specific instance of this fundamental choice in formal knowledge representation.