113 ;;Quote: the linguist seeks a simple and revealing grammar that explains the ability to produce and understand new sentences and recognize ungrammatical ones; hopefully leads to a general theory

114 ;;Quote: finite-state grammars are the simplest that generate an infinite number of sentences from a finite apparatus

115 ;;Quote: English is not a finite-state language because 'If S then S' has an unbounded dependency set

116 ;;Quote: statistical approximation is irrelevant to grammar; e.g., 'colorless green ideas sleep furiously' is rare but grammatical

117 ;;Quote: a phrase-structure grammar is a finite set of rewriting rules on a finite alphabet and initial strings; uses subset for terminals

118 ;;Quote: simplify a phrase-structure grammar by ordering the rewriting rules and identifying obligatory rules

120 ;;Quote: a context-sensitive grammar for verb phrases is too complex

121 ;;Quote: a transformational grammar consists of a kernel of basic sentences and optional transformations to derived sentences; e.g., active to passive

123 ;;Quote: limit kernel to a small set of simple, declarative sentences; defines content since transformations preserve meaning