Chomsky-normal-form derivation length
= Chomsky-normal-form derivation length
{c}
A Chomsky-normal-form parse tree for a word of length $n\geq1$ has $n$ terminal productions and $n-1$ binary productions. Every derivation represented by the tree therefore has exactly $2n-1$ steps.