PhD thesis,
On Inducing a Non-Trivial, Parsimonious Grammar for a Given Sample of Sentences
University of Michigan, Computer and Communication Sciences Department, (January 1973)
Abstract
This thesis presents an algorithm which, for a given sample of sentences, induces a grammar that (1) can generate the given sample of sentences, (2) is non-trivial in the sense that is does not merely enumerate the sentences of the sample, (3) is hierarchical in the sense that the sentences of the sample are derived through relatively long sequences of sentential forms, (4) is, at the same time, parsimonious in the sense that the grammar contains a relatively small number of rules of production, (5) contains recursive rules of production under appropriate specified conditions, and (6) contains disjunctive rules of production (and generalizations) under appropriate conditions. ...
