DTIC · phrase complementation, relative clause formation, two types of question construction,...
312
• \ ( AFCRL-66-270 ' SPECIFICATION AND UTILIZATION OF A TRANSFORMATIONAL GRAMMAR D. Lieberman INTERNATIONAL BUSINESS MACHINES CORPORATION Thomas J. Watson Research Center Post Office Box 218 Yorktown Heights, New York 10598 Contract No. AF19(628)-5t27 Project 4641 Task 464102 SCIENTIFIC REPORT NO. 1 Date of Report March 1966 CLEARINGHOUSE Jf()Jt l'EDBRAL SCIENTIFIC AND TECHNICAL INFORMA'TION --a-r--~~oon Mioroti1he Prepared for AIR FORCE CAMBRIDGE RESEARCH LABORATORIES OFFICE OF AEROSPACE RESEARCH UNITED STATES AIR FORCE BEDFORD, MASSACHUSETTS .... - .. .
Transcript of DTIC · phrase complementation, relative clause formation, two types of question construction,...
•
\ (
AFCRL-66-270
'
SPECIFICATION AND UTILIZATION
OF A TRANSFORMATIONAL GRAMMAR
D. Lieberman
INTERNATIONAL BUSINESS MACHINES CORPORATION Thomas J. Watson Research Center
Post Office Box 218 Yorktown Heights, New York 10598
Contract No. AF19(628)-5t27
Project 4641
Task 464102
SCIENTIFIC REPORT NO. 1
Date of Report March 1966
CLEARINGHOUSE Jf()Jt l'EDBRAL SCIENTIFIC AND
TECHNICAL INFORMA'TION --a-r--~~oon Mioroti1he
Prepared for
AIR FORCE CAMBRIDGE RESEARCH LABORATORIES OFFICE OF AEROSPACE RESEARCH
UNITED STATES AIR FORCE BEDFORD, MASSACHUSETTS
.... - .. .
AFCRL-66-270 t
SPECIFICATION AND UTILIZATION
OF A TRANSFORMATIONAL GRAMMAR
D. Lieberman
INTERNATIONAL BUSINESS MACHINES CORPORATION Thomas J. Watson Res;earch Center
Post Office Box 218 Yorktown Heights, New York 10598
Contract No. AF19(628)-5127
Project 4641.
Task 464102
SCIENTIFIC REPORT NO. 1
Date of Report March 1966
Distribution of this document is unlimited.
Prepared for
AIR FORCE CAMBRIDGE RESEARCH LABORATORIES OFFICE OF AEROSPACE RESEARCH
UNITED STA TES AIR FORCE BEDFORD, MASSACHUSETTS •
-
Preface
The objective of this project titled "Specification and
Utilization of a Transformational Grammar" is the investi
gation of the applicability of transformational theory as a
theoretical support for linguistic aspects of language data
processing. As the first step in our research program,
we are developing a transformational grammar of English,
including a large lexicon, and computer programs to aid
in the grammatical and lexicographic work. Our approach
and achievements thus far are presented herein in four
parts:
Part I, "The IBM Core Grammar of English"
by P. Rosenbaum and D. Lochak
Part II, "Design of a Grammar Tester"
by D. Lieberman
Part III, "Programming of the Grammar Tester"
by F. Blair
Part IV, "Computer Support for Lexicon Development and Use"
by D. Lieberman and D. Lochak
Professors E. Klima and G. H. Matthews served as
consultants to the project.
D. Lieberman Principal Investigator
Abstract
Scientific Report No. 1 contains four parts:
Part I - The IBM Core Grammar of English. Our current
grammar of English is presented in full, and numerous
derivations are carried out in detail to illustrate the
current generative power of the grammar.
Part II - Design of!. Grammar Tester. The design considera
tions on which the present version of the tester was based
are discussed, and a set of tentative input, output, and
control formats are presented.
Part III - Programming for the Grammar Tester. A LISP
implementation of the grammar tester is presented, The
overall flow of control and the various special functions
are described.
Part IV - Computer Support for Lexicon Development. A
program package (programmed in SNOBOL) to facilitate
the compilation, modification, scanning, etc. of the
lexicon is described,
PART I
"THE IBM CORE GRAMMAR OF ENGLISH"
P. Rosenbaum
D. Lochak
1.0
2. 0
3. 0
4.0
Table of Contents
Introduction
The Phrase Structure Component
2. 1 Rewriting Rules
2. 2 The Lexicon
The Transformational Component
3. 1 Introduction
3. 2 Transformational Rules
Derivations on the Core Grammar (CG)
4. 1 Conventions
4.2 Sentence Types
4. 3 Derivations
5. 0 Notes
Page
1
1
1
9
17
17
33
52
52
53
56
...
i
Abstract
THE IBM CORE GRAMMAR OF ENGLISH
by
Peter S. Rosenbaum and Dori ta Lochak
International Business Machines Corporation Thomas J. Watson Research Center
Yorktown Heights, New York
A transformational grammar is presented which characterizes
sentence types exemplifying noun phrase complementation, verb
phrase complementation, relative clause formation, two types of
question construction, indirect object and prepositional phrase con
structions, passive constructions, aspectual constructions, and
certain types of negation phenomena.
The presentation consists of 1) a theoretical introduction ex
plaining the version of transformational theory from which the IBM
Core Grammar of English h , c,lnstructed, Z) a presentation of the
Core Grammar, and 3) a set of sixty-six derivations constructed
in terms of the Core Grammar.
. .,..
l
1.. 0 Introduction
The linguistic description discussed in this section, the
IBM Core Grammar of English (henceforth referred to as the
CG), conforms, in its essentials, to recent theoretical propos
als.1 The version of the transformation theory of syntactic
descriptions underlying the CG provides two basic components,
a phrase structure component and a transformational compo
nent. The former treats the generation of underlying consti
tuent structures and the introduction of lexical material into
these structures. The latter deals with the transformation of
these underlying structures into derived constituent structures.
z. 0 The Phrase Structure Component
Z. 1. Rewriting Rules
The phrase structure component of the CG contains an un
ordered set of rewriting rules of the general form A---->~.
where A is a single nonnull symbol and ~ is a nonnull string of
symbols which is distinct from and does not contain A. A con
siderably oversimplified set of phrase structure rewriting
rules might be the following:
(1.) Sentence ----> Noun Phrase+ Verb Phrase
Verb Phrase - - - -> Verb+ Noun Phrase
Noun Phrase ----> Determiner+ Noun
Subrules, i. e. , alternative expansions of the same symbol, are
required to be abbreviated either by braces or by parentheses.
For example, the rule given in (Z) is an abbreviation for rules
( 3a) and ( 3b). If the rule (2.) is required to apply, then the
symbol tense must be expanded either as Present or as Past.
(2) Tense-----> {
Present} Past
(3) a. Tense ----> Present
b. Tense ----> Past
Similarly, rule (4) is an abbreviation for the subrules (Sa) and
( Sb).
(4) Noun Phrase ---->(Determiner)+ Noun
(5) a. Noun Phrase ---->Determiner+ Noun
b. Noun Phrase - - - -> Noun
The sequential application of the rewriting rules, starting
with an initial symbol, S, and continuing with each successive
line formed by the application of one rule to one symbol in a
string, results in the generation of a derivation. Symbols ap
pearing on the right side of a rewriting rule are either termi
nal or non-terminal. Symbols appearing on the left side of a
rewriting rule are only non-terminal. Glossaries of non
terminal and terminal symbols are provided in (6) and (7),
respectively.
(6) s Sentence
PRE Pre sentence
NP Noun Phrase
AUX Auxiliary
VP Verb Phrase
pp Prepositional Phrase
MAN Agen'tive Phrase
DET Determiner
ART Article
T Tense
2
(7) NEG
Q
PRES
PAST
M
have
en
be
ing
V
PREP
N
ADJ
DEF
INDEF
WH p
*
Negative
Question
Present
Past
Modal
Have
En
Be
Ing
Aspe ctual morphemes
Verb
Preposition
Noun
Adjective
Definite
Indefinite
WH
Passive
Sentence Boundary
The derivation of an underlying constitutent structure through
the application of the rewriting rules is terminated when the
derivation contains no unexpanded non-terminal symbols, i. e. ,
no generated non-terminal symbols remain to be expanded.
Particular derivations are identified by means of a
uniquely associated labelled bracketing or tree diagram refer
red to as a P-marker. These alternative notations are illus
trated for the rules in (1) as follows:
3
(8)
a. [[D
ete
rmin
er
No
un
]N
Ph
[V
erb
[Dete
rmin
er
No
un
]No
un
Ph
rase
]Verb
Ph
rase
]Sen
ten
ce
ou
n
rase
b.
Dete
rrn
iner
~
Det
ern
11
ner
N
ou
n
~
~
~ .....
r?'
With respect to a P-marker, a substring of symbols which is
uniquely traceable back to some node la belled X in a P-marker
has the analysis X (is ~ X). For example, in (8) the sub
string Verb+ Noun Phrase is a Verb Phrase. If A is a sym
bol in a string '3 which is itself an X, then A is dominated by
X. Finally, X immediately dominates a symbol B if X domi-
B and if X dominates no symbol C such that C dominates B.
(9)
The rewriting rules of the Core Grammar are as follows:
S ----> # (PRE) NP AUX VP
PRE - ---> (NEG) (0)
AUX----> T (M)
T ----> {:!::} VP----> (have en)(be ing)
*
PP----> PREP NP be (ADJ)
MAN----> PREP p
NP----> (DET) N (S)
DET - ---> ART (S)
ART ----> (WH) {DEF } INDEF
Although the physical dimensions of the CG' s rewriting
rules are small, the system is extremely powerful. This
power stems from the fact that the initial symbol, S, is re
cursive under the VP (Verb Phrase), under NP (Noun Phrase),
and under DET (Determiner). The expansion of VP and NP is
of particular interest. Two possible expansions of VP are
given in (10) and (11). These expansions characterize intran
sitive Verb Phrase complementation and transitive Verb
5
,,
.... ,
Phrase complementation, respectively. In their fully derived
form, these expansions correspond to the sentence comple
ment constructions in ( 1 Z) and ( 1 3).
{10) VP----> V + S
{11) VP----> V+ NP+ S
(1Z) John condescended to f!!I. ball with Sam
( 1 3) John tempted Bill !£ E.!!I, ball with Sam
Similarly, two distinct types of sentence complementation are
derived through the expansions of NP given in (14) and (15).
(14) NP----> DET + N + 5
(15) NP----> N + S
The expansion (14) might yield sentences like those in (16),
depending upon the distribution of NP in the underlying
structure.
(16) a. the fact that John came late bothers me
b. Bill pondered the fact that John came late
c. Harry worried about the fact that John came late
The expansion (15) is more interesting. When NP is domi
nated immediately by S, in one possible derivation, sentences
of the type exemplified by (17) and {18) may result.
( 17) it appears that John i!, honest
(18) · John appears to be honest
When NP is dominated immediately by PP, sentences like (19)
and (ZO) can result.
(19) I reminded John of Bill's hav·ing !.!.!!_
(ZO) I reminded John that Bill left
.,
6
' ,
When NP is dominated immediately by VP, sentences like (21)
and (22) may be generated.
(21) I believe that John is honest
(22) I believe John to be honest
The system of rewriting rules characterizes yet another
instance of S recursion, namely, the expansion of DET into
ART + S, which provides for the generat·:lon of relative clause
structures, some examples of which are given in (2 3).
(23) a. the boy who~~ smiled
b. the boy! ~ smiled
c. whatever you do bothers me
d. whichever article i.s selected will disintegrate
Beyond these important complex sentence constructions, the
system provides for several of the syntactic functions which
are usually seen to be fairly central to any adequate linguistic
description. These include two types of questions, "yes-no"
questions and NP questions as exemplified by the sentences in
(24), indirect object and prepositional phrase constructions,
passive sentences, sentences with aspectual properties, and
negation constructions.
(24) a. did John leave
b. which tall boy did you see
The system of rewriting rules in the CG suffers from
three fundamental gaps. First, the rules do not characterize
anything approaching a complete Determiner system. Second,
no Adverbial constructions of any kind are generated. Third,
there is no provision for the description of the processes of
conjunction and subordination. At present, we are experimenting
7
. ~
'1
~• I
...,
with several schemes for the description of the Determiner
system. The results of these studies will most probably be
included in an updated version of the CG to appear in approxi
mately eight months. The same is true for the Adverbial
system. We have given little attention to the problems of con
junction since theory is not sufficiently advanced to dictate the
nature of the device which will offer an explanation of the com
plex array of facts comprising conjunction phenomena. Hope
fully, theoretical insights with regard to conjunction will be
forthcoming and research in the description of this process can
be more profitably pursued.
The system of rewriting rules contains several question
able forrnulationa. For one, it is becomin ,.., increasingly clear
that the aspectual and auxiliary systems p.1. csented in the CG
must be modified. We are, at present, considering the possi
bility of treating the aspectuals (have en) (be ing) as features
of a predicate constituent VB, (Verbal), which will range over
both Verba and Adjectives, thereby eliminating the aspectuals
as phrase structure constituents of the underlying structure.
We have illso been studying questions of greater theoretical
import. First, we are interested in determining whether
Modale (M) are moat properly to be analyzed as Verbals and
whether Tense (T) is to be considered a syntactic feature of
Verbals. Such an analysis would eliminate AUX from the
gramrnar. Sirnilar considerations concerning the Negative
marker (NEG), and the question marker (Q) are being studied.
Second, the rewriting rules of the CG treat Present and Past,
and DEF and INDEF, as actual constituents of T and ART,
respectively. There are many reasons to believe that Present
8
)
,..
9
and Past are not constituents of the non-terminal symbol T,
but rather are syntactic features of a terminal symbol T. The
same arguments which apply in this case (and which we do not
discuss at present) hold for DEF and INDEF. Third, the de
scription makes no clear-cut distinction between terminal sym
bols which are morphemes and terminal symbols which become
the bearer of a complex symbol, i.e., a pair consisting of a
stem morpheme given in terms of a distinctive feature matrix
on the one hand and a vector of syntactic features determining
the idiosyncratic properties of given morphemes. Much cur
rent research is devoted to theoretical questions of this sort.
For the practically inclined, it is germane to point out
that the sentence types which the system will produce (invari
ably with less than ideal theoretical motivation) are numerous
and of considerable diversity. It is our current research goal
to increase the number of sentence types that the grammar can
handle and to enlarge its scope in a manner consistent with
theoretical developments.
2. 2 The Lexicon
The lexicon of the CG consists of a list of lexical entries.
Each entry consists of {1) a phonological distinctive feature ma
trix defining the underlying phonological properties of a given
morpheme and (2) a syntactic feature vector (a comple.x: symbol).
It is the latter which is of central interest to us at present. (In
the CG, phonological distinctive feature matrices are abbrevi
ated by the normal spelling of the morpheme in question. ) A
syntactic feature specifies that a given morpheme either has or
does not have a specific syntactic property. Thus, the fea
tures of the CG are marked either "+" (for possession) or
"-" (for non-possession of the particular property). This
form of specification is known to be inadequate with respect to
several syntactic phenomena, and it appears that the binary
values of a feature are subject to a feature of markedness
which determines the applicability of a particular binary syn
tactic feature. 2 Such considerations are omitted, however,
from the CG and will be discussed in the updated version to
appear several months hence. From the point of view of the
CG, complex symbols are fully specified, either positively or
negatively, for all syntactic features.
The CG employs four distinct types of syntactic features.
The first characterizes syntactic categorization, that is, the
category of the terminal symbol to which a particular complex
symbol is assigned. For example, a noun like pencil carries
the syntactic feature ( +N) which states the condition for a
grammatical introduction of the complex symbol representing
pencil into the phrase structure. The verb slay carries the
feature (+V) , the modal must carries the feature (+M); and
the adjective awful carries the feature (+ADJ) . The syntactic
feature vector is governed by the convention that any syntactic
feature which is not marked positively is necessarily marked
negatively. Thus, the full feature specification of the verb
slay contains the features {+ V ). (-N ). (-M) , (-ADJ) .
The second type of syntactic feature characterizes the
strict subcategorization of a given morpheme. Strict subcate
gorizational features render notions like transitive-intransitive.
For example, the verb~ ca:rries the feature (+ __ NP); the
verb elapse carries the feature (+ __ ). The first feature
mentioned above asserts that hit has a privilege of occurrence
10
,
11
immediately before a Noun Phrase. The verb hit is marked
( - ) by convention. What insures that the NP specified in --the feature is in fact the NP dominated by VP in the constituent
structure is the principle of strict local subcategorization, 3
which asserts that the frames dominated by the constituent
which inirnediately dominates a complex symbol determine the
strict subcategorizational properties of the complex symbol.
For example, the strict subcategorization of verbs and adjec
tives is determined by those constituents dominated by VP.
The strict subcategorizati,on of nouns is determined by those
constituents dominated by NP. The feature ( + NP) is in---terpreted to refer only to the NP which is immediately domi-
nated by VP in the event that the complex symbol containing
this feature also contains the feature ( + V). For verbs, the
feature ( + ) means that VP may dominate no constituent --other than V.
The third type of syntactic feature renders the notion of
inherent feature specification. The characteristics of inherent
features are not well understood at present and it is difficult to
justify particular classifications. At present, the inherent
features of the CG treat several distinct syntactic properties.
First, the number of nouns is characterized in terms of the
feature ( +Sg) ( -Sg) where the former is interpreted as singu
lar and the latter as plural. Second, nouns are classified
either as human, ( +human), or as ~-human (-human),
and so on for other features such as animateness and concrete
ness. (Lexical redundancy rules will eliminate lexical redun
dancy by predicting, for example, that any lexical item
marked with the feature ( +human) is automatically marked
...
"
(+animate). ) In the CG the feature (aSg) (where a is a vari
able ranging over + and -) determines nwnber agreement on
verbal elements. The feature '2human) determines, in ad
dition to verbal selection, certain morphological aspects of
relative pror.oun formation and pronominalization in general.
The fourth type of syntactic feature specifies the selec
tional subcategorization of a lexical item. Where strict sub
categorizational features specify co-occurrence properties
with respect to grammatical frames, selectional subcategori
zational features specify co-occurrence properties with re
spect to the inherent feature makeup of complex symbols in
troduced into grammatical frames. For example, the verb
condescend requires a subject noun carrying the feature
(+human) since sentences like the boy condescended~ fall
off the table are grammatical whereas others like the book
condescended to fall off the table are not. The verb conde
scend must carry the selectional subcategorizati.on feature
( +X ( +human ) AUX __ Y). This feature has the following
interpretation: The verb condescend has the privilege of oc
currence in a P-rnarker which meets the following conditions:
The string of terminal symbolB (either dominating or not domi
nating .complex symbols) must be segmentable into five con
secutive substrings, of which the first is anything at all, the
second is some terminal constituent dominating a complex
symbol carrying the syntactic feature (+human), the third.!!_
!!! AUX, the fourth is a V, and the fifth is anything at all.
Si.nee the variables X and Y may be supplied by convention, the
feature can be stated as (+ (+human) AUX __ ). (In effect,
a selectional 1ubcategorization feature specifies the domain of
12.
,.
a rule with transformational power.) For present purposes,
the system of selectional subcategorization should be viewed
as a classificational scheme, but one without much theoretical
support.
At present, the lexicon completely neglects an account of
the restrictions which lexical items idiosyncratically impose
upon the application of transformational rules. Consider, as
an example of this phenomenon, the fact that for is optionally
deleted in (Z5 ), but obligatorily deleted in (Z6) , at least in the
dialect which the CG is intended to characterize.
(25) a. I would prefer for you to say something
b. I would prefer you to say something
(26) a. *I want for you to say something
b. I want you to say something
The fact that an account of these phenomena has not been in
corporated into the CG has an important consequence: namely,
that it is currently impossible to construct a transformation
whose application is determined by an idiosyncratic property
of a lexical item. Thus, there is good reason to assign high
priority to work in this area and we are, at present, adapting
certain aspects of solutions proposed in recent months to the
CG. 4
The version of syntactic theory underlying the CG does not
allow the generation of syntactic features in the phrase struc
ture component, although such power is probably required in a
fully adequate grammar. Complex symbols are introduced into
the phrase structure by means of a lexical embedding rule of
the form A ----> CS where A is an N, V, ADJ, or Mand CS
13
...,
is a complex symbol in the lexicon. This rule, applying after
the termination of the rewriting rules, is legal in a particular
instance just in case
(i) the complex symbol CS introduced under the domina
tion of some terminal symbol D contains some syntactic fea
ture (+F) such that F = D and,
(ii) the P-marker in which the CS is introduced falls un
der the domain specified by any one strict subcategorizational
feature and by any one selectional subcategorization feature
positively marked in the CS. (For a CS specified negatively
for all strict subcategorizational and selectional subcategori
zation features, i.e., a CS carrying the feature (+M) , con
dition (ii) does not hold.)
By way of illustration, consider the introduction of the
noun teapot into a P-marker having the sub-tree given in (27).
(27)
The noun teapot carries the features (+N), (+DET __ ),
(-DET __ S ), (-_S), (-__ ), among others. The in
troduction of this noun through the application of the lexical
embedding rule produces the structure given in (28).
(2.8) NP
(teapot) (+N)
(+DET --(-DET ___ s (-_S) (-_)
14
This introduction is legal with respect to condition (i), since
the complex symbol contains the feature [+N] and has been in
troduced under the domination of N. But the introduction is
illegal with respect to condition (ii). The complex symbol for
teapot is specified for the strict subcategorizational feature
( +DET ). A P-marker falling under the domain of this --feature is one in which NP dominates only DET, aside from
the N itself. The P-marker given in (29) falls under this
domain.
(29) NP
D~
15
Since NP dominates Sin (27), however, this P-marker does
not fall under the domain of the one strict subcategorizational
feature positively specified for the noun teapot. Thus, this
particular application of the lexical introduction rule is illegal
and the derivation is consequently blocked. The derivation of
an underlying P-marker is terminated when the lexical intro
duction rule has applied legally to all instances of the terminal
symbols N, V, ADJ, M, which have been generated through
the application of the rewriting rules. The structure thus pro
duced serves as the input to the transformational component.
The nat.ure of the procedure for introducing prepositions
into the underlying structure has not yet been determined. For
purposes of mechanical recognition, prepositions can be
thought of as being introduced by rewriting rules. An appara
tus for preposition introduction will be presented in the up
dated version of the CG.
The CG contains a lexicon of approximately seven thousand
words drawn from the Thorndike-Lorge list on the basis of an
occurrence frequency of ten or more per million. The feature
classlfication of these words is still minimal, since it includes
only the following:
Syntactic Category
(+N) boy
(+V). slay
(+ADJ) honest
(+M) must
Strict Subcatego!_!zation
Verbs (+V)
(+ NP S) tempt
(+ NP) disappoint
(+ PP) approve
(+ S) condescend
(+ ) elapse
Nouns (+N)
(+DET S) fact
(+DET ) teapot
(+ S) it
(+ ) John
Inherent Subcatesorization
Nouns (+N)
(+human) boy
(+animate) mongoose
(+abstract) blame
(-animate) table
(-abstract)
16
Selectional Subcategorization
Verbs (+V)
(+ (+ s))
(+ (+ S) S AUX )
(+ (DET) (+human) PREP
Adjectives (+ADJ)
(+ (+ S) S AUX )
(+ S))
suppose
both~r
remind
obvious
This list of classifications should not be construed as a com
pleted lexicon, for it will be immediately clear that the clas -
sifications are much too incomplete to allow the free genera
tion of strings which are free from strict subcategorizational
and selectional violations. The lexicon has been constructed
with two goals in mind; first, to study the theoretical problems
arising in the description of lexical phenomena within the
framework of a transformational grammar, and second, to
develop an experimental lexicon for the purpose of testing a
variety of computational procedures.
3. 0 The Trans£ ormational Component
3. t Introduction
The transformational component of the CG contains rules
which transform underlying P-markers into derived P-markers.
The domain of a particular transformational rule is provided
in terms of conditions on P-markers. Any P-marker or set
of P-markers meeting the conditions imposed by a particular
transformational rule falls under the domain of that rule. By
way clarification, consider the following hypothetical trans -
formational rule.
( 30) B+C
t t
D
2
• X
3==== > 3
17
The numbered sequence of elements comprising the first
two lines of the above rule (referred to as a structure index)
defines the set of P-markers which may undergo the transfor
mational alteration stated in the third line of the rule. The
structure index can be interpreted as asserting that any ter
minal st ing (last line of a P-marker) falls under the domain
of the tr;:..nsformation ( 30) just in case it can be completely
segmented into three consecutive substrings such that the
first substring is ! (member of the constituent or category
sequence) B + C, the second is a D, and the third is anything
at all. The diagram ( 31) contains a P-marker which falls
under the domain of the transformation ( 30).
( 31)
N
A E F
The terminal string of (31), i.e., E - F - C - G - H - M - N,
can be segmented in such a way that the conditions stipulated
by the structure index are met. The diagram ( 32) contains a
P-marker which does not fall under the domain of the trans
formation ( 30).
( 32)
N
It is clear that transformational rules stated in the above
fashion have the power of variable reference, since each
structure index characterizes a variety of P-markers. For
example, the transformation ( 30) would be defined on the
18
. ,
P-marker ( 31.) regardless of the constituency dominated by B.
If the phrase structure component from which this P-marker
was constructed contains the rule B- - - -> E + L + S, then an
infinite number of P-markers are provided, all of which will
fall under the domain of the transforma ::ion ( 30).
Transformation rules often involve two additional types
of restrictions on P-markers. The first is the restriction of
dominance where some subtree must either have a certain
analysis or must dominate some particular subtree. This in
formation is normally stated in the transformational rule
itself by means of a labelled bracketing. Consider, by way of
illustration, the following hypothetical rule:
(33)
i
i
2.
0
3
3
E
4====>
4
This transformation is defined on a terminal string just in
case the P-marker associated with this string can be seg
mented into substrings such that the first is an A, the second
is a B, the third is a C, the fourth is an E, and, furthermore,
the second followed by the third comprises a D, as in the P
marker given in ( 34).
( 34)
The transformation (35) is defined on a terminal string just in
case
19 .
( 35) A
1
1
2
0
E
3====>
3
the P-marker associated with this string can be segmented
into substrings such that the first is an A, the second is a D
which dominates a B followed by a C, and the third is an E,
as in (34) also.
The second type of restriction is the condition of identity
where a subtree must be identical or not identical to some
other subtree.5 Such a restriction is not stated in the structure
index or in the line which specifies the structure change, but
as a condition on the rule, as in ( 36).
( 36) A B C A
1 2. 3 4====>
1 2. 0 4
Condition: 1 ~ 4
Thia rule is defined on a terminal string just in case the P
marker associated with this string can be segmented into four
consecutive substrings, of which the first is an A, the second
is a B, the third is a C, and the fourth is an A, but where the
subtree A associated with the index 1 is not identical to the
subtree A associated with the index 4. For example, this
rule is defined on the P-marker in ( 37), but not on the P
marker in ( 38).
(37)
.. '
20
I
,
(38)
Transformational rules are sensitive to the syntactic fea
ture composition of complex symbols including feature coeffi
cients. In other words, a transformational rule may be de
fined just in case the syntac:tic feature vector associated with
a complex symbol introducf;d into a P-marker meets certain
internal conditions. Consider, for example, the hypothetical
rule given in ( 39).
( 39) A
1.
1.
C
3====>
3
A terminal string falls under the domain of the above rule just
in case it can be segmented into three consecutive substrings
of which the first is an A, the second is a terminal symbol B
which dominates a complex symbol in whose syntactic feature
vector the feature (D). is marked positively, and the third is
a C. Thus, the P-marker in (40) falls under the domain of
this transformation whereas the P-marker in ( 41) does not.
(40)
A E F word
(+D) (+L) (-M)
21.
(41)
word (-D) (+L) (-M)
The transformational rule given in (42) requires a special in
terpretation since (+C) is not a constituent but a feature in a
vector.
(42) A
1
1
(+C)
2
2
B
3=== =- >
A P-marker falls under the domain of the above transforma
tion just in case the terminal string can be segmented into
three consecutive substrings of which the first is an A, the
second is a complex symbol marked positively for the feature
C, and the third is a B, as in the P-marker given in (43).
(43)
I [
word] (+C)
A transformational rule contains a finite sequence of
formal operations called elementary transformations. An
elementary transformation operates on the ~ term• of a struc
ture index and determines the alterations to be made in the P
mar ker s which fall under the domain of the transformation.
The elementary transformations employed in the CG are sub
stitution, deletion, sister adjunction, and daughter adjunction.
22
(There is reason to believe that daughter adjunction is theore
tically unmotivated. It is likely that this elementary transfor
mation will not appear in the updated version of the CG. )
Under the substitution elementary transformation, one
subtree is substituted for another subtree. Consider, for
example, the hypothetical rule given in (44).
(44) A
1
3
B
2
2
C
3====>
0 In this rule a subtree having the analysis C is substituted for a
subtree having the· analysis A in a P-marker which falls under
the domain of the transformation. This transformation will,
for instance, convert the P-marker in (45) into the P-marker
in (46 ).
(45)
DJ\ (46)
A 1 F G
23
i . ....
The deletion elementary transformation involves the de
letion of a subtree. An example of such a rule is given in (53).
This rule converts the P-marker in (54) into the P-marker
in (5 5 ).
(53) A B C
1 2 3====>
1 2 0
(54) s
A B
(55)
In the event that some constituent X is the sole daughter of
some constituent Y and the deletion X is defined, then Y as
well is deleted. Thus, the rule (53) converts the P-marker
(56) into the P-marker (57).
(56) s
(57) s
A 7 B
24
The elementary transformation of sister adjunction in
volves the introduction of some subtree under the immediate
domination of some constituent which has at least one daughter.
For example, the rule in (58) converts the P-marker (59) into
the P-marker (60).
(58) A B C
1 2 3====>
1 + 3 2 0
(59) s
A (60) s
D~ A In contradistinction to the substitution transformation, if a
constituent X is the sole daughter of a constituent Y, then a
transformation which defines the sister adjunction of Z to X
does ~ adjoin Z to Y. The transformation (58) operating on
the P-marker (61) yields the P-marker (62) and not the P
marker (63).
(61) S
25
i I
_, ,
(6Z)
(63)
s
s ----;::;;1
D C B
I A
However, if a constituent X, which is to be adjoined as a sis -
ter of Y, is the sole daughter of a constituent Z, then Z is ad
joined to Y. Thus, the transformation (58) operating on the
P-marker (64) yields the P-marker (65) and not the P-marker
(66).
(64)
(65)
(66)
s
A---------~1 I
C
s -------;:::::-:1 A C B
I C
The elementary transformation of daughter adjunction in
volves the introduction of some subtree under the immediate
domination of some constituent which dominates no other con
stituent. For example, the transformation (67) operates on
the P-marker in (68) and produces the P-marker in (69).
26
(67)
(68)
(69)
A
1
1 < 3
B
2
2
C
3 ====>
0
(where "<" is interpreted as immediately dominates)
s
s
~ I
~E
If a constituent X, which is to be adjoined as a daughter to
some constituent Y which dominates no other constituents, is
the sole daughter of some constituent Z, then Z is adjoined
as a daughter to Y.
Transformational rules may introduce morphemes into a
P-marker. For instance, the transformation in (70) converts
the P-marker in (71) into the P-marker in (72).
(70)
(71)
A
1
1
B
2.
2. + m
C
3====>
3
s
,._
27
(7Z) s
The transformational component of the CG contains an
ordered set of cyclic and post-cyclic transformational rules.
The cyclic rules apply to a lowest sentence. A lowest sen
tence is an S which dominates the sequence # - X - #, w.1~re
# is a sentence boundary and X is a variable which does not
contain #. In the diagram (7 3), S 3
meets the conditions of
a lowest S.
(7 3)
E/\,3 #
The cyclical transformational rules apply in sequence to
lowest S's. Consider, for instance, the following set of cyclic
rules in which the symbol Xis a variable ranging over any
structure at all.
(7 4) a. * 1
1
A
2
• X
3
3
#
4====>
4
- ·--·--·------ -
28
b. * 1
0
X
2
2
3====>
0
Applying cyclically, the rules in (74) operate on s3
in the P
marker given in (7 3) producing, sequentially, the P-markers
(75) and (76 ).
(75)
(76)
As the result of the application of the rules in (74), s2
now
meets the conditions of a lowest 5 and the cyclic rules apply
again yielding the P-markers (77) and (78).
29
(77)
(78)
After this cycle Sf now meets the conditions of the lowest S
and the cyclic rules apply once again yielding (79) and (80).
(79)
- -~ ~ ·- · - - --~---
30
(80)
This application of the rules leaves a P-marker in which no S
qualifies as a lowest S. Hence, the transformational cycle is
terminated.
The P-marker produced by the rules of the transforma
tional cycle is the input to the post-cyclic transformational
rules. A possible rule might be that in (81 ), which deletes
every instance of C in (80), thus generating the derived P
marker (8Z).
(81) X C y
1 z 3====>
1 ,, 3
(8Z) Si
z I
I
._ _. -- . -
31
The post-cyclic rules are ordered. The derivation is termi
nated after the applicability of the last post-cyclic rule has
been tested. The transformations, cyclic and post-cyclic, in
the CG are as follows:
32
33
3. Z Transformational Rules 6
I. CYCLIC RULES
1. CP 1 Complementizer Placement 1 7
T
# X [ ( a C) ]N NP+ be y have V
1 2 3 4 5 6====>
1 2 3 aC + 4 5 6
2. CP 2 Complementizer Placement 2 OB
T
# X [(+C)]V (NP) NP+ be y # have V
1 2 3 4 5 6 7====>
1 2 3 4 +C + 5 6 7
3. CP 3 Complementizer Placement 3 OB
* X N [NP+ Y]S z #
1 2 3 4 5 6 1====>
1 2 3 that+ 4 5 6 7
4. IE 8,9
Identity Erasure OB
# W (NP) X aC NP Y (NP) z
9
9
#
1 2
1 2
3 4
3 4
5
5
6 7
7
8
8
10====>
10
Condition: An NPj ts erased by an identical NP i if and only if
there ts an S such that
5. IOI
# X
1 2
1 2
6. TO
# X
1 2
1 2
V
3
n (i) NPj is dominated by Sn
(ii) NPi neither dominates nor is dominated by Sn
(iii) for all NPk neither dominating nor dominated
by Sn, the distance between NPj and NPk is
greater than the distance between NPj and NP i
where distance between two nodes is defined
in terms of the number of branches in the path
connecting them.
Indirect Object Inversion . OP
{::} to+ NP y
4 5 6 7====>
3+5 4 g 6 7
V
3
3
To Deletion
to NP (PREP)+ NP Y
4 5
5
6
6
7
7
OB
* 8====>
8
34
7. PASSIVE Passive OB
# (PRE) NP l AUX V (PREP) NP2
X PREP P Y #
1 2
1 2
3
7
4 5
4 be+ en+ 5
Condition: 3 -I 7
8. EXTRA Extraposition
# X ( (+_S) ]N s
4
., 1 2
1 2
3
3
6
6
y
5
5
7 8
" 8
*
9 10 11 12====>
9 3 11 12
OP
6 ----> ----4+6
9. PROREP Pronoun Replacement OB
# X [[ (+ S) ]N]NP (AUX (be en) V + (MAN)) aC NP Y #
1 z 3 4 5 6 7 8----> ----1 z 6 4 5 ., 7 8
iO. WHA WH-Attraction OB
* u ART [NP w {PREP+[WH [WH X]NP
X]NP} Y]S z * i z 3 4 5 6 7 8 9----> ----1 z 3 6 + 4 5 • 7 8 9
35
11. RELPLACE Relative Placement
# X ART S N
1 2 3 4 5
1 2 3 'J 5+4
y
6
6
#
7====>
7
12. AUXFILL Auxiliary Filler
# X T {~:ve} y #
1 2 3 4 5 6====>
1 2 3+4 'J 5 6
13. AG Agreement
# (PRE) [(DET)[(aSg)]~NP {PRES} PAST
1 2 3 4
1 2 3 4<aSg
Condition: 4<1
14. EVER Ever
# X INDEF [ (-human,)]N WH {1NDEF} DEF
1 2 3 4 5 6
1 2 3 4 5 6 + ever
36
OB
OB
OB
y #
5 6====>
5 6
OP
N y #
7 8 9====>
7 8 9
37
15. REGDEL Regressive Deletion a. OP b. OB
{ ART I (+PRO)]N} t· rJ } # X
INDEF N WH + INDE F + b N y # . ever
1 2 3 4 5 6 7 8====>
1 2 'I ~ 5 6 7 8
Condition: 4=6
16. DEFI Definitization OB
# X N [(PREP) + WH INDEF N Y]8
Z #
1 2 3 4 5 6 7 8 9====>
1 2 3 4 DEF 6 7 8 9
l 7. WHAG WH-Agreement OB
# X WH {1NDEF} DEF
(ever) ( (ahuman) )N y #
1 2 3 4 5 6 7 8===>
1 2 3 4 (ahuman 5 6 7 8
Condition: 4<0
18. PROGDEL Progressive Deletion OB
# X N (PREP) + WH + DEF N y #
1 2 3 4 5 6 7===>
1 2 3 4 'i 6 7
Condition: 3 = 5
19. RELDEL Relative Deletion
# X N [WH Y] NP + be + PRES ADJ Z #
1 2 3 4 5 6 7 ====>
1 2 3 g 5 6 7
20. ADJ PLACE Adjective Placement
# X N ADJ Y #
1 2 3 4 5 6====>
1 2 4 + 3 (j 5 6
21. COUP Complementizer Duplication
# X
1 2
1 2
aC NP Y #
3 4 5 6====>
3 4+3 5 6
22. CNEG C Negative Placement
* X aC <te ; ) + T hav NEG
1 2 3 4 5
1 2 5 + 3 4 " 23. CTENSE C Tense
y
6
6
* X aC <{~v}> + PAST
1 2 3 4
1 2 3 +have+ en 4
* 7====>
7
y * 5 6===>
5 6
38
OP
OB
OB
OP
OB
•
24. TS Tense Suppress ion
# X ac n:ave + (en))((+V)l}
T
1 2 3 4 5
1 2 3 4 0
25. CD Complementizer Deletion
# X V [(+_S)]N aC NP Y #
1 2 3
1 2 3
4
4
5
<I
6 7 8====>
26. TAG Tag Question
# NEG Q NP AUX VP
1 2 3 4
1 2 t, 4
5
5
6
6
y
7
6 7 8
#
8====>
7 3+4+5+8
27. NEGPLACE Negative Placement
# NEG (Q) NP
1
1
2
<I
3
3
4
4
AUX
5
5+2
X
6
6
#
7====>
7
39
OB
y * 6 7====>
6 7
OP
OP
OB
~
28. NEGTAG Tag Negative Placement
# X AUX NEG VP (S) Q NP AUX #
1 2
1 2
3
3
4 5
5
6 7 8 9
6 7 8 9+4
29. NEGAUX Negative Auxiliary
# X T +({;ve}i NEG y #
1 2 3 4 5 6====>
1 2 3+4 " 5 6
30. QUES Question
# Q X { PREP + [WH + Y)NP}
[WH + Y]NP z #
10====>
10
1 2 3 4 5 6====>
14+2 3
31. YESNO
# X
1 2
Q
3
1 2 5 + 3
" 5 6
Yes-No Question
NP AUX y #
4 5 6 7====>
4 6 7
·- .. . ----·-- --
40
OP
OP
OB
OB
32. AF Affix
T
# X -C ing en
1 2 3
1 2 0
Condition:
33. PREPDEL
NP (+ V) (+M) be have
4
4 + 3
y
5
5
#
6----> ----6
5 = a terminal string <T 1
, <T 2
, ... (1' , n
such that u 1
-,. _-:-C, ing, ~, or T and
2 = a terminal string ct,1
, cp2
, . . . cpn'
such that cl, 1- (+V) or (+M). n
Preposition Deletion
# X PREP [not (+ S)] y # (-C) N
1 2 3 4
1 2 0 4
34. PD Pronoun Deletion
# X [ (+ __ S) ]N (to+ NP)
1
1
z 2
3
0
4
4
5
5
5
5
5
6----> ----6
y
6
6
#
7====>
7
41
OB
OB
OB
...
35. AGDEL Agent Deletion OP
# X [PREP + INDEF + [ (+PRO) ]N]MAN y #
1 2 3 4 5====>
1 2 0 4 5
36. THAT that Deletion OP
# X {A~J} (NP) [that Y]S z #
1 2 3 4 5 6 7 8====>
1 2 3 4 0 6 7 8
37. VPCOMP VP Complement Placement OP
# X MAN {AUX} +C + have +VP y
1 2 3 4 5
1 2 4 + 3 0 5
38. BEDEL be Deletion
# X
1 2
1 2
M be +C
3 4 5
3 0 5
y
6
6
#
7====>
7
#
6----> ----6
OB
42
)
,
)
>
_ _....,...~--- . .. .
39. MCDEL
* X
1 2.
1 2.
40. QDEL
# X
1 2.
1 2.
M
3
3
a 3
41. ERASE
# X #
Modal Complementizer Deletion
+C y #
4 5 6----> ----0 5 6
Q Deletion
# y
4
4
5====>
5
Boundary Erasure
1 2. 3====>
0 2.
------ - --
43
OB
OB
OB
l
II. POST-CYCLIC RULES
42. PAST Past
X {<+v>} {+M)
PAST y
1 2 3 4==== >
1 2 ed 4
43. MTDEL Modal Term Deletion
X
1
1
{+M)
2
2
PRES
3
0
y
4====>
4
44. PLUDEL Plural Deletion
X {+V) [-Sg]PRES y
1 Z 3 4====>
1 z 0 4
OB
OB
OB
45. NUM Number OB
X
1
1
[ · {-Sg)] N
z
z + •
y
3====>
3
--- ~--- - ·-
44
- ,__........_,_
46. NUAG Number Agreement
X
1
1
(+V)
z z
+Sg
3
s
y
4====>
4
47. CONTR Contraction
X [ Y NEG]AUX z
1 Z 3 4====>
1 Z n't 4
48. NEGSPELL Negative Spelling
X NEG Y
1
1
z not
3====>
3
49. DO 1 Do 1
X
1 2. 3
1 did 3
50. DOZ Do Z
X
1
1
([ +Sg]PRES Y]AUX
Z 3
does 3
z
4====>
4
z
4====>
4
45
OB
OB
OB
OB
OB
51. DO 3 Do 3
X [[-Sg]PRES Y]AUX z
1 2.
1 do
52.. BE 1
X be
1 2.
1 "
5 3. BE 2.
X be
1 2.
1 "
54. BE 3
X be
1 Z
1 "
3
3
Be 1
[+Sg]PRES
3
is
Be Z
[ -Sg]PRES
3
are
Be 3
was
4====>
4
y
4====>
4
y
4====>
4
4====>
4
46
OB
OB
OB
OB
55. BE 4
X be
1
1
z
"
Be 4
were
56. HAVE 1 Have 1
X have [+ Sg]PRES
1 Z 3
1 0 has
57. HAVE Z Have Z
X have [-Sg]PRES
i Z 3
1 0 have
58. HA VE 3 Have 3
X have PAST
i Z 3
i 0 had
47
OB
,,
- >
4
OB
y
4====>
4
OB
y
4====>
4
OB
y
4====>
4
59. WHPD 1 WH Pronoun Deletion 1
X DEF [<+PRO)] WH+ Y (+Sg)
N
1 z 3 4====>
1 z 0 4
60. WHPD 2 WH Pronoun Deletion 2
X WH + INDEF + (ever) [ (+PRO)] (+Sg) N
1 2 3
1 z 0
61. WHDEL WH-Deletion
X
1
1
N
z z
[WH + Y]NP
3
0
NP
4
4
62. DEFTHAT Definite that
X DEF
1
1
2
that
WH+ Y
3====>
3
z
5====>
5
y
4====>
4
·- .. - . " - ··- - - --- -
48
OP
OE\
OP
OB
-
6 3. WH 1 WH 1
X [WH [ (+human) J { DEF } ]NP
INDEF
1 2 3
1 0 who
64. WH 2 WH 2
X
1
1
WH + DEF
2
which
65. WH 3 WH 3
X
1
1
WH + INDEF
2
what
y
3====>
3
y
3====>
3
y
4====>
4
66. PLADEL Plural Article Deletion
X
i
i
INDEF [ (-Sg) ]N
Z 3
0 3
y
4====>
4
.__ . .
49
OB
OB
OB
OB
67. C 1 C 1
X +C NP
1 Z 3
1 for 3
68. C Z C Z
X
1
1
+C
2
to
69. C 3
X NP
1 2
1 Z
70. C 4
X
1
1
-C
2
ing
y
3====>
3
C 3
-C
3
'•
C4
X
3====>
3
50
OB
y
4====>
4
OB
OB
y
4====>
4
OB
71. BY By
X [ PREP NP]MAN
1 2
1 by
72. INDEF
X INDEF
1 2
1 a
73. DEF
X DEF
1 2
1 the
y
3
3
Indefinite
3====>
3
Definite
y
3====>
3
OB
y
4====>
4
OB
OB
~- ---
, 'f ,
4. 0 Derivations on the CG
4. 1 Conventions
.. .
A derivation consists of four parts: An Actual String, a
Derived String, an Underlying Structure (P-marker), and a
Derivation.
An Actual String is an orthographic representation of a
gramma tical sentence in English. It identifies, in other words,
one of the sentences for which the CG offers a partial charac
terization. Lacking a phonological component, the characteri
zation offered by the CG is necessarily incomplete. The CG
is limited to syntactic characterization.
A Derived String provides the sequence of morphemes
generated by the grammar. The immediate constituency of
this sequence is not listed in the derived string but is uniquely
determined, nonetheless, by the transformational rules ap
plying to the structure underlying the string.
The Underlying Structure provides a record of the partic
ular application of rewriting and lexical introduction rules
which, upon the application of the transformational rules,
yields the sequence in the derived string. In an underlying
structure, complex symbols are represented by a word, e.g. ,
John, which is an abbreviation for the phonological distinctive
feature matrix associated with this word, and by a list of syn
tactic features, e.g., (+N), (+Sg), which are relevant to
the application of certain transformational rules.
A Derivation is a record of the transformational rules
which apply to the Underlying Structure. Each Derivation con
tains as many cycles of transformational application as there
are S's in the Underlying Structure, followed by one application
52
53
of the post-cyclic rules. A line of derivation is a record of --------the structure produced as the result of .. he application of the
transformation specified at the right of the line of der ivation
and also a record of the structure requisite to the application
of the transformation specified at the right of the, succeeding
line. Structure introduced by conventions on eL'.mentary trans
formations is not incorporated into a line of derivation. For
example, in Sentence Type No. 30, the application of the Affix
Transformation in the First Cycle incorporates AUX as well
as T into V, since T is the sole daughter of AUX. Since AUX
is adjoi':'1ed to the complex symbol by convention, and not as
the result of transfor~ational specification, AUX is not repre
sented in the line of derivation characte rizing the output of the
Affix Transformation. The incorporation or elimination of
structure in a line of derivation does not necessarily imply
that these alterations are the result of transformational appli
cation. When structure ceases to be relevant to the application
of subsequent transformations, it is no longer listed in a line
of derivation (although, of course, the structure continues to
exist in the full P-marker). Similarly, structure is listed in
a line of derivation only when it becomes relevant to the appli
cation of subsequent transformations.
4. Z Sentence Types
1. the boy likes the gir 1
Z. the boys like the girl
3. the boy liked the girl
4. the boy does not like the girl
5. the boy will like the girl
6. the boy would like the girl
54
7. the boy will not like the girl
8. the boy is admiring the girl
9. the boy isn't admiring the girl
10. the boy h, ... s been admiring the girl
11. the boy will have been admiring the gir 1
12. does the boy like the girl?
13. doesn't the boy like the girl?
14. John like s the girl doesn't he?
15. John does not like Mary does he?
16. is John admiring Mary?
17. the books were purchased by John
18. must Mary be tormented by John?
19. John gave the book to Mary
20. John offered Mary the book
21. the book was offered to Mary by John
22. Mary was offered the book by John
2 3. who sleeps ?
24. what boy sleeps?
25. which things slip?
26. what slips?
27. what book has John not taken?
28. about what did John speak?
29. the boy who must leave will leave
30. the book of which John speaks is awful
31. the book John speaks of is awful
32. John touched that which annoys Bill
33. Bill can visualize what will fall
34. whatever falls will bounce
35. a tall boy arrived
55
36. which tall boy did John see?
37. John would like for Mary to leave
38. John wants Mary to leave
39. John wants Mary to be loved by Bill
40. John prefers for Bill not to leave
41. Bill would prefer for .John not to have dreamed
42. for John not to drown would be preferred
4 3. it is required for John to stand
44. Bond was believed to be dead by Goldfinger
45. John loves to run
46. John likes to be taken
4 7. John thinks Bill to be silly
48. John decided for Bill to represent Harry
49. John decided on Bill to represent Harry
50. John appears to have fallen
51. it embarrasses Bill to trip
52. John may resemble Bill
5 3. John dislikes Bill's annoying Mary
54. John dislikes Bill annoying Mary
55. John dislikes annoying Mary
56. John decided on going
5 7. John thinks that Bill will go
58. John thinks Bill smokes
59. that Bill smokes was mentioned by John
60. Bill mentioned to Mary that John smokes
61. it was nientioned by John that Bill smokes
6Z. Bill tells ~tiary John smokes
6 3. Bill reminded Mary to go
64. John tempted Mary to go
56
65. John condescended to go
66. John stops wondering
4. 3 Derivations
(see following pages)
' S
en
ten
ce T
yp
e N
o.
1
Actu
al
str
ing
:
Deri
ved
str
ing
:
the b
oy
lik
es
the g
irl
the b
oy
lik
e s
th
e g
irl
Un
derl
yin
g s
tru
ctu
re:
#----
DE
I N
I
AR
T
r ,
I b
oy
]
T I
Deri
vati
on
:
Fir
st C
ycle
:
DE
F
, (+
N)
l(+
Sg
)
PR
ES
1.
[[D
EF
r b
oy
]
]NP
~
+S
g}
N
[[
+S
g)P
RE
S]T
[
lik
e]
DE
F
[gir
l)N
]S
(+V
) V
2.
[DE
F f
bo
y ]N
[l
ike
(+ V
) [(
+S
g]P
RE
S]T
] V
D
EF
f g
irl]
N]S
Po
st
Cy
cle
:
1.
[DE
F f
bo
y]N
fl
ike f
s]T
] D
EF
[g
irl]
]
k+v>
v
NS
2.
[th
e[b
oy
]N
[lik
e s
]y t
he
fgir
l]N
]S
V I
rlik
e]
~+
V)
~
DE
T
N
I I
AR
T
[girl]
I (+
N)
DE
F
T:A
G
T:A
F
T:N
UA
G
T:D
EF
..
Sen
ten
ce T
yp
e N
o.
2
Actu
al
str
ing
:
Deri
ved
str
ing
:
the b
oy
s li
ke t
he g
irl
the b
oy
s
lik
e t
he g
irl
Un
derl
yin
g s
tru
ctu
re:
~
#
--------
D~
I I
AR
T
bo
y
I f<
+N
)]
DE
F
l<-S
g)
T I
PR
ES
V I
[lik
e]
(+V
) D
E~
I I
AR
T
rg
irl]
I
~+
N)
DE
F
Deri
vati
on
:
Fir
st
Cy
cle
:
1.
[[D
EF
f b
oy
]
]NP
[[
-Sg
]PR
ES
]T
[ li
ke
] D
EF
[g
irl]
N]S
L
<-S
g )
N
(+ V
) V
T:A
G
z _
[ DE
F [
bo
y]
N
IT li
ke
[ [
-Sg
] P
RE
S]
T])
D
EF
[g
irl]
NJ
S L
(+ V
) V
T:A
F
Po
st
Cy
cle
:
I.
[DE
F
[bo
y
] [li
ke]
DE
F
[gir
l]N
]S
(-S
g}
N
(+
V}
V
T:P
LU
DE
L
Z.
[DE
F [b
oy
+ s]
[lik
c]V
DE
F
[gir
l]N
]S
(-S
g)
N
T:N
UM
3.
[th
e [b
oy
s ]
N
[lik
e JV
;h
e
[gi:
·l]l
'\]S
T
:DE
F
(.
Sen
ten
ce T
yp
e N
o.
3
Actu
al
stri
ng
:
Deri
ved
str
ing
:
the b
oy
lik
ed
th
e g
irl
the b
oy
lik
e e
d t
he g
irl
Un
derl
yin
g s
tru
ctu
re:
s N
NP
A
UX
DE
~
I T
I I
AR
T
[b
oy
]
I (+
N)
DE
F
(+S
g)
I P
AS
T
Deri
vati
on
:
Fir
st
Cy
cle
:
1.
[rD
EF
fb
oy
]
]NP
[[+
Sg
]PA
ST
]T
ftik
e]
DE
F [
gir
l]N
]S
~+
Sg
) N
L
<+V
) V
Z.
[ D
EF
[b
oy
]N
[lik
e
[ f+
Sg
)PA
ST
]T]
DE
F [
gir
l]N
]S
L<+
V)
V
Po
st C
ycle
:
1.
[ D
EF
f b
oy
]N
[lik
e [
ed
)T]
DE
F [
gir
l]N
]S
(+V
) V
2.
[ th
e [
bo
y ]N
f li
ke
ed
] V
th
e [
gir
l]N
]S
V
V
[ I ~
lik
e
(+V
)]
DE
T
I N
I fg
irl]
L
<+N
) A
RT
I D
EF
T:A
G
T:A
F
T:P
AS
T
T:D
EF
. ~
Sen
ten
ce T
yp
e N
o.
4
Actu
al
stri
ng
: th
e b
oy
do
es
no
t li
ke t
he g
irl
Deri
ved
str
ing
: th
e b
oy
do
es
no
t li
ke t
he g
irl
Un
derl
yin
g s
tru
ctu
re:
-~
PR
E
NP
I~
N
EG
D
ET
N
AJT
[b
ly l
I (+
N)
DE
F
(tS
g)
AU
X
I V
T
I
I [l
ike]
PR
ES
(+
V)
Deri
vati
on
:
Fir
st C
ycle
:
1.
[ N
EG
[ D
EF
[
bo
y
] ]N
P (
[[+
Sg
]PR
ES
]T]A
UX
[ l
ike]V
DE
F [
gir
l]N
]S
(+S
g)
N
2.
[[ D
EF
[ b
oy
]N]N
P [
[[+
Sg
]PR
ES
]T]A
UX
NE
G [
lik
e]V
DE
F [
gir
l]N
]S
Po
st
Cy
cle
:
1.
[[ D
EF
[b
oy
]N]N
P [
[[+
Sg
]PR
ES
]T]A
UX
no
t [l
ike]V
DE
F [
gir
l]N
]S
2.
([ D
EF
[b
oy
)N]N
P [
do
es]
AU
X n
ot
[lik
e)V
DE
F [
gir
l]N
]S
3.
f th
e f
bo
y]N
f d
oes]
AU
X n
ot
[lik
e]V
th
e f
gir
l]N
]S
T:A
G
T:N
EG
PL
AC
E
T:N
EG
SP
EL
L
T:D
O 2
T:D
EF
Actu
al
str
ing
: th
e b
oy
wil
l li
ke t
he g
irl
Deri
ved
str
ing
: th
e b
oy
wil
l li
ke t
he g
irl
Un
derl
yin
g s
tru
ctu
re:
--------#
-A ~
A
NP
DE
~
AJT
[
blyJ
I (+
N)
·.r
I !
O
T
I
PR
ES
[(:~
'J n:~
)] A
f T
[
r:~~
DE
F
(+S
g)
Deri
vati
on
:
Fir
st
Cy
cle
:
1.
2.
[(D
EF
r bo
y ]
]N
P
[(+
Sg
]PR
ES
]T
l<+
Sg
) N
r wil
l ]
[lik
ely
DE
F
[ gir
l ]N
ls
l<+
M)
M
(DE
F [
bo
y]N
[wil
l ,:+
M)
[ [
+S
g)
PR
ES
] T
]M
[ l
ike
] V
D
EF
[ g
irl]
N]
S
Po
st
Cy
cle
:
1.
2.
[ D
EF
[b
oy
] N
k
ill
) [
lik
e]
V
DE
F [
gir
l] N
] S
l<+
M}
M
[ th
e [
bo
y]
N [
wil
l] M
[
lik
e]
V t
he
L gir
l] N
] S
DE
F
T:A
G
T:A
F
T:M
TD
EL
T:D
EF
Sen
ten
ce T
yp
e N
o.
6
Actu
al
strin
g:
Deri
ved
str
ing
:
the b
oy
wo
uld
lik
e t
he g
irl
the b
oy
wil
l ed
lik
e t
he g
irl
Un
derl
yin
g s
tru
ctu
re:
~~
*
DE
~
I I
AR
T
lboy]
I {+
N)
DE
F
{+S
g)
I P
AS
T
p
~
I D
ET
I
Jii
ke]
I fg
irl]
L<
+V)
AR
T
L<+N
) I
DE
F
Deri
vati
on
:
Fir
st
Cy
cle
:
1.
[[ D
EF
f b
oy
]
]NP
[[+
Sg
)PA
ST
]T
~+
S&
) N
rw
m]
[lik
e)v
DE
F f
gir
l)N
]S
~+
M)
M
T:A
G
2.
[DE
F [
bo
y)N
~
ill
[[+
Sg
)PA
ST
]T]
flik
e)V
DE
F f
gir
l)N
]S
L <+
M)
M
T:A
F
Po
st
Cy
cle
:
1.
[DE
F [
bo
y]N
fw
ill [e
d)T
] [l
ike)V
DE
F [
gir
l]N
]S
l<+
M)
M
T:P
AS
T
2.
[th
e [b
oy
)N [
wil
l e
d)M
[li
ke)V
th
e fg
irl)
N]S
T
:DE
F
...
Sen
ten
ce T
yp
e N
o.
7
Actu
al
str
ing
:
Deri
ved
str
ing
:
the b
oy
wil
l n
ot
lik
e t
he g
irl
the b
oy
wil
l n
ot
lik
e t
he g
irl
Un
derl
yin
g s
tru
ctu
re:
~
PR
E
I N
EG
D
ET
N
AJT
fl.]
I (+
N)
DE
F
(+S
g)
Deri
vati
on
:
Fir
st
Cy
cle
:
..
- I ~
V
I I
I P
RE
S
[w
ill]
[l
ike]
(+M
) <
+v
)
1.
[NE
G [D
EF
r bo
y
] )N
P
[[[+
Sg
)PR
ES
]T r wi
ll
] )A
UX
[l
ike J
y D
EF
[g
irl)
N]S
L
<+Sg
) N
l<
+M
) M
z. 3.
[DE
F
[bo
y]N
([[
+S
g]P
RE
SJ
[wil
l ]
)AU
X N
EG
[l
ike JV
D
EF
[g
irl}
N}
S
T
(+M
) M
[DE
F
[bo
y]N
[w
ill
(+M
) [[
+S
g)P
RE
S]T
J N
EG
[l
ike J
y D
EF
[g
irl)
N]S
M
Po
at
Cy
cle
:
1.
2.
3.
[ DE
F
[bo
y ]N
[
wil
l J
NE
G [l
ikely
DE
F
[ gir
l JN
ls
(+M
) M
(DE
F
[bo
y]N
[w
ill)
M n
ot
[lik
e JV
DE
F
[gir
l)N
]S
[th
e
[bo
y]N
[w
ill]
M n
ot
[lik
e JV
th
e [g
irl]
NJS
#
NP
~
DE
T
N
I I
AR
T
rg
ir1
l I
(+N
)J
DE
F
T:A
G
T:N
EG
PL
AC
E
T:A
F
T:M
TD
EL
T:N
EG
SP
EL
L
T:D
EF
j
Sen
ten
ce T
yp
e N
o.
8
Actu
al
str
ing
:
Deri
ved
str
ing
:
the b
oy
is
ad
mir
ing
th
e g
irl
the b
oy
is a
dm
ire i
ng
th
e g
irl
Un
derl
yin
g s
tru
ctu
re:
----
-i
-*
NP
A
UX
~
DE
~
J b
e i
ng
V
N
P
I I
I I ~
AR
T
[b
oy
]
PR
ES
[a
dm
ire]
DE
T
N
I (+
N)
(+V
) I
I D
EF
(+
Sg
) A
RT
[
gir
11
I
(+N
)J
DE
F
D1~
riv
ati
on
:
Fir
st
Cy
cle
:
1.
[[D
EF
rb
oy
]
]NP
[[
PR
ES
]T b
e]A
UX
in
g
rad
mir
e]
DE
F
(gir
l]N
]S
l<+
Sg
) N
L (
+ V)
V
T:A
UX
FIL
L
2.
([D
EF
f b
oy
]
]NP
([
[+S
g]P
RE
S]T
be ]A
UX
in
g
~d
mir
e]
DE
F
[gir
l]N
]S
~+
Sg
) N
l<
+V
) V
T:A
G
3.
(DE
F
[bo
y]N
[b
e
-i·
[(+
Sg
]PR
ES
]T]A
UX
fa
dm
ire +
in
gJ
DE
F
[gir
l)N
]S
L (+
V)
V
T:A
F
Po
st
Cy
cle
:
1.
[DE
F
[bo
y]N
[i
s]A
UX
[a
dm
ire i
ng
)V D
EF
[g
irl)
N]S
T
:BE
1
2.
[th
e
[bo
y]N
[i
s]A
UX
[a
dm
ire i
ng
]V t
he
[gir
l]N
]S
T:D
EF
-
, ,-
..,;
-~
Sen
ten
ce T
yp
e N
o.
9
Actu
al
stri
ng
:
Deri
ved
str
ing
:
the b
oy
isn
't a
dm
irin
g t
he g
irl
the b
oy
is
n't
ad
mir
e i
ng
th
e g
irl
Un
derl
yin
g s
tru
ctu
re:
1 PR
E:
N?
au
x
I ~
I N
EG
D
ET
N
T
b
ein
g
V
------
I N
P
r ;ulm
ire]
,.,,-~
I
I I
AR
T
[ b
oy
J
PR
ES
I
(+N
) L
(+V
) D
jT
N
AR
T
_I
I [
gir
l]
DE
F
(+S
g)
Deri
vati
on
:
Fir
st C
ycle
:
1. 2.
3.
4. 5.
[NE
G[D
EF
[
bo
y]
]NP
[(P
RE
S]T
be]
AU
X i
ng
[a
dm
ire JV
DE
F [g
irl]
N]S
(+
Sg)
N
[NE
G
[DE
F
[ b
oy
]
]NP
[[
[+S
g]P
RE
S]T
be]
AU
X i
ng
[a
dm
ire JV
DE
F
[gir
l]N
]S
(+S
g)
N
[DE
F
fbo
y]N
[[
[+S
g)P
RE
S]T
be]
AU
X N
EG
in
g
(ad
mir
e]
DE
F
[gir
l]N
]S
(+V
) V
[DE
F
[bo
y]N
[[
[+S
glP
RE
S]T
be
NE
G ]
AU
X i
ng
[a
dm
ire]
DE
F
(gir
l)N
]S
(+ V
) V
[DE
F
(bo
y]N
[b
e +
[[+
Sg
)PR
ES
]T N
EG
]AU
X
fad
mir
e +
in
g]
DE
F
[gir
l)N
]S
l<+ V
) V
Po
st
Cy
cle:
1.
[ D
EF
[ b
oy
]N [
be [
[+S
g]P
RE
S]T
n't
]AU
X [
ad
mir
e i
ng
]V D
EF
[ g
irl]
N]S
Z.
[DE
F [
bo
y]N
[[i
s]T
n't
]AU
X [
ad
mir
e i
ng
]V D
EF
[g
irl]
N]S
3.
[th
e [
bo
y]N
[[i
s]T
n't
]AU
X [
ad
mir
e i
ng
]V t
he [
gir
l]N
]S
DE
F
(+N
},
T:A
UX
FIL
L
T:A
G
T:N
EG
PL
AC
E
T:N
EG
AU
X
T:A
F
T:C
ON
TR
T:B
E i
T:D
EF
4""'
Sen
ten
ce T
yp
e N
o.
10
Actu
al
str
ing
:
Deri
ved
str
ing
:
the b
oy
has
been
ad
mir
ing
th
e g
irl
the b
oy
has
been
ad
mir
e i
ng
th
e g
irl
Un
derl
yin
g s
tru
ctu
re:
----
-r
-#
NP
A
UX
p
I D
E~
T
h
av
e e
n
be i
ng
V
N
P
I I ~
AJT
[bly J
I {+
N)
PR
ES
[a
dm
irel
o.Jtr
N
{+
V) J
I I
AR
T
[g
irl]
D
EF
{
+S
g)
Deri
vati
on
:
Fir
st
Cy
cle
:
1.
([D
EF
[
bo
y
] ]N
P
([P
RE
S]T
hav
e]A
UX
en
bein
g [a
dm
ire JV
D
EF
[g
irl]
NJS
{+
Sg)
N
2.
3.
[[D
EF
r b
oy
]
]NP
[[
[+S
g]P
RE
SJT
hav
e ]A
UX
en
be i
ng
[a
dm
ire]
DE
F
[gir
l]N
]S
~+
Sg
) N
{+
V)
V
[DE
F
[bo
y]N
fh
av
e +
[[
+S
g]P
RE
S)T
JAU
X b
e+
en
ra
dm
ire +
in
g]
DE
F
[gir
l]N
]S
{+ V
) V
Po
st
Cy
cle
:
1.
[DE
F
[bo
y]N
[h
as)
AU
X
be e
n [a
dm
ire i
ng
]y D
EF
(g
irl]
N]S
2.
[th
e [
bo
y]N
[h
as]
AU
X b
e e
n [
ad
mir
e i
ng
]y t
he [
gir
l]N
]S
I {
+N
) D
EF
T:A
UX
FIL
L
T:A
G
T:A
F
T:1
-L\.
VE
1
T:D
EF
., ,.
Sen
ten
ce T
yp
e N
o.
11
Actu
al
str
ing
: th
e b
oy
wil
l h
:,v
e b
een
ach
nir
ing
th
e g
irl
Deri
ved
str
ing
: th
e b
oy
wil
l h
av
e b
een
ach
nir
e i
ng
th
e g
irl
Un
derl
yin
g s
tru
ctu
re:
AR
T
I D
EF
Deri
vati
on
:
Fir
st
Cy
cle
:
1.
[[D
EF
r bo
y
] ]N
P
l<+
Sg
) N
~bly]
(+N
) (+
Sg
)
---Tr•--
-----=-
-----
_-_
-_
--*
~
T
M
I I
f wil
l,
~+
M)j
P
RE
S
hav
e e
n
be i
ng
V
N
P
I~
fa
ch
nir
e]
DE
T
N
L<
+v>
I
I A
RT
fg
irl]
I
~+
N)
DE
F
[[f+
Sg
)PR
ES
]T r w
ill
] ]A
UX
hav
e e
n b
e i
ng
fa~
ire]
DE
F [
gir
l)N
]S
l<+M
) M
L
,+ V
) V
T
:AG
2.
(DE
F
(bo
y)N
[
[wi.
U +
[[+
Sg
)PR
ES
]T]
)AU
X h
av
e b
e+
en
fa
ch
nir
e +
in
g]
DE
F
[gir
l]N
]S
(+M
) M
L (
+ V
) V
T
:AF
Po
st
Cy
cle
:
1.
(DE
F
fbo
y)N
[[
wil
l)M
]AU
X h
av
e b
e
en
[ach
nir
e in
g)y
DE
F
[gir
l)N
]S
T:M
TD
EL
2.
[ th
e [
bo
y ]N
[ w
ill]
M h
av
e
be e
n [
ad
m,r
~ •n
gJV
th
e [
gir
l]N
]S
T:D
EF
Sen
ten
ce T
yp
e N
o.
l Z
Actu
al
stri
ng
:
Deri
ved
str
ing
:
do
es
the b
oy
lik
e t
he g
irl
do
es
the b
oy
lik
e t
he g
irl
Un
derl
yin
g s
tru
ctu
re:
PR
E
I Q
AU
X
I T
Y
NP
I P
RE
S
[bly J
(+
N}
I ~
[li
ke]
DE
T
N
(+Y
} I
I --
l .. girl
.. J D
EF
(+
Sg
}
Deri
vati
on
:
Fir
st
Cy
cle
:
1. z. 3.
[Q [
DE
F
[ b
oy
]
]NP
[[
f+S
g]P
RE
S]T
]AU
X [l
ike]y
DE
F
[gir
l]N
]S
(+S
g)
N
[[[[
+S
g]P
RE
S]T
]AU
X Q
[D
EF
[b
oy
]N]N
P [l
ike]y
DE
F
[gir
l]N
]S
[[[[
+S
g]P
RE
S]T
]AU
X D
EF
[b
oy
]N
[l
ike ]y
DE
F
[gir
l]N
]S
Po
st
Cy
cle
:
1.
[(d
oe
s]A
UX
DE
F [
bo
y]N
[li
ke]y
DE
F [
gir
l]N
]S
2.
[[ d
oes]
AU
X t
he [
bo
y]N
[li
ke]y
th
e f
gir
l]N
]S
AR
T
I D
EF
(+
N)
T:A
G
T:Y
ES
NO
T:Q
DE
L
T:D
O 2
T:D
EF
~
Sen
ten
ce T
yp
e N
o.
13
Actu
al
stri
ng
:
Deri
ved
str
ing
:
do
esn
't th
e b
oy
lik
e t
he g
irl
do
es
n't
th
e b
oy
lik
e t
he g
irl
Un
derl
yin
g s
tru
ctu
re:
* -
~1
----
# P
RE
N
P
AU
X
V
~ ~
I N
EG
Q
D
ET
N
T
V
~
I I
I I
..,.
,...
-"'-
AR
T
[bo
y~
P
RE
S
[li
ke]
DE
T
N
I ( +
N )
(+
V)
I I
DE
F
(+S
g)
AR
T
[g
irll
I
(+N
~
Deri
vati
on
:
Fir
st
Cy
cle
:
1.
[NE
G Q
[D
EF
r b
oy
]
]NP
[[[
+S
gJP
RE
SJT
JAU
X
[lik
e ]y
DE
F
[gir
l]N
JS
L<
+S
g)
N
2.
[Q (D
EF
[b
oy
]N]N
P
[[(+
Sg
]PR
ES
]T]A
UX
NE
G
[lik
e JV
D
EF
[g
irl]
N]S
3.
[Q [D
EF
[b
oy
]N]N
P
[[[+
Sg
JPR
ES
]T N
EG
]AU
X
[lik
e ]y
DE
F
[gir
l]N
]S
4.
[[[[
+S
g]P
RE
SJT
NE
GJA
UX
Q D
EF
[b
oy
]N]N
P
[lik
e]V
DE
F
[gir
l]N
]S
5.
[[[[
+S
g]P
RE
S]T
NE
GJA
UX
DE
F
[bo
y)N
[l
ike JV
D
EF
[g
irl]
NJS
Po
st C
ycle
:
f.
([[[
+S
gJP
RE
S]T
n't
)AU
X D
EF
[b
oy
)N [
lik
c)V
DE
F [
gir
l)N
]S
2.
Hr cl
o<'s
)T n
't)A
U).
DE
F [
bo
y)N
[ l
iJ.:,·]y
DE
F [
gir
l)N
]S
3.
[[(d
ov
s]T
n't
]AU
~-:
the
[bo
y]N
[li
keJV
th
e fg
irlJ
NJS
DE
F
T:A
G
T:N
EG
PL
AC
E
T:N
EG
AU
X
T:Y
ES
NO
T:Q
DE
L
T:C
ON
TR
T:D
O 2
T:D
EF
(_
.
Sen
ten
ce T
yp
e N
o.
14
Actu
al
stri
ng
: Jo
hn
lik
es
the g
irl
do
esn
't h
e
Joh
n l
ike s
th
e g
irl
do
es
n't
Jo
hn
D
eri
ved
str
ing
:
Un
derl
yin
g s
tru
ctu
re:
1 #
P~
E
~A
U~
~
I I
-----
-----
NE
G
Q
N
T
V
NP
I I
I ~
[
Jo
hn
] P
RE
S
rlik
e ]
D
ET
N
(+
N)
l(+
V)
I I
(+S
g)
AR
T
[gir
l ]
I (+
N)
DE
F
De
riv
ati
on
:
Fir
st
Cy
cle
:
1.
2.
3.
4.
[NE
G Q
[
[Jo
hn
] ]N
P [
[ [
+S
g]P
RE
S]T
]AU
X [
lik
e]V
DE
F [
gir
l]N
]S
(+S
g)
N
T:A
G
[NE
G [
[Jo
hn
]N]N
P [
[ [
+S
g]P
RE
S]T
]AU
X [
lik
e]V
DE
F [
gir
l]N
Q[
[ Jo
hn
]N]N
P [
[ [
+S
g]P
RE
S]T
]AU
X]S
T:T
AG
[ [
Joh
n]N
[ [
[+
Sg
]PR
ES
]T]A
UX
NE
G~
lik
e]V
DE
F [
gir
l]N
]Q [
[Jo
hn
]N]N
P
[ [
[+S
g]P
RE
S]T
]AU
X]S
VP
T
:NE
GP
LA
CE
[ [
Joh
n]N
[ [
[+
Sg
]PR
ES
]T]A
UX
[ [
lik
e]V
DE
F [
gir
l]N
]VP
Q [
(Jo
hn
]N]N
P [
[ [
+S
g]P
RE
S]T
]AU
X N
EG
]S
T:N
EG
TA
G
5.
[[ J
oh
n]N
[[[
+S
g]P
RE
S]T
]AU
X (
lik
e]V
DE
F [
gir
l]N
Q [
[Jo
hn
]N]N
P [
[[+
Sg
]PR
ES
]T N
EG
]AU
X]S
T:N
EG
AU
X
6.
[[Jo
hn
]N [
[[+
Sg
]PR
ES
]T]A
UX
r li
ke]
DE
F [
gir
l]N
[[[
+S
g]P
RE
S]T
NE
G]A
UX
Q [
[Jo
hn
]N]N
p1
S
L<+
V)
V
T:Y
ES
NO
7.
[[Jo
hn
]N fl
ike [
[ +S
g]P
RE
S]T
] D
EF
[ g
irl]
N [
[[+
Sg
]PR
ES
]T N
EG
]AU
X Q
[ J
oh
n]N
]S
T:A
F
L<+
V)
V
8.
[[Jo
hn
]N rl
ike [
[+S
g]P
RE
S]T
l D
EF
r gi
rl]N
[[[
+S
g]P
RE
S]T
NE
G]A
UX
r Jo
hn
]N]S
L<
+v>
Po
st
Cy
cle
:
t.
[[Jo
hn
]N [
lik
e[s
]T]V
DE
F [
gir
l]N
[[[
+S
g]P
RE
S]T
NE
G]A
UX
[Jo
hn
]N]S
2.
[[Jo
hn
]N [
lik
e s
]V D
EF
[ g
irl]
N [
[f+
Sg
]PR
ES
]T n
't]A
UX
[ J
oh
n]N
]S
3.
[[Jo
hn
]N [
lik
e s
]V D
EF
[ g
irl]
N [
[ d
oes]
T n
't]A
UX
[ J
oh
n]N
]S
4.
[[Jo
hn
]N [
lik
e s
]V t
he
[ g
irl]
N [
[ d
oes
]T n
't]A
UX
[ J
oh
n]N
]S
T:Q
DE
L
T:N
UA
G
T:C
ON
TR
T:D
O 2
T:D
EF
Sen
ten
ce T
yp
e N
o.
15
Actu
al
stri
ng
: Jo
hn
do
es
no
t li
ke M
ary
do
es
he
Deri
ved
str
ing
: Jo
hn
do
es
no
t li
ke M
ary
do
es
Joh
n
Un
derl
yin
g s
tru
ctu
re:
------------------#
lj{!:
N~~ Q
-N
P I N
[
Joh
n J
(+
N)
(+S
g)
Deri
vati
on
:
Fir
st
Cy
cle
:
1.
[NE
G Q
[ [Jo
hn
]
]NP
[[[
+S
g]P
RE
S]T
]AU
X [
lik
e]y
[M
ary
]N]S
(+
Sg
) N
I rli
ke]
L<+Y
> N
I rMary
] (+
N)
T:A
G
l.
[ N
EG
[ [
Jo
hn
]N]N
P [
[ [
+S
g]P
RE
S]T
]AU
X [
lik
e]y
[M
ary
]N Q
[ [
Jo
hn
]N]N
P [
[ [
+S
g]P
RE
S]T
]AU
X]S
T:T
AG
3.
[[[J
oh
n]N
]NP
[[[
+S
g]P
RE
S]T
]AU
X N
EG
[li
ke]y
[M
ary
]N Q
[[J
oh
n]N
]NP
[[[
+S
g]P
RE
S]T
]AU
X]S
4·
[ (J
oh
n]N
[ [
[+
Sg
]PR
ES
]T]A
UX
NE
G [
lik
e]y
[ M
ary
]N [
[ [
+S
g]P
RE
S]T
]AU
X Q
[ [
Jo
hn
]N)N
plS
5.
[ (J
oh
n]N
[ [
[+S
g]P
RE
S]T
]AU
X N
EG
[ l
ike]y
[M
ary
]N [
[ [
+S
g]P
RE
shlA
uX
[ J
oh
n]N
ls
Po
st
Cy
cle
:
1.
[[Jo
hn
]N [
[[+
Sg
]PR
ES
]T]A
UX
no
t [ li
ke]y
[ M
ary
]N[[
[+S
g]P
RE
S]T
]AU
X [
Jo
hn
]N]S
2.
([ J
oh
n]N
[ d
oes
]AU
X n
ot
[ li
ke)y
[ M
ary
]N d
oes
(Jo
hn
]N]S
,~
T:N
EG
PL
AC
E
T:Y
ES
NO
T:Q
DE
L
T:N
EG
SP
EL
L
T:D
O 2
Sen
ten
ce T
yp
e N
o.
16
Actu
al
stri
ng
: is
Jo
hn
ad
mir
ing
Mary
Deri
ved
str
ing
: is
Jo
hn
ad
mir
e i
ng
Mary
Un
derl
yin
g s
tru
ctu
re:
PR
E
I a
Deri
vati
on
:
Fir
st C
ycle
:
NP
I N
[
Jo
hn
] (+
N)
(+S
g)
~ I
AU
X
I T I
PR
ES
1.
[ Q
[
[Jo
hn
]
]NP
[ [
PR
ES
]T +
be]
AU
X i
ng
[ a
dm
ire JV
[M
ary
]N]S
(+
Sg
) N
2.
[ Q
[
[Jo
hn
]
]NP
[ [
[ +
Sg
)PR
ES
]T b
e]A
UX
in
g [
ad
mir
e)y
[ M
ary
]N]S
(+
Sg
) N
3.
[ [ [[
+S
g)P
RE
S]T
] b
e)A
UX
Q [
[Jo
hn
)N]N
P i
ng
ra
dm
ire]
[ M
ary
)N]S
L
<+v>
v
4.
[ [
be +
[(
+S
g]P
RE
S]T
] AU
X Q
[J o
hn
]N
fad
mir
e +
in
g]
[ M
ary
]N]S
L
(+V
) V
s.
[[b
e [
[+S
g]P
RE
S]T
]AU
X (
Joh
n]N
[ad
mir
e i
ng
]V [
Mary
]N]S
Po
st
Cy
cle
:
1.
[ [i
s] A
UX
[J
oh
n)N
[ a
dm
ire i
ng
)V [
Mary
]N]S
VP
I V
p
I I
[ad
mir
e]
(+V
) N
I [M
ary
] (+
N)
T:A
UX
FIL
L
T:A
G
T:Y
ES
NO
T:A
F
T:Q
DE
L
T:B
E 1
Sen
ten
ce T
yp
e N
o.
t 7
Actu
al
stri
ng
:
Deri
ved
str
ing
:
the b
oo
ks
were
pu
rch
ase
d b
y J
oh
n
the b
oo
ks w
ere
pu
rch
ase
en
by J
oh
n
Un
derl
yin
g s
tru
ctu
re:
\
l ,
~u
x
VP
I I
7 N
T
V
N
P
I I
I ~
~'
[Jo
hn
] P
AS
T
rpu
rch
ase]
DE
T
N
PR
EP
P
(+N
) L
{+V
) A
JT
rb
o~
k]
I (+
N)
DE
F
(-S
g)
Deri
vati
on
:
Fir
iu,
Cy
cle
:
t.
[ [ D
EF
[ b
oo
k]N
]NP
[ [
PA
ST
]T]A
UX
be +
en
+ [
pu
rch
ase
JV [
PR
EP
[[
Joh
n]N
]Np
1M
AN
]S
Z.
[ [D
EF
-
rbo
ok
l ]N
P rr
PAS
T] T
+ b
e J A
UX
en
[ p
urc
hase
1v £
PRE
P £
£ J o
hn
]N]N
p1
MA
N]S
(-
Sg
)j N
3.
[[D
EF
rb
oo
k]
]NP
[ [
[ -
Sg
]PA
ST
]T b
e]A
UX
en
fp
urc
haae]
[ P
RE
P [
[ J
oh
n]N
]Np
1M
AN
]S
L<
-Sg)
N
L
(+ V
) V
4.
[ D
EF
fb
oo
k]
[ b
e +
[[
-Sg
]PA
ST
]T]A
UX
rp
urc
hase
+ e
n]
[ P
RE
P [
[ J
oh
n]N
]Np
1M
AN
]S
~-S
g)
N
L (+
V)
V
Po
at
Cy
cle
:
T:P
AS
SIV
E
T:A
UX
FIL
L
T:A
G
T:A
F
1.
[ D
EF
fb
oo
k +
s] [ be
[[
-Sg
]PA
ST
]T]A
UX
[ p
urc
hase
en
]V [
PR
EP
f[J
oh
n]N
]Np
1M
AN
]S
T:N
UM
L<
-Sg)
N
2.. 3.
4.
[ D
EF
[b
oo
k s
]N [
were
]AU
X [
pu
rch
ase
en
]V [
PR
EP
[[J
oh
n]N
]Np
1M
AN
]S
[ D
EF
[ b
oo
k s
]N [
were
]AU
X [
pu
rch
ase
en
JV [
by
[[
Joh
n]N
]Np
1M
AN
]S
[th
e [
bo
ok
s]N
[w
ere
]AU
X [
pu
rch
ase
en
]V b
y [
Joh
n]N
]S
T:B
E 4
T:B
Y
T:D
EF
_..
. S"
Sen
ten
ce T
yp
e N
o.
18
Actu
al
stri
ng
: m
ust
Mary
be t
orm
en
ted
by
Jo
hn
Deri
ved
str
ing
: m
ust
Mary
be t
orm
en
t en
by
Jo
hn
Un
derl
yin
g s
tru
ctu
re:
-~
l
PR
E
NP
A
UX
I I ~
a N
-r
M
v
NP
M
AN
I I
I I
I~
[J
oh
n]
PR
ES
rm
ust]
fto
rmen
t]
N
PR
EP
P
(+N
}
L<
+M
) L
(+V
) [M
Jry]
(+
N)
(+S
g}
Deri
vati
on
:
Fir
st
Cy
cle
:
1.
[ Q
[[M
ary
]
]NP
[ [
PR
ES
]T [
mu
st]M
]AU
X b
e+
en
+ [
to
rmen
t]V
[ P
RE
P [
[ J
oh
n]N
]Np
lMA
N]S
(+S
g)
N
T:P
AS
SIV
E
z. [
Q [
[M
ary
]
]NP
[ f
f+S
g]P
RE
S]T
f m
ust
]M]A
UX
be e
n [
to
rmen
t]V
[ P
RE
P [
[ J
oh
n]N
]Np
lMA
N]S
(+
Sg
) N
T
:AG
3.
[ [
[ [+
Sg
]PR
ES
]T
rmu
st]
]A
UX
Q [
[ M
ary
] ]N
P b
e e
n [
torm
en
t]
[ P
RE
P [
[ J
oh
n]N
]Np
lMA
N]S
L
<+M
) M
(+
Sg
) N
{
+V
) V
T
:YE
SN
O
4.
[[[m
ust+
[[+
Sg
]PR
ES
]T]
]AU
X Q
[M
ary
]N b
e
µo
rmen
t +
en
J [P
RE
P [
[J
oh
n]N
]NP
]MA
N]S
(+
M)
M
L (+
V)
V
T:A
F
5.
[ [
[mu
st
[ [+
Sg
]PR
ES
]TJ
]AU
X [
Mary
]N b
e [
to
rmen
t en
]V [
PR
EP
[ [
Jo
hn
]N
]Np
lt./
.AN
]S
(+M
) M
T
:QD
EL
Po
st C
ycle
:
1.
[[[m
ust
]M]A
UX
[M
ary
]N b
e [
torm
en
t en
]V [
PR
EP
[[J
oh
n]N
]Np
JMA
N]S
Z.
[ [
mu
st]M
[ M
ary
]N b
e f t
orm
en
t en
]V (
by
[ [
Joh
n]N
]NP
]MA
N]S
-=-------
-"-
'-...
----
T:M
TD
EL
T:B
Y
,..
Sen
ten
ce T
yp
e N
o.
19
Actu
al
stri
ng
:
Deri
ved
str
ing
:
Joh
n g
av
e t
he b
oo
k t
o M
ary
Joh
n g
ive e
d t
he b
oo
k t
o M
ary
Un
derl
yin
g s
tru
ctu
re:
----
r ,
NP
A
UX
V
J!
I I
I N
T
V
N
P
I I
I ~
[Joh
n J
PA
ST
[g
ive]
DE
T
N
(+N
) (+
V)
I I
(+S
g)
AR
T
rbo
ok
] I
L<
+N
) D
EF
pp
~
PR
EP
N
P
I I
to
N I rM
ary
J
{+N
)
Deri
vati
on
:
Fir
st C
ycle
:
1.
[[ fJ
oh
n]
]NP
fr +
Sg
]PA
ST
] [g
ive]
DE
F [
bo
ok
]N t
o [
Mary
]N]S
L (
+S
g)
N
L T
(+
V)
V
T:A
G
Z.
[ [ Jo
hn
]N
[giv
e
[ [
+S
g]P
AS
T]T
] D
EF
[ b
oo
k]N
to
[M
ary
]N]S
(+
V)
V
T:A
F
Po
at
Cy
cle
:
1.
[[Jo
hn
]N
fgiv
e [e
d]
TJ
DE
F [
bo
ok
]N t
o [
Mary
]N]S
L
<+
V)
V
T:P
AS
T
z. [ [
J oh
n]N
[ g
ive e
d]V
th
e [
bo
ok
]N t
o [
Mary
]N]S
T
:DE
F
-
" -
Sen
ten
ce T
yp
e N
o.
Z0
Actu
al
stri
ng
: Jo
hn
off
ere
d M
ary
th
e b
oo
k
Deri
ved
str
ing
: Jo
hn
off
er
ed
Mary
th
e b
oo
k
Un
derl
yin
g s
tru
ctu
re:
N I
[Joh
n 1
i ~
r
V ~
N
T
I]
OT
I
I o
ffer
I
bo
ok
P
AS
T
[~+V)
Ar
L{+N)]
(+
N)
(+S
g) J
D
EF
Deri
vati
on
:
Fir
st
Cy
cle
:
1.
[ [
[ Jo
hn
]
)NP
PA
ST
[ o
ffer J
y [ t
o[
[ M
ary
)N]N
plp
p [
DE
F [
bo
ok
)N]N
p1
S
(+S
g)
N
z. 3.
4.
[ [ f
Joh
n
jl ]N
P P
AS
T [
off
er ]
y [
[ M
ary
]N]N
P [
DE
F [
bo
ok
)N]N
P]S
L
<+
Sg)
N
([ f J
oh
n]
]NP
[f
[+S
g)P
AS
T]T
]AU
X [o
ffer]
[M
ary
)N D
EF
[b
oo
k)N
]S
L (+S
g)
N
(+ V
) V
[{Jo
hn
]N
roff
er
[[+
Sg
)PA
ST
]T]
[Mary
]N D
EF
[b
oo
k)N
]S
L<
+V
) V
Po
st C
ycle
:
1.
fr Jo
hn
]N [
off
er
[ ed
]T]V
[M
ary
]N D
EF
[b
oo
k]N
]S
Z.
[[ J
oh
n)N
[ o
ffer
ed]V
[ M
ary
)N t
he [
bo
ok
)N]S
"j5
p
PR
~P
I I
to
N
T:I
OI
T:T
O
T:A
G
T:A
F
T:P
AS
T
T:D
EF
I r M
ary
] L (
+N
)
Sen
ten
ce T
yp
e N
o.
21
Actu
al
stri
ng
: th
e b
oo
k w
as
off
ere
d t
o M
ary
by
Jo
hn
Deri
ved
str
ing
: th
e b
oo
k w
as
off
er
en
to
Ma
ry
by
Jo
hn
Un
derl
yin
g s
tru
ctu
re:
~------s:-------------------------------1
1
N~
X
jf~
I
I ~
------
N
T
V
NP
P
~
[Jo
Ln
] P
~S
T
[ofi
er]
D
E~
P
R~
P
PR
G ~
(+N
) (+
V)
I I
I I
AR
T
[b
oo
k]
to
N
I (+
N)
I D
EF
(+
Sg
) [~
:~
~]
Deri
vati
on
:
Fir
st
Cy
cle
:
1. 2.
3.
4.
[ [ D
EF
)o
ok
]N]N
P [
[ P
AS
T]T
]AU
X b
e +
en
+ [
off
er J
V t
o [
Mary
]N [
PR
EP
[ [
Joh
n]N
]Np
lMA
N]S
T:P
AS
SIV
E
[ [
DE
F
[b
oo
k]
]NP
[ [
PA
ST
]T +
be]
AU
X e
n [
off
er]
V t
o [
Mary
]N [
PR
EP
[ [
Jo
hn
]N]N
plM
AN
]S
(+S
g)
N
T:A
UX
FIL
L
[ D
EF
[b
oo
k J
[ [ [+S
g]P
AS
T]T
be]
AU
X e
n
roff
er]
to
[ M
ary
]N [
PR
EP
[ [
Jo
hn
]N]N
plM
AN
]S
(+S
g)
N
(+\'
) V
T
:AG
[ D
EF
[ b
oo
k]N
[b
e+
[ [
+S
g]P
AS
T]T
]AU
X
foff
er
+ e
nl
to [
Mary
]N
[ P
RE
P [
[ J
oh
n]N
]NP
]MA
N]S
L
<+
V)
JV
T
:AF
Po
at
Cy
cle
:
1.
[ D
EF
[ b
oo
k]N
[ w
as)
AU
X [
off
er
en
]V t
o [
Mary
)N [
PR
EP
([
Joh
n]N
]NP
]M
AN
]S
T:B
E
3
2.
[ D
EF
[ b
oo
k]N
[ w
as]
AU
X [
off
er
en]V
to
[ M
ary
]N [
by
[[
Joh
n]N
]Np
lMA
N]S
T
:BY
3.
[th
e [
bo
ok
]N [
was]
AU
X [
off
er
en
]V t
o [
Mary
]N b
y [
Jo
hn
]N]S
T
:DE
F
-
~
Sen
ten
ce T
yp
e N
o.
22
Actu
al
stri
ng
:
Deri
ve
d st
rin
g:
Mary
was
off
ere
d t
he b
oo
k b
y J
oh
n
Mary
was
off
er
en
th
e b
oo
k b
y J
oh
n
Un
derl
yin
g s
tru
ctu
re:
# N;==
==-1=
====
==-==
-==--_
---~
-#
A
X
N
I V
I
I V
N
~ ;~
fJo
hn
] P
AS
T
[ I
~ ~
L<+N
) o
ffer]
D
E~
,...
......_
(+
V)
I I
PR
EP
p
AR
T
rbo
ok
J I
I ,
to
N
I (+
N)
DE
F
[M
Ly
]
(+N
) (+
Sg
)
Deri
vati
on
:
Fir
st C
ycle
:
1.
[ (J
oh
n)N
PA
ST
[ o
ffer l
y [
to [
[ M
ary
]N]N
P]P
P [
DE
F [
bo
ok
)N]N
P P
RE
P P
)S
2.
[[[J
oh
n)N
]NP
[[P
AS
T]T
]AU
X [
off
er)
V [
[Mary
)N]N
P [
DE
F [
bo
ok
)N]N
P P
RE
P P
]S
MA
N
PR
~
T:I
OI
T:T
O
3.
[ [
[ M
ary
)N]N
P [
[ P
AS
T)T
]AU
X b
e+
en
+ [
off
er l
y [
DE
F [
bo
ok
)N]N
P [
PR
EP
[ [
Jo
hn
)N]N
plM
AN
]S
T:P
AS
SIV
E
4.
5. 6.
[[
[F!-
.far
y]
]NP
[[P
AS
T]T
+ b
e]A
UX
en
[o
ffer]
V D
EF
[b
oo
k]N
[P
RE
P [
[Jo
hn
]N]N
P]M
AN
JS
T:A
UX
FIL
L
(+S
g)
N
[ [M
ary
] [
[ [+
Sg
]PA
ST
]T b
e]A
UX
en
[o
ffer]
D
EF
[ b
oo
k]N
[ P
RE
P [
[ J
oh
n]N
]NP
]MA
N]S
T
:AG
(+
Sg)
N
(+
V)
V
[( M
ary
]N [
be+
[[+
Sg
)PA
ST
]T]A
UX
[o
ffer+
en
] D
EF
[b
oo
k)N
[P
RE
P [
[ Jo
hn
) ]
] ]
(+V
) N
N
P M
AN
S
V
T:A
F
Po
st C
ycle
:
1.
2.
3.
[[M
ary
]N [
was]
AU
X [
off
er
en]V
DE
F [
bo
ok
)N [
PR
EP
f[J
oh
n]N
]Np
lMA
NJS
[[ M
ary
]N [
was]
AU
X [
off
er
en]V
DE
F [
bo
ok
]N [
by
[[J
oh
n]N
]NP
]MA
N]S
[[M
ary
]N f
was]
AU
X f
off
er
en]V
th
e [
bo
ok
]N b
y [
Joh
n]N
JS
T:B
E
3
T:B
Y
T:D
EF
~
Sen
ten
ce T
yp
e N
o.
Z3
Actu
al
stri
ng
: w
ho
sle
ep
s?
Deri
ved
str
ing
: w
ho
sle
ep
s
Un
derl
yin
g s
tru
ctu
re:
,s
--
7~
-
PR
E ~ ~ X
VP
I
I I
Q
DE
T
N
T
V
I I
I I
AR
T
[ o
ne l
PR
ES
I sle
ep
I ~
(+N
) (+
V)
WH
IN
DE
F
(+P
RO
) (+
hu
man
) (+
Sg
)
Deri
vati
on
:
Fir
st
Cy
cle
:
1.
[[ O
]PR
E[
[ [
WH
IN
DE
F]A
RT
]DE
T l on
e ]
]NP
[ +
Sg
]PR
ES
[ s
leep
]v1
s (+
Sg
) (+
hu
man
) N
z. [
Q (
WH
[ +
hu
rnan
]IN
DE
F
[ o
ne
] ]N
P [
+S
g]P
RE
S [
sle
ep
]V]S
(+
hu
man
) N
3.
[ [W
H [
+h
urn
an
]IN
DE
F [
on
e]N
]NP
O [
[ [
+S
g]P
RE
S]T
]AU
X f
sle
ep
] ]S
.
L (+
V)
V
4.
[ [
WH
[ +
hu
man
)IN
DE
F [
on
e)N
]NP
Q
rsle
ep
[ [
+S
g)P
RE
S]T
] ) 5
(+
V)
. V
5.
[ [
WH
[ +
hu
man
)IN
DE
F [
on
e)N
]NP
[s
leep
[ [
+S
g)P
RE
S]T
J ) 5
(+V
) V
Po
st
Cy
cle
:
1. z. 3.
[ [
WH
[ -
+h
um
an)I
ND
EF
~
on
e ]
]NP
[ s
leep
[s]T
]V]S
(+
PR
O)
(+S
g)
N
[ [
WH
[ -
+h
um
an]I
ND
EF
]NP
[ s
leep
s)v
1s
[ [ w
ho
]NP
[ s
leep
s)v
ls
-
T:A
G
T:W
HA
G
T:Q
UE
S
T:A
F
T:Q
DE
L
T:N
UA
G
T:W
HP
D 2
T:W
H 1
. r
*
-S
en
ten
ce T
yp
e N
o.
24
Actu
al
stri
ng
: w
hat
bo
y s
leep
s?
Deri
ved
str
ing
: w
hat
bo
y s
leep
s
Un
derl
yin
g s
tru
ctu
re:
IP
----------------:a
----------------#
PR
°E
I N
?~
ux
VP
----
----
---
I I
on
N
T
V
Q
I
I !
I ~
r .!~)
l
PR
ES
[~1
:;r]
WH
IN
DE
F
(+
~)
(+h
um
an
) (-
PR
O)
Deri
vati
on
:
Fir
st
Cy
cle
:
1.
2.
3.
4.
5.
[Q[W
HIN
DE
F
[
bo
y
] ]N
P [
+S
g]P
RE
S [
sle
ep
]V]S
(+
Sg
) (+
hu
man
) N
[ Q
[W
H [
+h
um
an
]IN
DE
F f
bo
y
] ]N
P [
+S
g]P
RE
S [
sle
ep
]V]S
L
<+
hu
man
) N
[ [
WH
[ +
hu
man
]IN
DE
F [
bo
y]N
]NP
Q [
[ [
+S
g]P
RE
S]T
]AU
X [s
leep
] ]S
(+
V)
V
[ [
WH
[ +
hu
man
]IN
DE
F [
bo
y ]N
]NP
Q
rsle
ep
L
<+
V)
( [+
Sg
]PR
ES
]T]
vls
[[W
H [
+h
um
an
]IN
DE
F [
bo
y]N
]NP
rs
leep
[[
+S
g]P
RE
SlT
J ls
Ll+
V)
V
Po
!:t
Cy
rl c
·:
1.
[(W
I!
[-lh
\tm
,rn
] 1ND
.E:F
[b
n,
JNJN
P [
slc
cp
[s]T
JVJS
2.
[(\'
:ha
t [
lio
y]N
]NP
[ s
l' c
·p s]v
ls
T:A
G
T:W
HA
G
T:Q
UE
S
T:A
F
T:Q
DE
L
T:N
UA
G
T:W
H
3
'
Sen
ten
ce T
yp
e N
o.
25
Actu
al
stri
ng
:
Deri
ved
str
ing
:
wh
ich
th
ing
s sl
ip?
wh
ich
th
ing
s
slip
Un
derl
yin
g S
tru
ctu
re:
~--
----
----
----
-II pi_
E __
__
__
~-7
~
AlI
Q
DE
< ~
AlJ
X
I
I ~
wfi
~F
[
thln
g l
.( +i
~ ;,
{
+P
RO
) (-
hu
man
) (-
Sg
)
Deri
vati
on
:
Fir
st
Cy
cle
:
1.
2.
3.
4.
5.
[Q [
WH
DE
F
[
thin
g
] ]N
P r -
Sg
]PR
ES
r sli
p]v
ls
(-S
g)
(-h
um
an
) N
[ Q
[
WH
[-h
um
an
]DE
F r
thin
g
] ]N
P (
-Sg
]PR
ES
[ s
lip
]V]S
l(
-hu
man
) N
((W
H [
-hu
man
]DE
F (
thin
g]N
]NP
Q [
[(-S
g]P
RE
S]T
]AU
X
rsli
p]
ls
IJ+
V)
V
[ W
H (
-hu
man
]DE
F [
th
ing
]N Q
[
slip
[
(-S
g]P
RE
S]T
l ls
(+
V)
JV
[WH
[-h
um
an
] [t
hin
g]N
[s
lip
[-S
g]P
RE
Sl
ls
DE
F
(+V
) 1 V
Po
st
Cy
cle
:
1.
2.
3.
(WH
[-h
um
an
]DE
F [th
ing
]
(sli
p]V
]S
(-S
g)
N
r r W
H [
-hu
man
]DE
F [
thin
g+
SJ ]N
P r
slip
]vls
(-
Sg
) N
[ w
hic
h f
thin
g s
lN
[ s
lip
]V]S
T I
PR
ES
VP
I V I
[sli
p]
(+V
)
T:A
G
T:W
HA
G
T:Q
UE
S
T:A
F
T:Q
DE
L
T:P
LU
DE
L
T:N
UM
T:W
H 2
'
Sen
ten
ce T
yp
e N
o.
26
Actu
al
stri
ng
: w
hat
sli
ps?
Deri
ved
str
ing
: w
hat
sli
ps
Un
derl
yin
g s
tru
ctu
re:
#. ~
#
PR
r
I Q
7~
~
-~
AU
X
VP
----
----.
.....__
I
I D
ET
N
T
V
I I
I I
AR
T
r th
ing
l
PR
ES
[s
lip
l ~
(+N
) (+
V)
WH
IN
DE
F l (+PR
O)
(-h
um
an
) ,(
+S
g)
Deri
vati
on
:
Fir
st
Cy
cle
:
1. , .... 3.
4.
5.
[Q [
WH
IN
DE
F
[
thin
g
] ]N
P [
+S
g]P
RE
S [
sli
p]v
ls
(+S
g)
(-h
um
an
) N
[ Q
[ W
H [
-hu
man
JIN
DE
F r
thin
g
] ]N
P [
+S
g]P
RE
S [
sli
p]V
]S
[5-h
um
an
) N
[ [
WH
[-h
um
an
]IN
DE
F
[ th
ing
]NJN
P Q
[ [
f+S
g]P
RE
S]T
]AU
X
[sli
p
] JS
(+
V)
V
[ W
H [
-hu
man
)IN
DE
F [
th
ing
)N Q
rs l
ip
[ [+
Sg
)PR
ES
]TJ
]S
L<
+V
) V
[ W
H [
-hu
man
)IN
DE
F [
th
ing
JN [s
lip
+
[ [
+S
g)P
RE
S]T
] JS
(+
V)
V
Po
st
Cy
cle
:
1.
[ [
WH
[-h
um
an
)IN
DE
F
[
thin
g
] ]N
P [
sli
p[
s )T
lvls
(+
PR
O)
(+S
g)
N
2.
[ [
WH
[-h
um
an
JIN
DE
FJN
P r
slip
s]v
ls
3.
[ [
wh
at]
NP
[ s
lip
(s)P
RE
Slv
ls
T:A
G
T:W
HA
G
T:Q
UE
S
T:A
F
T:Q
DE
L
T:N
UA
G
T:W
HP
D 2
T:W
H
3
Sen
ten
ce T
yp
e N
o.
Z7
Actu
al
stri
ng
: w
hat
bo
ok
has
Joh
n n
ot
tak
en
?
Deri
ved
str
ing
: w
hat
bo
ok
has
Joh
n n
ot
tak
en
en
Un
derl
yin
g s
tru
ctu
re:
PR
E
~1
N
~
N
A~
X
I N I
[
Joh
n l
(+N
) (+
Sg
) j
I T I
PR
ES
---1
DE
~
[ta
ke ]
I
[ b
oo
k J
!+V
) ~
T
(+N
)
(-P
RO
) W
IN
E
F
(-h
um
an
)
Deri
vati
on
:
Fir
st C
ycle
:
1.
[NE
G Q
[[Jo
hn
]
]NP
[[
PR
ES
)T +
hav
e)A
UX
en
[ta
ke)V
WH
IN
DE
F r
bo
ok
J
JS
(+S
g)
N
b(-
hu
man
}
N
T:A
UX
FIL
L
Z.
[ N
EG
Q [
[Jo
hn
]
]NP
[ [
[ +
Sg
)PR
ES
]T h
av
e)A
UX
en
[ t
ak
e]y
WH
IN
DE
F r
bo
ok
j
JS
T:A
G
(+S
g}
N
l<-h
um
an>
J N
3.
[ N
EG
Q [
[
Jo
hn
] ]N
P [
[ [
+S
g]P
RE
SJT
hav
e]A
UX
en
[ t
ak
e JV
WH
[-h
um
an
] 1ND
EF
[
bo
ok
]
J 5 (+
Sg
) N
(-
hu
man
}
N
T:W
HA
G
4.
[ Q
[ [
Jo
hn
]N]N
P [
[ [
+S
g]P
RE
S]T
hav
e]A
UX
NE
G e
n [
tak
e JV
[ W
H [
-h
um
an
]IN
DE
F [
bo
ok
]N]N
p1
S
T:N
EG
PL
AC
E
5.
[[W
H [
-hu
man
)IN
DE
F [
bo
ok
]N]N
P Q
[[J
oh
n]N
]NP
[[[
+S
g]P
RE
S]T
hav
e]A
UX
NE
G e
n [
tak
e]V
]S
T:Q
UE
S
6.
[ [W
H [
-h
um
an
]IN
DE
F [
bo
ok
]N]N
P [
[ [
+S
g]P
RE
S]T
hav
e]A
UX
Q [
[ J
oh
n]N
]NP
NE
,,
[ta
ke
] ls
(+
V)
V
7.
[ W
H [
-hu
man
]IN
DE
F [
bo
ok
]N [
hav
e +
[ [
+S
g]P
RE
S]T
]AU
X Q
[ J
oh
n]N
NE
G r ta
ke +
en
] ] 5
L (+
V}
V
T:Y
ES
NO
T:A
F
8.
[WH
[-h
um
an
]IN
DE
F [
bo
ok
]N [
hav
e [
+S
g]P
RE
S]A
UX
[Jo
hn
]N N
EG
[ta
ke e
n]V
]S
Po
st
Cy
cle
:
1.
[WH
[-h
um
an
]IN
DE
F [
bo
ok
]N [
hav
e[+
Sg
]PR
ES
]AU
X [
Joh
n]N
no
t [t
ak
e e
n]V
]S
Z.
[ [
WH
[-h
um
an
]IN
DE
F [
bo
ok
]N]N
P [
has]
AU
X [
Jo
hn
]N n
ot
[ ta
ke e
n]V
]S
3.
[[w
hat
[bo
ok
]N]N
P [
has]
AU
X
[Jo
hn
]N n
ot
[tak
e e
n]y
ls
T:Q
DE
L
T:N
EG
SP
EL
L
T:H
AV
E 1
T:W
H 3
•
Sen
ten
ce T
yp
e N
o.
l8
Actu
al
str
ing
:
Deri
ved
str
ing
:
ab
ou
t w
hat
did
Jo
hn
sp
eak
?
ab
ou
t w
hat
did
Jo
hn
sp
eak
Un
derl
yin
g s
tru
ctu
re:
~ i~
p
# A
UX
~
-T
H
NP
I
V
--------~
------
PR
E
I I
PR
EP
I N
I
sp
eak
f
D
T
I [ J
oh
n
AR
T
{>N
) (+
N)
(+P
RO
)
(+S
g)
W~
EF
(-h
u=
n)
(+S
g)
Deri
vati
on
:
Fir
st
Cy
cle
:
1.
[ Q
[[Jo
hn
]
]NP
[+
Sg
]PA
ST
[ s
peak
]V [
ab
ou
t]P
RE
P W
H I
ND
EF
f
thin
g
] J 5
(+S
g)
N
L<
-hu
man
) N
T
:AG
[ th
ing
]
]NP
]S
{-h
um
an
) N
T
:WH
AG
l.
[ Q
[ [
Jo
hn
]N)N
P [
+S
g]P
AS
T [
sp
eak
]V [
ab
ou
t]P
RE
P [
WH
[-h
um
an
]IN
DE
F
1.
[ [
[ ab
ou
t]P
RE
P [
WH
[-h
um
an
]IN
DE
F [
th
ing
]N]N
P]P
P Q
[ [
Joh
n]N
jNP
[ [
[+
Sg
)PA
ST
]T]A
UX
[ s
peak
]V]S
T:Q
UE
S
[ [ ab
ou
t]P
RE
P [
WH
[ -
hu
man
]IN
DE
F [
th
ing
]N]N
P [
[ f
+S
g]P
AS
T]T
]AU
X Q
[
Joh
n]N
[ s
peak
]V]S
T:Y
ES
NO
•'
I
~
5.
[ [ a
bo
ut)
PR
EP
[ W
H [
-hu
man
]IN
DE
F [
th
ing
]N]N
P [
[ [
+S
g)P
AS
T]T
)AU
X [
Jo
hn
]N [
sp
eak
)V]S
Po
st
Cy
cle
:
1.
[ [ ab
ou
t)P
RE
P [
WH
[-h
um
an
)IN
DE
F
[
thin
g
] ]N
P [
did
)AU
X [
Jo
hn
]N [
sp
eak
]V]S
(+
PR
O)
(+S
g)
N
Z.
[ [ ab
ou
t]P
RE
P [
WH
[-h
um
an
)IN
DE
F)N
P [
di:
i)A
UX
[ J
oh
n)N
[ s
peak
)V]S
3.
[ [ ab
ou
t]P
RE
P [
wh
at]
NP
[ d
id]A
UX
[ J
oh
n]N
[ s
pea
k]V
]S
T:Q
DE
L
T:D
O 1
T:W
HP
D 2
T:W
H 3
~-
Sen
ten
ce
Ty
pe N
o.
29
Actu
al
str
ing
: th
e b
oy
wh
o m
ust
leav
e w
ill
leav
e
Deri
ved
str
ing
: th
e b
oy
wh
o m
ust
leav
e w
ill
leav
e
Un
derl
yin
g s
tru
ctu
re:
# 1
#
' -
NP
-------
~
~r
DE
T
N
T
M
V
NP
DE
~
I I
~
Wf{
" ~
F
bo
y
(+N
}
(+h
um
an
) (+
Sg
) (-
PR
O)
AU
X
~~
I P
RE
S
I [1nu
st] (+
M)
I I
I I
l bo
y
] P
RE
S
[ w
ill l
[leav
e]
(+N
) (+
Mij
(+
V)
+h
um
an
}
(+S
g}
p I V I re
av
e]
{+
V)
~
,:
Deri
vati
cn
:
Fir
st
Cy
cle
:
1.
X[[
WH
DE
F
[
bo
y
] ]N
P [
[+S
g]P
RE
S]T
(+
Sg}
{
+h
um
an}
N
[mu
st]
[l
eav
e]v
ls Y
(+
M}
M
z. X
([W
H [
+h
um
an
]DE
F r
bo
y
] ]N
P [
[+S
g]P
RE
S]T
[m
ust]
[ le
av
e]V
]S Y
~
+h
um
an
) N
(+
M)
M
3.
X[[
WH
[+
hu
man
]DE
F [
bo
y]N
]NP
fm
ust
+ [
[+S
g]P
RE
SJT
] [ le
av
e]V
]S Y
l<
+M
} ·M
Seco
nd
Cy
cle
:
T:A
G
T:W
HA
G
T:A
F
1.
[[(D
EF
]AR
T [
bo
y]N
[W
H [
+h
um
an
]DE
F[b
;y ]
[m
ust
[+
Sg
]PR
ES
]M [
leav
e]V
]S]N
P P
RE
S [
wil
l]M
[le
av
e]V
]S
(+ g
) N
T
:RE
LP
LA
CE
z. [[
HD
EF
]AR
T]D
ET
[
bo
y
] [W
H[+
hu
man
]DE
F[b
oy
]N[m
ust
[+S
g]P
RE
S]M
[le
av
e]V
]S]N
P[+
Sg
]PR
ES
[wil
l]M
[leav
e)V
]S
{+S
g)
N
T:A
G
3.
[DE
F [
bo
y]N
(W
H [
+h
um
an
]DE
F (
mu
st [
+S
g]P
RE
S]M
[le
av
e]V
]S [
(+S
g]P
RE
S]T
[w
ill]
[l
eav
e]V
]S
(+M
) M
T
:PR
OG
DE
L
4.
[DE
F (
bo
y )N
[W
H [
+h
um
an
)DE
F (m
ust
[+S
g]P
RE
S]
[leav
e)V
]S [w
ill+
[[+
Sg
]PR
ES
]T]
[ le
av
e]V
]S
(+M
) M
(+
M)
M
T:A
F
Po
st C
ycle
:
1.
[DE
F [
bo
y ]N
[[
WH
[+
hu
man
]DE
F]N
P [
mu
st]M
[le
av
e]v
ls [
wil
l]M
[le
av
e]v
ls
Z.
[DE
F [
bo
y]N
[[w
ho
]NP
[m
ust
]M [
leav
e]v
ls [
wil
l]M
[le
av
e]v
ls
3.
[th
e [
bo
y ]N
[[w
ho
]NP
(m
ust
]M P
eav
e]v
ls [
wil
lJM
[ l
eav
e]v
ls
T:M
TD
EL
T:W
H 1
T:D
EF
..
Sen
ten
ce T
yp
e N
o.
30
Actu
al
str
ing
: th
e b
oo
k o
f w
hic
h J
oh
n s
peak
s is
aw
ful
Deri
ved
str
ing
: th
e b
oo
k o
f w
hic
h J
oh
n s
peak
s is
aw
ful
Un
derl
yin
g s
tru
ctu
re:
,-----
------
-_-_
-_-_
-_-_
-_-_
-_-_
-_-_
-_-_
-_-_
-_-_
-_-_
-_-_
-_--~
====
=~s:-
-----#
7
------
l'IP
A
IX ~
NP
A
UX
I I
N
T
[
Jo
Ln
] (+
N)
(+S
g)
I P
RE
S
V
[
bo
~,k
]
(+N
_) (-
PR
O)
(+S
g)
I rsp
eak
] ~
(+ V
) o
f D
ET
AiT
[
bo
~k
]
~
(+N
) W
H
IN D
EF
(-
hu
man
) (-
PR
O)
~
T
b("
A
bJ
I I
~::~;J
P
RE
S
•
-
i~ I,
~
Deri
vati
on
:
Fir
•t C
ycle
:
t.
x [[
f Joh
n ]
]N
P [
+S
g)P
RE
S f
•peak
)v o
f W
H I
ND
EF
lr
bo
ok
Jl
1 5
Y
l<+
Sg
) N
( -
hu
man
i N
Z.
X [
(Jo
hn
)N [
[+S
g)P
RE
S]T
[•
peak
] o
f W
H [
-hu
nan
]IN
DE
F
[ b
oo
k 1 ]
5 Y
{ +
V)
V
. (-
hu
man
) N
3•
X [
[[Jo
hn
]N]N
P
[•p
eak
[(
+S
a]P
RE
S]T
] [
of]
PR
EP
[ W
H [
-h
um
.an
]IN
DE
F [
bo
ok
]N]N
plS
y
(+V
) V
""
Seco
nd
Cy
cle
:
1. z. 3.
[[[D
EF
]AR
T[[
of]
PR
EP
[WH
[-h
Wn
.ln
]IN
DE
~b
oo
k)N
]Np
f[Jo
hn
]N]N
P[•
pea
k[+
Sg
]pR
ES
]V]S
[bo
ok
]N]N
PP
RE
S b
e[aw
ful]
AD
J]S
[[(D
EF
)AR
T[b
oo
k]N
[of
WH
[-h
wn
an]I
ND
EF
[bo
ok
]N[J
'oh
n)N
[•p
eak
[+S
g)P
RE
S]V
]S]N
pl[
PR
ES
]T]A
UX
be[
awfu
l]A
DJ]
S
[[[D
EF
]AR
T [
bo
ok
]
[of
WH
[-h
u.m
an]!
ND
.Ey
lbo
ok
]N[J
oh
n)N
[•p
eak
[ +
Sg
]PR
ES
)V]S
]NP
[[P
RE
S]T
be]
AU
X (
awfu
l]A
DJ]
S
{+S
1)
N
.,
T:A
G
T:W
HA
G
T:A
F
T:W
HA
T:R
EL
PL
AC
E
T:A
UX
FIL
L
4.
[[(
DE
F)A
R.T
[ b
oo
k ]
[[
of]
PR
EP
WH
[-h
um
an
]IN
DE
~b
oo
k]N
[Jo
hn
]N[a
peak
[+S
g]p
RE
S]V
]S]N
P[(
[+S
g]P
RE
SJT
be]
AU
X [
awfu
l]A
DJ]
S
(+S
1)
N
T:A
G
r .., . 6.
7. I.
rnE
F{
bo
ok
]N (
[of]
pp
_E
P W
H D
EF
[
boo
k
] [J
oh
n]N
[ •
pea
k{
+S
fJP
RE
S]V
]S [
+S
g)P
RE
S b
e [a
wfu
l)A
DJJ
S
{-h
wn
an
) -
N
[DE
F [
boo
k]N
[[a
f]P
R.E
P (
WH
[-!
:.=
i.an
]DE
F
f b
oo
k
] ]N
P {
Joh
n]N
[•p
eak
{+
Sg
)PR
ES
]V]S
[+
Sg
]PR
ES
be
[aw
ful]
AD
J]S
l<
-h
~n
)
N
[DE
F (
boo
k]N
([v
f]P
R.E
P (
WH
[-h
wn
an
)DE
F]N
P [
J'o
hn
JN f
•pea
k[+
Sg
)PR
ES
]V]S
[[+
Sg
]PR
ES
]T b
e]A
UX
[aw
ful]
AD
J]S
(DE
F (
boo
k]N
fof
WH
[-h
mn
&n
]DE
F [
Joh
nJN
(•p
eak
[+
Sg
JP~
ES
]V]S
[b
e +
[[+
Sg
]PR
ES
JTJA
UX
[aw
ful]
AD
JJS
Po•t
C
ycle
:
1.
{D:E
F f
00
oit
jN [
oi
Wn
L-h
=:i
DE
F [
Jo
iul]
N f
•pea
k[•
JTJV
]S [
be
[[+
Sg
]PR
.ES
]TJA
UX
[aw
ful]
AD
J]S
Z.
[ D
EF
[ b
oo
k)N
[ o
f [
WH
[-h
wn
an
)DE
F]N
P [
Joh
n]N
( •
pea
k(•
]T)V
]S [
i•J
AU
X (
aw
ful]
AD
J]S
3.
[ D
EF
[ b
oo
kJN
[ o
f [ w
hic
h)N
P (
Joh
n)N
[ •
peak
[•JP
RE
Slv
ls [
i•J
AU
X [
aw
ful)
AD
J]S
4_
[ th
e [
bo
ok
]N[
of
[ w
hic
h)N
P [
Jo
hn
)N [
•p
eak
[•JP
RE
S]V
]S [
i•J
AU
X [
aw
ful]
AD
J]S
T:B
E 1
T:W
H Z
T:D
EF
T:D
EF
1
T:W
HA
G
T:P
RO
GD
EL
T:A
F
T:N
UA
G
Sen
ten
ce T
yp
e N
o.
31
Actu
al
str
ing
: th
e b
oo
k J
oh
n s
peak
s o
f is
aw
ful
Deri
ved
str
ing
: th
e b
oo
k J
oh
n s
peak
s
of
is a
wfu
l
Un
derl
yin
g s
tru
ctu
re:
li.e
N
~--
----
+>
----
--#
[
bo
~k
]
N
T
[
Jo
Ln
] {+
N)
(+~
g)
I P
RE
S
(+N
}
{-P
RO
}
{+
Sg
)
' ~
'sp
eak
] P
RE
P
NP
L (
+ V)
cif
----------
DE
T
N
AJT
[
bo
~k
]
~
{+N
} W
H
IND
EF
(-
hu
ma
n)
(-P
RO
)
-
-------*
!, ';
.....-
Deri
vati
on
:
Fir
st
Cy
cle
:
1.
X [
[ [
Jo
hn
] ]N
P [
+S
g]P
RE
S [
speak
]V o
f W
H I
ND
EF
[
bo
ok
J ]
5 Y
(+
Sg)
N
{
-hu
man
) N
T
:AG
2.
X [
[Jo
hn
]N [
[+S
g]P
RE
S]T
[sp
eak
] o
f W
H [
-hu
man
]IN
DE
F [
b
oo
k J ]
5 Y
·(+
V)
V
(-h
um
an
) N
T
:WH
AG
3.
X [
[(Jo
hn
]N]N
P
[sp
ea
k
[[+
Sg
]PR
ES
]T]
of
[WH
[-h
um
an
]IN
DE
F [
bo
ok
]N]N
p1
S Y
(+
V)
V
T:A
F
Seco
nd
Cy
cle
:
1.
[[(D
EF
]AR
T([
WH
[-h
um
an] 1N
DE
F[b
oo
k]N
]NP
[Jo
hn
]N[s
peak
[+S
g]P
RE
S]V
[of]
PR
Ep
lS[
bo
ok
]N]N
PP
RE
S b
e[aw
ful)
AD
J]S
T:W
HA
2.
3.
4.
5. 6.
[[[D
EF
]AR
T[b
oo
k]N
[WH
[-h
um
an
]IN
DE
F[b
oo
k]N
[Jo
hn
]N[s
peak
[+S
g]P
RE
S]V
of]
5]N
P[[
PR
ES
]T]A
UX
be[
awfu
l]A
DJ]
S
T:R
EL
PL
AC
E
[(D
EF
[b
oo
k l
[WH
[-h
um
an
] 1ND
EF
[bo
ok
]N[s
peak
[+S
g]P
RE
S]V
:.f
]S]N
P [
[PR
ES
]T +
be]
AU
X [
awfu
l]A
DJ]
S
(+S
g)
T:A
UX
FIL
L
[[D
EF
[bo
ok
] [ W
H[-
hu
man
]IN
DE
F[
bo
ok
]N[J
oh
n]N
[ sp
eak
[+S
g]P
RE
S]V
of]
5]N
P [
[[+
Sg
]PR
ES
]T b
e]A
UX
[aw
ful]
AD
J]S
{+
Sg
) N
T
:AG
[DE
F[b
oo
k]N
[WH
DE
F f
b
oo
k
] [J
oh
n]N
[ sp
eak
[+S
g]P
RE
S]V
of]
S [
+S
g]P
RE
S b
e [a
wfu
l]A
DJ]
S
k-h
um
an
) N
T
:DE
FI
[DE
F[b
oo
k]N
[[W
H[-
hu
man
]DE
F r
bo
ok
]
]NP
[Jo
hn
]N[
speak
[+S
g]P
RE
S]V
of]
5 [+
Sg
]PR
ES
be[
awfu
l]A
DJ]
S
~-h
um
an
) N
T
:WH
AG
7.
[DE
F[b
oo
k]N
[(W
H[-
hu
man
] 0E
F]N
P [
Joh
n]N
[sp
eak
[+S
g]P
RE
S]V
of]
5 [[
+S
g]P
!'!.E
S]T
be
[aw
ful]
AD
J]S
T:P
RO
GD
EL
8.
[DE
F[b
oo
k]N
[[W
H[-
hu
man
]DE
F]N
P[J
oh
n]N
[s
pea
k[+
Sg
]PR
ES
]y
of]
5 [b
e+
[[+
Sg
]PR
ES
]T]A
UX
[aw
ful]
AD
J]S
T:A
F
Po
st C
ycl
e:
t.
[DE
F[b
oo
k· 1
,.[(W
H[-
hu
ma
n)D
EF
]NP
[Jo
hn
)N[s
pea
k[s
)T]V
of]
5 [b
e[+
Sg
)PR
ES
]AU
X [
aw
ful)
AD
J]S
T:N
UA
G
z. [D
EF
[bo
ok
]N[[
WH
[-h
um
an
]DE
FJN
P[[
Joh
n]N
]NP
[sp
eak
[s]P
RE
S]V
of]
5 [
is]A
UX
[aw
ful]
AD
J]S
3.
[DE
F[b
oo
k)N
([[J
oh
n]N
]NP
[sp
eak
[s]P
RE
S]V
of)
5 [
is)A
UX
[aw
ful)
AD
J]S
4.
[th
e [
bo
ok
]N [
[Jo
hn
)N [
sp
ea
k ,
JV o
f]5
[is)
AU
X [
aw
ful)
AW
]S
T:B
E t
T:W
HD
EL
T:D
EF
-
Sen
ten
ce T
yp
e N
o.
32
Actu
al
str
ing
:
Deri
ved
str
ing
:
Joh
n t
ou
ch
ed
th
at
wh
ich
an
no
ys
Bil
l
Joh
n t
ou
ch
ed
th
at
wh
ich
an
no
y s
B
ill
Un
derl
yin
g s
tru
ctu
re:
H·------ 1--
--------
-----
NP
A
UX
I I
N
T
(
Jo
Ln
] (+
N)
(+S
g)
I P
AS
T
V I
[to
uch
] (+
V)
DE
F
NP
DE
~
~
(+N
) AJ
T [
thin
g
]
WH
IN
DE
F
(+S
g)
(+P
RO
) (-
hu
man
}
.P
T I
PR
ES
N i th
ing
]
(+N
}
(+P
RO
} (+
Sg
)
VP
V~
P
I I
[an
no
y]
(+V
) N
I r Bill]
L<
+N
)
I , I ll
Deri
vati
on
:
Fir
st
Cy
cle
:
1. 2.
3.
X f
[WH
IN
DE
F
[
thin
g J
)NP
[+
Sg
)PR
ES
[an
no
y)V
[B
ill)
N)S
Y
(+S
g)
(-h
um
an
) N
X [
WH
[-h
um
an
)IN
DE
F
f th
ing
J
f[+
Sg
)PR
ES
)T
ran
no
y]
[Bil
l}N
)S Y
L
<-h
um
an)
N
(+V
) V
X [
WH
[ -
hu
man
)IN
DE
F [
thin
g)N
ra
nn
o~
L
<+
V)
f[+
Sg
)PR
ES
]T]
[Bil
!]N
]S y
V
T:A
G
T:W
HA
G
T:A
F
Seco
nd
Cy
cle
:
1.
[[ fJ
oh
n]
]NP
PA
ST
[to
uch
]V[[
DE
F]A
RT
[th
ing
]N[W
H[-
hu
man
)IN
DE
F[t
hin
g]N
[an
no
y[+
Sg
]PR
ES
]V[B
ill]
N]S
]NP
]S
l<+
Sg)
N
T
:RE
LP
LA
CE
2.
[[ [
;Jo
hn
] ]N
P[+
Sg
]PA
ST
[to
uch
]y[D
EF
]AR
T[t
hin
g]N
[WH
[-h
um
an
] 1ND
EF
[th
ing
]N[a
nn
oy
[+S
g]P
RE
S]V
[Bil
l]N
]S]S
(+
Sg
) N
T
:AG
3.
([ [
Jo
hn
] ]N
P[+
Sg
]PA
ST
[to
uch
]yff
DE
F]A
RT
[th
ing
]N [
WH
DE
F r
thin
g
] [a
nn
oy
[+S
g)P
RE
S]V
[Bil
l]N
)S)N
p1
S
(+S
g)
N
L<
-hu
man
) N
T
:DE
FI
4.
[[
fJo
hn
] ]N
P[+
Sg
]PA
ST
[to
uch
]V[D
EF
]AR
T[t
hin
g]N
[WH
[-h
um
an
)DE
F f
thin
g
J [an
no
y[+
Sg
]PR
ES
]V[B
ill]
N]S
]S
L<
+Sg
) N
~
-hu
man
),
N
T:W
HA
G
5.
[[[J
oh
n]
]NP
[[+
Sg
]PA
ST
]T
fto
uch
] [[
DE
F]A
RT
[th
ing
]N [
WH
[-h
um
an)D
EF
[an
no
y[+
Sg
]PR
ES
]V[B
ill]
N]S
)Np
1S
(+
Sg
) N
l<
+V
) V
T
:PR
OG
DE
L
6.
[[Jo
hn
]N
rou
ch
[f
+S
g]P
AS
T]T
] [D
EF
[th
ing
]N[W
H[-
hu
man
]DE
F[a
nn
oy
[ +
Sg
]PR
ES
]V [
Bil
l]N
]S]N
p1
S
(+V
) V
T
:AF
Po
st C
ycle
:
1.
([Jo
hn
]N f
tou
chf e
d]T
]VD
EF
[th
ing
]N[W
H[-
hu
man
] 0E
F e
:n;r
[+S
g]P
RE
S]
V [
Bil
l]N
]S]S
Z.
[(J
oh
n)N
(to
uch
ed
)VD
EF
[
thin
g J
(WH
[-h
um
an
)DE
F[a
nn
oy
[s)
J [B
il'J
J]
{+
PR
O)
T
V
NS
S
(+S
g)
N
3.
[(Jo
hn
]N [
to
uch
ed
]V D
EF
[W
H[-
hu
man
)DE
F [
an
no
y •
Jy
[ B
ill]
N]S
)S
4.
[[Jo
hn
]N [
to
uch
ed
]V t
hat
[[W
H[-
hu
man
]DE
FJN
P [
an
no
y •
Jv
[Bil
l]N
JS]S
5.
[(Jo
hn
]N [
to
uch
ed
]V t
hat
[[w
hic
h)N
P [
an
no
y •
lv [
Bil
l]N
)s1
s
T:P
AS
T
T:N
t!A
G
T:W
HP
D t
T:D
EF
TH
AT
T:W
H Z
Sen
ten
ce T
yp
e N
o.
33
Actu
al
strin
g:
Bil
l can
vis
uali
ze w
hat
wil
l fa
ll
Deri
ved
str
ing
: B
ill
can
vis
uali
ze w
hat
wil
l fa
ll
Un
derl
yin
g s
tru
ctu
re:
N---------s-----------------------------N
---
------
-----7
-
Ni ~
N
< ~
I I
I
[
Bil
l l
PR
ES
r ca
n ]
(+
N}
~
+M
} (+
Sg
}
N...f
I
[ vis
{~
~~
ze] ~
AR
T
# #
I -
DE
F
p
~
DE
T
N
I I
AR
T
~D
EF
W
H
thin
g
(+N
}
(+P
RO
) {
+S
g)
(-h
um
an
}
AU
X
T~
I I
PR
ES
f w
ill]
L<
+M}
N
[
thL
g
] (+
N}
(+
PR
O)
(+S
g}
-hu
man
)
V I
f fall
]
Ji+
V)
,.~
-
Ii ,:
Deri
vati
on
:
Fir
•t
Cy
cle
:
1.
·X [
[WH
IN
DE
F
[
thin
g l ]NP
[+
Sg
]PR
ES
wil
l C
fall
]v1
s Y
{+
Sg
) {
-hu
man
) N
z. X
( W
H (
-hu
man
)IN
DE
F
[ th
ing
]
[(+
S1
]PR
ES
]T f w
ill
] [
fall
JV JS
Y
{-h
um
an
) N
l<
+M
) M
3.
X
[ W
H [
-hu
man
]IN
DE
F [
th
ing
)N [
wil
l +
[[+
S1]
PP
ES
]Tl
[ fa
ll]V
jS Y
{
+M
) _
,M
Seco
nd
Cy
cle
:
T:A
G
T:W
HA
G
T:A
F
1.
[[ f B
ill
] ]N
P P
RE
S [
can
)M [
vi•
ual
iz.e
]V [
[DE
F]A
RT
[th
in1
]N [
WH
[-h
um
an
]IN
DE
F [
thin
g]N
(w
ill[
+S
g]P
RE
S]M
[ f
all
]V]S
]Np
lS
L<+5
1>
N
_ T
:RE
LP
LA
CE
2..
([
rBil
l]
]NP
[+
Sg
]PR
ES
[ca
n)M
[v
iau
ali
ze]V
[D
EF
]AR
T r
th
ing
J [
WH
[-h
um
an
]IN
DE
F [
thin
g]N
[w
ill[
+S
g]P
RE
S]M
f fa
ll]V
]S]S
~
+S
1}
N
~+
PR
O}
N
T
:AG
3.
[( B
ill]
N [
[~5
1jP
RE
SjT
I. ca
n J,
[vta
uali
ze]V
[W
H [
-hu
m.L
n]I
ND
EF
[th
ing
]N [
wil
l[+
Sg
]PR
ES
JM [
fal
l]V
]S]S
T
:RE
GD
EL
L
l~M
) M
4.
[[ B
ill]
N [
~:~
; [i
+sg
)PR
ES
JT ]M
[vi
aua.
i.i.
ze)V
[W
H [
-hu
man
jlN
DE
F [
lhi.i
::.id
N [
wil
l[+
S1
dP
RE
S]M
[ f
all
]y] 5
] 5
T:A
F
Po
•t
Cy
cle
:
1.
2..
3.
[[ B
ill]
N [
can
]M [
vi•
uali
ze]V
[ W
H [
-hu
man
JIN
DE
F [<:~
:t>] [
will]M
[ f
all]
V]
5) 5
(+S
g)
N
[[ B
ill]
N [
can
]M [
vi•
uali
.ze]V
[ [
WH
[-h
um
an
]IN
DE
F]N
P [
wil
l]M
[ f
all]
VJS
]S
[[ B
ilij
N (
can
jM t
\•ia
~i.
i.c jV
i:f w
a.~
JNP
t..,
illJ
M [
Iall
]y1
5] 5
T:M
TD
EL
T:W
HP
D 2
.
T:W
H
3
Sen
ten
ce T
yp
e N
o.
34
Actu
al
str
ing
: w
hate
ver
fall
s w
ill
bo
un
ce
Deri
ved
str
ing
: w
hat
ev
er
fall
s w
ill
bo
un
ce
Un
derl
yin
g s
tru
ctu
re:
#------------------------------
!il!
DE
T ,,_ __
___ ,
----
--#
IN
DE
F
NP
--------
------
DE
T
N
I _
I A
RT
W~
~E
F
thin
g
(+N
) (+
PR
O)
(+S
g)
(-h
um
an
)
•
T I
PR
ES
-~
' th
ing
(+
N)
(+P
RO
) (+
Sg
) (-
hu
man
)
p I V I
[fa
ll
] (+
V)
-------fl
V I
f'i>
ou
nce
J L
(+V
)
..,
-D
eri
vati
on
:
Fir
st
Cy
cle
:
1.
2.
3.
X (
[WH
IN
DE
F
[
thin
g
] ]N
P [
+S
g]P
RE
S [
fall
]v1
s y
{+
Sg
) (-
hu
man
) N
X [
WH
[-h
um
an
]IN
DE
F
r th
ing
]
[[+
Sg
]PR
ES
]T
~-h
um
an
) N
ff
all
] ] 5
Y
L<
+V)
V
X [
WH
[ -h
um
an
]IN
DE
F [
th
ing
]N
ffall
l<
+V
) [[
+S
g]P
RE
S]T
]/s y
T:A
G
T:W
HA
G
T:A
F
Seco
nd
Cy
cle
:
1.
[r(I
ND
EF
]AR
T r
~h
ing
] [W
H [
-hu
man
]IN
DE
F[t
hin
g]N
[fall
f+S
g]P
RE
S]V
]S]N
PP
RE
S [
wil
l]M
[bo
un
ce]V
]S
~+
Sg
) N
T
:RE
LP
LA
CE
2.
[[[I
ND
EF
]AR
T
( th
ing
]
[WH
[-h
um
an
]IN
DE
F[t
hin
g]N
[fall
[+S
g]P
RE
S]V
]S]N
P [
+S
g]P
RE
S [
wil
l]M
[bo
un
ce]V
]S
{+S
g)
T·A
G
{-h
um
an
) N
·
3.
[[IN
DE
F]A
RT
r t
hin
g J
[WH
[-h
um
an
]IN
DE
F e
ver[
thin
g]N
[fall
[+S
g]P
RE
S]V
]S [
+S
g]P
RE
S[w
ill]
M[b
ou
nce]V
]S
~-h
um
an
) N
T
:EV
ER
4.
[[[W
H [
-hu
man
]IN
DE
F e
ver[
thin
g]N
[ f
all
[+S
g]P
RE
SL
.r]S
]NP
[[+
Sg
]PR
ES
] T
[w
ill 1
[ boun
ce JV
-k {t
-M)
M
T:R
EG
DE
L
5.
([W
H [
-hu
mar
·IN
DE
F e
ver[
thin
g]N
[fa
ll[+
Sg
]PR
ES
1v
1s
rwm
+ [
[+S
g]P
RE
SJT
l [b
ou
nce]v
ls
L<
+M
) .J
M
T:A
F
Po
st C
ycle
:
1. z. 3.
4.
[[W
H [
-h
um
an
]IN
DE
Fev
er[
thin
g]N
µ
au
[ +
Sg
]PR
ES
J ] 5
fwil
l]M
[b
ou
nce
]V]S
L<+
V)
V
[(W
H [
-hu
man
]lN
DE
F e
ver f thin
g
] [ fa
ll[
a]T
]V]S
[w
ill]
M [
bo
un
ce]
yJs
+P
RO
) (+
Sg
) N
[([W
H [
-hu
man
]lN
DE
F e
ver ]
NP
[!a
ll(a
]T]V
]S (
wil
l]M
[b
ou
nce]v
ls
([[w
hat
ev
er]
NP
(fa
ll[s
]T]V
]S [
wil
l)M
[b
ou
nce]v
1s
T:M
TD
EL
T:N
U~
G
T:W
HP
D 2
T:W
H 3
-
Sen
ten
ce T
yp
e N
o.
35
Actu
al
str
ing
: a
tall
bo
y a
rriv
ed
Deri
ved
str
ing
: a
tall
bo
y a
rriv
e e
d
Un
derl
yin
g s
tru
ctu
re:
#--
----
----
----
----
----
----
----
-/
*
NP
D~
I _
I A
RT
~
WH
IN
DE
F
bo
y
{+
N)
{-P
RO
) {
+h
um
an)
(+S
g)
* b
oy
(+
N)
{-P
RO
) {
+h
um
an)
{+S
g)
p
b~
DJ
I r
tall
]
L<
+A
DJ)
AU
X
VP
I I
T
V
I P
AS
T
I fa
rriv
el
L-<
+V
) J
I, 1,
Deri
vati
on
:
Fir
st
Cy
cle
:
1.
X [
WH
IN
DE
F
2.
X [
WH
IN
DE
F
f bo
y
] [[
PR
ES
)T +
be)
AU
X [
tall
)AD
J]S
Y
li+
Sg
) N
[
bo
y
] [[
[+S
g]P
RE
S]T
be]
AU
X [
t.-.l
l]A
DJ]
S y
(+
Sg
}
+h
um
an
) N
3.
X [
WH
[+
hu
man
]IN
DE
F
[ b
oy
]
[[[+
Sg
]PR
ES
]T b
e]A
UX
[ta
ll]A
DJ]
S y
(+
hu
man
) N
4.
X [
WH
[+
hu
man
]IN
DE
F [
bo
y]N
[b
e+
[[+
Sg
]PR
ES
]T]A
UX
[ta
ll]A
DJ~
S y
Seco
nd
Cy
cle
:
T:A
UX
FIL
L
T:A
G
T:W
HA
G
T:A
F
1.
[[[I
I~D
EF
]AR
T r b
oy
]
[WH
[+h
um
an
)IN
DE
F[
bo
y]N
[ b
e[+
Sg
)PR
ES
JAU
X[
tall
]AD
J]S
]NP
PA
ST
[ arr
ive]V
JS
~+
Sg
) N
T
:RE
LP
LA
CE
2.
[[IN
DE
F r
bo
y]
[WH
[+h
um
an
]IN
DE
F[b
oy
]N[b
e[-
tSg
]PR
ES
JAU
X [
tall
]AD
J]S
]NP
[+
Sg
]PA
ST
farr
ive]V
]S
~+
Sg
} N
T
:AG
3.
[IN
DE
F [
bo
y ]N
[W
H D
EF
r
bo
y I [
be[+S
g]P
RE
S]A
UX
r t
all
]AD
J]S
[+
Sg
]PA
ST
r arr
ive]v
ls
t+h
um
an
) N
T
:DE
FI
4.
[IN
DE
F [
bo
y ]N
[[W
H [
+h
um
an
]DE
F
[ b
oy
]
]NP
[b
e[+
Sg
]PR
ES
]AU
X [
tall
]AD
J]S
[+
Sg
]PA
ST
[ arr
ive]V
]S
_ {
+h
um
an}
N
T
:WH
AG
5.
6.
7.
8.
[IN
DE
F [
bo
y]N
[(W
Hf +
hu
man
)DE
F]N
P[
be[+
Sg
]PR
ES
]AU
X [
tall
]AD
J]S
f+
Sg
]PA
ST
f arr
ive
]V]S
[(IN
DE
F [
bo
y ]N
[[
tall
] AD
J]S
]NP
f +
Sg
]PA
ST
[ a
rriv
e]V
]S
f[IN
DE
F f
tall
]AD
J [b
oy
]N]N
P ff
+S
g]P
AS
T]T
rarr
ive]
] 5 L
(+ V
} V
[IN
DE
F [
tall
]AD
J fb
oy
]N f
arr
ive f
[+S
g]P
AS
T]T
]V]S
Po
st C
ycle
:
t.
[IN
DE
F [
tall
)AD
J [b
oy
)N [
arr
ive [
ed)T
]V]S
Z.
[a [
tall
]AD
J [b
oy
JN [
arr
ive e
dJV
JS
T:P
RO
GD
EL
T:R
EL
DE
L
T:A
DJP
LA
CE
T:A
F
T:P
AS
T
T:I
ND
EF
r ....
Sen
ten
ce T
yp
e N
o.
36
Actu
al
str
ing
: w
hic
h t
all
bo
y d
id Jo
hn
see
Deri
ved
str
ing
: w
hic
h t
all
bo
y d
id J
oh
n s
ee
Un
derl
yin
g s
tru
ctu
re:
-----#
N
NP
I D
ET
I
N
----~
-
I I (
+N
) Jo
hn
l /1
\.
(-P
RO
)
(+N
) /
I '\
-h
u=
nl
~
DE
T
N
AJT
r bly
] ~
(+N
) W
H
DE
F
(-P
RO
) (+
hu
man
) (+
Sg
)
(+S
g)
I A
UX
I T I
PR
ES
p
~D
J
be
I
r tall
J
L<
+A
DJl
,. I
Deri
vati
on
:
Fir
st
Cy
cle
:
1.
X [
WH
DE
F
2.
X [
WH
DE
F
[ b
oy
]
[[P
RE
S]T
+ b
e]A
UX
[ta
ll]A
DJ]
S Y
(+
Sg
) N
[
bo
y
] [[
(+S
g]P
RE
S]T
be]
AU
X [
tall
]AD
J]S
y
(+S
g)
(+h
um
an
) N
3.
X [
WH
[+
hu
man
]DE
F
[ b
oy
]
[[[+
Sg
]PR
ES
]T b
e]A
UX
[ t
all
]AD
J]S
Y
(+h
um
an
) N
4.
X [
WH
[+
hu
man
]DE
F f
bo
y]N
[b
e+
[[+
Sg
]PR
ES
]T]A
UX
[ta
ll]A
DJ]
S Y
Se
co
nd
Cy
cle
:
T:A
UX
FIL
L
T:A
G
T:W
HA
G
T:A
F
1.
[Q
[ [J
oh
n]
]NP
PA
ST
[see
}V
[[W
H D
EF
)AR
T[b
oy
}N
[WH
[+h
um
an
}D
EF
[bo
y]N
[be
[+S
g}
PR
ES
]AU
X[t
all
}A
DJ]
S}
Np
lS
(+S
g)
N
T:R
EL
PL
AC
E
2.
[Q [
µ
oh
n
] }
NP
[+
Sg
]PA
ST
[see
}V[[
WH
DE
F]A
RT
[bo
y]N
[WH
[+h
um
an
]DE
F[b
oy
]N[b
e[+
Sg
]PR
ES
]AU
X[t
all
]AD
J]S
]Np
lS
~+
Sg
) N
T
:AG
3.
[Q [
Jo
hn
]
[+S
g]P
AS
T[s
ee
]V((
WH
DE
F]A
RT
[bo
y ]N
[[W
H[+
hu
man
]DE
F]N
P[b
e[+
Sg
]PR
ES
]AU
X[t
all
]AD
J]S
]Np
lS
{+S
g)
N
T:P
RO
GD
EL
4.
5.
6.
7.
8.
[Q [
Jo
hn
1
f +S
g]P
AS
T[s
ee
}y
f[W
H D
EF
] AR
T [
bo
y ]N
f[t
all
]AD
J]S
]NP
]S
(+S
g )j
N
[Q [
[Jo
hn
]N]N
P [+
Sg
]PA
ST
[se
e]V
[[W
H D
EF
]AR
T [
tall
]AD
J [b
oy
]N]N
P]S
[fW
H[+
hu
man
]DE
F [
tall
]AD
J [b
oy]N
]NP
Q
f[Jo
hn
}N
]NP
[[f
+S
g]P
AS
TJT
]AU
X [
see
]V]S
f[W
H[+
hu
man
}D
EF
[ta
ll]A
DJ
fbo
y}N
]NP
rrf+
Sg
lPA
ST
]T]A
UX
Q [
[Jo
hn
]N]N
P [s
ee
]V]S
f[W
H[+
hu
man
]DE
F [
tall
] AD
J [b
oy
]N]N
P ff
[ +S
g] P
AS
T]T
] AU
X [
Joh
n}N
! s
ee
}V]S
Po
et C
ycle
:
t.
[(W
H[+
hu
man
)DE
F [
tall
]AD
J [
bo
y)N
]NP
[d
id)A
UX
[Jo
hn
)N [
eee)
V]S
2.
([w
hic
h [
tall
]AD
J [b
oy
]N]N
P [
did
)AU
X [
Joh
n]N
[ee
e]V
]S
T:R
EL
DE
L
T:A
DJP
LA
CE
T:Q
UF:
S
T:Y
ES
NO
T:Q
DE
L
T:D
O 1
T:W
H Z
Sen
ten
ce T
yp
e N
o.
37
Actu
al
str
ing
: Jo
hn
wo
uld
lik
e f
or
Mary
to
leav
e
Deri
ved
str
ing
: Jo
hn
wil
l ed
lik
e f
or
Mary
to
leav
e
Un
derl
yin
g s
tru
ctu
re:
~
#
NI ~
N
T
M
I I
I
[
Jo
hn
]
PA
ST
[
wil
l ]
(+N
) (+
M)
(+S
g)
*
p A
UX
V
P
I I
I N
T
V
I I
I [Ma
ry]
PR
ES
[1
eav
eJ
(+N
) (+
V)
(+S
g)
~
~ i'
Deri
vati
on
:
Fir
st
Cy
cle
:
1.
X [[
fM
ary
] ]N
P [
[+S
glP
RE
SlT
[le
av
e]
ls Y
L
<+
Sg)
N
(+
Y)
y
2.
X [
[Mary
lN re
av
e +
[[+
Sg
]PR
ES
]T]
ls y
(+
Y)
y
Seco
nd
Cy
cle
:
1.
[[ [
Jo
hn
] ]N
P P
AS
T [
wil
l]M
[ l
ike]y
(+
-Sg}
N
r it
J
[+C
[[M
ar/
jN]N
P [
leav
e[+
Sg
]P~
Esl
yls
ls
l('+
C)
N
T:A
G
T:A
F
T:C
P 1
2.
[[ [
Jo
hn
] ]N
P [
+S
g]P
AS
T [
wil
l]M
[li
kely
r it
J
[+C
[[M
ary
]N]N
P [
leav
ef+
Sg
]PR
Esl
yls
ls
T:A
G
(+S
w
N
~+
C)
N
3.
[ rJ
oh
n]
[+S
g]P
AS
T [
wil
llM
[li
kely
[
it J
[+C
[[M
ary
lNlN
P +
C
fleav
e [
[+S
glP
RE
S]T
] ] 5
] 5 IJ
+S
g}
N
c'+
C)
N
L (+
Y)
y T
:CD
UP
4.
[ [J
oh
n}
[[
+S
glP
AS
TlT
rwm
] [l
ikely
fi
t ]
[+C
[M
ary
lN +
C[l
eav
e]
1 5] 5
T
:TS
(+
s~
N
L<+
M)
M
l<+
c >
N
<+ Y
) Y
5.
[[Jo
hn
]N r
vi;'i
ll +
f[+
Sg
]PA
ST
]T]
flik
e]y
f it
]
[+C
[M
ary
]N +
C[l
eav
e]Y
]S]S
L<
+M
} M
l<
+_
S}
N
6.
[[Jo
hn
]N [
wil
l[+
Sg
]PA
ST
]T
flik
e]y
f+
C [
Mary
]N +
C f
leav
e]y
] 5] 5
Po
st C
ycle
:
1.
[[Jo
hn
]N [
wil
l [e
d]T
]M [
lik
ely
f+
C [
fMary
]N]N
P +
C f
leav
e]v
lsls
z. [[
Joh
n]N
fw
ill
ed]M
[li
kely
[fo
r [[
Mary
]N]N
P +
C [
leav
e]y
1s1
s
3.
[[Jo
hn
]N [
wil
l ed
]M [
lik
e]y
[fo
r [[
Mary
]N]N
P t
o [
leav
e]y
lsls
T:A
F
T:P
D
T:P
AS
T
T:C
1
T:C
2
Sen
ten
ce T
yp
e N
o.
38
Actu
al
str
ing
:
Deri
ved
str
ing
:
Joh
n w
an
ts M
ary
to
lt:
:'iv
e
Joh
n w
an
t s
Mary
to
leav
e
Un
derl
yin
g s
tru
ctu
re:
-r-==~
=:===
===--
--------
-------1
1 N
~U
X
~
I N
T
I P
RE
S
[
JoL
n J
(+N
) (+
Sg
)
NP
A
UX
V
P
I I
I N
T
V
[MLy
] I
I P
RE
S
[leav
e]
(+N
) (+
V)
(+S
g)
'
.....
1'
-D
eri
vati
on
:
Fir
st
Cy
cle
:
1.
X [[
[M
ary
] ]N
P [
[+S
g]P
RE
S]T
[l
eav
e]
]SY
(+
Sg
) N
(+
V)
V
2.
X [
[Mary
]N
[leav
e
[[+
Sg
)PR
ES
]T]
) 5 Y
{+
V)
V
Seco
nd
Cy
cle
:
1.
[[ [J
oh
n
] ]N
P P
RE
S [w
an
t]
[ it
]
[+C
[[M
ary
]N]N
P [
leav
e [
+S
g]P
RE
slv
lsls
(+
Sg
} N
(+
V)
_ V
{+C
} N
2.
[[ [
Jo
hn
]
]NP
[+
Sg
]PR
ES
[w
an
tlv
[it
)N [
+C
[[M
ary
]N]N
P [
leav
e [
+S
g]P
RE
slv
1sl
s {+
Sg
) N
3.
f Jo
hn
1 [+Sg
]PR
ES
[w
ant)
V [
it]N
[ +
C [
[Mary
]N]N
P +
C [
leav
e [
[+S
g)P
RE
S]T
] ]S
]S
L<+
Sg}
N
. <+
V)
V
4.
[ ~
Jo
hn
] [+
Sg
]PR
ES
[w
an
t]V
[
it
] [
+C
[[M
ary
]N]N
P +
C [
leav
e)
) ]
{+S
) {+
S
) V
S S
g
N
-N
5.
[ [J
oh
n]
[[+
Sg
]PR
ES
)T [w
an
t]
[ it
]
[[[M
ary
]N]N
P +
C [
leav
e]
] ]
(+S
g)
N
{+V
) V
(+
_S
}
N
VS
S
6.
[[Jo
hn
)N
[wan
t [[
+S
g)P
RE
S]T
] [
it
] [[
[Mary
]N]N
P +
C [
leav
e]V
]S]S
(+
V}
V
{+
_S
) N
7.
([Jo
hn
]N
[wan
t [+
Sg
]PR
Es]
[[
Mary
]N +
C [
leav
e)v
lsls
(+
V)
V
Po
st C
ycle
:
1.
[[ J
oh
n]N
[w
an
t[s]
T]
[[M
ary
)N +
C [
leav
e]v
lsls
(+
V)
V
2.
[[Jo
hn
]N [
wan
t[s)
T]V
[[
Mary
]N t
o
fleav
e]v
lsls
T:A
G
T:A
F
T:C
P 1
T:A
G
T:C
DU
P
T:T
S
T:C
D
T:A
F
T:P
D
T:N
UA
G
T:C
2
..
Sen
ten
ce T
yp
e N
o.
39
Actu
al
str
ing
:
Deri
ved
str
ing
:
Joh
n w
an
ts M
ary
to
be l
ov
ed
by
Bil
l
Joh
n w
an
t s
Mary
to
be l
ov
e e
n b
y B
ill
Un
derl
yin
g s
tru
ctu
re:
~----*
NP
A
UX
I
I ~
N
T
r ---
-I
I ~
[
Jo
hn
]
PR
ES
[w
Jn
t]
N
H ----
(~~~
(+ y
)
[ i~
]
-S
(+N)
(+
S
) (+
C)
NP
I N I
rBil
l J
L<+N
)
AU
X
I T I
PR
ES
*
~p
V
N
fl I
i M
AN
L<:;~
] ~
PR
~
[
I P
Mary
(+
N)
(+Sg)]
Deri
vati
on
:
Fir
st
Cy
cle
;
1.
2.
3.
4.
X [
[[M
ary
]N]N
P (
[PR
ES
)T]A
UX
be+
en
+ l
ov
e [
PR
EP
[[ B
ill]
N]N
plM
AN
]S Y
X [
[M
ary
] ]N
P (
[PR
ES
)T +
be)
AU
X e
n l
ov
e P
RE
P [
Bil
l)N
]S Y
·(
+S
g)
N
X [
[M
ary
] [[
[+S
g]P
RE
S]T
be]
AU
X e
n [
lov
e]
PR
EP
[B
ill]
N]S
Y
(+S
g)
N
{+V
) V
X [
[Mary
)N [
be+
[[+
Sg
]PR
ES
]T]A
UX
rlo
ve +
en
] P
RE
P [
Bil
l]N
]S y
(+
V}
V
T:P
AS
SIV
E
T:A
UX
FIL
L
T:A
G
T:A
F
Seco
nd
Cy
cle
:
1.
([ r Jo
hn
] ]N
P P
RE
S [
wan
t)N
U
+S
g}
N
[ it
]
[+C
([M
ary
]N]N
P [
be
[+S
g]P
RE
S]A
UX
[lo
ve
en]V
PR
EP
[B
ill]
N]S
]S
{+
C)
N
T:C
P 1
2.
3. 4.
5.
6.
[ fJ
oh
n
] [+
Sg
)PR
ES
[w
an
t)V
[it
)N [
+C
[[M
ary
)N]N
P [
be
[+S
g)P
RE
S]A
UX
[lo
ve
en)V
PR
EP
[B
ill]
N)S
]S
L<+
Sg)
N
T:A
G
[ rJ
oh
n
] [+
Sg
]PR
ES
[w
ant)
V [
it]N
[+
C [
[Mary
]N]N
P +
C [
be
[[+
Sg
]PR
ES
]T]A
UX
[lo
ve
en]V
PR
EP
[B
ill]
N]S
]S
Ll+
Sg)
N
T
:CD
UP
[ ~
Joh
n ]
[+
Sg
]PR
ES
[w
ant}
V
[ it
]
[+C
[[M
ary
]N]N
P +
C [
be]
AU
X [
lov
e en
]V P
RE
P [
Bil
l]
] ]
(+S
)
(+
S}
N 5
S
g N
-
N
T:T
S
[ rJ
oh
n J
[f +
Sg
]PR
ES
] L
<+
Sg)
N
[w
an
t]
[ it
]
[[[M
ary
]N]N
P +
C [
be]
AU
X [
lov
e eE
]V P
RE
P [
Bil
l]N
]S]S
{+
V)
V
<+
_S
}
N
T:C
D
[[Jo
hn
]N
[wan
t (+
V)
[[+
5g
]PR
ES
]T]
r it
]
[[[M
ary
]NlN
P +
C [
be]
AU
X [
lov
e en
]v P
RE
P [
Bil
l]N
lsls
v
l<+
_s>
N
T
:AF
7.
[[Jo
hn
]N
[wt;
~ f
+S
g]P
RE
S]
V [
[Mar
y]N
+C
[b
e]A
UX
[lo
ve
en]V
PR
EP
[B
ill]
N]S
)S
Po
at
Cy
cle
:
T:P
D
t.
[(Jo
hn
]N [
wan
t[aJT
J-[[
Mar
y1
N +
C [
be]
AU
X [
lov
e en
]V P
RE
P [
Bil
l]N
]S]S
(+
V)
" ~
Z.
([Jo
hn
]N [
wan
t[s]
T]V
[[M
ary
)N t
o [
be)
AU
X [
lov
e en
]V [
PR
EP
([B
ill)
N]N
plM
AN
]S]S
3.
[[Jo
hn
]N [
wan
t[s]
T]V
[[M
ary
]N t
o [
be]
AU
X [
lov
e en
]V [
by
[[B
ill]
NJN
p1
MA
N1
s1s
T:N
UA
G
T:C
Z
T:B
Y
Sen
ten
ce T
yp
e N
o.
40
Actu
al
str
ing
: Jo
hn
pre
fers
fo
r B
ill
no
t to
leav
e
De
riv
ed
str
ing
: Jo
hn
pre
fer
s fo
r B
ill
no
t to
leav
e
Un
derl
yin
g s
tru
ctu
re:
1'-
----
--..
#
NP
A
UX
I I
N
T
[JJhn
] {
+N
) {
+S
g}
I P
RE
S
,;p
V I
f pre
fer]
N
---#
L (+
V)
f (:L ]
+
S}
{+C
)
PR
E
I N
EG
NP
I N [B;ll]
{+
N)
{+S
g}
AU
X
VP
I I
T
V
I I
PR
ES
[1
eav
e]
{+
V)
....
,:
Deri
vati
on
:
Fir
st
Cy
cle
:
1.
X [
NE
G [
[B
ill
] ]N
P [
[[+
Sg
]PR
ES
]T]A
UX
µ
eav
e]
] 5
Y
(+S
g}
N
L<+
V}
V
2.
X [
[[B
ill]
N )
NP
[[[
+S
g)P
RE
S]T
]AU
X N
EG
[le
ave)
V]S
Y
Seco
nd
Cy
cle
:
1.
[[
rJo
hn
] ]N
P P
RE
S [
pre
fer J
V r i
t ]
[+C
[[
Bil
l]N
]NP
[+
Sg
]PR
ES
NE
G [
leav
e]V
]S]S
L
<+
sg}
N
L<
+c>
N
2.
[ fJ
oh
n ]
[+
Sg
)PR
ES
[p
refe
r ly
[it
]N [
+c [
[Bil
l]N
]NP
[+
Sg
]PR
ES
NE
G [
leav
e)v
lsls
L
<+Sg
} N
3.
[(Jo
hn
]N [
+S
g]P
RE
S [
pre
fer]
V [
it]N
[+
C (
[Bil
l]N
]NP
+C
[[+
Sg
]PR
ES
]T N
EG
[le
ave]
V]S
]S
4.
[[Jo
hn
]N [
+S
g]P
RE
S [
pre
fer
JV [
it]N
[+
C
[Bil
l)N
NE
G +
C [
[+S
g]P
RE
S]T
[le
ave]
V]S
]S
5~
6.
7.
[[Jo
hn
]N [
[+S
g]P
RE
S]T
[p
refer]
[it]
N [
+C
[B
ill]
N N
EG
+C
[le
av
e)v
lsls
(+
V)
V
[[Jo
hn
]N
rpre
fer
[[+
Sg
)PR
ES
]T]
r it
]
[+c [
Bil
l]N
NE
G +
C [
leav
e)v
lsls
L
(+V
) V
L
<+
_S
}
N
[(Jo
hn
]N rp
refe
r [+
Sg
]PR
Es]
[+
C [
Bil
l]N
NE
G +
C [
leav
e]v
lsls
L
<+
V)
V
Po
st C
ycle
:
1.
2.. 3.
4.
[[Jo
hn
]N
fpre
ferr
sJT
] [+
C [
Bil
l]N
NE
G +
C [
leav
e)v
lsls
L <
+ V
} V
[[Jo
hn
)N [
pre
fer[
s)T
]V [
+C
[[B
ill]
N]N
P n
ot
+C
[le
av
e]v
lsls
[[Jo
hn
]N [
pre
fer[
s)T
]V [
fo
r [B
ill]
N n
ot
+C
[le
av
e]v
lsls
[[Jo
hn
]N [
pre
fer[
s)T
]V [
for
ram
)N n
ot
to [
leav
e]v
lsls
T:A
G
T:N
EG
PL
AC
E
T:C
P 1
T:A
G
T:C
DU
P
T:C
NE
G
T:T
S
T:A
F
T:P
D
T:N
UA
G
T:N
EG
SP
EL
L
T:C
1
T:C
2.
-
Sen
ten
ce T
yp
e N
o.
41
Actu
al
str
ing
:
Deri
ved
str
ing
:
Bil
l w
ou
ld p
refe
r fo
r Jo
hn
no
t to
hav
e d
ream
ed
Bil
l w
ill
ed
pre
fer
for
Joh
n n
ot
to h
av
e d
ream
en
Un
derl
yin
g s
tru
ctu
re:
----
#
NP
A
UX
I N
[Blu]
(+N
) (+
Sg
)
~
T
I I
[w
ill]
(+
M)
PA
ST
I
(Pre
fer]
L (
+V
)
p I N
EG
N
T
V
[JoLn
] I
I P
AS
T
[dre
am
] (+
N)
(+ V
)
(+S
~
I 'I
Deri
vati
on
:
Fir
st
Cy
cle
:
1.
X [
NE
G [
[J
oh
n]
]NP
[[[
+S
g]P
AS
T]T
]AU
X [
dre
am
]V]S
Y
(+S
g)
N
T:A
G
Z.
X (
[[Jo
hn
]N]N
P (
[[+
Sg
]PA
ST
]T]A
UX
NE
G [
dre
am
]V]S
Y
T:N
EG
PL
AC
E
Seco
nd
Cy
cle
:
1.
[[
[Bil
l ]
]NP
PA
ST
[w
ill]
M [
pre
fer]
V
(+S
g)
. N
r it J
[+C
[[J
oh
n]N
]NP
[+
Sg
]PA
ST
NE
G [
dre
am
]vls
ls
Lf+
C)
N
T:C
P 1
z. 3.
4.
5. 6.
7.
8.
[ [B
ill
] [+
Sg
]PA
ST
[w
ill]
M [
pre
fer ]
y
{+S
g)
N
[ [B
ill
] [+
Sg
]PA
ST
[w
ill]
M [
pre
fer]
y
{+S
g)
N
r it
] [+
C [
(Jo
hn
]N]N
P [
+S
g]P
AS
T N
EG
[d
ream
]V]S
]S
l<+c>
N
T
:AG
r it
] [+
C [
[Jo
hn
]N]N
P +
C [
[+S
g]P
AS
T]T
NE
G [
dre
am
]vls
ls
L<
+C
) N
T
:CD
UP
[ [
Bil
l ]
[+S
g]P
AS
T [
wil
l]M
[p
refe
r JV
r
it
] [+
C [
Joh
n]N
NE
G +
C [
[+S
g]P
AS
T]T
[d
ream
]V]S
]S
(+S
g)
N
L<+
C}
N
T:C
NE
G
[ [B
ill J
[+S
g]P
AS
T (
wil
l]M
[p
refe
r]V
r i
t ]
[+C
(Jo
hn
]N N
EG
+C
hav
e e
n (
[+S
g]P
AS
T]T
[ d
ream
]V]S
]S
(+S
g)
N
L<+
C}
N
T:C
TE
NS
E
[ [
Bil
l ]
[[+
Sg
)PA
ST
]T
[wil
l ]
[pre
fer J
V r i
t ]
[+C
[Jo
hn
]N N
EG
+C
hav
e e
n
rdre
am
] ]S
]S
(+S
g)
N
(+M
) M
L
l+C
) N
L (
+V
) V
T:T
S
[[B
ill]
N
rwil
l [[
+S
g]P
AS
T]T
] [p
refe
r ]y
f
it
] [+
C [
Joh
n]N
NE
G +
C h
av
e
~+
M)
M
l_~'+
_S
)
N
[dre
am
+ e
n]
lsls
(+
V)
V
T:A
F
[( B
ill]
N
[wil
l [[
+S
g]P
AS
T]T
] [ p
ref
er
JV [
+C
[ J
oh
n]N
NE
G +
C h
av
e
rdre
am
+ e
n]
J 5] 5
T:P
D
(+M
} M
L
<+
V}
V
Po
at
Cy
cle
:
t.
([B
ill]
N [
wil
l (e
d]T
]M [
pre
fer J
V [
+C
(Jo
hn
]N N
EG
+C
hav
e [
dre
am
en
]yJ 5
J 5
Z.
([B
ill]
N [
wil
l ed
]M [
pre
fer J
V [
+C
[[J
oh
n]N
]NP
no
t +
C h
av
e [
dre
am
en
]yJ 5
J 5
3.
([B
ill]
N [
wil
l ed
)M [
pre
fer ]
y [
fo
r ([
Joh
n]N
]NP
no
t +
C h
av
e [
dre
am
en
]vls
ls
4.
([B
ill]
N (
wil
l ed
]M [
pre
fer]
y [
for
[Jo
hn
)N n
ot
to h
av
e [
dre
am
en
]y1
s1s
'?:P
AS
T
T:N
EG
SP
EL
L
T:C
t
T:C
2
Sen
ten
ce T
yp
e N
o.
42
Actu
al
str
ing
: fo
r Jo
hn
no
t to
dro
wn
wo
uld
be p
refe
rred
Deri
ved
str
ing
: fo
r Jo
hn
no
t to
dro
wn
wil
l ed
be
pr
efe
r en
un
derl
yin
g s
tru
ctu
re:
,r-----------~
-----------------------------------#
DE
~
AU
X
T~
M
V
M
AN
I I
AR
T
I I
I
I [
on
e rA
ST
[ w
ill
] rp
refe
r 1
(+N
) (+
M)
PR
-6
"-P
IND
EF
(+
PR
O)
S--
H
PR
E
NP
A
UX
V
P
I I
I I
NE
G
N
T
V
[JoL]
I I
PR
ES
ero
wn
] (+
N)
(+ V
) (+
Sg
)
..
I I ' I ' 1: ., 1,
Deri
vati
on
:
Fir
st
Cy
cle
:
1.
X [
NE
G [
f J
oh
n]
]NP
[[[
+S
g]P
RE
SJT
JAU
X
rdro
wn
] ]S
Y
li+
Sg
) N
{+
V)
V
T:A
G
2.
X [
[[Jo
hn
]N]N
P [
[[+
Sg
]PR
ES
]T]A
UX
NE
G [
dro
wn
]V]S
Y
T:N
EG
PL
AC
E
Seco
nd
Cy
cle
:
1.
[[IN
DE
F[o
ne]N
]NP
[PA
ST
[wil
l]M
]AU
X[p
refe
r]V
[ fit
]
[+C
[[J
oh
n]N
]NP
[[+
Sg
]PR
ES
]TN
EG
[dro
wn
]V]S
]NP
PR
EP
P] 5
l<+
C)
N
T:C
P 1
2.
3.
4.
5. 6.
1. 8.
[[ f
i.t J
[+C
[Jo
hn
)N[+
Sg
]PR
ES
NE
G[d
row
n)V
]S]N
PP
AS
T[w
ill]
Mb
e e
n [
pre
fer
]y[P
RE
P[I
ND
EF
[on
e]N
]Np
lMA
N]S
L<
+S
g)
N
T:P
AS
SIV
E
[[ [
i.t
]
[+C
f[Jo
hn
]NJN
P[+
Sg
)PR
ES
NE
G[d
row
n]V
]S]N
P[+
Sg
]PA
ST
[wil
l]M
be e
n [
pre
fer)
y[P
RE
P I
ND
EF
on
e)M
AN
]S
~S
g)
N
T:A
G
[(it
]N[+
C[(
Joh
n]N
]NP
+C
[[+
Sg
]PR
ES
]TN
EG
[ dro
wn
]y]g
l+S
g]P
AS
T[w
ill]
Mb
e e
n [
pre
fer ]
V[P
RE
P I
ND
EF
on
e]M
AN
]S
T:C
DU
P
[[i.
t]N
[+ C
[Jo
hn
)NN
EG
+ C
[[+
Sg
] PR
ES
] T
[ dro
wn
]V]S
[ +S
g]P
AS
T[ w
ill)
M b
e e
n [
pre
fer l
y[P
RE
P[I
ND
EF
[ on
e ]N
]Np
lMA
N]S
T:C
NE
G
[[it
]N[+
C[J
oh
n)N
NE
G +
C[ d
row
n]V
]S f
[+S
g]P
AS
T]T
lw
ill I b
e en
'p
refe
r I [P
RE
P[I
ND
EF
[on
e]N
]Np
lMA
NJS
(+
M)
M
(+V
) V
T
:TS
[L it
Jr+
c (
Joh
n)N
NE
G +
C [
dro
wn
lvls
[w
i.11
+ [
[+S
g]P
AS
T]T
] b
e rp
refe
r +
en
1
[PR
EP
IN
DE
F[o
ne)
N]M
AN
]S
(+
S)
N
·(+
M}
.(+
V}
-M
V
T
:AF
[[+
C [
Joh
n]N
NE
G +
C [
dro
wn
]V]S
[w
ill[
+S
g]P
AS
T]M
be
[pre
fer
en
)y[ P
RE
P I
ND
EF
r o
ne
] ]M
AN
]S
Lf+
PR
O}
N
T
:PD
9.
[[+
C [
Joh
n)N
NE
G +
C [
dro
wn
]vls
[ 7:~
[+Sg
]PA
ST
] b
e[p
refe
r en
]vls
M
T:A
GD
EL
Po
at
Cy
cle
:
t.
[(+
C (
Joh
n]N
NE
G +
C (
dro
wn
]V]S
rw
ill
[ed
]T]
be [
pre
fer
en]V
]S
L«+M
) M
Z.
[[+
C [
[Jo
hn
)NJN
P n
ot
+C
[d
row
n)V
JS [
wil
l ed
]M b
e (
pre
fer
en
)vls
3.
([ f
or
[[ J
oh
n)N
]NP
no
t +
C [
dro
wn
]VJS
[ w
ill
ed]M
be
[ p
refe
r en
]V]S
4.
[[ f
or
[Jo
hn
]N n
ot.
to r d
row
n]v
1s
[wil
l ed
]M b
e [p
refe
r en
)vls
T:P
AS
T
T:N
EG
.5P
EL
L
T:C
t
T:C
Z
L:...
Sen
ten
ce T
yp
e N
o.
43
Actu
al
str
ing
: it
is r
eq
uir
ed
fo
r Jo
hn
to
sta
nd
Deri
ved
str
ing
: it
is r
eq
uir
e e
n f
or
Joh
n t
o s
tan
d
Un
derl
yin
g s
tru
ctu
re:
#-
T
V
I I
PR
ES
rr
eq
uir
e]
N
S
II
IND
EF
L
(+V
}
[ i~
]
(+N
} (+
S
} (+
Sg}
(+
C}
NP
I N
['oLn]
(+N
}
(+S
g}
AU
X
I T I
PR
ES
~
PR
EP
P
VP
I V I
[8ta
nd
] (+
V}
I •
-D
eri
vati
on
:
Fir
st
Cy
cle
:
1.
X [
[ [J
oh
n]
]NP
[[+
Sg
]PR
ES
]T
fsta
nd
l ) 5
Y
(+
Sg
) N
L (+
V}
j V
T:A
G
X [
[(Jo
hn
)N]N
P
fsta
nd
[[
+S
g)P
RE
S]T
J ) 5
Y
L<
+V
} V
2.
T:A
F
Seco
nd
Cy
cle
:
1.
([IN
DE
F [
on
e)N
]NP
[[P
RE
S)T
]AU
X[r
eq
uir
e)y
[
rit ]
[+C
[(J
oh
n]N
]NP
[sta
nd
[+S
g)P
RE
S]V
]S]N
PP
RE
P P
] 5 ~
+C
) N
T
:CP
1
2.
[[ f i
t ]
[+C
[Jo
hn
]N[s
tan
d f
+S
g]P
RE
S]V
]S]N
PP
RE
S b
e+
en
+[r
eq
uir
e]y
[ P
RE
P[
IND
EF
[on
e]N
]Np
lMA
N]S
(+
S
) (+
C)
T:P
AS
SIV
E
N
3.
[[ t it
]
]NP
[[P
RE
S]T
]AU
X b
e e
n [
req
uir
e]V
PR
EP
IN
DE
F[o
ne]N
[ +
C[J
oh
n]N
r st
an
d[+
Sg
]PR
Esl
vls
ls
(+
_S
)
T:E
XT
RA
(+
C)
N
4.
5. 6.
7.
8.
9.
[[ r it
] ]N
P [
[PR
ES
]T b
e]A
UX
en
[re
qu
ire]y
PR
EP
IN
DE
F [
on
e]N
[+
C[J
oh
n]N
[ st
an
d[+
Sg
]PR
ES
]V]S
]S
(j+
Sg
} N
T
:AU
XF
ILL
[[
[ it
]
]NP
[[[
+S
g]P
RE
S]T
be]
AU
X e
n[r
eq
uir
e]V
PR
EP
IN
DE
F[o
ne]N
[+C
[[J
oh
n)N
]NP
[sta
nd
[+S
g]P
RE
S]V
]S]S
(+
Sg)
N
T
:AG
[(it
]N[+
Sg
]PR
ES
be e
n [
req
uir
e)V
PR
EP
IN
DE
F f
on
e]N
f+
C [
(Jo
hn
)N]N
P +
C
fsta
nd
[[+
Sg
]PR
ES
]TJ.
.,
) 5) 5
L< +
V)
V
T:C
DU
P
[(it
]NH
(+S
g]P
RE
S]T
be)
AU
X e
n fi
-eq
uir
e]
PR
EP
IN
DE
F [
on
e]N
[+C
[Jo
hn
]N +
C
rsta
nd
] ] 5
] 5 L
(+V
) V
L
<+
V)
V
T:T
S
[[it
]N[
be
+ [
[+S
g]P
RE
S]T
]AU
X
fre
qu
ire
+ e
njl
f PR
EP
IN
DE
F r
on
e ]
]MA
N[+
C [
Joh
n]N
+C
[s
tan
d]
] 5] 5
L<
+V
) V
~
+P
RO
) N
,<
+V
) V
T
:AF
[[it
]N (
be
[+S
g]P
RE
SJ
AU
X [
req
uir
e en
JV [
+C
[Jo
hn
]N +
C [
sta
nd
]V]S
]S
T:A
GD
EL
Po
st
Cy
cle
:
t.
[[it
]N [
isJA
UX
[re
qu
ire e
n]V
[+
C [
[Jo
hn
]N]N
P +
C [
stan
d]v
lsls
z. [(
it]N
[is
]AU
X [
req
uir
e e
n]v
[fo
r [[
Joh
n]N
]NP
+c [
sta
nd
]vls
ls
3.
[(it
]N (
isJA
UX
[re
qu
ire e
n]V
[ f
or
[Jo
hn
]N t
o [
stan
d]v
ls]s
T:B
E t
T:C
t
T:C
Z
'
Sen
ten
ce T
yp
e i
.-i :>
. 4
4
Actu
al
str
ing
; B
on
d w
as b
eli
ev
ed
to
be d
ead
by
G
old
fin
ger
Deri
ved
str
ing
: B
on
d w
as
beli
ev
e e
n t
o b
e d
ead
by
G
old
fin
ger
Un
derl
yin
g s
tru
ctu
re:
N~
I
I I
----
:e
N
T
---
~--:----------
' I
V
NJ:
rGo
ldfi
ng
er]
P
AS
T
r _I
] ~
L
(+N
) t•
heve
N
/
"-._
(+
V)
[ (:~
) ~
S
H
PR
EP
p
(+
_S
}
( +C
}
NP
I N
[BLd]
(+N
) (+
Sg
)
AU
X
VP
I b
~D
J
T I
I P
RE
S
~ dead
]
(+A
DJ)
(.
.
J ,,
Deri
vati
on
:
Fir
st
Cy
cle
:
1.
X (
[ [B
on
dJ
]NP
([P
RE
S]T
be]
AU
X [
dead
]AD
J]S
Y
(+S
g)
N
T:A
UX
FIL
L
2.
3.
X [
[[B
on
dl
]NP
[[[
+S
g]P
RE
S]T
be]
AU
X [
dead
]AD
J]S
y
(+S
g ~ N
X [
f[B
on
tlJN
]NP
[b
e+
[[+
:g
)PR
ES
]T]A
UX
[d
ead
]AD
J]S
y
T:A
G
T:A
F
Seco
nd
Cy
cle
:
1.
[[[G
old
fin
ger ]
N]N
P[[
P~
.ST
]T]A
UX
[beli
ev
e]V
[ r it
J
[+C
[[B
on
d]N
]NP
[be[+
Sg
]PR
ES
]AU
Xf d
ead
)AD
J]S
]NP
PR
EP
P] 5
LJ+
C)
N
T:C
P 1
2.
[[
[ it
]
[+ C
[B
on
d]N
[be[
+S
g] P
RE
S]A
UX
[ dead
]AD
J]S
]NP
PA
ST
be+
en
+ [
beli
ev
e]J
PR
EP
[[G
old
fin
ger ]
N]N
plM
AN
]S
(+
_S
)
T:P
AS
SIV
E
{+
C)
N
3.
4.
5. 6.
7.
8.
9.
[[ r it
]
]NP
[PA
ST
]AU
Xb
e e
n[b
eli
ev
e]V
[PR
EP
[Go
ldfi
ng
er]
N]M
AJ+
C[[
Bo
nd
]N]N
P[b
e[+
Sg
]PR
EJA
UX
[dead
]AD
ifjs
L<
+_
s >
N
T:E
XT
RA
[ff3
on
d]N
]NP
[[P
AS
T]T
]AU
X b
e e
n [
bel
i<!v
e]V
PR
EP
[G
old
fin
ger]
N [
+C
[b
e [+
Sg
]PR
ES
]AU
X[d
ead
)AD
J]S
]S
T:P
RO
RE
P
[[ r
Bo
nd
] ]N
P [
(PA
ST
]T b
e]A
UX
en
[b
eli
ev
e]V
PR
EP
[G
old
fin
ger]
N [
+C
(b
e [+
Sg
]PR
ES
]AU
X[d
ead
]AD
J]S
]S
(+S
g)
N
T:A
UX
FIL
L
[[[B
on
d]
]NP
[(
[+S
g]P
AS
T]T
be
] AU
X e
n[b
eli
ev
e]V
PR
EP
[Go
ldfi
ng
er ]
N[+
C f
be[[
+S
g]P
RE
S]T
]AU
X[d
ead
]AD
J]S
]S
(+S
g)
N
T:A
G
[ lB
on
d]
f[[+
Sg
]PA
ST
]T
be]
AU
X e
n [
be~
i~v
e]
PR
EP
[G
old
fin
ger]
N [
+C
[b
e]A
UX
[d
ead
]AD
J]S
]S
(+S
fl)
N
( )
V
T:T
S
[[B
on
d]N
(bc +
[[+
Sg
]PA
ST
]T]A
UX
[b
elie
ve+
enl
[P
RE
P [
Go
ldfi
ng
cr]
N]A
UX
f+C
fb
e]A
UX
[[d
ea
d]A
DJ]
Vp
lS]S
L
{ + V
}
J V
T :
AF
[[B
on
d]N
[b
e [+
Sg
]PA
ST
]AU
X [
beli
ev
e e
n]V
[+
C [
be]
AU
X [
dead
)AD
J]S
[P
RE
P [
(Go
ldfi
ng
er]N
]Np
1M
AN
JS
T:V
PC
OM
P
Po
st C
ycle
:
t.
([B
on
d)N
[w
as)
AU
X [
beli
ev
e e
n]V
[+
C [
be]
AU
X [
dead
)AD
J]S
[P
RE
P [
[Go
ldfi
ng
er]
N]N
plM
AN
]S T
:BE
3
Z.
([B
on
d)N
[w
as]
AU
X [
beli
ev
e e
n]V
[to
[b
e]A
UX
[d
ead
]AD
J]S
f P
RE
P [
[Go
ldfi
ng
er]
N]N
plM
AN
]S
T:C
Z
3.
([B
on
d)N
[w
as)
AU
X [
beli
ev
e e
n]V
[to
[b
e)A
UX
[d
ead
)AD
J]S
(b
y [
[Go
ldfi
ng
c:J
)Np
lMA
N]S
T
:BY
Sen
ten
ce T
yp
e N
o.
45
Actu
al
!:tr
ing
: J
oh:1
lo
ve
s to
ru
n
Deri
ved
str
ing
: Jo
hn
lo
ve
s to
ru
n
Un
derl
yin
g s
tru
ctu
re:
~~P
I
I I
N
T
V
I I
I
[Jo
hn
]
PR
ES
ft
ov
e]
N
S
#
<~ ~ \
l < +
v >
~
i ~ ]
(+N
) (+
S
}
(+C
}
NP
A
UX
V
P
I I
I N
T
V
I
I I
I
['ohn]
PR
ES
[ru
n]
(+N
}
+V
} (+
Sg
)
~ '
Deri
vati
on
:
Fir
st
Cy
cle
:
1.
X [[
[Jo
hn
] ]N
P [
[+S
g]P
RE
S]T
r run
]
ls Y
( +
Sg
) N
l<
+ V)
V
2.
X
[[[J
oh
n]N
]NP
rr
un
f[
+S
g]P
RE
SJT
J ] 5
Y
~+
V)
V
Seco
nd
Cy
cle
:
1. 2.
3.
4.
5.
6.
([[J
oh
n]N
]NP
PR
ES
[lo
ve]y
[ r it
]
[+C
[fJ
oh
n]N
]NP
[ru
n[+
Sg
]PR
ES
]V]S
]NP
]S
L(+
C)
N
[[ [
:Jo
hn
] ]N
P P
RE
S f
lov
e]y
(it
]N f
+C
f ru
n [
+S
g]P
RE
S]Y
]S]S
(+
Sg
} N
[ fJ
oh
n]
[+S
g]P
RE
S [
lov
e]V
[it
]N [
+C
[ru
n [
[+S
g]P
RE
S]T
l ] 5
] 5 L
<+
Sg)
N
(+Y
) J y
[Jo
hn
] [[
+S
g]P
RE
S]T
[l
ov
e]
[it]
N [
+C
[ru
n]v
lsls
(+
Sg
) N
(+
V)
V
ffJo
hn
]N
ri.o
ve
[[+
Sg
]PR
ES
]T]
[ it
1
[+C
[ru
n]y
] 5] 5
L<+
Y)
y <+
__
_ s~
N
[(Jo
hn
]N
fio
ve
f[+
Sg
]PR
ES
]T]
[+C
[1·u
n]v
lsls
L<+
Y)
y
Po
st C
ycle
:
1.
[[Jo
hn
]N [
lov
e[s
]TJ
[+C
[ru
n]v
lsls
(+
V)
V
2.
[[Jo
hn
)N [
lov
e s)
V f
to f
run
]V] 5
] 5
T:A
G
T:A
F
T:C
P 1
T:I
E
T:A
G
T:T
S
T:A
F
T:P
D
T:N
UA
G
T:C
2
Sen
ten
ce T
yp
e N
o.
46
Actu
al
str
ing
: Jo
hn
lik
es
to b
e t
ak
en
Deri
ved
str
ing
: Jo
hn
lik
e s
to
be t
ak
e e
n
Un
derl
yin
g s
tru
ctu
re:
_p
I P
RE
S
[lik
e
] (+
V)
N
-#
[
i~
] (+
N)
(+
S)
(+ ,..
; )
NP
DE
~
AiT
i ole J
I
(+N
) IN
DE
F
(+P
RO
)
AU
X
I T I
PR
ES
,r-~
I
I M
AN
ftak
e]
N
~
(!+
V)
1 PR
6 ")
,
~Jo
hn
] (+
N)
+S
g)
,;
.. ...
.::.
\.
• D
eri
vati
on
:
Fir
st
Cy
cle
:
1. 2.
3.
4.
X [
[[Jo
hn
]N]N
P [
[PR
ES
]T]A
UX
be+
en
+ [
tak
e]V
[P
RE
P[I
ND
EF
[on
e]N
]NP
]MA
N]S
Y
X [
( [J
oh
n]
]NP
[(P
RE
S]T
be]
AU
X e
n [
tak
e]V
[P
RE
P[I
ND
EF
[on
e]N
]Np
lMA
N]S
Y
(+S
g)
N
X [
rJ
oh
n]
[[[+
Sg
]PR
ES
]T b
e]A
UX
en
[tak
e]
[PR
EP
[IN
DE
F[o
ne]N
]Np
lMA
N]S
Y
L<
+S
g)
N
(+ V
} V
X [
[Jo
hn
]N [
be+
[[
+S
g]P
RE
S]T
]AU
X r
tak
e +
en
] [P
RE
P[I
ND
EF
[on
e]N
]Np
lMA
N]S
Y
(+V
) V
T:P
AS
SIV
E
T:A
UX
FIL
L
T:A
G
T:A
F
Seco
nd
Cy
cle
:
1.
[[[J
oh
n]N
]NP
PR
ES
[lik
e]y
f r i
t ]
[+C
[[J
oh
n]N
]NP
[ b
e[+
Sg
]PR
ES
]AU
X[t
ake
en
]VP
RE
P I
ND
EF
[on
e]N
]S]N
p1
S
k+
c>
N
T·C
P 1
.
,
2.
[[ rJ
oh
n]
]NP
PR
ES
[!ik
e]V
fit
] [+
C [
be[
+S
g]P
RE
S]A
UX
[ta
ke e
n]V
PR
EP
IN
DE
F [
on
e]N
]S]S
L
<+Sg
) N
L
<+C
) N
T
:IE
3.
[ rJ
oh
n]
[+S
g]P
RE
S [
lik
e]V
"[
_ it
]
[+C
[b
e [[
+S
g]P
RE
S]T
]AU
X [
tak
e e
n]V
PR
EP
IN
DE
F [
on
e]N
]S]S
L
<+
Sg)
N
(+C
) N
T
:AG
4.
[[[J
oh
n]N
]NP
[[+
Sg
]PR
ES
]T
--
--
[lik
e]
I it
]
[+C
[b
e]A
UX
[ta
ke e
n]v
PR
EP
IN
DE
F [
on
e]N
lsls
(+
V)
V
L<+
C)
N
T:T
S
5.
[[ J
oh
n]N
[li
ke [
[+S
g]P
RE
S]T
] r
it
] [+
C [
be]
AU
X [
tak
e e
n]V
PR
EP
IN
DE
F f
one]
N]S
]S
(+V
) V
~
+_
S)
N
T:A
F
6.
[[Jo
hn
]N
rlik
e [
[+S
g]P
RE
S]T
] [+
C [
be]
AU
X [
tak
e e
n]V
[P
RE
P I
ND
EF
r
on
e ]
]MA
N]S
]S
(+V
) V
L
<+
PR
O)
N
T:P
D
7.
[[Jo
hn
]N [
lik
e [
[+S
g]P
RE
SJT
] [+
C [
be]
AU
X [
tak
e e
n]v
lsls
(+
V)
V
T:A
GD
EL
Po
st C
ycle
:
L
[(Jo
hn
]N [
lik
e[s
)T]V
[+
C [
be)
AU
X [
tak
e en
]v1
s1s
Z.
[[J
ohn
)N [
lik
e s)
V [
to [
be]
AU
X [
tilk
!.! en
)V]S
]S
T:N
UA
G
T:C
l
Sen
ten
ce T
yp
e N
o.
47
Actu
al
str
ing
:
Deri
ved
str
ing
:
Joh
n t
hin
ks
Bil
l to
be s
illy
Joh
n t
hin
k s
B
ill
to b
e s
illy
Un
derl
yin
g s
tru
ctu
re:
I rth"nk
] </
v>
-------------------,
N I
[ (:~) ]
(+
_S
)
(+C
)
NP
NP
I N
[
Bll
l]
(+N
) (+
Sg
)
AU
X
I T I
PR
ES
II
VP
b~
DJ
I r s
illy
)
[+A
DJ)
' ~
Deri
vati
on
:
Fir
st
Cy
cle
:
1.
X [
[ fB
ill J ]
NP
[[P
RE
S]T
be]
AU
X [
sill
y]A
DJ]
S Y
L
<+Sg
) N
z. X
[[ r Bi
ll J
]NP
[[[
+S
g]P
RE
S]T
be]
AU
X [
sill
y]A
DJ]
S y
L
<+Sg
) N
3 ·
X [
[(B
ill]
N]N
P [
be+
[[+
Sg
]PR
ES
]T]A
UX
[si
lly
]AD
J]S
y
Seco
nd
Cy
cle
:
/ [(
Joh
n]
PR
ES
[th
ink
]V [
[
it
] [+
C [
[Bil
l]N
]NP
[b
e [+
Sg
]PR
ES
]AU
X [
sill
y]A
DJ]
S]N
plS
N
{
+C
)
(+
_S
)
N
z. [(
Joh
n]
PR
ES
[th
ink
]V [
[
it
] ]N
P [
+C
[[B
ill]
N]N
P [
be
[+S
g]P
RE
S]A
UX
[si
lly
]AD
J]S
]S
N
(+
_S
)
(+C
) N
3.
4.
5.
6.
[[ r Joh
n]
]NP
PR
ES
[th
ink
]y (
[Bil
l]N
]NP
[+
C [
be
[+S
g)P
RE
S]A
UX
[si
lly
)AD
J]S
]S
L<+
Sg)
N
[ [J
oh
n]
[+S
g]P
RE
S [
thin
k)V
[[B
ill]
N]N
P [
+C
[b
e [f
+S
g]P
RE
S]T
]AU
X [
sill
y]A
DJ]
S]S
(+
Sg
) N
[ [J
~hn
]
[(+
Sg
]PR
ES
]T fth=
--] [[~
~e
-jA
UX
fs-
i-lly
-}~
aJ~
Sls-
-(+
Sg
) N
L<
+ V
) V
[[Ja
hr
.. r
rth
ink
[[+
Sg
]PR
ES
JTJ
[[B
ill]
N]N
P [
+C
[b
e]A
UX
[si
lly
]AD
J]S
~
(+V
) V
Po
st C
ycle
:
1.
[[Jo
hn
)N [
thin
k[s
]T]V
[B
ill]
N [
+C
[b
e)A
UX
[si
lly
]AD
J]S
]S
Z.
[[Jo
hn
]N [
thin
k s
]V [
Bil
l]N
[to
[b
e]A
UX
[si
lly
]AD
J]S
]S
T:A
UX
FIL
L
T:A
G
T:A
F
T:C
P 1
T:E
XT
RA
T:P
RO
RE
P
T:A
G
T:T
S
T:A
F
T:N
UA
G
T:C
Z
✓
Sen
ten
ce T
yp
e N
o.
48
Actu
al
stri
ng
:
Deri
ved
str
ing
:
Joh
n d
ecid
ed
fo
r B
ill
to r
ep
resen
t H
arr
y
Joh
n d
ecid
e e
d f
or
Bil
l to
rep
resen
t H
arr
y
Un
derl
yin
g s
tru
ctu
re:
N~
-p
------------------------#
I I-
N
T
V
PP
I I
I ~
(+N
) (+
V)
I ~
[Jo
hn
] P
AS
T
[decid
e]
PR
EP
N
P
(+S
g)
on
N
#
S---#
t (:L l
+_
S)
{+C
)
N I
~
Bil
l .,
(+N
)
(+Sg
)J
AU
X
I T I
PR
ES
I
rrep
resen
t]
L (+
V)
-...
~
'
•l:
,
Deri
vati
on
:
Fir
st
Cy
cle
:
1.
X [
[ [B
ill
] ]N
P [
[+S
g]P
RE
S]T
(+
Sw
N
rr
ep
rese
nt]
[H
arr
y ]N
]S Y
L
(+V
) V
2.
X [
[[B
ill)
N]N
P
frep
rese
nt
[[+
Sg
)PR
ES
JT]
[Harr
y ]N
]S Y
L
(+V
} V
Seco
nd
Cy
cle
:
T:A
G
T:A
F
1.
[[ f
Jo
hn
] ]N
P P
AS
T [
decid
e)V
[o
n]P
RE
P [
[ it
]
[+C
[[B
ill]
N]N
P[r
ep
rese
nt[
+S
g]P
RE
S]V
[Harr
y]N
]S]N
plS
L
<+
Sg)
N
(+C
) N
T
:CP
1
2.
[[Jo
hn
]
[+S
g]P
AS
T[d
ecid
e]V
[o
n]P
RE
P
[ it
J
[+C
[[B
ill]
N]N
P[r
ep
rese
nt[
+S
g]P
RE
S]V
[H
aay
]N]S
]S
( +S
g)
N
(+C
}
N
T:A
G
3.
[[Jo
hn
]N [
+S
g]P
AS
T[d
ecid
e]V
[o
n]P
RE
P fit J
[+C
[[B
ill]
N]N
P +
C
frep
rese
nt[
[+S
g]P
RE
S]T
] [H
arr
y]N
] 5] 5
~+
C)
N
L (+
V)
V
T:C
DU
P
4.
[[Jo
hn
)N [
[+S
g)P
AS
T]T
[d
ecid
e]
[on
)PR
EP
(+
V)
V
r it
] [+
C [
Bil
l]N
+C
[ r
ep
resen
t)v
[H
arr
y ]N
lsls
~+
C)
N
T:T
S
t it
~ [+
C [
Bil
l)N
+C
[re
pre
sen
t)V
[H
arr
y]N
] 5] 5
+
s)
(+C
) N
T
:AF
5.
[[Jo
hn
) rd
ecid
e [[
+S
g]P
AS
T]T
J
[on
]PR
EP
N
(+
V)
V
6.
[[Jo
hn
]N [
decid
e [
+S
g)P
AS
T]V
~
it
] [+
C [
Bil
l]N
+C
[ r
ep
rese
nt]
V [
Har
ry]N
]S]S
( +
S
)
(+C
) N
7.
[[Jo
hn
)N
[:d
ecid
e [+
Sg
)PA
ST
] [+
C [
Bil
l]N
+C
[re
pre
sen
t)V
[H
arr
y)
] ]
(+V
} N
SS
V
P
oa
t C
ycle
:
0
t.
([Jo
hn
)N [
decid
e [
ed)T
]V [
+C
[[B
ill]
N]N
P +
C [
rep
rese
nt)
V [
Har
ry]N
]S]S
z. ([
Joh
n]N
[ d
ecid
e e
d)V
[ f
or
[[B
ill]
N]N
P +
C [
rep
rese
nt]
V [
Harr
y)N
] 5) 5
3.
([Jo
hn
]N [
decid
e e
d]V
[fo
r [B
ill]
N t
o [
rep
rese
nt)
V [
Harr
y)N
J 5j 5
T:P
RE
PD
EL
T:P
D
T:P
AS
T
T:C
t
T:C
Z
Sen
ten
ce T
yp
e N
o.
49
Actu
al
stri
ng
: Jo
hn
decid
ed
on
Bill t
o r
ep
resen
t H
arr
y
Deri
ved
str
ing
: Jo
hn
decid
e e
d o
n Bi
ll to
rep
resen
t H
arr
y
Un
derl
yin
g s
tru
ctu
re:
N~
P
f
I I~
N
T
V
p
p
I 1
1-
[Jo
hn
] P
AS
T
[decid
e]
PR
EP
N
P
(+N
) (+
V)
I (+
Sg
) o
n
N t (L]
(+
_S
)
(+C
)
NP
I N
[BtllJ
(+N
) (+
Sg
)
AU
X
I T I
PR
ES
v~
I
rrep
resen
t]
L (+
V)
I N I
rHarr
yl
L (+
N)j
-D
eri
vati
on
:
Fir
st
Cy
cle
:
1.
X [
( f B
ill
] ]N
P [
(+S
g]P
RE
S]T
fr
ep
resen
t]
[ H
a.r ry
]N]S
Y
L<
+S
g)
N
L (+
V)
V
T:A
G
Z.
X [[
(Bil
l]N
]NP
[r
ep
resen
t [[
+S
g]P
RE
S]T
J [H
arr
y ]N
]S Y
(+
V)
V
T:A
F
Seco
nd
Cy
cle
:
1. z. 3.
4. 5.
6.
[(Jo
hn
]N P
AS
T [
decid
e]y
[o
n]P
RE
P
[ it
]
[+C
[[B
ill]
N]N
P [
rep
rese
nt[
+S
g]P
RE
S]V
[H
arr
y]N
]S]S
(+
C)
T:C
P 1
(+
_S
)
N
[[Jo
hn
]N P
AS
T [
decid
e)V
[o
n)P
RE
P [
f i
t l ]N
P [
+C
[[B
ill]
N]N
P·[
rep
rese
nt[
+S
g]P
RE
S]V
[H
arr
y]N
]S]S
(+
_S
)
T:.E
XT
RA
(+
C)
J N
[( rJ
oh
n]
]NP
PA
ST
[d
ecid
e]V
[o
n]P
RE
P [
[Bil
l]N
]NP
[+
C [
rep
rese
nt[
+S
g]P
RE
S]V
[H
arr
y]N
]S]S
l<+
Sg
) N
T
:PR
OR
EP
( fJ
oh
n]
[+S
g]P
AS
T (
decid
e]V
(o
n]P
RE
P [
(Bil
l]N
]NP
[+
C [
rep
rese
nt[
(+S
g]P
RE
S]T
]V [
Harr
y]N
JS]S
l<
+S
g)
N
T:A
G
[[Jo
hn
]N [
[+S
gjP
AS
T]T
fd
ecid
e]
[on
]PR
EP
[(B
ill]
N]N
P [
+C
[re
pre
sen
t]V
[H
arr
y ]N
]S]S
L<
+v>
v T
:TS
[(Jo
hn
]N
fdec
ide
[[+
Sg
]PA
ST
]T]
[on
]PR
EP
[(B
ill]
N]N
P [
+C
[re
pre
sen
t[+
Sg
]PR
ES
1v [
Harr
y]N
] S
] 5 L (
+V
) V
T
:AF
Po
st C
ycle
:
1.
[[Jo
hn
]N [
decid
e [
ed]T
JV [
on
]PR
EP
[B
ill]
N [
+C
[re
pre
sen
t]V
[H
arr
y]N
]SJS
z. [(
Joh
n]N
(d
ecid
e e
d]V
(o
n]P
RE
P [
Bil
l]N
(to
(re
pre
sen
t]V
(H
arr
y]N
J 5] 5
T:P
AS
T
T:C
Z
'
Sen
ten
ce T
yp
e N
o.
50
Actu
al
stri
ng
: Jo
hn
ap
pears
to
hav
e f
all
en
...
Deri
ved
str
ing
: Jo
hn
ap
pear
s to
hav
e f
all
en
Un
derl
yin
g s
tru
ctu
re:
#--
----
----
----
----
--~
----
----
----
-#
AU
X
VP
I I
[ (:L]
~""
#
T I
(+
S)
N
AU
X
"
PR
ES
<+
c>
I I
VP
N
T
I
[JoLn
] p
I I
(+N
) A
ST
~ f
all
]
(+S
g)
(+V
)
V I
[ap
pear]
(+
V)
Deri
vati
on
:
Fir
st
Cy
cle
:
1.
X [
[Jo
hn
]
[[+
Sg
]PA
ST
]T
riall
]
ls y
{+
Sg}
N
L
<+V
} V
T:A
G
2.
X [
[[Jo
hn
)N]N
P r fa
ll
([+
Sg
]PA
ST
]T]
]S Y
L<+
V)
V
T:A
F
-S
eco
nd
Cy
cle
:
1.
[ [
it
] [+
C [
[Jo
hn
]N]N
P [
fall
[+
Sg
]PA
ST
]V]S
PR
ES
[ap
pear]
V]S
(+
C)
(+
_S
)
N
2.
[[
( it
]
]NP
PR
ES
[ap
pear]
v [
+C
[[J
oh
n]N
]NP
[fa
ll [
+S
g]P
AS
T1
vls
ls
(+
_S
}
(+C
}
N
3.
4.
5. 6.
7.
[[
fJo
hn
J ]N
P P
RE
S [
ap
pear l
v r
+c [
fall
[+
Sg
]PA
ST
lvls
1s
L<
+S
g)
N
[ [J
oh
n]
[+S
g]P
RE
S (
ap
pe
ar]
v [
+c
ffau
[+
Sg
]PA
ST
] ls
ls
(+S
g}
N
l<+
V)
V
([Jo
hn
]N [
+S
g]P
RE
S [
ap
pear]
V [
+C
hav
e e
n rf
all
[+
Sg
]PA
ST
] ] 5
]S
. ~
+V
) V
([Jo
hn
]N [
[+S
g]P
RE
S]T
[ap
pear]
[+
C h
av
e e
n r fa
ll]
lsls
(+
V)
V
~+
V)
V
[[Jo
hn
JN [
ap
pear
([+
Sg
]PR
ES
]T]
[+C
hav
e rall
+ e
n]
lsls
(+
V)
V
(+V
) V
Po
st
Cy
cle
:
1.
[fJo
hn
]N [
ap
pear[
s]T
]V [
+C
hav
e r
fall
en
] ]S
]S
(+V
) V
2.
[[Jo
hn
)N [
ap
pear
s]V
(to
hav
e [
fall
en
)vls
ls
T:C
P 1
T:E
XT
RA
T:P
RO
RE
P
T:A
G
T:C
TE
NS
E
T:T
S
T:A
F
T:N
UA
G
T:C
2
·" q t
Sen
ten
ce T
yp
e N
o.
51
Actu
al
stri
ng
:
Deri
ved
str
ing
:
it e
mb
arr
asses B
ill
to t
rip
it e
mb
arr
ass
s B
ill
to t
rip
Un
derl
yin
g s
tru
ctu
re:
N~~
N
# S
# J
r ~
p
I ~
I
I I
it
] P
RE
S
rem
barr
ass]
N
(+N
) L
(+V
) I
(+
_S
)
NP
A
UX
V
P
[B
ill]
(+
C)
I I
I (+
I"+)
(+
Sg
) N
T
V
(+
Sg
)
I I
I
[
Bil
l ]
PR
ES
ft
rip
]
(+N
) L
(+V
) (+
Sg
)
Deri
vati
on
:
Fir
st
Cy
cle
:
1.
X [
[ [
Bil
l ]
]NP
[[+
Sg
]PR
ES
]T rtr
ip]
] 5
Y
(+S
g)
N
L<+
V)
V
T:A
G
Z.
X [
[(B
ill]
N]N
P ft
rip
[[+
Sg
]PR
ES
]T]
]S y
.
L<
+V
) V
T:A
F
'
Seco
nd
Cy
cle
:
1.
[ r it
J
[+C
[[B
ill]
N]N
P [
trip
[+S
g]P
RE
S]V
]S P
RE
S [
em
barr
ass]V
[[B
ill]
N]N
p1
S
~+
C)
N
Z.
[ f
it
] [+
C [
trip
[+
Sg
]PR
ES
]V]S
PR
ES
[em
barr
ass]V
[[B
ill]
N]N
p1
S
I<+
S)
l (+
C)
N
3.
[[ f i
t j ~p
PR
ES
[em
barr
ass]y
[B
ill]
N [
+C
[tr
ip [
+S
g]P
RE
S Jv
Js]s
(+
_S
)
(+C
} (+
Sg
) N
[[ r it
] ]N
P [
+S
g]P
RE
S [
em
barr
ass]V
[B
ill]
N [
+C
ftr
ip[[
+S
g]P
RE
S]T
] ]S
]S
~+
Sg
) N
l<
+V
) V
4.
5.
[[it
]N [
[+S
g]P
RE
S]T
[em
barr
ass]
[Bil
l]N
[+
C [
trip
]v1
s1s
(+V
) V
6.
[[it
]N
rem
barr
ass [
[+S
g]P
RE
S]T
] [B
ill]
N [
+C
[tr
ip]v
lsls
L
(+V
) V
Po
st
Cy
cle
:
1.
[[it
]N [
em
barr
au
(s]T
lv [
Bil
l]N
[+
C [
trip
]v1
sls
Z.
[[it
]N [
em
barr
ass s
]V [
Bil
l]N
[to
[tr
ip]V
]S]S
T:C
P 1
T:I
E
T:E
XT
RA
T:A
G
T:T
S
T:A
F
T:N
UA
G
T:C
Z
1
Sen
ten
ce T
yp
e N
o.
5 2
Actu
al
stri
ng
:
Deri
ved
str
ing
:
Joh
n m
ay
resem
ble
Bil
l
Joh
n m
ay
resem
ble
Bil
l
Un
d.e
rly
ing
str
uctu
re:
-r
, N
P
--------
----N
#
S
# ~
M
[ (:L]
(+
S)
(+C
)
I I
PR
ES
[
may
] (+
M)
be
NP
A
UX
~
I I
N
T
V
NP
(i,oL]
I I
I P
RE
S
[resem
ble
] N
(+
N)
(+V
) I
(+S
g)
[B
ill]
(+
N)
Deri
vati
on
:
Fir
st
Cy
cle
:
1.
X [
[ r Jo
hn
] ]N
P [
(+S
g]P
RE
S]T
l<
+sg)
N
ri
,ese
mb
le]
[Bil
l]N
]S Y
L <+
v>
v
2.
X [
[[Jo
hn
)N]N
P
f'i-
esem
ble
[(+
Sg
]PR
ES
]TJ
[Bil
l]N
]S Y
L
(+ V
) V
...
T:A
G
T:A
F
Seco
nd
Cy
cle
:
1.
[ ~
it
] [+
C [
[Jo
hn
]N]N
P [
rese
mb
le [
+S
g]P
RE
S]V
[B
ill]
N]S
PR
ES
[m
ay]M
be]
S
(+C
} (+
_S
}
N
T:C
P 1
z.
[( [
it
]
]NP
[P
RE
S [
may
]M]A
UX
be
[+C
[[J
oh
n]N
]NP
[re
sem
ble
[+
Sg
)PR
ES
]V [
Bil
l]N
]S]S
(+
_S
)
T:E
XT
RA
(+
C)
N
3.
a 4
.
5. 6.
7.
8.
[[ rJ
oh
n]
]NP
PR
ES
[m
ay]M
be
[+c [
rese
mb
le [
+S
g]P
RE
slv
[B
ill]
Nls
ls
L<+
Sg)
N
[( f
Jo
hn
] ]N
P [
+S
g]P
RE
S [
may
]M b
e [
+C
rr
ese
mb
le [
[+S
g]P
RE
S]T
] [B
ill]
N]S
]S
~+
Sg
}
N
L (+
V}
V
[(Jo
hn
)N [
[+S
g]P
RE
S]T
r m
ay
] b
e [
+C
[re
sem
ble
JV [
Bil
l]N
lsls
~
+M
) M
[(Jo
hn
]N f m
ay
+ [
(+S
g]P
RE
S]T
] b
e [+
C [
rese
mb
le]V
[B
ill]
N]S
]S
L<
+M
) M
[[Jo
hn
]N f
may
[[
+Sg
]PR
ES]
T]
[+C
[re
sem
ble
)V [
Bil
l]N
lsls
L
<+
M)
M
[[Jo
hn
]N [
may
[(+
Sg]P
RE
S]T
] [(
rese
mb
le]V
[B
ill]
N]S
]S
(+M
} M
Po
st C
ycle
:
1.
[[Jo
hn
]N [
may
)M [
[rese
mb
le)V
[B
ill]
Nls
ls
T:P
RO
RE
P
T:A
G
T:T
S
T:A
F
T:B
ED
EL
T:M
CD
EL
T:M
TD
EL
I
Sen
ten
ce T
yp
e N
o.
5 3
Actu
al
stri
ng
:
Deri
ved
str
ing
:
Joh
n d
isli
kes
Bil
l's a
nn
oy
ing
Mary
Joh
n d
isli
ke s
B
ill
's a
nn
oy
in
g M
ary
Un
derl
yin
g s
tru
ctu
re:
f -
, N
~A
UX
I I
N
T
I I
[
Jo
hn
] P
RE
S
(+N
) (+
Sg
)
I [d
isli
ke]
(+V
) N
f (:l) ]
<+ S
) (-
C)
p I N I rill J
(+
N)
(+S
g)
AU
X
~p
I T I
I I
PR
ES
en
no
y]
N
(+V
) I
[Mary
] (+
N}
' -
.,
Deri
vati
on
:
Fir
st C
ycle
:
t.
X (
[ f B
ill J
]NP
([+
Sg]
PR
ES
]T r
an
no
y]
[Mar
y]N
]S Y
~
+S
g)
N
L<+ V
) V
T:A
G
Z.
X [
[[B
ill]
N]N
P
fan
no
y
[[+
Sg
]PR
ES
]T]
[Mar
y]N
]S Y
L
(+ V
) V
T:A
F
Seco
nd
Cy
cle
:
1.
[[ [
Jo
hn
] ]N
P P
RE
S [
dis
lik
e]V
f
it J
[-C
([B
ill]
N]N
P [
ann
oy
[+S
g]P
RE
S]V
[M
ary
]N]S
]S
(+S
g)
N
L<
-C)
N
T:C
P 1
Z.
[ r Jo
hn
] [+
Sg
]PR
ES
[d
isli
ke JV
[
it J
[-C
[[B
ill]
N]N
P [
ann
oy
[+S
g]P
RE
S]V
[M
ary
]N]S
]S
~+
Sg
) N
(-
C)
N
T:A
G
3.
[[Jo
hn
]N [
+S
g]P
RE
S [
dis
llk
e]V
r it
J
[-C
([B
ill]
N]N
P
-C r
ann
0y
[[+
Sg
]PR
ES
]T]
[Mar
y]N
]S]S
L
<-C
)N
(+V
) V
T
:CD
UP
4.
[(Jo
hn
]N [
[+S
g]P
RE
S]T
rd
isli
ke]
fit
J
[-C
[(B
ill]
N]N
P -
C r
an
no
y]
[Mar
y]N
]S]S
L
<+
V)
V
l<-C
) N
L
(+V)
V
T:T
S
5.
[[Jo
hn
]N fd
isli
ke
[[+
Sg
]PR
ES
]T]
f it
]
[[[
Bil
l]N
]NP
-C
fa
nn
oy
+ -C
J [M
ary
]N]S
]S
L (+
V)
V
L<
+_
S)
N
L<
+V
) V
T
:AF
[[Jo
hn
]N r
dis
lik
e [
[+S
g]P
RE
SJT
] [[
[Bil
l]N
]NP
-C
fa
nn
oy
-C
J
[Mar
y)N
]S]S
T
:PD
+
V)
V
L<
+V
) V
6.
Po
st C
ycle
·
1.
[(Jo
hn
)N [
dis
lik
e[s]
T]V
[[[
Bil
l]N
]NP
-C
[an
no
y -
C]V
[M
ary
]N]S
]S
z. [[
Joh
n]N
r dis
lik
e s
]v [
[[B
ill]
N]N
P '
s
[an
no
y -
C]v
[M
ary
]Nls
ls
3.
[[Jo
hn
]N [
dis
lik
e s
]V [
[[B
ill]
N]N
P
's
[an
no
y i
ng
]V [
Mar
y]N
J 5] 5
T:N
UA
G
T:C
3
T:C
4
-
Sen
ten
ce T
yp
e N
o.
54
Actu
al
str
ing
:
Deri
ved
str
ing
:
Joh
n. d
isli
kes
Bil
l an
no
yin
g M
ary
Joh
n d
isli
ke
• B
ill
an
no
y i
ng
Ma
ry
Un
derl
yin
g s
tru
ctu
re:
'f
' N~
:X
-I
I N
T
V
[
Jo
L]
P~
ES
(+
N)
(+S
g)
I
[dis
lik
e]
(+V
}
[ (:l1]
(+
S)
(-C
)
,
NP
I N
v_
~p
[
Bil
l]
(+N
) (+
Sg
)
I J
[an
no
y]
I (+
V)
rMary
]
{+
N)
---I
... -,
Deri
vati
on
:
Fir
st
Cy
cle
:
1.
X [
[ rB
illJ
]N
P [
[+S
g]P
RE
S]T
ra
nn
oy
] [M
ary
]N]S
Y
~+
Sg
) N
L
<+
V)
V
2.
X [
[[B
ill]
N]N
P
fan
no
y [
[+S
g]P
RE
S]T
] [M
ary
]N]S
Y
L<+v
> v
Seco
nd
Cy
cle
:
1.
[[ [
Jo
hn
1 ]N
P P
RE
S [
dis
lik
e]V
(+
Sg
)JN
i it
J
[-C
[[B
ill]
N]N
P[a
nn
oy
[+S
g]P
RE
S]V
[M
ary
]Nls
ls
<-c>
N
T:A
G
T:A
F
T~C
P 1
2.
[ rJ
oh
n]
[+S
g]P
RE
S [
dis
lik
e JV
r it
J
[-C
[[B
ill]
N]N
P [
ann
oy
[+S
g)P
RE
S]V
[M
ary
]N]S
]S.
T:A
G
~+
Sg
) N
L
<-C
) N
0
3.
[[Jo
hn
]N [
+S
g]P
RE
S [
dis
lik
e]V
fit
J
f-C
[[B
ill]
N]N
P -
C [
an
no
y [
[+S
g]P
RE
S]T
] [M
ary
]N]S
]S
~-C
) N
{+
V)
V
T:C
DU
P
4.
[[Jo
hn
]N [
+S
g]P
RE
S [
dis
lik
e]V
[
it
] [-
C [
[Bil
l]N
]NP
-C
[an
no
y]V
fM
ary
]N]S
]S
T:T
S
{-C
)
(+
_S
)
N
5.
[[Jo
hn
]N [
[+S
g]P
RE
S]T
rd
isli
ke]
r it
]
[[[B
ill]
N]N
P -
C
ran
no
y l
[Mary
]Nls
ls
L {+
V)
V
L<
+_
S)
N
{+
V)
JV
6.
[[Jo
hn
]N [
dis
lik
e
[[+
Sg
]PR
ES
]T]
[ it
]
[[[B
ill]
N]N
P
ran
no
y +
-C
J [M
ary
]N]S
)S
(+V
) V
(+
_S
)
N
L (+
V)
V
7.
[[Jo
hn
]N [
dis
lik
e [
[+S
g]P
RE
S]T
] [[
[Bil
l]N
]NP
[an
no
y -
CJ
[Mary
]N]S
]S
(+V
) V
(+
V)
V
Po
st C
ycle
:
1.
[~!o
hn
]N [
dis
lik
e(s
]T]V
[[B
ill]
N (
ann
oy
-C
]V (
Mar
y]N
J 5] 5
2.
[[Jo
hn
]N [
dis
lik
e s
)V [
[ B
ill]
N [
ann
oy
in
g)V
[M
ary
]NJ 5
] 5
T:C
D
T:A
F
T:P
D
T:N
UA
G
T:C
4
Sen
ten
ce T
yp
e N
o.
55
Actu
al
stri
ng
:
Deri
ved
str
ing
:
Joh
n d
isli
kes
an
no
yin
g M
ary
Joh
n d
isli
ke s
an
no
y i
ng
Mary
Un
der l
yin
g s
tru
ctu
re:
--===
====
=r==
====
====
=~----
----1
AU
X
I N
T
V
I
[
Jo
hn
] (+
N)
(+S
g)
I P
RE
S
I [d
isli
ke]
N
#
(+V
) [
(:~
)
]
(+
S)
(-C
)
NP
A
UX
~
I I
N
T
V
NP
I I
I I
r,ohn]
PR
ES
[a
nn
oy
] N
(+
N)
(+V
) I
L<
+S
g)
[Mary
] (+
N)
Deri
vati
on
:
Fir
st
Cy
cle
:
1.
X [[
[Jo
hn
] ]N
P [
[+S
g]P
RE
S]T
[an
no
y]
[Mar
y]N
]S Y
(+
Sg
) N
(+
V)
V
z. X
[[[
Joh
n]N
]NP
[an
no
y [
[+S
g]P
RE
S]T
] [M
ary
]N]S
Y
(+V
) V
Seco
nd
Cy
cle
:
1. z. 3.
4.
5.
6.
[[[J
oh
n]N
]NF
PR
ES
[d
isli
ke]V
i it
] [-
C [
[Jo
hn
]N]N
P [
ann
oy
[+S
g]P
RE
S]V
[M
ary
]N]S
]S
{-C
) N
[[ [
Jo
hn
] ]N
P P
RE
S [
dis
lik
e]V
rit
] [-
C [
an
no
y[+
Sg
]PR
ES
]V [
Mar
y]N
]S]S
<
+sg
) N
L<
-c> N
[[ [
Jo
hn
] ]N
P [
+S
g]P
RE
S [
dis
lik
e]V
r it
]
[-C
[an
no
y [
[+S
g]P
RE
S]T
] [M
ary
]N] 5
] 5 (+
Sg
) N
L
(-C
) N
(+
V)
V
[[J o
hn
]N l
[+S
g]P
RE
S]T
rdi
slike]
r. it
] [ -
C
ran
no
y 1
[Mar
y ]N
]S]S
L<
+v>
v L<
-c> N
L<
+v>J
v [[
Joh
n]N
fd
isli
ke [
[+S
g]P
RE
S]T
l f
it
] r [
an
no
y +
-C
J [M
ary
]N]s
1s
L <+v
> :.J
v ~+
_s>
N
<+v>
v
[[Jo
hn
]N [
dis
lik
e [
[+S
g]P
RE
S]T
] [
fnn
oy
-c]
[Mary
]N]s
ls
(+V
) V
(+
V)
V
Po
st C
ycle
:
1.
[[Jo
hn
]N [
dis
lik
e[s
]T]V
[[a
nn
oy
-C
]V [
Mar
y]N
] 5] 5
z. [[
Joh
n]N
[d
isli
ke s
]V [
[an
no
y i
ng
]V [
Mary
]N] 5
] 5
T:A
G
T:A
F
T:C
P 1
T:I
E
T:A
G
T:T
S
T:A
F
T:P
D
T:N
UA
G
T:C
4
4 S
en
ten
ce T
yp
e N
o.
56
Actu
al
stri
ng
:
Deri
ved
str
ing
:
Joh
n d
ecid
ed
on
go
ing
Joh
n d
ecid
e e
d o
n g
o i
ng
Un
derl
yin
g s
tru
ctu
re:
..... ------s----------------------------#
NP
I N
AU
X
I T
r---p
p I
[
Jo
hn
] (+
N)
(+S
fl
I P
AS
T
,_
[
decid
e]
PR
EP
~
(+V
) I
/"'
-------
. o
n
N
# S
#
(. (:L ]
(+
S
) {-
C)
I N
P
AU
X
VP
I I
I N
T
V
I I
I
[
Jo
hn
] (+
N)
(+S
g)
PR
ES
[<!
~)]
I-
.. -
Deri
vati
on
:
Fir
at
Cy
cle
:
1.
X ([
[J
oh
n]
]NP
([+
Sg
]PR
ES
]T [
g
o 1
JS
y
(+S
g)
N
(+ V
)j V
2.
X [
[[Jo
hn
]N]N
P r go
[[
+5
g]P
RE
SJT
1
1s y
~
+V
) JV
Seco
nd
Cy
cle
:
1.
2.
3.
4.
5. 6.
[[[J
oh
n]N
]NP
PA
ST
[d
ecid
e]V
(o
n]P
RE
P
[ it
J [ -C
[[
Joh
n]N
]NP
[g
o [
+S
g]P
RE
S]V
]S]S
(-
C)
N
([ f J
oh
n]
)NP
PA
ST
[d
ecid
e]V
[o
n)P
RE
P
[ it
]
[-G
(g
o [
+S
g]P
RE
S]V
]S]S
L
<+Sg
) N
(-
C)
N
[ rJ
oh
n]
[+S
g]P
AS
T [
decid
e)y
[o
n]P
RE
P
[it
1
[-C
r go
([
+S
g]P
RE
S]T
] ]S
]S
l{+
5g
) N
~
-C)J
N
~+
V)
V
([Jo
hn
]N [
(+5
g]P
AS
T]T
rd
ecid
e]
[on
]PR
EP
[
it 1 [
-C f
go
]
]S]S
L
<+
V)
V
(-C
) N
~
+V
) V
[[Jo
hn
]N
(dec
ide
[[+
Sg
]PA
ST
]T]
[on
]PR
EP
[
it
] [
[ g
o
+ -
C]
] 5] 5
L (
+V
) V
(+
_S
)
(+V
) V
<
-C)
N
([Jo
hn
]N
(dec
ide
f[+
Sg
]PA
ST
]T]
[on
]PR
EP
[ r go
-CJ
] 5) 5
L
<+v>
v
l(+v>
v
Po
at
Cy
cle
:
t.
[[!o
hn
]N [
decid
e [
ed)T
]V [
on
)PR
EP
[(
go
-C
]y] 5
1 5
2.
[(Jo
hn
]N [
decid
e e
d)V
[o
n)P
RE
P [
[ g
o i
ng
)y1
5] 5
T:A
G
T:A
F
T:C
P 1
T:I
E
T:A
G
T:T
S
T:A
F
T:P
D
T:P
AS
T
T:C
4
Sen
ten
ce T
yp
e N
o.
5 7
Actu
al
stri
ng
:
Deri
ved
str
ing
:
Joh
n t
hin
ks
that
Bil
l w
ill
go
Joh
n t
hin
k s
th
at
Bil
l w
ill
go
Un
derl
yin
g s
tru
ctu
re:
:====
=r===
== ~
* I
I N
T
V
N
P
I I
I --
[
Jo
hn
] P
RE
S
[th
ink
] (+
N)
(+V
) (+
Sg
)
N
f (A)]
+
S)
(+C
)
# s
*
NP
A
UX
V
P
I T
~.{
I
N
V
[ siu]
I I
I P
RE
S
[w
ill]
G!
~)]
(+N
) (+
M)
(+S
g)
Deri
vati
on
:
Fir
st
Cy
cle
:
1.
X [
[ f B
ill]
]N
P (
[+S
g]P
RE
S]T
f w
ill]
[g
o]V
]S Y
~
+S
g}
N
~
+M
) M
2..
X [
[(B
ill]
N]N
P f
wil
l +
[[+
Sg
]PR
ES
]T]
[go
]V]S
y
L<+
M}
M
Seco
nd
Cy
cle
:
1.
[[[Jo
hn
]
]NP
PR
ES
[th
ink
]V
(+S
g}
N
r it
] [t
hat
([B
ill]
N]N
P [
wil
l[+
Sg
]PR
ES
]M [
go
]V]S
]S
~+
C}
N
2..
[ rJ
oh
n]
[[+
Sg
]PR
ES
]T ft
hin
k]
[it]
N [
that
([B
ill]
N]N
P [
wil
l[+
Sg
]PR
ES
]M [
go
]V]S
]S
IJ+
Sg}
N
L (+
V}
V
3.
[(Jo
hn
]N
rth
ink
[[+
Sg
]PR
ES
]T]
[ it
]
[th
at[
[Bil
l]N
]NP
[w
ill[
+S
g]P
RE
S]M
[g
o]y
] 5] 5
IJ+
V}
V
(+
_S
}
N
4.
(fJo
hn
]N f th
ink
[[+
Sg
]PR
ES
]T]
[th
at
[(B
ill]
N]N
P [
wil
l [+
Sg
]PR
ES
] [g
o]V
]S]S
L
<+
V}
V
(+M
} M
Po
st C
ycle
:
1.
[(Jo
hn
]N {
thin
k [
+S
g]P
RE
S]
[th
at
[Bil
l]N
[w
ill]
M [
go
]V]S
]S
L<
+V
) V
2..
[[Jo
hn
]N [
th
ink
[s]
T ly
[th
at
[Bil
l]N
[w
ill]
M
[go
]v1
s1s
T:A
G
T:A
F
T:C
P 3
T:A
G
T:A
F
T:P
D
T:M
TD
EL
T:N
UA
G
Sen
ten
ce T
yp
e N
o.
5@
Actu
al
stri
ng
: Jo
hn
th
ink
s B
ill
smo
kes
Deri
ved
str
ing
: Jo
hn
th
ink
s
Bil
l sm
ok
e s
Un
derl
yin
g s
tru
ctu
re:
I N I
N~
X
---~
----
#
I
I T I
[
Jo
hn
] (+
N)
(+S
g)
PR
ES
[th
ink
] N
#
#
(+V
) [
(:l, ]
(+
_S
)
(+C
)
NP
I N I
[Bill ]
(+
N)
(+S
g)
AU
X
i T I I
PR
ES
VP
I V I
[8m
ok
e]
.{+
V)
l
Deri
vati
on
:
Fir
st C
ycl
e:
1.
X [
[ r Bi
ll 1
]N
P [
[+S
g]P
RE
S]T
[sm
ok
el
1s
y L<
+sg>
J N
<+
V>
Jv
Z.
X [
[[B
ill]
N]N
P f
smo
ke
[[+
Sg
]PR
ES
]T]
]S Y
L
<+
V)
. V
Seco
nd
Cy
cle
:
1.
[[ [
Jo
hn
l]N
P P
RE
S [
thin
k]v
[it
]N [
that
[[B
ill]
N]N
P [
smo
ke [
+S
g]P
RE
S1
v1
s1s
(+S
g)
z. [ r
John
] [[
+S
g]P
RE
S]T
r
-hin
k]
[it]
N [
that
[[B
ill]
N]N
P [
smo
ke [
+S
g]P
RE
slv
lsls
L<
+Sg)
. N
( +
V)
V
3.
[[Jo
hn
]N r
thin
k [
[+S
g]P
RE
S]T
7
~ it
J
[th
at([
Bil
l]N
]NP
[sm
ok
e [
+S
g]P
RE
slv
lsls
(+
V)
J (+
S
) N
V
-
4.
[[Jo
hn
]N r
t~in
k [
[+S
g]P
RE
S]T
] [t
hat
[[B
ill]
N]N
P [
smo
ke [
+S
g]P
RE
slv
lsls
(+
V)
V
5.
[[Jo
hn
]N f
ihin
k [
+S
g]P
RE
S 1
[[B
ill]
N
fsm
ok
e [+
Sg
]PR
ES
l ls
ls
IJ+
V)
'.JV
L
<+
V)
Jy
Po
st C
ycl
e:
1.
[[Jo
hn
]N [
thin
k[s
]T]V
[[B
ill]
N [
smo
ke[s
]Tlv
lsls
T:A
G
T:A
F
T:C
P 3
T:A
G
T:A
i
T:P
D
T:T
HA
T
T:N
UA
G
Sen
ten
ce T
yp
e N
o.
59
Actu
al
stri
ng
:
Deri
ved
str
ing
:
that
Bil
l sm
ok
es
was
men
tio
ned
by
Jo
hn
that
Bil
l sm
ok
e s
wa
s m
en
tio
n e
n b
y J
oh
n
Un
derl
yin
g s
tru
ctu
re:
t,-
------;;::~
::.:
:.-
:._
--------------------------f
~
I I
N
[
Jo
Ln
] (+
N)
(+S
g)
T I
PA
ST
I
----~
::--, --#
P
R~
[m
en
tio
n]
(+V
) [
it ]
(+N
) (+
S
} (+
Sg
).
NP
A
UX
V
P
I I
I N
T
V
~Bin]
I I
PR
ES
[s
mo
ke]
(+N
}
.(,+
V)
( +
Sg
}.
1'
Deri
vati
on
:
Fir
st C
ycle
:
1.
X [
( rB
ill
] ]N
P (
[+S
g]P
RE
S]T
(;
.mo
ke]
] 5 Y
~
+S
g)
N
L<
+V
) V
T:A
G
Z.
X [
[(B
ill]
N]N
P
rsm
ok
e ([
+S
g]P
RE
SJT
] ] 5
Y
L (+
V)
V
T:A
F
Seco
nd
Cy
cle
:
1. z. 3.
4.
5. 6.
[[(J
oh
n]N
]NP
([P
AS
T]'
tAU
X [
men
tio
n]V
[(i
t]N
[th
at[
(Bil
l]N
]NP
[ s
mo
ke[
+S
g]P
RE
S]V
]S]N
P P
RE
P P
] 5 T
:CP
3
[([i
t]N
[th
at[B
ill]
N[1
1m
ok
e[+
Sg
]PR
ES
]V]S
]Np
l[P
AS
T]T
]AU
X b
e+
en
+ [
men
tio
n JV
[ PR
EP
[[Jo
hn
]N]N
plM
AN
]S
T:P
AS
SIV
E
[( r it
] [t
hat
[Bil
l]N
[sm
ok
e[+
Sg
]PR
ES
]V]S
]NP
[[P
AS
T]T
be]
AU
X e
n [
men
tio
n]V
[FR
EP
[(Jo
hn
]N]N
P]M
AN
]S
~+
Sg
) N
T
:AU
XF
ILL
[( r i
t ]
[th
at[B
ill)
N[s
mo
ke[
+S
g]P
RE
S]
V)S
]NP
([[+
Sg
)PA
ST
]T b
e)A
UX
en
fm
en
tio
n]
[PR
EP
([Jo
hn
]N]N
plM
AN
]S
L<+S
g)
N
L (+
V)
V
T:A
G
[[ i it
]
[th
at[B
ill)
N[s
mo
ke(
+S
g]P
RE
S]V
)S]N
P[b
e+([
+S
g]P
AS
T]T
]AU
Xrm
enti
on
+en
] [P
RE
P([
Joh
n)N
]Np
lMA
N]S
(+
Sg
) L
<+
V)
V
T·A
F
(+
_S
)
N
•
[([t
hat
(Bil
l]N
rsm
ok
e[+
Sg
]PR
ES
, ] 5
JNP
(b
e [[
+S
g]P
AS
T]T
]AU
X i
;nen
tio
n e
ri'J
[PR
EP
[(Jo
hn
]N]N
plM
AN
]S
. L
<+
V)
~v
L
<+
v>
Jv
T
:PD
Po
3t
Cy
cle
:
1.
([[t
hat
(B
ill]
N [
smo
ke [
s]T
]V]S
]NP
[b
e [+
Sg
]PA
ST
]AU
X (
men
tio
n e
n]V
[P
RE
P [
Joh
n)N
]MA
N]S
Z.
([[t
hat
[B
ill]
N [
smo
ke s
]v]J
NP
[w
as]A
UX
[m
en
tio
n e
n]V
[P
RE
P [
[Jo
hn
]N]N
P]M
AN
]S
3.
[[[t
hat
[B
ill]
N [
sm
ok
e s
)V]S
]NP
[w
as]A
UX
[m
en
tio
n e
n)V
[b
y [
[Jo
hn
)N]N
P]M
AN
]S
T:N
UA
G
T:B
E 3
T:B
Y
L
Sen
ten
ce T
yp
e N
o.
60
Actu
al
stri
ng
:
Deri
ved
str
ing
:
Bil
l m
en
tio
ned
to
Mary
th
at
Joh
n s
mo
kes
Bil
l m
en
tio
n e
d t
o M
ary
th
at
Joh
n s
mo
ke s
Un
derl
yin
g s
tru
ctu
re:
, f
, ~
-N
P
AU
X
I I
N
T
I I
[
Bil
l]
PA
ST
(+
N)
(+S
g)
v I
[m
en
tio
n]
(+V
)
NP
I N
[t°L"]
(+N
) +
Sg
)
* ~
PR
EP
~
p
I I
to
N I
[M
ary
] -~
+N
)
AU
X
VP
I I
T
V
I I
PR
ES
[s
mo
ke]
(+V
)
.. 'II
Deri
vati
on
:
Fir
st
Cy
cle
:
1.
X (
[ f J
oh
nJ
]NP
([+
Sg
]PR
ES
]T
l<+
Sg
) N
rs
mo
ke]
ls y
L (
+V
) V
z. X
[[(
Joh
n]N
]NP
[s
mo
ke [
[+S
g]P
RE
S]T
l ] 5
Y
(+V
) JV
Seco
nd
Cy
cle
:
T:A
G
T:A
F
1.
[(B
ill]
N P
AS
T (
men
tio
n]V
(
r it
]
(th
at
[(Jo
hn
]N]N
P (
amo
ke(
+S
g]P
RE
S]V
]S]N
P (
to]P
RE
P (
Mar
y]N
]S
~+
_S
)
N
T:C
P 3
Z.
[[ fB
ill]
]N
P P
AS
T (
men
tio
n]V
([
it
] ]N
P (
to]P
RE
P [
Mary
]N [
that
[Jo
hn
]N (
amo
ke[
+S
g]P
RE
S]V
]S]S
~
+S
g)
N
(+_
S)
N
T:E
XT
RA
3.
4.
5.
[ r Bi
ll]
[[+
Sg
]PA
ST
]T
rmen
tio
n]
[it]
N [
to]P
RE
P [
Mary
]N [
that(
Joh
n]N
[am
ok
e(+
Sg
]PR
Esl
Jsls
L
l+sg
>
N
<+v>
v
T:A
G
[(B
ill ]
N
--
-f;
nen
tio
n[(
+S
g]P
AS
T]T
] [
it
l (t
o]P
RE
P [
(Mary
]N]N
P[t
hat(
Joh
n]N
[sm
ok
e [
+S
g]P
RE
S]V
] 5] 5
L (+
V)
V
(+
_'S
)jN
T
:AF
[(B
ill]
N
rmen
tio
n [
[+S
g]P
AS
T]T
l [t
o]P
RE
P [
Mary
]N [
that
[Jo
hn
]N [
smo
ke [
+S
g]P
RE
slv
lsls
T
:PD
L
<+
v>
Jv
Po
at
Cy
cle
:
1.
[[B
ill]
N [
men
tio
n [
ed)T
]V [
to]P
RE
P [
Mary
]N [
that
[Jo
hn
]N rs
mo
ke [
+S
g]P
RE
S,
] 5] 5
L (+
V)
Jv
T:P
AS
T
Z.
[[B
ill]
N [
men
tio
n e
d]V
[to
]PR
EP
[M
ary
]N [
that
[Jo
hn
]N [
smo
ke [
s]T
]V]S
]5
T:N
UA
G
Sen
ten
ce T
yp
e N
o.
61
Actu
al
stri
ng
: it
was
men
tio
ned
by
Jo
hn
th
at
Bil
l sm
ok
es
Deri
ved
str
ing
: it
was
men
tio
n e
n b
y J
oh
n t
hat
Bil
l sm
ok
e s
Un
derl
yin
g s
tru
ctu
re:
#--
----
-;:~
==
----
----
----
----
----
----
----
#
I N I
[
Jo
hn
] (+
N)
(+S
g)
T I
PA
ST
(+~
) ,
(+
_5
)
(+S
g)
N [B1]
(+N
) (+
Sg
)
*
AU
X
VP
I I
T
V
I I
PR
ES
em
ok
e]
(+V
),
-..
'
Deri
vati
on
:
Fir
st C
ycle
:
1.
X [
[ r B
ill 1
]N
P [
[+S
g]P
RE
S]T
fs
mo
ke]
] 5 Y
IJ
+S
g)J
N
l (+
V)
V
T:A
G
Z.
X (
[[B
ill]
N]N
P
rmo
ke [
[+S
g]P
RE
S]T
] ] 5
Y
(+
V)
V
T:A
F
Seco
nd
Cy
cle
:
1. z. 3.
4.
5.
6.
([[J
oh
n]N
]NP
[[P
AS
T]T
]AU
X [
men
tio
n]V
[[i
t]N
[th
at
[[B
ill]
N]N
P [
sm
ok
e[+
Sg
]PR
ES
]V]S
]NP
PR
EP
P]S
T:C
P 3
[[ f
it
] [t
hat[
Bil
l]N
[ sm
ok
e[+
Sg
]PR
ES
]V]S
]NP
[[P
AS
T]T
]AU
Xb
e+en
+[m
enti
on
]V[ P
RE
P[[
Joh
n]N
]Np
1M
AN
]S
L<
+_
S)·
N
T:P
AS
SIV
E
[[ [
it
]
]NP
[[P
AS
T]T
]AU
X b
e e
n [
men
tio
n]V
PR
EP
[Jo
hn
]N [
that
[Bil
l]N
[sm
ok
e[+
Sg
]PR
ES
]V]S
]S
(+
_S
)
N
T:E
XT
RA
[[ f
it
] ]N
P [
[PA
ST
]T b
e]A
UX
en
[m
en
ti::;
n]
V
PR
EP
[Jo
hn
)N [
that[
Bil
l]N
[ s
mo
ke [
+S
g]P
RE
S)V
]S]S
L<
+S
g)
N
T:A
UX
FIL
L
[[ r it
]
]NP
[[[
+S
g]P
AS
T]T
be]
AU
X e
n r
men
tio
nl
PR
EP
[Jo
hn
]N[t
hat
[Bil
l]N
[sm
ok
e[+
Sg
]PR
ES
1v
1s1
s L<
+S
g)
N
L<
+V
) Jv
T
:AG
[[it
]N [
be
+ [
[+S
g]P
AS
T]T
]AU
X [
men
tio
n+
en
] P
RE
P [
Joh
n]
[th
at[
Bil
l]
rsm
ok
e [
+S
g]
ES
, ]S
] ( +
V)
N
N
( + V
) P
R ~
S V
V
T
:AF
P
ost
Cy
cle
:
1.
[[it
]N [
be
([+
Sg
]PA
ST
]T]A
UX
fm
en
tio
n e
nl
PR
EP
[Jo
hn
]N [
that
[Bil
l]N
[sm
ok
e [
s]T
]V]S
]S
L <
+V
) Jv
T
:NU
AG
2.
[fit
]N [
was
]AU
X
[m;+
n~
i;n
en
] V
[P
RE
P [
[Jo
hn
]N]N
P]M
AN
[t
hat[
Bil
l]N
[sm
ok
e s]
V]S
]S
T:B
E
3
3.
[[it
]N [
was
]AU
X [~
:~~
on
en
]V
[by
[[J
oh
n]N
]NP
]MA
N [
that
[Bil
l]N
[sm
ok
e s]
V]S
]S
T:B
Y
Sen
ten
ce T
yp
e N
o.
62.
Actu
al
stri
ng
:
Deri
ved
str
ing
:
Bil
l te
lls
Mary
Jo
hn
sm
ok
es
Bil
l te
ll s
Mary
Jo
hn
sm
ok
e s
Un
derl
yin
g s
tru
ctu
re: ~=
====
===-
---*
NP
A
UX
I I
N
T
I I
[
Bil
l ]
(+N
) (+
Sg
)
PR
ES
V I
[te
ll]
(+V
)
r {:~) 1
~
+
s~
NP
I N
[
Jo
hn
] (+
N)
(+S
g)
~
PR
EP
N
P
I I
to
N I
[M
ary
] (+
N)
AU
X
VP
I I
T
V
I P
RE
S
I
[sm
ok
e]
(+V
)
Der·:
vat
ion
:
Fir
st C
ycle
:
1.
X [
( r Jo
hn
1 ]N
P [
(+S
g]P
RE
S]T
fs
rnok
e]
]S Y
l<
+S
g)j
N
L<
+V
) V
T:A
G
2.
X (
[[Jo
hn
]N]N
P f
srn
oke
[[+
Sg
]PR
ES
]T]
) 5 Y
L (
+V
) V
T:A
F
Seco
nd
Cy
cle
:
1. z. 3.
4.
5.
6.
1.
[[B
ill]
N P
RE
S [
tell
]V[[
it]N
[th
at[J
oh
n]N
[ sr
no
ke[+
Sg
]PR
ES
]V]S
]NP
[[to
]PR
EP
[[M
ary
]N]N
plp
plg
T:C
P 3
[(B
ill]
N P
RE
S (
tell
]V [
(to
]PR
EP
([M
ary
)N]N
P]P
P [
(it)
N [
that
(Jo
hn
)N (
srn
ok
e(+
Sg
)PR
ES
]V]S
]NP
]S
T:I
OI
[( f B
ill]
]N
P P
RE
S [
tell
]V (
[[M
ary
)N]N
P]P
P [
(it)
N (
that
[Jo
hn
)N (
srn
ok
e[+
Sg
]PR
ES
]V]S
]Np
lS
~+
Sg
) N
T
:TO
[ r Bi
ll,
[[+
Sg
]PR
ES
]T
ftell
] [[
(Mary
)N]N
pJp
p [
[it]
N [
that
[Jo
hn
]N [
srn
ok
e{+
Sg
]PR
ES
]V]S
]NP
]S
~+
Sg
~ N
~
+V
) V
T
:AG
[[B
ill]
N
µell
[(
+S
g]P
RE
S]T
] [[
(Mary
)N]N
plp
p [
f it
]
[th
at(J
oh
n)N
[sr
no
ke[
+S
g]P
RE
S]V
]S]N
P]S
l<
+V
) V
1
5+
_S
) N
T
~F
[(B
ill]
N
ftel
l [(
+S
g]P
RE
S]T
] [[
(Mary
)N]N
P]P
P [
(th
at(J
oh
n]N
(sr
no
ke(
+S
g]P
RE
S]V
]SJN
P]S
L
<+V
) V
T
:PD
([B
ill]
N f
tell
[(+
Sg
]PR
ES
]T]
[[[M
ary
]N]N
plp
p (
[[Jo
hn
)N
fsrn
oke[
+S
g]P
RE
Sl
) 5]N
plS
L<
+v>
v L<
+v>
~v
T:T
HA
T
Po
st C
ycle
:
1.
[(B
ill]
N [
tell
[s)
T]V
[[(
Mary
)N]N
P]P
P [
[[Jo
hn
]N [
sm
ok
e [
s]T
]V]S
]NP
]S
T:N
UA
G
,, I 1:
Sen
ten
ce T
yp
e N
o.
63
Actu
al
stri
ng
: B
ill
rem
ind
ed
Mary
to
go
Deri
ved
str
ing
: B
ill
rem
ind
ed
Mary
to
go
Un
derl
yin
g s
tru
ctu
re:
#--
----
=~
::::
:::-
----
----
----
----
----
----
----
-#
AU
X
I N
T
V
N
P
P.t
I
f Bil
l ]
l (+N
) (+
Sfl
I P
AS
T
I [re
min
d]
(+V
)
I N I
[
Mary
] (+
N)
(+S
g}
p
of ~
s
l ,:L ]
.
+
S)
(+C
}
#
NP
A
UX
V
P
I I
I N
T
V
I I
I [M
ary]
PR
ES
[<!
~)]
t+N
) (+
Sg
)
*
Deri
vati
on
:
Fir
st C
ycle
:
1.
X [
[ r M
ary
] ]N
P [
[+S
g]P
RE
S]T
r g
o ]
]
S y
L (+S
g)
N
L<+
V)
V
T:A
G
z. X
[([
Ma
ry)N
]NP
fgo
[[+
Sg)
PR
ES
JT]
JS y
l(
+V
) V
T:A
F
Seco
nd
Cy
cle
:
1.
[[B
ill]
N P
AS
T [
rem
ind
)v [
[Mary
]N]N
P (
of)
PR
EP
[ [
it
]
[+C
[(M
ary
]N)N
pl(
go
(+S
g]P
RE
Slv
lvp
lsls
(+
C)
N
T:C
P 1
z. [[ r B
ill J
]NP
PA
ST
(re
min
d]v
[(M
ary
]N]N
P (
of)
PR
EP
[ I it
I (+
c [
go
[+S
g]P
RE
S]v
lsls
T
:IE
l<
+S
g)
N
(+C
) N
3.
[ [B
ill J
[+S
g]P
AS
T [
rem
ind
]V [
[Mary
]N]N
P [
of]
PR
EP
[ f
it J
[+C
fg
o [
[+S
g]P
RE
S]T
] ] 5
] 5
<+
sg)
N
~+
c>
N
L
<+
v>
v T
:AG
4.
([B
ill]
N [
[+S
g)P
AS
T]T
[re
min
d]
[[M
ary
]N]N
P [
of]
PR
EP
[ r it
J
[+C
[g
o)V
]S]S
T
:TS
~
V)
V
~C
)N
.. -
5.
[(B
ill]
N
t-;_
emin
d [
[+S
g]P
AS
T]T
] [(
Mary
] N
]NP
[o
f]P
RE
P [
~
it
] [+
C [
go
]V]S
]S
(+V
) V
(+
C)
(+
_S
)
N
6.
([B
ill]
N
f';-
emin
d [
[+S
g]P
AS
T]T
] [(
Mary
]N]N
P [
i ft
J [+
C [
go
]V]S
]S
L (+
V)
V
( +C
) (+
_S
)
N
7.
[[B
ill]
N
r;.e
min
d [
[+S
g]P
AS
T]T
] ([
Mary
]N]N
P
[+C
(g
o]V
)S]S
U
+V
) V
Po
st C
ycle
:
1.
[(B
ill]
N
[rem
ind
[ed
]T]V
[M
ary
]N
(+C
[g
o)v
lsls
Z.
[[B
ill]
N [
rem
ind
ed
)V [
Mar
y)N
[to
[g
o]V
]S]S
T:A
F
T:P
RE
PD
EL
T:P
D
T:P
AS
T
T:C
2
~
Sen
ten
ce T
yp
e N
o.
64
Actu
al
stri
ng
:
Deri
ved
str
ing
:
Un
derl
yin
g s
trin
g:
Joh
n t
em
pte
d M
ary
to
go
Joh
n t
em
pte
d M
ary
to
go
-r
, N
~X
------- VP
I N
I T
v T
N
P
* *
I
[
Jo
hn
] (+
N)
(+S
g)
I P
AS
T
I
[
tem
pt]
(+
V)
(+C
)
I I N I
[Mary
] (+
N)
(+S
g)
N
AU
X
VP
I I
I N
T
V
I
[
Mary
] (+
N)
(+S
g)
I P
RE
S
I c:~a
...
Deri
vati
on
:
Fir
st
Cy
cle
:
1.
X [(
[Mary
] ]N
P [
(+S
g]P
RE
S]T
r go
]
JS y
(+
Sg
) N
,
'. ~
+V
) V
z. X
[[(
Mary
]N]N
P
[go
[(
+S
g]P
RE
S]T
] ]S
y
(+V
) V
Seco
nd
Cy
cle
:
1.
[(Jo
hn
]N P
AS
T re
mp
t]
[[ M
ary
]N]N
P [
+C
[(M
ary
]N]N
P [
(go
(+S
g]P
RE
Slv
lvp
lsls
(+
C}
V
z. 3.
4. 5.
[( [
Jo
hn
] ]N
P P
AS
T f
tem
pt]
[(
Mary
]N]N
P [
+C
[g
o[+
Sg
]PR
ES
]V]S
]S
(+S
g)
N
L<
+C
) V
[ [J
oh
n]
[+S
g]P
AS
T
ftem
pt]
[(
Mar
y]
N]N
P
[+C
fg
o [
[+S
g]P
RE
S]T
l 1
sls
{+S
g)
N
L (+
C)
V
l<+
V)
:IV
[(Jo
hn
]N [
[+S
g]P
AS
T]T
re
mp
t]
[(M
ary
]N]N
P [
+C
[g
o]V
]S]S
(+
C)
. (+
V)
V
[(Jo
hn
]N
rem
pt
[(+
Sg
]PA
ST
]TJ
[(M
ary
]N]N
P [
+C
[g
o]V
]S]S
(+
V)
V
Po
st C
ycle
:
1.
i(Jo
hn
)N [
tem
pt
(ed
]T]V
[[M
ary
]N]N
P [
+C
[g
o]v
ls1
s
z. [(
Joh
n]N
[ t
em
pt
ed]V
[(M
ary
]N]N
P [
to (
go
]V]S
]S
T:A
G
T:A
F
T:C
P Z
T:I
E
T:A
G
T:T
S
T:A
F
T:P
AS
T
T:C
2
~
Sen
ten
ce T
yp
e N
o.
65
Actu
al
str
ing
:
Deri
ved
str
ing
:
Joh
n c
on
desc
en
ded
to
go
Joh
n c
on
descen
ded
to
go
Un
derl
yin
g s
tru
ctu
re:
·~
*
NP
A
UX
I I
N
T
[
Jo
Ln
] (+
N)
(+S
~
I P
AS
T
NP
A
UX
V
P
I I
I N
T
V
I
I I
[
Joh
n ]
P
RE
S
[ g
o J
(+N
) (
+V
) (+
Sg
)
Deri
vati
on
:
Fir
st
Cy
cle
:
1.
X (
[ r Jo
hn
] ]N
P (
[+S
g]P
RE
S]T
r g
o J
JS y
~+
Sg
) N
IJ+
V)
V
T:A
G
2.
X [
[(Jo
hn
]N]N
P
fgo
([
+S
g]P
RE
SJT
l 1s
y
L<+V
) :JV
T
:AF
....
I, '·
Seco
nd
Cy
cle
:
1. z. 3.
4.
, 5
.
([[J
oh
n)N
]NP
PA
ST
fc
on
desc
en
dl
[+C
[[J
oh
n]N
]NP
[[g
o (
+S
g]P
RE
S]V
]Vp
lS]S
L
<+
CL
Jv
[( f J
oh
n]
)NP
PA
ST
[ c
on
desc
en
d)V
[+
C [
go
[+
Sg]
PR
ES
]V]S
]S
l<+
SS
, N
[[ [
Jo
hn
J
]NP
[+
Sg
]PA
ST
(co
nd
esc
en
d)v
[+
C r
go
([
+S
g]P
RE
SJT
l 1
s1s
(+S
g ),
N
l<+
V)
1 V
[[Jo
hn
]N (
[+S
g]P
AS
T]T
rc
on
des
cen
d1
[+
C (
go]V
]S]S
L
(+
V)
JV
[(Jo
hn
] fc
on
desc
en
d (
[+S
g]P
AS
T]T
] N
L
(+
V)
V
[ +c (
go
] v
1s1
s
Po
st C
ycle
:
t.
[[Jo
hn
]N [
co
nd
esc
en
d [
ed]T
]V [
+C
[g
o]v
lsls
z. [[
Joh
n]N
[ c
on
desc
en
d e
d)V
[ t
o [
go
)v1
s1s
T:C
P Z
T:I
E
T:A
G
T:T
S
T:A
F
T:P
AS
T
T:C
2
ij L
Sen
ten
ce T
yp
e N
o.
66
Actu
al
stri
ng
: Jo
hn
sto
ps
wo
nd
eri
ng
Deri
ved
str
ing
: Jo
hn
sto
p s
w
on
der
ing
Un
derl
yin
g s
tru
ctu
re:
# -4
--
#
I *
T I
PR
ES
NP
A
UX
·p
I I
I N
T
V
[
Jo
Ln
] (+
N)
(+S
g)
l P
RE
S
I [
wo
nd
er]
(+
V)
Deri
vati
on
:
Fir
st
Cy
cle
:
1.
X [[
[Jo
hn
]
]NP
[[+
Sg
]PR
ES
]T
{+
Sg
) N
[w
on
der]
] 5
Y
(+V
) V
2..
X [
([Jo
hn
]N]N
rw
on
der
[[+
Sg
]PR
ES
]T]
]S y
L
<+
V)
V
I V I
[ sto
p]
(+ V
)
T:A
G
T:A
F
Seco
nd
Cy
cle
:
1. 2.
3.
4. 5. 6.
[[
[ it
]
[-C
f[J
oh
n]N
]NP
[w
on
de
r [[
+S
g]P
RE
S]T
]V]S
]NP
PR
ES
[st
op
]V]S
(-C
)
(+
_S
}
N
([ r it
]
]NP
([P
RE
S]T
]AU
X [
sto
p]y
[-C
f[J
oh
n)
N]N
P [
wo
nd
er
(r+
Sg
]PR
ES
]T]V
]S]S
Ll+
_S
) N
[[ r
Jo
hn
] ]N
P P
RE
S [
sto
p]v
[-C
[w
on
der
[[+
Sg
]PR
ES
]T]v
lsls
~+
Sg
) N
[( r
Joh
n ]
]N
P (
[+S
g]P
RE
S]T
L
<+
Sg)
N
[sto
p]
[-C
w
on
der
[[+
Sg
]PR
ES
]T
1 51s
(+
V)
(+V
) V
V
[[ [
Jo
hn
] ]N
P (
[+S
g]P
RE
S]T
(+
Sg
) N
[
sto
p]
[-C
[w
on
der]
] 5
] 5
(+V
) V
.
(+V
) V
[[(J
oh
n]N
]NP
[st
op
rr+
sg]P
RE
S]T
] [
[wo
nd
er
-CJ
lsls
(+
V)
V
(+V
) V
Po
st
Cy
cle
;
1.
[[[
Joh
n]N
]NP
[st
op
(s]T
]V [
(wo
nd
er
-Cly
ls1
s
2.
[([J
oh
n]N
]NP
[st
op
sly
[[w
on
de
r in
g]V
] 5] 5
T:C
P 1
T:E
XT
RA
T:P
RO
RE
P
T:A
G
T:T
S
T:A
F
T:N
UA
G
T:C
4
I.
5. 0 Notes
1 In particular, see Noam Chomsky, Aspects of the Theory of
Syntax, ( Cambridge, 1965 ).
2 Cf. G. Lakoff, On the Nature of Syntactic Irregularity,
Indiana University Doctoral Dissertation, ( 1966).
3 Cf. Chomsky, Aspects ..• , Ch. 2.
4cf. G. Lakoff, On the Nature . . . .
5 Cf. P. Postal, 11A Note on 'Understood Transitively', 11 IJAL,
January, 1966, Vol. 32, No. 1, for discussion of.the identity condition in the transformational component.
6The rules for relative clause formation employed in the CG
are adapted from the more general formulation of S. Y. Kuroda.
7 The obligatoriness of the rule CP 1 is lexically determined.
8For discussion of the condition imposed upon the Identity
Erasure Transformation, Cf. P. S. Rosenbaum, 11A Principle Governing Deletion in English Sentential Complementation, 11
IBM Research Report, RC 1519, (Yorktown Heights, 1965). For a general discussion of sentential complementation in English, Cf. P. S. Rosenbaum, Grammar of English Predicate Complement Constructions, MIT Doctoral Dissertation, 1965, and "Phrase Structure Principles of Complex Sentence Formation in English," (in preparation), and "Transformational Principles of Complex Sentence Formation in English, " (in preparation).
9 For a transformation which must apply if the P-marker meets the structural conditions imposed by the structure index of the rule, e. g. , the Identity Erasure Transformation for Verb Phrase Complement constructions, the failure of this P-marker to meet the identity condition imposed on this transforma.tion must indicai:e an ungrammatical derivation. Such a ' iblocking" facility is not currently provided in the CG and the grammar, consequently, will generate ungrammatical strings. This facility is omitted at present primarily because it is not clear whether derivations should actually "block," (which is a simple enough matter to accomplish, Cf. English preprocessor manual, Information System Language Studies Number Seven, Mitre Corp. , May, 1965, ) or whether derivations should more appropriately proceed to termination becoming marked in the process either for legality or for illegality. The latter mechanism currently appears promising and will, in all probability, be incorporated into a later version of the IBM English Grammar.
...
I , ,
, . ,
I • I
BLANK PAGE ..
· 1 I
. - - -~- -- - - .
PART 11
"DESIGN OF A GRAMMAR TESTER"
D. Lieberman
This Part has been submitted for presentation at the Fall Joint Computer Conference, November 8-10, 1966, San Francisco, California
Design ~ ~ Grammar Tester
Contents
Design Considerations
1. Automatic expansion of a grammar
2. Checking the legality of a derivation
3. Traces
4. Automatic comparison with expected result
5. Partially automatic update of a set of test sentences
6. Testing a sequence of variations of a grammar in one run
7. Grammar and test sentence maintenance
Input and Output Formats and Control Cards
i. Form of the grammar
2. Conversion of compact form to expanded form
3. Grammar update
4. Production of specified derivation and comparison with expected result
Present Status
. -- .,. .. -
Page
1
4
4
5
6
6
9
10
13
13
21
24
ZS
31
1
The work described herein is the first step in a long
range program to develop computer aids to linguistic research
and machine techniques to exploit linguistic theory in practical
applications.
Our immediate goal is a computer aid in the develop
ment of a comprehensive and detailed transformational gram
mar of English. This computer aid is intended to provide
material assistance to the grammarian and, at the same time,
to be a vehicle for the accumulation of initial experience in
linguist-computer interaction unde r conditions of half-day
turn-around time. Also, some initial information regarding
the programmer and machine resources (including running
times) required for this type of work will be obtained and will
be used in planning future work.
Design Considerations
The two main design considerations are : 1) what facil
ities are necessary and/ or useful to the linguist, and Z) in
what form will these facilities be provided? In other words,
what will the machine do for the linguist, and what must the
linguist do for the machine?
There are many things, ran.ging from simple boot •
keeping to random generation of sentences, that can be done
by a computer operating on a grammar in machinable form.
In fact, there ha.ve been suggestions in the literature that
computers could perform what are usually considered to be
creative aspects of grammatical research. For example, it
has been suggested that a computer could be programmed to
accept some corpus as input and produce a grammar of the
-. ~-. --
2
corpus as output, or could accept as input some corpus and its
translation into some other language, and produce a translation
algorithm as output. Whatever the merit of such suggestions
·may be (especially without the support of a theory of linguistic
universals), our approach is quite different and far less spec
tacular as regards its immediate objectives. Rather than at
tempt to revolutionize the manner in which linguistic research
is carried out, we accepted current methods as being basical
ly sound and asked whether there were aspects of the linguist's
work which could be carried out more effectively (economical
ly) or more extensively by using a computer. Although we did
not rule out the possibility that certain activities previously
considered creative might turn out to be routine and machin
able, we looked first for obviously routine and tedious tasks
which could be done as well or better by a computer than by a
linguist,
The task we chose for immediate implementation was
the testing of a grammar. Specifically, given a grammar,
will it in fact generate the variety and complexity of sentences
and accompanying structural descriptions expected by the
grammarian? Moreover, will it correctly exclude all that it
is supposed to exclude? Exhaustive testing is, of course, out
of th~ question even with a computer. What we are interested
in is establishing the extent and type of testing required to
"check out" a grammar, and developing computer techniques
to facilitate the work.
The problem of grammar testing,or, more generally,
the characterization of the coverage of a grammar, has re
ceived very little attention in the literature in the past, since
3
it has not been a pressing problem. Transformational theory
has only recently reached a stage of development at which it is
feasible to use it as a basis for a comprehensive and detailed
grammar of English. Until recently, applications of transfor
mational theory to descriptions of English have had as their
main objective the testing of the adequacy of the general
theory. The grammars actually produced we"re either detailed
descriptions of fragments of English, or were skeletal de
scriptions of the main features of English syntax. Moreover,
these grammars served their purpose without requiring an
unreasonable amount of testing effort (either they were small
enough to be tested exhaustively manually, or they were in
adequate in some way at a gross level and there was no point
i.n examining them i.n greater detail).
The situation i.s now quite different. Using current
transformational theory, we are able to write grammars
which are too big for exhaustive manual testing and at the same
time appear to be adequate at a very detailed level. The
grammar of English presented in Part I of this report is
just a bout at the limit of manual tractability, but it is far from
limitations imposed by the current state of the theory. Thus,
the use of machine testing procedures is not just highly de sir -
able, but appears to be a necessity for further expansion of
the grammar.
The basic test facility is the automatic generation of a
sentence. The input is a gr,arrunar and a specified derivation
(sequence of rule numbers), and the output is a sentence and
its structural descri.pti.on or a failure indication if the deriva
tion could not be carried out. But if this were all that was
provided for the linguist, it would probably be more of a
hindrance than a help. Eventually, experience will indicate
what sort of computer aids are useful a nd feasible, but even
at the present design stage it is clear that a number of addi
tional facilities are required:
4
1. Automatic expansion of a grammar. In specifying a
derivation, it is not enough to specify rule numbers - -specific
subrule numbers must be specified. Thus, a facility is needed
to take as input a grammar in the usual notation (using braces
and parentheses) and produce as output a listing of the gram
mar in which each • ubrule is explicitly displayed and uniquely
identified in some way. If this task were left to the linguist
and had to be repeated each ti.me the grammar was modified,
it would detract significantly from the over-all usefulness of
the computer aid.
z. Checking the legality of a derivation. The fact that
some specified sequence of rules led to a successful deriva-0
tion (an acceptable sentence and structural description) does
not guarantee that the grammar can actually generate the sen
tence which resulted from the application of the specified
sequence of rules. The specified sequence may have violated
some traffic rule conventions in the grammar. For example,
a particular context-free subrule may have been specified,
but a context-sensitive subrule in the same main rule may have
been applicable at the time the specified rule was applied.
Thia would be a violation of the convention that, within each
main rule, the subrule1 form two main groups - -one context
sensitive and one context-free--and the context-sensitive group
i1 considered to precede the context-free group in order.
5
Similar violations can occur in the application of transforma
tional rules. It is therefore necessary to include a facility for
checking the legality of a specified derivation as it is carried
out. Moreover, there should be various options available to
the linguist regarding the action to be taken if a specified deri
vation is illegal at some point. As a minimum, there should
be two options--one to halt and one to proceed--with appropri
ate comments regarding the illegality printed out in either case.
The reason for including a proceed option is that it may, at
times, be of experimental value to be able to determine the
result of applying a particular sequence of rules even though
the grammar in which they occur contains other rules which
would take precedence in a rigorous application of the grammar.
3. Traces. Thus far, the only computer output we have
mentioned (aside from printout of comments regarding illegal
ities in specified derivations) is the final derived sentence and
its surface structure. All of the intermediate steps (the cur
rent string and tree after ea.ch rule application) are readily
available, but,with the exception of the step at which the deep
structure is established, the status after each rule application
would be of interest only in special cases. It therefore seems
best to leave the extent of tracing as an option to be selected
for each derivation by the linguist. The choices are:
a. no trace,
b. complete trace- -the current string and current
tree are printed out after each rule application,
c. as called for--the current string or the current
tree or both are printed out after the application of
appropriately marked items in the specified
.,
6
de ri va tion.
4. Automatic comparison with expected result. It can be
expected that during the early stages of testing of a grammar
most sentences will reveal some deficiency in the grammar,
and relatively few sentences will be generated correctly. The
trace facilities would be used heavily, and the proportion of
time spent in checking the final result for correctly generated
sentences would e small. However, as the grammar is cor
rected and refined, a larger and larger number of sentences
will be correctly generated. But every time the grammar is
modified, even in a minor way, it will be necessary to re
check a large number of sentences supposedly unaffected by
the modification. At this point, the task of manually checking
just the final results of the derivations could become a major
bottleneck in the use of the tester as a tool in the development
of a g~ammar. Thus, a facility for automatically checking the
final results (string and surface tree, and perhaps deep struc
ture as well) appears to be highly desirable. This facility
should, of course, be optional. The input to the tester when
using the autom a tic check option would then be a grammar, a
specified derivation and a final string, a final tree, or both
(and appropriate control cards, as described below, to indi
cate the selected option). The output would be simply a YES
or NO for each of the specified structures. Additional output
could be obtained simultaneously by selecting an appropriate
TRACE option.
5. Partially automatic update of a set of test sentences.
As the testing of a gramm.ar proce.eds, a collection of sen
tences will be accumulated which could form a test set in the
- ''-=-•.:,,,.,....~-..-- --- - -------
sense that derivations of the entire set would involve a very
large portion of the grammar. Such a set would probably be
7
of the order of about 100 sentences. A final string and tree
would be associated with each of the test sentences so that the
automatic checking option could be used. The grammarian
could simply scan the output for a NO result in order to find
the remaining few errors in the grammar. This would be a
very effective procedure when the grammar is developed to a
point at which 90% or more of the test sentences are correctly
generated (or correctly not generated- -the test ·set would pro
bably contain not only legal derivations, but also specified
sequences of rules to verify that certain non-grammatical
strings are in fact suppressed by the grammar). However,
there is one drawback to the above procedure. Whenever the
grammar is modified, even slightly, in such a way as to di
rectly affect only a few test sentences, a much larger number
of test sentences may be indirectly affected. By affected, I
mean that the specified sequence of subrule numbers which
represents the derivation of a particular sentence will require
modification. For example, suppose a new symbol were added
to the right hand side of constituent structure rule 1 as an op
tional term, and that the selection of that item was required
in only a few of the teat sentences. Moreover, suppose that
the new symbol were rewritten as a string of old symbols in
the next rule (of the new grammar) and that no further changes 0
in the content of the rules were necessary. Then the new
grammar would be related to the old as follows:
Rule 1 would have one r more new aubrules.
Rule 2 would be entirely new.
,,,
•
8
Rule 3 would have the same content as Rule 2 in the old
grammar, and in general rule i in the new grammar would
have the same content as Rule i-1 in the old grammar for
i > 3.
This means that just about every single rule number in every
specified derivation representing the set of test sentences
would have to be changed. If this had to be done manually, the
advantages of having a set of test sentences would be largely
nullified. Fortunately, most of the modification required in
this example can be done automatically by keeping track of
added (and, in general, also deleted) rules during grammar
update and establishing a mapping from old rule number to new
rule number. In this example, the mapping would be:
(Rule i) ld -(Rule i+f) for i > 2. The mapping could then o new -
be applied to the set of specified derivations representing the
set of test sentences to modify all occurrences of relevant rule
numbers (i ~ 2) appropriately.
In the above example, we considered the automatic
establishment of a mapping involving only subrules within main
rules whose content was not affected by the gramma!" modifica
tion. The mapping can be carried further to include those sub
rules within a modified main rule whose contents are not af
fected by the modification. This can be done by expanding the
modified main rule, comparing the resulting collection of sub
rules with the original collection of subrules, and establishing
a mapping between subrules with identical content before and
after the modification. The mapping applied to the l!let of test
sentence• would then be a resultant mapping obtained by com
bining the main rule mapping and the subrule mapping.
=----
9
It should be mentioned again that the updating of the set
of test sentences cannot be fully automatic. However, a large
amount of updating can be done autornatically and it is essential
that provision for such facilities be included in the design of
the grammar tester.
6. Testing a sequence of variations of a grammar in one
run. Thus far, we have discussed facilities for testing one
grammar at a time. The procedure would be somewhat as
follows:
carry out a testing run;
examine the results and prepare modifications;
carry out an update run on the grammar and test
sentences;
complete the updating of the teat sentence, specified
derivations,and expected results manually where necessary;
carry out a new testing run;
etc.
This procedure will be effective only if, after each testing run,
it is of interest to apply only one set of modifications to the
grammar. But if it is desirable to try several alternatives,
the above procedure would be too cumberaome since it would
require either a long series of, runs or else the maintenance
of several complete copies of the program, grammar, set of
test sentences, and any other sentences being studied.
A limited amount of simultaneous testing of several
variants of a grammar can be achieved by using the update
facility described in (5) above, and making provision for a
sequence of tests and update• in one run. It should be possi
ble to apply the various update• to either the original grammar
(the input grammar at the start of the run) or to any of its up
dated versions (formed earlier in the run). This can be done
by labeling each version of the grammar as it is formed and
including with each update the name of the grammar to which
it is to be applied. From the programming point of view, this
requires the construction of a primitive supervisory facility.
10
The extent to which this facility for experimenting with
several variants of a grammar simultaneously can be used is
limited because, as noted above, updating of test derhrations
can·:1ot, in general, be fully automatic. However, it will be
possible to carry out some updates completely automatically,
and even when the automatic part of the update is not complete,
it may be sufficient to permit useful experimentation to be
carried out. In particular, specified derivations which are
supposedly not affected (except for renumbering) by a given
modification can be tested even if the updating of other deriva
tions must be completed later manually. Since it will often be
easier to foresee the effect of a modification on a small prob
lem area than on the remainder of the grammar, the testing
of supposedly unaffected portions of the grammar will provide
a very useful preliminary evaluation of the correctness of a
modification. Thus, it appears to be quite worthwhile to in
clude planning for this type of facility in the initial design
consideration.
7. Gram.mar and teat sentence maintenance. The gram
mar tester will perm.it almost continuous experimentation
with and modification of the grammar. In fact, it may be pos
sible to develop a grammar along several different lines, or,
in effect, to develop several grammars simultaneously. A
··· • ... ------
11
vast amount of material will be produced as the grammar de -
velopment proceeds, most of which will be of only transitory
interest. The relatively small portion selected for temporary
or more or less permanent retention will still be voluminous
enough to require machine aids in its management. The num
ber of simultaneously active grammars or variants s } 1,Juld be
limited only by the grammarian's ability to handle them effec
tively from a linguistic point of view, and should not be limited
by storage and retrieval problems associated with the use of
the computer.
Every grammar can originate as an update. Even if an
entirely new grammar is being loaded from cards, the system
can be initialized with a null grammar and the grammar being
loaded can be treated as an update of the null grammar. The
same holds for the set of test sentences corresponding to the
grammar. The control parameters of the update run (or up
date portion of a run) will be used to as sign a label to the
grammar and to indicate whether the grammar is to be saved.
The set of test sentences will be handled similarly. The con
trol parameters of the test portion of the run will be us~d to
indicate whether the results of the test are to be saved on tape
or just printed out. The reason for saving the re1ults is that
it may turn out, in the future, to be useful to scan the tapes
by machine to find grammars with particular properties with
respec"t to certain test 1entences. After the automatic update,
that portion of the updating of the set of teat sentences which
could not be done automatically will be completed manually and
the tape will be corrected by a special program. Provision
should also be made for allowing notes and comments to be
• I
saved along with the grammar. Thus, maintenance programs
are required to:
select a specified grammar from the ou tput of an update
and/ or test run;
select the associated set of test sentences;
add manual corrections to the updated test sentences;
select the results of a test of the grammar;
form a unit consisting of the above items and any comments
provided by the linguist.
12
The above discussion was concerned with the first of
the main design considerations mentioned at the beginning of
this section of the report, namely, what facilities are neces
sary and/ or useful t o the linguist. Now let us consider the
second--:-in what form will the facilities be provided to the
linguist? The alternatives range from a high-level linguistics -
oriented programming language which would be used by the
linguist to program the facilities he desires to a single pro
gram package with all facilities built in and not modifiable by
the user. We chose the latter extreme alternative, because
when the various factors affecting the choice, such as pro
grammer'• time, Unguiat'• time, ease of modification of the
program, economy of machine utilization, etc. were consid
ered, there turned out to be one .overriding fact, namely, the
extreme scarcity of transformational grammarians at present.
Thus, the basic design principle was to make as little demand
as possible on the linguist for non-linguistic work. This
meant not only that the linguist ahou1d not be required to pro
gram, but also that he should be able to write grammars in
the format which has been developed by the transformational
13
school. Of course, some special format convention• will b C'
required to achieve machinability, but even here convenience
to the linguist should be given more weight than convenience to
the progranuner or the machine.
Input and Output Formats and Control Cards
1. Form of the granunar. Each line of the grammar is
punched on a separate card. If a line is too long for one card,
a continuation card is used. The card preceding a continuation
card will have a C in column 77.
The type and number of each main constituent structure
and transformational rule will occupy a line of its own, and
will start in column 1. Some typical rule labels are CS 15 or
UT 7 or BT 3, where CS, UT and BT represent constituent
structure rules, unary transformations and binary transforma
tions, respectively. The rule label may be followed after one
or more spaces by a mnemonic label. No restriction is placed
on the number of space• between the rule label and the mne
monic, but the mnemonic must be on the same card.
All symbols which can appear on the left side of a CS
rule will consist of from 1 to 5 contiguous alphabetic or nu
meric characters, i.e., no special characters will be used
within such 1ymbols. The first character will be alphabetic,
but the remaining may be mixed alphabetic and numeric.
There will be a special set of 1ymbols called sentence
boundary symbol• which will start with a special character,
preferably # if it ii available on the pririlter.
The manu• cript notation - will be replaced by = and
the manuscript brace will be replaced by two asterisks, one
.. 14
marking the upper end of the brace and one marking the lower
end. Thus,
A
B
C
D
will be replaced by
*A* B
C
*D* In the manuscript format, a line of symbols outside a brace is
positioned at the center of the brace. In the input format,
such lines will be "justified" upward to correspond with the
top of the brace. Thus,
AB
·c AB*C*
D D
E
F
will be replaced by E
*F*
Also, in the manuscript format, braces on the same "line" are
positioned so that their midpoints are at the same level. In
the input format, braces on the same "line" will be justified
upward so that their upper ends will be on the same line. Thus,
AB (
·c
D
E
F
) GH {~>} will be replaced by
AB(*C*)GH*(I)*
D
E
*F*
Note that parenthe1e1 in the manuscript format will remain as
parentheaea in the input format.
In the manuacript format, trees are drawn with the
root at the top and with deacendents below their ancestors and
usually po1itioned m.ore or le11 aymmetrically with respect to
their ance1tor. In the input format, the root will be at the
left, desce;ndent1 will be to the rir: t of their ancestor•, and
the descendent& of a node will be positioned such that the top
most descendent (rightmost in the manuscript format) will be
on the same line as its ancestor. Thus,
A
D
will be replaced by
A J M
L
I K
G
B F
C E
D
In the manuscript format for context condition•, the
poaition of the aymbol on the left-hand side of the rule is
usually indicated by a dash. In the input form, three con
tiguous asterisks will be uaed.
The initial strings will be represented in the same
forrr1at as CS rules. The rule label will be STRT and the rule
type will be INST. The grammar may start aa follows:
STR T INITIAL STRINGS
INST i = A • B • F CD
*E • The CS rules will follow. A typical form ia illustrated below,
and the symbol• L:'/n and TIF/n are dilcus • ed following the
ts
illuatrations.
cs 15
A= B • C (•DS1 E*) IF/1 F • (G) IF/Z
H TIF/1
•I JSZ•
K S3 TIF/Z
•LMIF/3(N)S4 • IF/1+ ST•••
IF/Z- T ••• U
IF/3+ ••• u TIF/1- PQR
D •••
EF
TIF/Z+ X y •••
16
Conte xt-sensitive rules are represented by placing an
IF· statement immediately following a symbol, a right paren
thesis or a right brace, U the IF statement immediately fol
lows i . symbol, it i• associated with all subrules involving
.selection of the occurrence of that symbol. U the IF statement
immediately follow • a right parenthesis or right brace, it is
a • aociated with all subrules involving the selection of any
aymbol which occur• between the right parenthesis or brace
and it• correaponding left parenthesis or brace. Since the
inclusion of complete IF statements at several points in a main
rule would be unwieldy and would considerably reduce the
tranaparency of the main rule, only ·a reference to an IF state
ment is included directly within the rule, and the complete
statement i• Hated below the main rule. The reference con
sists of a slaah followed by a number followed by a + or - sign,
1. 7
for example, IF/ 3+. The + sign means that the context must
be present, and the - sign means that it must not be present.
In addition to the usual context-sensitive condition re
presented by IF/n, we have included a special device repre
sented by TIF /n. Thia is a context condition which permits
reference to the current tree and not just the current string.
This special device is a fundamental violation of the theory
since it effectively does away with the constituent structure
part of the grammar by making it essentially transformational.
Thus, the TIF would not be used in a grammar which is in
tended entirely to be an expression of or a teat of the theory.
It is included in the design because it may turn out to be a
useful ad hoc device in extending the grammar for practical
application•.
The trees in the TIF statements are not necessarily
complete subtrees of the current tree (where a complete sub
tree consi1ta of a node and all that it dominates, but may
specify only relevant parts of a tree. For example, TIF / Z+
in the above illustration says only that A must have Y as an
immediate ancestor . and Y must have X as an immediate an
cestor, but say• nothing about poa1ible siblings of Y.
The format for complex symbol• is more flexible than
required for the particular form of lexicon we are developing
as part of the grammar. The feature part of the complex e
symbol can be treated either as an ordered vector or as an un-
ordered collection of symbols, i. e., each position in the vector
can be named and referred to by name. Each complex category
type will have a feature vector of specified length and an aux
iliary table containing names for some or all of the vector
positions. If a position is not given a name, it automatically
takes its number a1 its name. Named positions can also be
referred to by their position number. For example, if N is a
complex symbol, its auxiliary table might have the form
Complex Symbol
N
Vector Position Number
1
z 3
4
5
6
Position Name
ANIM
HUM
CONC
PROP
COL
Each vector poaition can be filled by a string 1)f characters,
although our preaent type of lexicon requires only a plus
or minus in each position. In the examples below, a single
character will be uaed.
A complex symbol can have one of the following forms:
i. pure ordered vector
N [ H, K, +, -, T, - ]
ii. pure table reference
N//CONC = +, ANIM = H, 4 = -, COL= -, PROP= T,
HUM= Kl/
Note that the entries are unordered.
iii. mixed
N [, K, , -, , ] // PROP = T, COL = -, ANIM = H,
CONC = +II
where again, the entries within the double 1la1hes are
unordered.
18
The input format for transformational rules uses three
lines: the first line is the structural index, the second line is
a consecutive numbering of the items in the structural index,
and the third line indicates the structural change. Each item
in the fir•t line defines a column running through all three
lines, and the corresponding entries in lines Z and 3 are left
justified with respect to the column. Thus, the manuscript
format
ABC DEF IJ KL M ====> 3 0 P+3+1+Q 5 1 1 Z 3 4 5
will be replaced by the input format
ABC DEF IJ KL M
t
3
2
" 3 4
P+3+t+Q 5
5
t
Conditions imposed on transformational rules are
19
called WHERE statements herein. The first line of each
WHERE statement will have WHR beginning in column 4, fol
lowed by any number of spaces (but not going to a continuation
card) followed by a "+" or a "-" followed by a code (CXT or
FTR) followed by a apace followed by either one number or by
two number• separated by a comma, where the numbers refer
to the structural index. The + and - indicate that the condi
tion mu1t or muat not obtain, respectively. One number is
u1ed when we wiah to specify the context (CXT) or feature
(FTR) content of the item indicated by the number. Two num
ber• are u1ed when we wiah to compare the contexts or feature
contents of the two item• indicated by the two numbers. In this
latter ca1e, only the + 1ign may be used.
zo
The actual statement will start in column 7 of the next
line. The following examples illustrate the various forms of
WHERE statements (where BAK, BIK, BOK represent complex
symbol position names).
WHR +CXT
A B
3
C
D [, , E, , +] // Z6 = F, BIK = G, 19 = -//
••• H
I [ , J, - ] // BIK = K, 1 = L //
The asterisks indicate the position of the item labeled
3 in the rule.
WHR -FTR 3
[, , A, B] // 14 = C, BAK = DI/
WHR +CXT 3, 5
••• A
Bl/ 1, 5, BIK, 37 //
WHR +FTR 3, 5
// Z, 8, 9, BOK, BIK, 17 //
WHR +FTR 3, 5
II Z, 5// LX
In the last example, LX stands for any lexical item and
indicate, that features Z and 5 of lexical items 3 and 5 and the
lexical item• themselves muat be the 1ame. If all the features
must agree, we will write
WHR +FTR 3, 5
// ALL //
Note that when features are to be compared, we indi
cate only the poaitions to be compared, not the content of the
variou1 poaition1.
21
The grouping of the unary tranaformations will be indi
cated by uaing the 1ame rule number for all transformations
in a given group. If a group is optional, the rule number will
be followed by a - sign. The ordering and identification• of
the tran•formation• within a group will be indicated by a num
ber separated from the rule number (and "-" sign, if present)
by a 1la1h. Thu1, we may have the following sequence of
unarie1:
UTi
UTZ/1
UTZ/Z
UTZ/3
UT3
UT4-/t
UT4-/Z
UTS
2. Converaion of compact form to expanded form. The
input i1 a grammar in the form deacribed above and control
card• (deacribed below). The control card• indicate that the
de1ired operation i• Conversion, and also indicate whether
both main rule • and subrules or juat aubrules are to be printed
22
out, and whether the conversion is to be applied only to CS
rules or to transformational rules as well. If printout of main
rules is selected, the output should give each main rule exactly
as in the input, followed by its s ubrules.
The CS-subrules should be grouped according to the IF
(but not the TIF) statements associated with them, and the
groups should be ordered in order of increasing IF number.
In general, there may be &.?veral IF' s asso_ciated with a given
rule. A set of rules forms a group only if they have exactly
the same set of associated IF statements. Groups character
ized by multiple IF' s are ordered as follows: groups w · h an
IF/ 1 will pre cede groups without an IF/ 1. Among all groups
with an IF/1, those with an IF/2 will precede those without an
IF/ Z, etc. To illustrate, suppose some main rule has four
IF' s in it, and suppose that all combinations of IF' s occur,
then the groups would be ordered as follows:
IF/1 IF/Z IF/3 IF/4
IF/1 IF/Z IF/3
IF/i IF/Z IF/4
IF/1 IF/Z
IF/1 IF/3 IF/4
IF/i IF/3
IF/i IF/4
IF/1
IF/2 IF/3 IF/4
IF/Z IF/3
IF/2 IF/4
IF/2
IF/3 IF/4
- ~-~-----... -
IF/3
IF/4
no IF'a.
23
Vfithi1' each group, the rules are unordered as far as
the traffic rules are concerned, but in the printout, they should
be ordered alphabetically.
After the subrules are grouped and alphabetized, they
should be printed out in the following format: the first line
gives the main rule name and number starting in column 2, and
after three spaces a G followed by a group number assigned
consecutively by the conversion program. Then, starting in
column 25, the associated IF statement will be given by an IF/
followed by one or more numbers in increaEing order (sepa
rated by commas, if mo:re tMn one number). The next line
will give subrule number i starting in column 4 with the main
rule number (but not nam,?) followed by R followed by i. The
subrule itself will 1tart in column i 3. li subrule Z is in the
same group, it will come on the next line, For example, the
first three lines of Rule i 7 may ~-p:f>ear as follows:
CS1.7 Gi IF/1.,2,4
i7Ri
17Ra
A=BCD
A=BF
If subrule 3 i.s in group Z, we woi:.ld then have
CS17 GZ IF/1., 3
i7R3 A=BC
In the printout, a space should be left between the last line of
one group and the fir1t line of the next. Any TIF statement
references a1sociated with a aubrule will follow the subrule
in the same line, with at lea1t twelve spaces between the laat
•
;
character of the laat symbol and the TIF reference, but the
TIF reference ahould start no earlier than column 103.
The full IF and TIF statements should follow the last
aubrule in the aame format as in the input. If the main rule
aa well aa the aubrule is printed out, the IF and TIF atate -
ments need appear only after the last subrule and not also
after the main rule.
If a "line" does not fit in one line of printout (u&Sing
1 Z0 columns) it should be continued on the next line starting i.n
column 16 if it is part of a subrule, and in column 106 if :tis
part of a TIF reference.
Z4
3. Gran1n~-:-- update. The input is a grammar in the cora
pact form and one or more of the following ordered types of
control cards and associated data. The first control card in
dicates that the d.eaired operation is grammar update.
Type 1. The purpose of this type of update is to re
place some symbol everywhere it occurs by some other sym
bol. The control symbol and the data are on the same card.
The control aymbol REPSYM starts in column 1 followed by
any number of apaces followed by a symbol followed by any
nwnber of apace• followed by a ayrnbol, but all three items
must be on one card. The interpretation ia that the first sym
bol ia to be replaced everywhere by the second. If more than
one replacement ia desired, a separate card ia used for each
one.
Type Z. Thia is to replace an entire rule. The con
trol aymbol (a tarting in column 1) is REPRUL followed by any
number of apace• followed by a main rule name and number.
The replacement rule start• on the next card and is expressed
25
in the input format described above. U more than one replace
ment is desired, each ia preceded by an appropriate control
card.
Type 3. This is to delete an entire rule. The control
•ymbol (starting in column 1) is DELRUL followed by any num
ber of spaces followed by a ma in rule name and :\urr .. ber.
Type 4. This is to add an entire rule. The control
card is like that for REPRUL except that the control symbol
will be ADDRUL. The rule to be added starts on the next card
and is in the input format.
'V/hen rules are added or deleted, the rules following
the point of insertion or deletion will have to have their rule
numbers updated appropriately. This updating should not be
done until all additions and deletions have been carried out,
since the point of insertion or deletion is defined in terms of
the pre -updated grammar.
4. Production of specified derivation and comparison with
expected result. The following options are possible:
Input compact format, or
Grammar expanded format, or
Format result of updating in the same run
Traffic
Rule•
Deletion
Special
Devices
{ {
{
blocking, or
non-blocking
immediate, or
delayed
use TIF's
do not u1e TIF1 1
. . - - --- ---,----
Illegality
Trace
Comparison
{
stop, or
continue
none, or
all stringJ, or
all trees, or
all string• and all trees, or
as called for
none, or
final string, or
final string and final tr~e
26
The first control card will have PROD followed by one
or more blanks followed by the identification title of the gram
mar to be used. The next card will have MODE in columns
1- 4. Selection of options will be indicated on the MODE card
as follows:
Col. 7- 9 for grammar format:
CMP for compact format
EXP for expanded format
UPD for re1ult of updating in the same run
Col. 13-15 for traffic rule1:
BLK for blocking grammar
N(7)N for non-blocking grammar
Col. 19-22 for deletion:
IMMD for immediate deletion
DLYD for delayed deletion
Col. 25-28 for 1pecial device•:
TIF for use TIF' s
ION for ignore TIF' 1
-~- .. - -·- -' ~---------·---- ~~
Col. 3i-34 for illegality:
STOP for stop
CONT for continue
Col. 3'/-40 for trace:
N0NE for none
STRG for all strings
TREE for all trees
STTR for all strings and all trees
CALL for as called for
Col. 43-46 for comparison:
N0NE for none
STRG for string
STTR for string and tree
The MODE card is followed by a sentence identification
card. The identification starts with an 5- in columns f-2 fol
lowed by any number of alphanumeric characters, including
blanks, but not going beyond column 42.
Z7
If a comparison string and tree is included, the next
card will have EXP STRG starting in column 7, and the fol
lowing card will contain the string in the input format. Fol
lowing the string will be a card with EXP TREE starting in
column 7, and the tree will be given on successive cards in the
input format.
After the above card• (if present) cornea the specified
derivation. I : is introduced by a card with DERIV starting in
column 4. The sequence of rule• (actually subrule1) starts on
the next card, and ii given one rule to a card, with a • equence
number • tarting in column i 3 and the rule name and number
starting in column ZS. Each rule may be followed (after any
number of apace1) by either STRG, TREE, or STTR. If the
trace option is CALL, the current string, tree, or both will
be printed out after application of a rule followed by STRG,
TREE, or STTR, respectively. If in any other trace mode,
the• e 1ymbols will be ignored.
The next card is an output control card permitting op-
tional selection of one or more of the following for printout:
Input control card
Output control card
Record of illegalities
EXP STRG and aasociated string
EXP TREE and associated tree
DERIV and associated sequence of rules.
ZS
Printout of traces is not optional. If a trace is ob
tained, it is automatically printed out. Also, if a comparison
i1 made, the result• (YES or NO) are automatically p1 inted out.
The output control card has OUTPUT in columns 1-6.
The print out selections will be indicated as follows:
Col. 13-16
MODE
blank
Col. 19-ZZ
OUTP
blank
Col. ZS-ZS
ILLG
blank
for input contr<,l card
print out MODE control card (in input format)
no printout
for output control card
print out output control card (in input format)
no printout
for Ulegalitie1
print out record of illegalitie1 (in format
deacribed below)
no printout
Col. 3i- 34
EXST
blank
Col. 37-40
EXTR
blank
Col. 43-47
DERIV
for expected string
print out expected string (in input format,
starting with the EXP STRG card)
no printout
for expected tree
print out expected tree (in input format,
starting with the EXP TREE card)
no printout
for specified derivation
print out specified derivation (in input format,
starting with the DERIV card)
blank no printout
The various items printed out are ordered as follows:
Grammar identification
Sentence identification
Z9
Results of comparison. These are printed out on
the same line as the Sentence identification, as follows:
Starting in column 55: STRG followed by two blanks
followed by YES or NO (for match or not match, re
spectively);
Starting in column 7 3: TREE followed by two blanks
followed by YES or NO.
MODE Control Card
Output Control Card
Record of illegalities - RECORD OF ILLEGALITIES
is printed out, starting in column i, and then separate
lines are used for each illegality, with each line con
taining the appropriate rule sequence number and rule
name and number as in the input format, followed,
I I
• tarting in column 37, by a statement describing the
illegality (for example, 9RZ3 WAS APPLICABLE, or
9RZ3 WAS NOT APPLICABLE).
EXP STRG and associated string (in inpu.t format)
EXP TREE and associated tree (tn input format)
DERIV and associated sequence of rules (in input
format)
Traces - in the order obtained. For each trace,
TRACE is printed, starting in column 1 followed on
the same line by the rule sequence number and rule
name and number (in input format) which "triggered"
the trace, On the next line, STRING is printed,
starting in column 4, and the current string is printed
on the next line in input format. Then, on the next
line, TREE i1 printed, starting in column 4, and the
tree is printed out in input format, starting on the
next line.
The control card for the Conversion operation has
EXPAND in columns 1-6 followed by one or more blanks fol
lowed by the identification of the grammar to be expanded.
The next card indicates what is to be printed out and what is
to be aaved on tape, This card has DISP in columns 1-4 and:
Col. i 3-18 PRCOM for print only compact grammar
PRXPND for print only expanded grammar
30
PRBOTH for print both (in format described
above)
Col. ZS-30
blank
SVCOM
for print out neither
for • ave only compact grammar
on tape at end of run
SVXPND
SVBOTH
blank
for save only expanded grammar
for save both
for save neither
31
The control card for the Update operation has UPDATE
in columns 1-6 followed by one or more blanks followed by the
identification of the grammar to be updated. The next card
assigns an identification title to the updated grammar. It has
IDENT in columns 1-5 followed by one or more blanks followed
by an identification title. The following card indicates what is
to be printed out and what is to be saved on tape. This card
has DISP in columns 1-4 and:
Col. 13
Col. 25- 30
Col. 37-41.
Present Status
PRUPD
blank
PRPRE
PRPOST
PRBOTH
blank
SVPRE
SVPOST
blank
print out update cards
do not print out update cards
f.or print out pre -updated grammar
for print out updated grammar
for print out both
for print out neither
save pre-updated gramm:?. •~ on tape
save updated grammar on tape
save neither
The programming done thus far is described in detail
in Part III of thil report. The basic routines for automatic
expansion of a grammar, for carrying out a derivation, for
checking the legality of a derivation, and for providing traces
are running, However, the present program does not as yet
include provisior, for context restrictions (WHERE statements)
on transformational rules. Also, the input and output formats
being used at pre1ent do not yet conform to the specifications
described above, which were designed with convenience to the
linguist in mind. The present formats are still in a form con
venient to the programmer for debugging purposes.
32
PART III
PROGRAMMING OF THE GRAMMAR TESTER
F. Blair
Programming ~ the Grammar Tester
Contents Page
1..0 INTRODUCTION 1
1..1 Compiler 1
1. 2 Derivation Tester 2
2.0 FUNCTION DESCRIPTIONS FOR THE 2 GRAMMAR COMPILER
3. 0 FUNCTION DESCRIPTIONS FOR THE 14 DERIVATION TESTER
4.0 ON MATCHING ARBITRARY PROPER 27 STRINGS IN TREES
4. 1 Introduction 27
4. 2 Pattern Specification 30
4. 3 The Function Properanalysis 32
4. 3. 1 Literal match 32
4. 3. 2 Back-referenced match 32
4. 3. 3 Indefinite pattern or 33 "Dollars" match
4. 3. 4 The pattern ele~ent NIL 33
4. 3. 5 LISP Functions for pattern 33 matching
4.4 Some More General Comments on 34 Matching Proper Strings in Trees
4. 5 The Question of Efficiency and the 35 Combinatorial Problems Involved
4.6 Conclusion 36
REFERENCES 37
FIGURES follow 37
APPENDICES
A, I PRINTOUT OF AN INPUT GRAMMAR (From Gutsin [] )
A, II PICASO PRINT OF S-EXPRESSION FOR AN EXPANDED GRAMMAR
A, III LISTING OF THE PUNCHED CARDS FOR THE S-EXPRESSION FOR THE EXPANDED GRAMMAR
B SAMPLE DERIVATION TEST
C SELECTED EXAMPLES
•'· I
"i:,11111111_•;111!!\S!ll!,!!!!!!!"!-•t!!II. -a--------;;w-...--~,-~ ..;"l .
BLANK PAGE .... .
, ,, '' I
,, "'r~~~~ .?---1~~ - _.....,.,.., ·"' .... _--It""""
.,
t
.,
1.
I I
,,, 'r l
t 1
1
1. 0 INTRODUCTION
This part of the report describes the implementation of a
process for compiling and updating transformational grammars
and a process for testing such grammars. Both processes
were written in LISP 1. 5[3
] and some knowledge of that lan
guage will be presumed in these notes.
1. 1 Compiler
The Compiler facilities provide a notation and a transla
tion-expansion procedure for converting an input grammar on
punched cards into l:in expanded grammar, which is in the form
required by the Derivation Tester. The notation of the input
grammar is described elsewhere in this report. Figure 1 pro
vides a description of the conceptual organization of the trans
lation-expansion procedure. Figure 2 gives a more detailed
outline of the flow of control of this process. The reader who
wishes to follow the flow of control further is directed to the
individual function descriptions (Section Z).
The output of this process, the expanded, translated, and
.updated grammar, is a LISP s-expression[3]_ The conceptual
form of the a-expression is that of a tree structure, e.g.,
ds _f I y 1 2
I
1 2 •••
I 1 2 •••
I VP= V NP
2
Appendix A contains a sample input grammar, a printout of its
expanded form, and the a-expression for the expanded form.
1.. 2 Derivation Tester
Within this system, testing a grammar is a conceptually
simple process of checking whether it will generate the struc
tures that it is intended to produce. In order to accomplish
this objective, the user must specify for each structure the
sequence of rules which he hypothesizes should be applied in
order to produce it. A deck of cards, known as the Derivation
Test Packet, with one rule number per card, is used for this
purpose. Figure 3 Ulustra.t s the process of testing a given
expanded grammar. Figures 4 and 5 illustrate, in much
greater detail, the flow of control during testing. Still great~r
detail ia provided in the function descriptions(Section 3). As
part of the program for derivation testing, some functions
were created to accomplish the matching of proper analyses
in structure trees. These functions, which are of rather
general interest, are discussed in Section 4 below. Appendix
B includes printouts of several sample derivations.
Z. 0 FUNCTION DESCRIPTIONS FOR T: .. 'iE GRAMMAR COMPILER
z. 1. Pica so [ ~; !!] Arguments: x is any s-expression[3] to be printed.
n is the number to be assigned to the
current level. (initially, usually i)
Description: Prints x in a form where substructures are in
dented according to their depth. The depth number is also
printed. Used to print the a-expression for the expanded
grammar.
Requires subfunctions: Dopnt, Leonardo, Prtchar 1.
Example: See Figure Z
Remarks: For best results, the verbosity of the garbage
collector[3] should be suppressed.
Z. Z Dave []
3
Description: Sets the free variable expgrm to the value of the
function Gutain []; that is, the a-expression for the ex
panded grammar.
Remark: See Figure Z
Z. 3 Gutsin [] (Grammar Update and Test System INput translator)
Description: Reads input cards representing the rules 1:>f a
grammar until an ENDOFALL card is encountered, at
which time it returns as value the cumulative expansions
of these rules. Thia accumulation of rules is referred to
as the a-expression for the expanded grammar. The new
rules are accumulated on the a-expression expgrm which
may be set to an existing grammar for updating purposes
or may be initially set to ((CS)(UT)(BT)(STRT)) - the
headings for Constituent Structure rules, Unary Transfor
mations, Binary Transformations, and the set of initial
strings, respectively. The schematic in Figure Z illus
trates the reading of these rule types by Read6 [] and
their subsequent processing within Gutsin [ ].
Requires: Read6, Buread, Transf, Stots, Treescan
Remark: See Figure 2
---- - -
4
Z.4 Read6 []
Description: Reads one card record from the current input
device (7Z columns). Returns as value a list of symbols on
the card. Any string of alphabetics or any string of numer
als separated by commas or blanks constitutes a symbol to
this function. Used for reading IF rules*, rule names,
control cards, and derivation cards.
Z. 5 Buread [~]
Argument: x is vacuous; that is, it is an artifact of a pre
vious version of the function which survived to this time.
Description: Causes one Bracket-expression form to be read
from cards, translated, and expanded. Returns as value
the grouped, sorted, and expanded corresponding B-expres
sion. This is the main function for processing CS rules.
Has the effect of filling the character matrix Ai and passing
control to Bureadi . .
Requires: Carrcharray, Bureadi.
Remarks: See Figure 2; see also Appendix C.
2. 6 Bureadi [ 3)
Argument: .?! is the greatest depth, in cards, of the current
Bracket-expression form.
Description: The character matrix Ai (~; 72) contains the
Bracket-expression form. This array is printed by
Printarray. The Scan function creates the corresponding
B-expression for the form. Thus, a B-expression is the
representation of a Bracket expression as an a-expression.
The B-expression is expanded, then grouped and returned
in a form for attachment to the current grammar.
•IF rules express context restrictions on the current string .£!·
Requires: Printarray, Mkpairsfrmgrp, Group, Expandr,
Scan,
Z. 7 Scan [ i; l; ipu; ip.t; 1E!_; i.e!_]
Arguments: i = the current row index
l = the current column index
ipu = the present row upper limit
!P! = the present row lower limit
JE!_ = the present column right-hand limit
JE! = the present column left-hand limit
Description: A function which is used to translate that part
of the matrix (Ai) of character elements A 1 (_!,; 1) frorn ipu = ( i present upper) to ip.l = (_!, present lower)
and if!_ = (1 present left ) to J.e!:_ = (1 present right),
which constitutes a well formed Bracket-expression, into a
linear S-expression form called B-expression. The
translation replaces:
Bracket-expression+
* • and
(A)
-with- B-expression
(ORR A B .•• )
(ORR A XO)
Requires: Scanbox, Par, Mkatom
Example: Bracket-expression
R16 *
*
* •
ONE
INT TOT
* IFPL * (OTHER) (REL CMP)
• *
+ The braces implied by the four asterisks (the "asterisk box") are included in the figure for purposes of legibility, but do not actually appear in the input or output of the system.
5
becomes: B-expresaion
( (R16 ( (ORR ( (ORR INT TOT) IFPL) ONE) ( (ORR OTHER
XO) (ORR (REL CMP) XO) ) ) ) )
Remark: See Appendix C, (the output of Scan is the input of
Expander, in the function Buread1)
Z. 8 Mkatom [_!_; j_; .if!.] (Make atom)
Arguments: i = current row position
l = current column position
J.E.!:. = column right-hand bound.
6
Description: Returns as value the atom whose first character
starts in column 1 of row i of matrix Ai, but cannot exceed
JE!_. Creates an atomic symbol from a sequence of non
blank characters.
Z. 9 Par [ i; 1] (Find Right Parenthesis)
Description: Scana row i of Ai from column 1 until an un
balanced ')' is encountered. The column number of that
')' is the value of Par.
Z. 10 Scan box [ i; li ~; U ; J!; .J.!.] Arguments: _! and l are row and column indexes, respectively.
~ and .J! are the coordinates of the upper left hand • of an
• box. U and 1!, are vacuous.
Description: A 1ubfunction of Scan for translating an • box.
A function on the matrix Ai.
Requires: Scanboxb.
z. 11 Scanboxb [ i; j; iup; Up; .i!.P,; J.!:E.]
Arguments: i, l are current row and column indexes.
iup = row number of the top of the • box
Up = row number of the bottom of the • box
J.!£ = column number of the left side of the • box
..i!£ = to be determined, the right side of the box.
Description: Returns as value the B-expression for the im-
pJ.ied * box.
Requires: Testar, Scan.
Z. 1 Z Te star [ iup; i; l] Description: Predicate tests if an * occurs in the 1th column
of A1 above row_!, but not above iup. (row 2 is considered
to be above row 3. )
2. 13 Expandr [~]
Description: Where ~ = a B-expression such as produced by
Scan [ • • • ]. The value is the result of removing all "XO"
from each substring of the neet form of Expand [ ~] ; [i. e. ,
Mknt [Expand [ x]]] unless that substring consists only of
"XO", in which case the substring will appear as "NIL".
We shall call this a list of proper simple expressions.
Remark: See Appendix C.
2. 14 Mknt [~] (Make Neet)
Description: Transforms~ of the form (((A(B(C(D))))(E F G))
(H I J)) into the neet form: ((A B C D)(E F G)(H I J)).
(The output of Expand is the above form rather than the
neet form.)
2.15 Efiace[~;I.]
Description: Removes all expressions Equal to~ from list I.·
2. 16 Expand [~]
7
Description: Accepts as input a B-expression ~ such as pro
duced by the Scan [ • • •] function, and produces as output a
list of alternative "simple expressions" implied by~- This
subfunction of Expandr expands a compact B-expression
into it• list of implied strings.
.,. ,.
Requires: L91
2. 17 L91 [~; w1]
Description: A subfunction of Expand. xis current position
in w1, the B-expreasion that is to be reduced to a list of
simple expressions. Returns as value the implied list of
simple expressions.
Requires: Expand, L9f 2.
Remark: Modifies the free variable expandlst.
2. 18 L912 [k; !.i ~
Argument: !! = list of B-expressions to be expanded (may be partially expanded)
!. = a list of the form (ORR !t a 2 ! 3 •.. )
k = a list of the form (a. a. 1
... ) - -1. -t+
where the !' s are any B-expression.
Description: Returns as value a list whose elements are Ex
pand[,!!']' a, where n' i1 the result of substituting .!i for! on
n. Expand[n'] is done l'.Or all a. in k to produce the resul-- -1. -
tant list.
Requires: Expand.
Remark: Modifie~ the free variable ~andlst
2. 19 Group[~;~
8
Description: Where lst is a list of proper simple expressions;
returns as value a list of grouped and sorted simple expres
sions. The groups are numbered sequentially from ~· The
input simple expressions are grouped according to the IF' s
that they contain as described in the proposal. Within each
group the set of simple expressions are ordered low to high.
Requires: Sortlohigh, Noifgt, Ifnoif, Ifnoifeq, Selectif, Remif.
Remark: The effect of Group can be seen as the value of
Buread1 in the examples in Appendix C.
2. 20 Sortlohigh [~]
9
Description: Where x is a list of lists. Reorders x and num
bers from the free variable runo.
Requires: Sortlohi
Example: if runo = 2
Sortlohigh [ ((ABC)(B CUT)(A))] = ((2 A)(3 ABC)(4 B CUT))
2. 21 Sortlohi [~] synonymous with Sort2 [~] or Sort1 [~]
Description: Where ~ is a list of lists to be ordered alpha
Letically in ascending order.
Sort2 [ ((ABC)(B CUT)(A))] = ((A)(ABC)(B CUT))
Requires: Lohi
Remark: The sort order can be observed in the printout of
the expanded grammar, Appendix A, part II.
Z. 22 Lohi [~_; I_]
Description: Predicate tests if list.! is alphabetically lower
than list I· Requires: Lap (LISP assembly language)[3] subroutine
Lohiprintnm
Example: Lohi [(AB); (A C)] = T
Lohi [ (A); (A C)] = T
Z. 23 Noifgt [.tat; !!.1
Description: Predicate is true if there is no atom IF/ fol
lowed by a number greater than!!. OQ the S-expression .tat.
Z. 24 Ifnoif [.tat]
Description: Predicate is true if the atomic symbol IF/ does
not occur on the S-expression .tat.
z. 25 Unoifeq [ .tst; !!.1
Description: Predicate is true if there is no atom IF/
' I
followed by the number!: on the s-e>r::pression 1st.
z. Z6 Sele ctif [ .tst; _!:]
Description: Returns as value all lists in the a-expression
.tst which contain an atom IF/ followed by the number !:·
Requires: Member1
Z. Z7 Memberi [~; :r_; ~]
Description: Predicate is true if I. immediately follows ~ on
list z.
Z. ZS Remif [ .tat; _!:]
Description: Rem_oves all lists _! on the a-expression .tst for
which Memberi [IF/;~;_!] is true.
Z. Z9 Mkpairsfrmgrp [~]
Description: Numbers the groups of simple expressions~
from the free variable number ngrp. ~ is usually the out
put of Group [ • • • ] •
Z.30 Printarray[ai; i;l;!!_;jJ_]
Description: Print array ai from row .. ~ to row ii from
column 1 to JJ.. Remark: The results of Printarray calls in Buread 1 can be
seen in Appendix C.
10
Z. 31 Carrcharray [ x; i] (Card Character Array)
Arguments: ~ is firs; character in current startread buffe1·[3]
i denotes current row number.
Description: Reads cards until an EOF or a period in
column i is encountered. Stores each character of the
card as an element of the array Ai. Ordinarily cards are
read and stored in columns 1-71 of Ai, but if a '/' appears
in column 1, the subsequent characters go into 7Z-i i 9.
Requires: Charrayl
z. 3 Z Charray1 [ ~; i; .! ]
Description: Stores away in A1 each character of the current
card. That is, it fills a row or half-row .
Z. 33 Stots [] (Store Transformation)
Description: A function to read a transformational rule and
convert it to the standard form for the Grammar tree. A
subfunction of Gutsin.
Requires: N extnonblankafte r blank, Findatoms-dropplus, and
Expandr.
Example: EEE $ X rT *} *M ):c X ING V
*EN• HAVE *BE •
0 1 z 3 4 5 0 1 z 4+- 3 5
Value is .•••
((6) ($) (6) (5) (X) (5) (4) ((M) (V) (HAVE) (BE)) (3) (3) ((T) (ING) (EN)) (4 -) (2) (X) (2) (1) ($) (1) (O) (EEE) (0))
$
6 6
Remark: The transformational rules are either a single (Kx72) matrix of characters or a (Kx72) matrix followed by a card with a '/' ("slash") followed byan(Nx72) character matrix.
Z. 34 Nextnonblank [~; 11 Description: Finds the next non-blank character object in row
:!!_ of the matrix of character elements A1 (10, 72), starting
in column l· The value of the function is l', the column
containing the first non-blank encountered to the right. If
no non-blank is encountered by column 71, the value of the ·-·
function is 71. A subfunction of Stots [] .
2. 35 Nextnonblankafterblank [1; ~]
Description: Has as value the first column l', of row u of
11
Matrix Ai (10, 72) which has a non-blank character object
after the character object blank to the right of column l· If such a column is not found by column 71, the value of the
function is 71. A subfunction of Stots.
2. 36 Findatoms-dropplus [ l; J!_; ~]
Description: A subfunction of Stots [] . Operates on matrix
of character objects Ai (10, 72). Its value is the list of all
objects separated by plus '+' and terminated by 'blank' on
row = !!!!!.. between and including columns .J. to jr. If a blank
is encountered, or J!. = 1, the value is NIL.
2. 37 Trans£ [~]
12
Argument: ~ is an S-expression representing the transforma
tional rule, usually prepared by Stots.
Description: This function numbers and groups the input into
a form compatible with the general form of the expanded
grammar. The a-expression for this compatible form is the
output of the function.
Requires: Mkpairsfrmgrp, Group, Mknt, Expand.
2. 38 Trees can []
Description: Reads in one character matrix containing a two
dimensional tree; returns as value a standard a-expression
representation of the tree.
Requires: Strmtx; Printarray, Triescan.
Example: ,:-c E-:-,F
becomes (A(B(C))(D)(E(F)))
Remark: See example in Appendix C.
2. 39 Strmtx [~; .!]
Arguments: xis initial character on the i th card.
i 3
Description: Atomic symbols on the i th card are stored in
matrix Ai ?. & the (_!, l) th element; where l is the column of
the first character of the atom. A subfunction of Tree scan.
Remark: Works only for literal atoms (no numbers).
Z. 40 Tries can [ cui; cuj; ilw]
Arguments: cui, cuj = the current row and column indexes in Ai.
Uw = the current lower extent (in rows) of the tree.
Description: A subfunction of Treescan. Operates on the
symbol array Ai to produce the standard s -expression for
the contained tree.
Requires: Extnf.
2. 4i Extnf [ .!_; l• ilw]
Description: Finds the extent of the (.!,, j)th node (i.e. , the
number of rows of Ai required by the descendants of
Ai ( i, l)).
Remark: For the example given with Tre e s can (in Appendix
C), the extent of the A is 3 (i. e. , Extent [ i; (the col. no. ·,
of A); 4] = 3).
3. 0 FUNCTION DESCRIPTIONS FOR THE DERIVATION TESTER
3.1 Deriv []
14
Description: Tests a given packet of derivation cards, which
specify the application of grammar rules, for consistency
with the current expanded grammar, which is bound to the
free variable sym.bol expgrm. The process is terminated
when it encounters an OUTPUT, OUTP, or ENDUP card
or whenever it exhausts the grammar or encounters a fatal
error. This function does CS rule testing and then passes
control to Derivtrans [] to test the transformational rules.
Requires: Read6, Curtrstr, Fstsubrlof, Spread, Nomorecs,
Evalcs, Groupapplies, Getpsg, Tiftst, Applycr, Bpi,
Derivtrans.
Remarks: Figure 4 illustrates the flow of control in Deriv [ ].
See Appendix B for examples of the use of this function.
3. Z Curtrstr [] (Current Tree and String)
Description: Creates initial current string, bound to the free
variable cs. Creates the initial current tree bound to the
free variable ctr. Returns a list of these two structures
as value, but is executed primarily for its effect on.£!_ and
ctr.
Requires: Getpsg.
3. 3 Getpsg [ !i f!.i Ei_i E.!.8.1 (Get Present Subgroup)
Description: This function gets the subgroup for ! (for ex
ample: CS) with rule number~ .. group number a, sub
group ~• out of the expanded grammar expgrm. U no
such item is found, it returns the value NIL.
Example: Getpag [CS; 4; Z; Z] = (Z VP= V NP).
3. 4 Fstsubr .lof [ E.!_i 3J (First subrule of)
Description: Returns Getpsg [CS;~; _s; 1]; that is, the
first subgroup of group _s of CS rule~-
3. 5 Spread [ x]
Argument: x = a list of symbols read from a derivation card
by Read6[ ].
15
Description: If~ = (OUTPUT), then the function returns the
value NIL. If x is of the normal form for a derivation
card (that is: a sequence number followed by the rule type,
rule number, and optionallyanRfollowed by the group and
subgroup numbers), then the following free variables get
tr.eir respective assignments:
seqno (sequence number~ f!_ (rule number),and optionally
a (group number~ E.!K (subgroup number).
3. 6 Nomorecs [] (No More CS)
Description: Tests if there is no rule equal to CS~
Requires: Fstsubrlof.
Remark: See Figure 4.
3. 7 Evalcs []
Description: Predicate tests whether the symbol on the left
side of current subgroup, .£!.&, is contained in the current
string.£!·
3. 8 Groupapplies [] +
Description: A predicate which tests if all the IF/n' a• that
can be found in .£!.I apply to the current string .£!.· Uses
fu,nction Listi£ [cdddr [cag]; IF/] to form a list of the IF
numbers present in .£!.i· The predicate Applyif[u] is used
+ This functio 1 will no doubt be changed in the future.
• IF rules express context restrictions on the current string .£!.·
on each IF number present in~ until either it fails, in
which case Groupapplies fails, or it exhausts all IF' s in
,;sg, i.n which case Groupapplies succeeds. On success,
the free variable iflst is assigned the list of cells in.£!,
for which all IF' s succeed.
Requires: Getcells, Liatif, Applyif.
3. 9 Getcells [ u]
Description: A subfunction of Applyif [~] . Forms a list of
all sublists of.£!_ which begin with ~-
Example: If~= (AB A CA),
then Getcells [A] = ((A B A C A)(A C A) (A)).
3. 10 Listi£ [ !i u]
Description: Lists all n. in u which follow an x, where the -t
~i are numbers.
Example: Listi£ [IF/; (A= B IF/ 1 C IF/ Z)] = (1 Z)
3. 11 Applyif [~] +
Description: Tests if all IF /ni apply to cs, where u =
<!!.1 • • • ni · • • ).
Requires: Member3+, Memberz+, EffaceZ, Getassocif.
3. 1 Z Getassocif [ u]
Description: Get r ·ule IF/u associated with rule er. A sub
function of Applyif.
3. 13 MemberZ [!; I]
Arguments: x, a list of symbols given as a pattern;
I,, a list in which the pattern match ia to find a
match (usually ~).
+ These functions will no doubt be redone in the future. At present, they are little tested and possibly not well defined.
16
Input free variables: alf- -the current iflst,or list of cells
(normally of.£!) which contain the current symbol as
car[] and have passed previously applied context restric
tions; u2--the current IF rule, which contains a***
element, which must match the current symbol; ~--the
current string.
Description: This function returns as value the list of ele -
ments of alf which corresponded to the *** in u2 when~
(the pattern part of u2 with the current symbol substituted
for ***) is made to overlay all segments of I that it
exactly matches. This admittedly complicated function is
used to test if a given context occurs and, furthermore,
if a particular element appearing in that context is a mem
ber of the set of possible current symbols.
Requires: Member 3.
3. 14 Member 3 [ _!i y]
Description: Lists all cells of x_ which are the concatenation
of list~ with anything. Used to test for the occurrence of
a given context.
Example: Member 3 [ (A, B); (R, A, B, C, A, B, A, B)]
= ((A, B, C, A, B, A, B)(A, B, A, B)(A, B))
3. 15 Efface2 [ x; }:]
Description: Removes all items on list! from list I· [ every
occurrence]
3. 16 Tiftst [] •
Description: Tests whether CS ~ R ll• E!i. does not hold for
17
* Tiftat is not complete at this time, but will be rigged to always give the value NIL. The main reason for this is that, as of yet, no TIF rules exist in the CS section of the current test grammar.
0
all TIF' s• mentioned in the rule. Removes from iilst
(the list of instances which survived all IF tests) those
cells which the TIF conditions eliminate.
Requires: Treematch.
3. f 7 Treematch [ !; I,]
Description: Where: ! is a pattern tree I. is an ordered list of input trees
Predicate tests if tree ~ can be found among I.· If the
pattern~ contains an •••, which can match any single
node, then the matched node, if found, is returned as
value. There are three possible values:
NIL (cannot be found)
T (found, but~ does not contain a ***) (node).
Uses Treetop, which requires terminalst.
3. f8 Treetop [!; I,]
Description: Where: ! is ordered list of pattern trees,
f8
I. is an ordered list of input trees
Predicate tests if all pattern trees can be fitted, in a left
right ordering, to the ordered input trees. The fitting
must be anchored at the head of each matched pair. Re
quires free variable list terminalst (a list of terminal
cells of y). If there is a terminal ••• in !, the matched
terminal node is given as the value. There are three po11 -
sible values:
NIL
T
(node)
• TIF rules are context restrictions on the current tree.
3. f 9 Applycr [] =
Description: The purpose of this function is to rewrite the
current string £!_ and the current tree ctr. This is done
by inserting on£!_ the rewrite section of~ for the first
cell of ~ that appears on list if.let (the list of £!. terms
which survived all IF/ and TIF/ rules).
Requires: Member 4, Treeterminal, Subsk.
3. ZO Member4 [ ~• IJ Description: Similar to Member 3, but works on a list of
terminal nodes of the tree I.· Also gives first occurrence
only.
Example: Member4 [ (A, B); ((R)(A) (B)(C)(A)(B)(A)(B)]
= ((A)(B)(C)(A)(B)(A)(B)).
3. Zf Treeterminal [ !,]
Description: Lists all terminal list nodes of~- Treeterminal
[ (L(A((C)(D))(B(C))) (A~C)(B(C(D)))) (A(B(C)))))]
= ((C)(D)(C)(C)(D)(C)).
3. ZZ Subsk [_!; I,i !)
Description: Substitute x for y on z. One occurrence only.
3. Z 3 Bpl [!,)
Description: Print tree .! in the form shown in the example
below. This form is called the subscript tree print.
Example: Bpl [ (A (B) (C (D)))] prints as:
( B ( D))
A C
3. Z4 Derivtrans []
Description: This function tests the transformational rules
called for in the derivation packet and tests for their
consistency with respect to ~ ancil the current expanded
,, ., .
f9
,.
,, 20
grammar.
Requires: Finddeepest, Sonof, Getpg, Upair, Spread, Read6,
Properanalysis, Dotrn, Bpl, Members.
Remarks: See also flowchart of this, function (Fig. 5).
See Appendix B for samples of this function's action.
3. 25 Finddeepest [ .!• !!..!!• !_]
Description: This function gives as value the leftmost of the
set of deepest subtrees in tree which have root ! and which
are not on list I..
Example: Finddeepest [S; (S(A(C(D)(R(A)(S(A))))
(B(C(S(A(C))(B)))(S(B(S(C)(A))(D))))); ( )]
that is, tree =
Requires: Memberr
3. 26 Memberr [!; x]
value is (S(A))
Description: True if~ is Equal to some member of list !_.
3. 27 Sonof [~
Description: The value of this function is the list of node pairs
((~t • r1 ) ... (!;_· 1.t» such that node !;, has the parent~ in
the ancestral tree ~- ·This value is used in the Proper
analysis function.
Example: Sonof [ ((A(B(C)(D))(E)))] = (((A(B(C)(D))(E)). ((A(B(C)(D))(E))))
((B(C)(D))· (A(B(C)(D))(E))) ((C).(B(C)(D))) ((D)·(B(C)(D))) ((E).(A(B(C)(D))(E))))
. . ".
3. ZS Getpg [ ~• cr9] (Get present group for transformational rules)
Arguments: n is either UT or BT
cr9 is a rule number.
Description: This function returns as value the a-expression
which represents transformational rule ~ cr9.
Requires: Sass9c
Example: The external Bracket-expres aion is:
UT9
Q
1
3 + 1
(WP)
z z
AUX
3
0
then the value of Getpg [ UT; 9] is
(((i Q WP AUX)(2. Q NIL AUX))((1 3 1)(Z Z)(3 0)))
3. Z9 Sass9c [~J :ll ~
Description: Ideniical to Lisp function Sassoc, except that it
uses Equal to test for equality rather than Eq.
3. 30 Upair [ ~ (Unpair)
Z1
Description: Where! is an a-expression of the following form:
((!o · (~o bo1 · • · )) · • · (~ · (~o E.n1 .. · )))
Upair returns as value:
((!o !.1 · : ··. !n)((~o ~01 · • · ) · · · (~no ~1 · · · )))
Example:
Upair [((1· (3 1))(2,(2))(3·(0)))] = ((i Z 3)((3 1) (2) (0)))
3. 31 Properanalysis [ !] Arguments: .! = cons[!!:,!!; cons[names; pattern,]]
Description: This function provides a rather powerful ability
to do pattern matching in trees. Within the scope of the
derivation testing, its purpose is to test if the list given
0
...
22
as patterns can be considered a proper analysis in tree.
If it can, then the corresponding nodes of the tree are
paired with the corresponding names and the resulting list
of pairs is given as output. Otherwise, the output is NIL.
After establishing the free variables patterns, names,
and mpairs, a test is made to see if the atoms which oc
cur in patterns occur in tree. If this test fails, Proper
analysis fails. Otherwise control is passed to Fndp:rop
analysis. This function and its subfunctions are of suffi
cient interest to be discussed separately in more detail
in Section 4.
Requires: Part, Listofatoms, Fndpropanalysis.
3. 32 Part [ I_i z]
Description: Tests if each atom of list I. is a part of
s -expression !·
Example: Part [ (A); A] = T
Part [ (A B); (B (A (C B)))] = T
Part [ (A B); (B (E (C B)))] = F
3. 33 Listofatoms [ !]
Description: Makes a list of all atoms in a-expression~
(one occurrence only).
Requires: Union
3. 34 Union [ ~• ~
Description: Where~ and.!!. are lists representing sets.
Returns a list representing the union of the two sets.
Example: Union [ (A B CA); (A C E)] = (A B C E)
3. 35 Fndpropanalysis [ u] (Find proper analysis)
Arguments: u is the current tree.
free variables: patterns, names, and mpairs.
•
•
•
•
Description: This function tries to find a match for the first
elements of patterns for which P-a[ ... ] can find matches
for all the rest. The variable mpairs will contain the
final value. Fndpropanalysis [ u] tries all nodes of the
tree u, until it succeeds or exhausts the tree. The order
in which the nodes are tried is given by the recursion:
Fndpropanalysis [ ~
[make tests; if they succeed return T, otherwise:
r := Fndpropanalysis [ Car [~]] ;
r-return [r] ;
otherwise T-Fndpropanalysis [Cdr[ u]].
Requires: P-a.
3. 36 P-a [~; E,i ~J mpairs)
Arguments: x is current tree
f is current list of pattern elements
n is current list of names
mpairs is current list of matached pairs of
pattern elements and matching nodes.
Definitions of the pattern elements of f are given in
section 4. 0.
23
Description: If E.i (the current first pattern element) is a
literal pattern element, then P-a must find a match on the
content of the node x or the content of its leftmost descen
dant node ~• (cadr[x]) or cadr [x'], etc. If no match can
be found, a terminal node will be encountered and P-a
fails. If, however, a match is found at some node xi,
then xi is paired with ~i (car[n]) and appended to the list
of matched pair (mpairs). Then the function returns the
value of
--- --------- -
.. ,,
24
P-a [ Nxtcontiguous [xi]; cdr[E]; cdr[n]; mpairs].
When P-a finally exhausts p, it returns the value of
mpairs. In the case where p 1
is an indefinite pattern
element, successively longer sequences of contiguous
nodes will be paired with p 1
(starting with none (NIL)). If
P-a continues to fail for all these cases, then this process
will be repeated for !', x" . . . x\ etc. until either P-a
succeeds or all such combinations are exhausted.
Requires: Nxtcontiguous, Comitrin, Gtname.
Remarks: For additional information about this matching
facility, see section 4. 0.
3. 37 Nxtcontiguous [!; ~] (Next contiguous node to !)
Arguments: ! is a node in a tree and~ is a list of son-father
pairs for some tree.
Description: Returns as value the next node to the right of u,
that is, the right-hand sibling if it exists; otherwise, the
right-hand sibling of the most im1nediate ancestor which
has siblings.
Requires: Memberr.
Remarks: "Contiguous" spelled "contigious" in the program.
3. 38 Comitrin (left; order]
Description: A function obtained from the METEOR report[4]_
This function is employed here to evaluate arguments of
matching functions which occurred as pattern elements in
Properanalysis.
Requires: Gtname.
3. 39 Gtname [name: f!.!.]
Description: Evaluates the expression name with respect to
the list of variable bindings f!!.·
Requires: Copytp.
3. 40 Copytp [ x]
25
Description: Makes a copy of list x.
3. 41 Dotran [u; tr;~] (Do the Transformation)
Arguments: ~ = a list of dotted pairs of the form:
((name . treepart )(name 1
. treepart 1
) . . . n n n- n-
(name ( treepart1
))
tr = a list of pairs of the form:
( (name 1
• (name x1 ... ) )(name
2. (name yi ... ) ) ... )
ct = the current tree in which the named tree
parts are found.
Description: This function finds the associated treepart in ct
given by u, of the left member of each pair of tr and re-- -places it with the list of treeparts given in the right mem
ber of the pair. Thus Dotran has the effect of transform
ing ct according to tr. For a given left member of tr, if
either its associated right member on~ is null, or its
associated right member on tr has only one element and
that element is identical with the left member, then no
change in ct is made. Deletion is signified by a single
right member of tr, that is, either EEE or zero. Any
member of a right member list of tr which has no associ
ated member on u will be inserted as a literal node.
Requires: Getallnode.
Example: Arguments of Dotran
~ = ((6 +) (5 (IP (TO) (NP (N (PROP (DAVE))))) (MAN (BY)
(NP (N (PROP (DORITA)))))) (4 V (HAND)) ( 3 ED) (Z (NP
(DET (THE)) (N (COM (BOOK)))) (AUX (T) (BE))) (1 +))
!:! = (( i i) (Z Z) (3 0) (4 4 3) (5 5) (6 6))
26
ct= ((S (+) (NP (DET (THE)) (N (COM (BOOK)))) (AUX{]) (BE))
(ED) (VP (V (HAND)) (IP (TO) (NP (N (PROP (DAVE)))))
(MAN (BY) (NP (N (PROP (DORITA))))))(+)))
Value of Dotran
((5 (+) (NP (DET (THE)) (N (COM (BOOK)))) (AUX (T)
(BE)) (VP (V (HAND)) (ED) (IP (TO) (NP (N (PROP
(DAVE))))) (MAN (BY) (NP (N (PROP (DORITA))))))(+)))
3. 42 Getallnode [~; y; z]
Arguments: ~ is a node about to be replaced.
r, is a list of the names of the nodes that are to
replace~-
~ is a list of dotted pairs (usually the ~ in Dotran).
Description: This function returns as value the node that is
to replace ~-
..
4. 0 ON MATCHING ARBITRARY PROPER STRINGS IN TREES
27
A general pattern matching capability similar to that pro
vided by the string pattern 1nanipulating languages SNOBOL[ 1 ],
COMIT[Z], etc. has been developed within the context of a set
of strings, known as proper strings, which is definable on a
tree. The facility gives the user the capacity to carry out a
rather powerful set of pattern matching operations in trees.
The algorithm is programmed in LISP 1. 5[3] and is utilized as
part of a computer system. for testing transformational gram
mars, where it serves to perform the pattern matching in
volved in checking for applicability of transformational rules.
4. 1 Introduction
One of the more interesting, if not entirely new, ideas in
the field of procedure-oriented languages is that one can base
a general-purpose programming language upon the concept of
pattern identification. Just how this can be achieved is not
going to be described in this note, but, for those who wish to
pursue this topic, there are some references in the biblio
graphy. Before proceeding to a description of a small exten
sion of current capabilities, one general statement will be
made in this connection: namely, that the specification of pat
tern criteria, the identification of the pattern elements, and
the subsequent construction of new patterns which contain pre
viously identified elements, is a natural way for humans to
describe processes.
The use of trees as models of structures is well known
and has wide applicability. One such model is that in which
each node identifies, classifies, or otherwise describes the re
lationship of the set of nodes it dominates. For example, from
linguistics we get the following incomplete model of a sentence:
,, (
This model implies, for instance, that:
(NP AUX V NP to NP)
is a legitimate sentence form; or, in more detail, a noun
phrase (NP) followed by an auxiliary (AUX) followed by a verb
(V) followed by (NP to NP) is a sentence form that can be gen
erated in English. Note the importance that the order of
28
nodes has. For example, (AUX NP V NP to NP) is not im
plied by the above tree, but (NP AUX V NP to NP) is. Note
further that (NP DET AUX V NP to NP) is not implied by the
tree, as the DET is a part of the NP. In this case, NP is said
to dominate DET. Also note the (NP VP) is never an adequate
description of a fragment of the sentence modeled by the tree,
as there must be an AUX after NP and before the VP. Thus
we have examples of the constraints of order, contiguity, and
non-dominance.
In t~sting for applicability of transformational rules, it is
typically required to be able to identify the occurrence of a
particular sentence fragment: e. g. , (DET N) in the current
structure. This fragment does, in fact, satisfy the above
mentioned constraints of order, non-dominance, and conti
guity. Any arrangement of the nodes of the tree fulfilling
29
these three requirements will be called a proper substring, a
concept which linguists refer to by the term "proper analysis".
Two nodes, ~ and y_, in a tree_!, are said to constitute a
proper substring of.! if y_ is to the right of ~ and is either (a)
the node that can be reached from x by ascending in the tree
until a righi-adjacent branch is found and then descending one
level on that branch or (b) one of the set of nodes that c,\n be
reached from~ by continuing down the path deocribed in (a),
always taking only leftmost branches. For example, in
starting from the leftmost DET node in (4. 1. 1), a right-adja
cent branch is found at the NP node immediately above it,~ and
the nodes N and PROP are encountered in following the down
ward path; thus, (DET N) and (DET PROP) are proper sub
strings. In the case of the leftmost PROP node, the ascending
portion of the path continues all the way to the S node before a
right-adjacent branch (the one leading to AUX) is found; the
proper substrings here are (PROP AUX)and (FROP T).
Given the above definition, the set of proper substrings
for a tree can be defined recursively as follows: An ordered
set of nodes (n1
, n2
, ••• ?\) constitutes a proper substring if,
and only if:
k = 1 or
n. n ... is a proper substring for i = 1 to k-1. 1 1+ .l
One can order the set of proper substrings according to
two criteria: first by depth, then by leftmost-ness. Ob
serving this ordering, a partial listing of proper substrings
for the above example tree (4. 1. 1) is as follows:
4. 1. 2 S
NP
NP AUX
NP AUX VP
NP AUX V
NP AUX V NP
NP AUX V NP IP
NP AUX V NP to
NP AUX V NP to NP
NP AUX V NP to DET
NP AUX V NP to DET N
NP AUX V NP to DET PROP
NP AUX V DET
DET N
N
PROP
30
Having defined an ordered set, it is meaningful to pick the
first member of the set for which some criterion holds. In
this case of the set of proper substrings, the criterion em
ployed is equivalence to some specified pattern.
4. 2 Pattern Specification
A pattern is specified as a sequence of elements which
must occur in the same sequence in the object string. Pattern
matching consists of identifying with each pattern element this
corresponding portion of the object string.
(• In this example only the content of the node is given, but what is actually implied is the node and all it dominates. )
Example:
sample pattern
1A 1 'B'
'A' X 'B'
sample matching string
AB
where x is a variable which matches any string, including the
null string, and 'A', 'B' are literal elements. Another way of
expressing the pattern 'A' x 'B' is:
A$B
1 X 3
where each pattern element is identified by the assigned name
or numeral appearing immediately below it. The $ is called
the indefinite pattern element and matches any string, inclu
ding the null string. This notation is derived from COMIT[t]
and, more immediately, from METEOR[4J_ A variation of
this notation is used for specifying transformational rules:
The top line represents the pattern elements of a proper sub
string and the second line contains the names to be given to
the substring fragments that they match. A third line is pro
vided for specifying replacement.
A LISP function Properanalysis has been written which
provides us with the facility to specify a string pattern and to
identify its pattern elements with the nodes of the correspond
ing proper substring of a tree- -the corresponding substring
being the first one of the ordereJ set described in 4. i. Z for
which an exact match can be established. The list of nodes
corre,,ponding to a given element is herein called a fragment.
- - - ·-- -...c_ .,.. . -
31
. ' ,'( 32
4. 3 The Function Properanalysis [~
Where u is a list of the form: (tree, (names• patterns))
patterns = a list of pattern elements, ex: (p1 Pz .•• pk)
names = a list of names for the associated elemento,
ex: (n1 n 2 . . . nk)
tree = the ordered list of nodes whose ancestors' siblings
are as yet unmatched, ex: ((A (B) (C (D))))
for the node A
~ If a match cannot be found, the value of the function is NIL.
Otherwise, the list mpairs (for matched pairs) is returned as
value. mpairs is a list of the form:
( (name t" matching-structure 1 ) ..• ),
where name. is the i th
element of the list names, and matching-1
structure is that list of nodes of~ (and/or its ancestors'
siblings) which matches the i th
member of the list patterns for
the successful match. Allowable member types of the list
patterns and their meanings are:
4. 3. 1 Literal match:
If the pattern element is an atom, and that atom is not the
name of a previously matched fragment of the proper substring,
then the atom will match only an identical contiguous atom of
the proper substring.
4. 3. Z Back-referenced match:
li the pattern element is the name of a previously matched
fragment of a proper substring, then the element will match
only an identical contiguous fragment.
4. 3. 3 Indefinite pattern or "Dollars" match:
The pattern element "$11 will match any contiguous proper
substring fragment, including the empty fragment.
33
Note: In the future, a "fixed number of indefinite pattern
elements" match might be included. This would be of the form
($. n) where n specifies the number of elements to match.
Currently, we have had no occasion to use this type of capabil
ity, but it might well be useful in a more general environment.
4. 3. 4 The pattern element NIL:
In this case, the matching process simply continues as
though this pattern element did not exist; i. e. , it goes on to
the next pattern element.
4. 3. 5 LISP functions for pattern matching:
A pattern element of the form (FN function name 1
, name 2
• • • namek) is called a matching function. The idea of pattern
matching functions is probably due to D. Bobrow, and their
use here is practically identical to that described in the
METEOR report[ 4].
If the above matching function appeared as a pattern ele
ment, the LISP function "function" would have to be defined,
and it would continue the pattern matching. (Note: this would
allow violations of the set ordering, which might be desirable. )
function is a function of k+1 arguments, the first of which
is x, the current node in the tree at which matching is to take
place. The arguments, name 1
.•• namek, can be other
matching-functions, names of previously matched pattern
fragments, atoms or expressions. The matching function
must obey the following conventions:
'"-, ..
The entire tree, of which x is a node, is described by the list
of (node ancestor) pairs given by the free variable~·
Any segment of the tree which is matched (m-patterns) should
be paired with car[name] and mpairs set equal to
cons[cons[car[~ue]; m-patterns]; mpairs] , where m-pat
terns is assumed to be the list of nodes which constitute that
matched segment.
If the function fails to find a match, it must return the value
NIL.
4. 4 Some More General Comments ~ Matching Proper Strings !,!; Trees
34
While the operation of finding contiguous segment patterns
in a structure is an important operation when a tree structure
model is employed, it is by no means generally sufficient.
For instance, the requirement of non-dominance makes it
impossible to match many specifiable tree patterns. This re
quirement can, to a large extent, be overcome by the use of
matching-functions. Matching-functions do not, however,
meet the requirement for a natural and powerful means of
pattern specification. Certainly the facility to match complete
trees as literal pattern elements can be obtained immediately.
But what if such a pattern-element tree-literal matched com
pletely the top of a more developed subtree node? Would this
be considered a pattern match? This may be made clearer
by the fallowing example:
Consider the sample tree, 4. 1. 1 and the pattern specified:
It is obvious that the above pattern occurs in the tree. But
would one always agree that the following occurs?
(NP AiX VP)
33
This brings up the even more general question of whether to
allow tree-pattern elements with variables. A sample request
for such pattern matching might be:
Identify the pattern:
A, E, .A I
X
AB
in the current tree, where
*B* must be part of the current proper string; that is, (A E B)
is a proper substring and B is immediately dominated by an A
which dominates only a C which dominates an indefinite amount
of structure called x which has a terminal node A to the left
of a terminal node B, where A is not necessarily contiguous
to B.
It appears that we are at present on the threshold of this
kind of pattern matching facility. That is, a suitable set of
matching functions could be defined to do the requ .. red
matching. A ~nore convenient notation than matching functions
should be devised, but at least the basic facility is there.
4. 5 The Question 5!! Efficiency and the Combinatorial Problems Involved
The present proper-analysis function is a highly recursive
procedure with certain tricks to make it more efficient. More
such tricks will be added. It is critically important to identify
the certainty of failure at the earliest possible instance. It is
·" •. , r
precisely in the case of trying to find a pattern which does not
exist that the worst combinatorial problems arise. Accurate
timing data for illustrative pattern matching cases is not yet
available, but should become so as an outgrowth of applying
the Properanalysis function to the problem of transforming
linguistic structures.
4. 6 Conclusion
36
The proper-substring pattern matching i rees described
in this paper, along with the ability to add the generality of
LISP matching-functions, provide a usable way to identify pat
terns in trees. Application of this technique to testing genera
tive transformational grammars has been tried and should pro
vide interesting timing data in the future. Depending on the
result of future studies involving fast-fail tricks, it may be
possible to attempt an even more general matching of trees in
trees.
REFERENCES
1. Farber, D. S. , Griswold, R. E., and Polonsky, I. P.,
"SNOBOL, A string manipulation language". Journal of
the ACM, Vol. 11, No. 1, January 1964.
Z. An introduction!£_ COMIT programming. The Research
Laboratory of Electronics and the Computation Center,
MIT, 1961.
3. LISP 1. 5 Programmer's Manual, Computation Center
and Research Laboratory for Electronics, MIT, August
196Z.
4. Bobrow, D. G. "METEOR: A LISP Interpreter for String
Transformations, " THE PROGRAMMING LANGUAGE
LISP: Its Operation and Applications. Be1·keley and
Bobrow (eda. ), Information International, Inc., March
1964.
/ . .
37
~
" ~I
I In
put
Gra
mm
ar
V
I
I r
YI U
pdat
es
+
Exp
ande
d G
ram
mar
s-
expr
essi
on
,- Gra
mm
ar
expa
nsio
n an
d up
date
pr
ogra
m
l
Pri
ntou
t
I E
xpan
ded
~a
mm
u
~ ~~
:r,"
;;::
ion}
Pri
ntou
t o
f in
put
(see
App
endi
x A
, se
c. I
)
PIG
UR
E 1
. S
imp
le s
chem
atic
of
the
proc
ess
of
tran
slat
ing
a se
t of
gra
mm
ar r
ules
int
o a
mac
hine
pro
cess
able
gra
mm
ar.
(for
a s
ampl
e pr
into
ut.
see
App
endi
x A
, se
c. I
I)
>1
Exp
ande
d G
ram
mar
s-
expr
essl
on
(see
App
endi
x A
• se
c. m
)
PlGURE 2. Grammar Expanllon and Update Program: An Outline Plcuo: The print function
Plcuo (Dave Cl; 1 J
Printout of Expanded Grammar
Dave: A function to caet the free variable expgrm to the value of me function Guuin (the S-expresalon
for an expanded grammar).
expgrm:• Guuln C) Return rexpgrm1
Guuin: A function to read in grammar rules until an ENDOFALL card ls encountered.
11ne:•Read6Cl --If u:=f(Une 1
PlcuoC
grammar tree; 1]
Retum [ Punch [
grammar treell
Punch [
grammar tree)
read in and
prlnt rule w/ Buread. Add rule to
>..;;.;;.;;;._ ______ ,._. grammar tree.
Yea
Yea
Yea
Yea
Print C
---------t (SYNTAX ERROR)]
I
read in and print rule with "neeacan CJ Add rule to grammar tree
read and print rule with Tranaf [ Stout]] Add rule to grammar tree
read in rule w/ Read6 CJ Print the rule. Add rule to grammar uee
~
Ex
pan
ded
G
ram
nia
r a-e
xp
ressio
n
+
Deri
vati
on
T
est
Pack
et
Deri
v [
]
Reco
rd o
f G
en
e rati
o
) >
lan
d e
rro
r co
nfl
icts
Sim
ple
sch
em
ati
c o
f th
e p
rocess o
f te
sti
ng
a g
ram
nia
r fo
r co
nsi
sten
cy
wit
h a
n a
ssu
med
deri
vati
on
.
Fig
ure
3
... ~
Derlv [l
Line:= Read6[l
Derlv 2
curusut l
Deriv 21
er:= 1
Derlv 4
cg:• 1
p
PIGURI 4. The Derivation Teating Function Deriv(]:
print [INITIAL STRlNG NOT GIVEN]
Return [T)
Yea
Thia function testa for coruistency of the CS rulea and then puses conuol to Derivtrana t) for the uanaformadon rule testing.
Return (STOP]
applycr [) print [curule] print [csgJ
'---------1 BPI [ctr)
print [(ILLEGAL RUIZ NAMI;) CURULI]
Dertv 8 cr:-cr + 1 cg:•1 csg:•Psiaubr.fof ~-----(er; cg]
cg:acr + 1 c:o--- cag:•Psuubr.fof (er; cg]
F
ILLEGAL t) Return [STOP]
F
Return(()]
ILLEGAL C] Return [STOP]
..
"'1 ,
LP
s
p
ctr:•1ub1t {+1 11 otrJ n.«UT w:•T
ctrl:afinddeepeat [Sa cu1 · l .J aon:•aonof [cPlll [ctr11 ()]
l :•com [cu l1 l] u. .. T
cgl:•r. tcg) cg:•f [cg)
A r--....11~-------tranaf:•wpllr [cgl] analyll .. diddler [f [cgl]
G
R
w:•F pr:•prr n:•BT cr:•pr u:•F
FIGURE 5.
T~-----------prtnt ((derivation complete)]
return {DONE]
print [11st [curulea cag1 (wu applicable))]
u. .. properanalylla {cona [cirl1 con, [car [tranaf]; rt analylla) ]1] r. r [analylla)
m
Dotron [u: cgl; ctr] son:•aonof {11st [cull
analy11I:• diddler [f [cg]]
enor[l11t [caga(IWGAL DIRIVA'I10N)lcurule}l
=---.- --- - --- ~---
,.
;,
APPENDIX A, I
PRINTOUT OF AN INPUT GRAMMAR
I •
(From Gutsin [])
· - - - - --
;,
Fu" CT I LJ:,.1 ~~- --;:E-:-;V-;-A-;-L"CJU~On"iltiE;:---uH:-i"ATS-:tSuiE~E~N.--.E:"IiH~f.•E·li~EDr.,--,1r.:11::-::G~U:r.M'="e N~f~s-.·-.-------------( L hM UOA Nil CPltASO (DAVEi 1)1 ~ll .. .. ·· ···-··---------------------------------·---' STRT 1)
INSTl • S ·, cs .. 1,------------------~---------------·---
s • $ (PRE) NP AUX VP S (CS 2)
-· .. .,k.C•7·~ J I NI: G J CCS 3)
AUX• T DO C•M•I -··· ···--- ---- .-1 • ·-,cs 4)
VP. (HAVt: EN) (BE ING) •v c•NP•J •• ,, •• CMANI ITIMEI • •PPi hP --- --------•s •
•BE ADJ .. lcs 5)
t-4P • COP) N I SI &CS 6)
... .. .. pi' • PREP ,cs 7)
MAN • •~Y P• •AC\I •
ICS 8) TIME • IFREl,d CTUU CDUIU --·rrs-q1· --- ---- _ __;_ __________ _ PLACE• •COEST) CORIG>•
LOC •o, sf •
lCS 10) OP • CPO) OET
.. ,cs 11)
01:T • ART est (CS 12)
. AMT""'"-•--• iliotF• •OEF •
•
,cs 13) --~--~N~-~.-=s-=1..,..N=c""'E.,..R~I-T""'"Y•-,-------------------------------BOY IT ·-----=,---H~l~N-·G-------------------·- - ---------___.--LNE MA~ ·------------------------·---- ----------HOOK TABLE PLAN
•f-ACT .---------· . ·---
'
'
CCS l't) ____ y_•_•CU~ClSCEND•
ClSLIKE LEAVl: BtlHVl ·----h~~Pl-~~-=-------------------·----------1 t;f,1,1-'1
_____ ulV[ ______ _._ ________ _
Sl:t: CtCIOE
•CU,VlNCE • ---- --- - ·- --------------(CS 15) ACJ :c •~GI\EST•
GRH:N -- IALL ·---------------
IJEEP •fl~M • ···-n:.-rn;r··- · ----
Hz *uliGHT TO• CAN -----i.l LL _________________ _
*MU ST • ICS 17)
··--- - Pt<l:P . • - •cN•
•UF• CUT l - INDIRECT OBJECT INVERSIONI
I X NP 11' Y t - - ·------·--· 1.23 4 !>6 1 2 4 3 5 6 ·--e-,c, U~T 2 P,H).)··, VE_-,---------------·-----------------
' ~p ~ux V ITOI NP y BY SUM z s l i 3 4 5 6 7 I 9 10 ll 12 1 2 7 4+Ut+~U 5 b O 8 9 J l[ 12
CUT J TO UELETJONJ $ X V TO Y $ ---1 f-3-,. ·--·-5-6 ______________ _ --- ·- ·---·-l 2 3 G 5 6
CUT 4 MCV_E __ .:...> __________________________ _
$ X T 00 •M • Y S •ee•
14?34 ~ 61 ·---1235 0 67 CUT~ ,uESTIONJ
i X Q NP AUX V ·s ·---l l 34 5 67 1254 0 67
CUT 6 OtWOROP> s x-"G-v-·-=-v;__;_,--------------------1 2 l It 5 6 l 2 0 4 5 6
U:tiDCFALL J
'. J:1
I
APPENDIX A, II
PICASO PRINT OF 5-EXPRESSION
FOR AN EXPANDED GRAMMAR
- ,
.,
.,
f ( .... ) 2 ( ..
3 (CS \ I
4 ( f )
5 (GROUP 6 ( f )
7 ( f S = $ PRE NP AUX VP $ )
7 ( 2 S = $ NP AUX VP$) 4 ( 2 )
5 (GROUP ) 6 ( f .. . ... )
7 (i PRE = QNEG ) 7 (Z PRE = ) 7 (3 PRE = NEG 7 (4 PRE = Q)
4 (3 ) 5 (GROUP
6 ( f ) 7 (f AUX = T DOM) 7 (Z AUX = T DO) 7 (3 AUX = T DO I
4 (4 . . ) 5 (GROUP ...... )
6 ( f
7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7
(1 VP= HAVE EN BE ING V NP PP MAN TIME ) ( 2. VP = BE ADJ ) (3VPsBEINGBEADJ) (4 VP= BE ING V ) (5 VP = BE ING V TIME ) (6 VP = BE ING V MAN ) (7 VP = BE ING V MAN TIME ) (8 VP= BE ING VS ) (9 VP = BE ING V S TIME ) (10 VP= BE ING VS MAN ) (11 VP= BE ING VS MAN TIME ) (12. VP= BE ING V NP) (13VP= BEINGVNPTIME) (14VP= BEINGVNPMAN) (15 VP• BE ING V NP MAN TIME ) (16 VP= BE ING V PP ) (17 VP= BE ING V PP TIME ) (18 VP= BE ING V PP MAN ) (19 VP= BE ING V PP MAN TJME ) (ZO VP = BE ING V PP ) (2.1 VP = BE ING V PP TIME ) (ZZ VP = BE ING V PP MAN ) (2.3 VP= BE ING V PP MAN TIME ) (2.4 VP= BE ING V PPS ) (25 VP = BE ING V PP S TIME ) (26 VP= BE ING V PP S MAN ) (27 VP = BE ING V PP S ~fAN TIME ) (28 VP = BE ING V PP NP ) (29 VP = BE ING V PP NP TIME ) ( 30 VP = BE ING V PP NP MAN )
----- - ·
•
•
--··1 131 VP= 11"f7Nc;v· p1• f'4P MAN TIMf. 7 132 VP • Ut: INv V PP PP J
__ 7!-______________ l:-:3:-'3'--:V'::-P~=-u E I N l,; V . PP I' P __ T IM E ._) __ _ 7 (34 VP= U~ l~t,; V PP PP MAN) 7 135 VP= ttt: ING V PP PP MAN T1"1t 7 13& VP = IH: I t-.G V NP )
--7 --------------137 VP= dE lt-.G V I\P TIME ) -
7 13ff VP= 0[ l~G V NP ~AN >
7 (;j<I VP= IH· IN(; V NP MAN llME J --,=----------------c·4·o-vP·--~- i1t:"-· 1 rH; -v · ·NP·· s I .. · - ·- ·- · ·---·
7 ( 4 l V P = ll I: I NG V r.. 11 5 T I 1-1 [ J 7 C42 VI> = t1l INr. V NP \ MM~ I
--7 --- ---- ,43 . VI' = llt. IN<; ·v ·N" ~ MAN . fiM f · · -···· ·-
7 C44 VP= Hl JNG V NP NP I 1 , 4 ~ v P = HE I N c; v N; 1 r. I' r I MF , -------- ·-·-· .. .. ........ ·----- ------·-···· · - - .. ·· - · 7 ( 46 VP = tll ,.,.p NP !H1N ) I Nu " 7 (41 VP= Ht NP NP MI\N TIME ) I Nl, V 7 C '• ti V P = 11 t- N P I' P I I f'.41i V
·-- -·- - 7 (4\J - \IP - ; - HL N.., PP TIME· --1 -·----. i Nl, " 7 C !JO \/ I' = I It: NI' 11 P I' I\ N ) I N,..i V 7 (':>l VI'= tll. NP l1 P f11\N JJMI· ING V
· - · -1 · - ---- · ···---· t':>i .. vP ·· :;; · ·11,\VL LN i t- ti u,J 1 7 l':>3 VP = HI\VL r~ 1q: NG tit I\UJ I 7 C'>4 VI' = lil\VI: t: N ·H· N(; \/ I
----7·-··- ·· ·-··,'>s- vP · · liAVL LN ·It: N(, V MAN; · ··- - - - ·- ···· - ····
1 ( 5<, v.-i = HAV I:: I:~ tit- Nu V MM~ T IMF- ) 'I ( 5 7 V I' = ti A V E t N 11 l NG V M' I
--,- ·····- ··- r-,if " vr · ;;·-- Hi\Vl . H'4 IH::' NG V NP MAN )
7 ( 5 9 V I' = ti I\ V f F. N IH: N c; V NP MAN T I ~ f J 1 ( bU VP = HAVE EN llE NG V NP )
- ·- - ·1--·------,--------,.b1 vi, -= HAVE - f:N° - IH: .. NG- v - ~µ·-MANT
7 (62 VP= HAV E EN nf NG V NP MAN TJMF 7 C b 3 VP = HA Vt: F. N IH: I~ G V NP NP )
---7 -n;7;-V-P-~-H"·vl:· ··o~· -,)C"1 N·cr v ·-NP-NP. n Mf.,.-7 I b !> V P = H A V E E: N 1• E I N li V N P N P M i\ N ) 1 Cbb VP= HAV~ tN Ht NG V NP NP MAN TIM[ 7 ·-n~ ·1- \rP·--;-H Av [ . I: N IH: NG V . NP . PP . ) . . . . . . - ·---·
7 I 6tJ VP = HflVt: U J 1~~ rH; \I NP PP M1\N 7 C <> CJ VP = 1 i fl V l H~ J 1: ,~ G \I t-. P t' P 1 I t-lL ) --7 I 70 VP = 1• AVL- : N ·l l: N(, V . NI' \ I 7 ( 7 l VP = -•AV t: !: N 1 t- NG \' NP S Mt. N ) 7 ( 7 2 V P = H I\ V l: E N t \ L N G \' N P S r-·, I\ N T I M t:
- ·- - -7 ·-f7f"VP. ;,- HI\V t tN 1-i t Nu \ ' ~p · ~ JI Ml j - - - - · - ··
1 (I'• VP= IM'v[ EN 1.H: Nii \ t-:P llMI' j
7 ( ·1 5 V P = 1-i i\ \ l: t N J t; N ll \.: NP T I Mt. ) --- 7 176 VP= 1·tAVf (1'" l\ f: NLJ \' ..-p·-,
7 (77 VP= HAVl. t:N JF. NG \Ipµ ) 7 (78 VP~ HAVE tN ~E Nf, V PP MAN
- ---i f'79 VP·= tiAVf: - EN-·:\E PH, V PP -MAN-· ,· · · ·-· . - ....... ·--· -
7 (HO VP= HAVE EN ilE ING V PP MAN TlMC ) 7 ltH V P = HA V l: t: N d t: I NG V P P ,-; AN T I ME J
---7 I 8l VP = HA iiEfN.-HE°" ·, Nli . v·•- r 'p•·-NP ) 7 183 VP= HAVt: tN dt: ING V PP NP MAN ) 7 184 VP= HAVE EN BE ING V PP NP MAN TIMt J
-~7 ~r:HA'I/F.7:·N- tJt·· ·1 Ne·· VPlJ- NJ> -T I'Mt--r ·- · --7 (86 VP= HAVE EN Bt ING V PP PP I 7 1~1 vr = HAVE EN BE ING V pp pp MAN > 7 188 Vp;-HAVE EN BE ING V ~p PP MAN TIME 7 189 VP• ttAVE EN BE ING V PP PP TIMt::) 7 190 VP• HAVE EN 8E ING V PPS )
;,
' 1 C.91 VP• HAVE EN OE ING V PPS MAN ) 7 192 VP • HAVE: 't:N OE ING V PP S MA~ TIME ) 7 (93 VP= HAV[ EN UE ING V PP S TIMC ) ---1·----------------,-9-=-,.--=-v~.,-= -:..;;HA v E_EN .. _u E-INGV 7'P T IM£: , "------
1 195 VP• HAVE EN Uf ING V PP TIME ) 7 196 VP • HAV~ EN Bl- ING V S ) .. --··-1--------------..;,"-'-q 7 yp_ds_ HA vt · [i{" et: .. r"N G- V-.,.S_M_ . ..,..A_N--,-) -----
., (98 VP = HAV( U'4 Uf: INti V S MAN T IH[ 7 ( 9 9 VP • HA Vt- E: N IH: I NG V S T I ME ) 1 11ou vP = .. H,\v"f- l ·;~---"L I iiG ·v···-r1H°~ -T--1 1101 VP= HAVL l~ V ) 7 ( l 0 2 V P = HA VI f :~ V MAN J
... ___ i (Hf3VP=--HAVt .. t: ·~ . \/ I-IAN - l l,'1E -r---- -----7 (104 VP= HAV[ ~NV NI' ) 7 ( 10 5 VP = H !\VI· I: ,~ V NP )
---·-1 1 TobVr°- = - HAVt · t ,~-·v NP MAN ,
7 1107 VP= HAVF fN V NP MAN ) 7 (108 VP= HAV E EN V NI' MAN TIME J
-- · ·---- 7 -·-- --·--- ··rro'l - VP- -= - HAVE r: :~ V i~I' 'MAN T IMf: -· l -
7 1110 VP = HAV E EN V Nr NP ) 7 ( l 1 l V P = 14 A V t: t: I~ V N P N P M AN )
.... ____ 1 Tfll-·v~- -=-- HAVt . ti~ V N1' NP MAN . t IMC I 7 CllJ VP= HAV~ EN V NP NP TIME ) 7 (114 VP= HAVt: EN V N~ PP )
- -.,-- r1s - vrr=-···HhV E · f l~ V NI~ pp MM~ · -, · --- - ----- -- -- - --7 1116 VP= HAVl EN V N~ PP MAN TIM~ ) 7 ( 11 7 VP = Ii AV I I: I~ V NP P P T I ME )
-----7~-- rrnr ·~µ- : ""t• hVL . l I~ V · NP s t 7 (11~ VP= HAVl EN V NP S ~AN ) 7 ( l Z O VP = HA V f. ll~ V NP 5 M fl N T IM E 1 t 121 vP-;;-HJ\ vr·· E1rv-- Ni1 · s- ·T rH·rr-·· 7 Cl22 VP~ HAV l E~ V NP TIM[ ) 7 C ll3 VP = HAVt: l:1~ V NP TIME ) 7 I 1l4 vl'"-=HAVF""lii-· v·-- pp----,.. ------------1 1125 VP= HAV~ EN V PP ) 1 112b VP= HAVl EN V PP MAN )
----.1 T2,\iP:- ·HAV r - ~N·--·v ·pp MM~ , - ·--···--1 (128 VP s HAV[ E~ V PP M~N TIME ) 7 1129 VP= HAVE tN V ~p MAN TIME) 7 C 1 JO VP = 1-i AVE t:: N . V- Pt> - N fl . . ) - - --- .. .
7 l 131 VP s HAVE [NV PP NP MAN ) 7 (132 VP= HAVt:: ~NV PP NP MAN TIME 7 Tf j7f P-s- i•{A VF. -· t: N - V. -PP. N ., . t f ;.ii· r ---7 Cll4 VP= HAVl ~NV PP PP ) 7 (135 VP• HAV E EN V PP PP MAN ) 7 ffibVP--;-· HAVf "'E) iv pp·--p·p ·
0 MAN O ·n ME7' 7 1117 VP• HAVE- E1'4 V PPP•• TIME I 7 (138 VP 2 HAVf EN V PPS ) 7 llJ9VP=-HAVtEi~--"/- PP .... S M;fN7 7 (140 ~t' c HAVE EN V PPS MAN TIME ) 7 1141 VP= HAV( l:N V PP S TIME I 7 (142 VP-= HAVt::-t::I~ V- PP nMt_) _______ _
7 1143 VP= HAVC EN V PP TIM~ I 7 1144 VP= HAVE EN VS )
-----7 114 5 v P-= ... H AV tew--v-rKA N 7 Cl4b VP a HAVE EN VS HAN TIME ) 7 1147 VP • hAVC EN V S TIME I 1 11tr~iP·c- H·,v1::-·-f'irvTrM°e··-----------1 (149 VP• V)
· 7 ( 150 VP • V MAN I -------------
1
'
'
7 1151 VP s V MhN TIM~ ) -------------7 (15l VP• V NP a 7 ll)J VP= V ___ NP , ____________ _ 7 (1~4 VP= V NP M~N 7 ll5j VP= V NP MhN 7 I l 5 b VP = V t-.i P M /1 N J f MF. )
-----7 11)7 VP= V NP M,'11~ TIME) ---- --- -- - --- ··-7 I lSH VP = V NP Nl 1 I
___ 7 _______________ 11~9 VP = V flP t~1• :H1N _ _) _______ _ 7 1160 VP = V NP N I• MJ\N JIMt: J ---· ------ ------ -~-· -7 (161 VP= V NP N,1 IIMf) 7 ____ llb2VP=VNPP 1 )
----.,-- -- - - ·- •- ·----- ---, 1 b .3 VP- = .. V NP JJ .> MhN . ) - ---- -- - ·- .... .
7 ( l b '• V P = V N 1 1 I' 1 > i-1 /, N T l M E ) 7 _ _ _ _ , lo? VP = V r.1> 1-' ,1 I I MF. ) 7 ·· ··-··- ·- ··-- · T fo1 - vJ1---~ -V NP ) I . ·····- ------ - ·-- -- ---- · .
7 ' l t-, 7 V,, = V ,~ p s 1i 1\ N ) 7 ______ (lhH VP = V N~ \ ~/\N flM E )
··--- - - 7 ·····- -·-·--- - ·, ll:>ll. VP- ·= · v . NP S J IMt" I -----------------· 7 (170 VP= V (14 1' TI Mr 7___________ 1171 VI-' = V NI' TIM I.
·-- -; I l Ii:' V P-· - = V P I' I -------·· .
7 (173 VP= V PP ) 7 ( l 7 4 VP = V P ~• ~ ,\ f\
. - - -., - ------------- - ··---- - - ( 171:J \qJ = V PP M.H~
7 ( l 7 6 V P = V P fl M !1 N T I ,,q: 7 _______ I 177 vr = v t' P 1''.i\N 1Ir1 t-:
---1 -· - - ------, 17H Vi>- ··v Pl' r,, ,1 I 7 I 1 7 g V P = V p p N .l M /\ IIJ ) 7 I l H U V P = V P 11 N .> I~ /1 N T I M t: 7 I !t1·l- vP-·=··- v· ·pp ··1·~·• f P-11: I 7 1182 VP= V PPP~) 1___________ ( liJ) VP = V l'I' PP .' -1 1\:-~ )
·- ·---1 t 1u4 vP- ·;;, ·-v ..,., -..,.,- 1-111 1~ l 1ME , 7 ( l H ~ VP = V PP PP r I Mt-' ) 7 llHo VP= V PPS ) 7 - llH7 VP= v · p,_, - s · 1-1/\r4 I ·- - - ---7 llOH VP:.: V PPS Mi\N flMt I 1 _____ ·-- 11~9 VP= V PPS TlML t 7 - 11 (Jl) VP = V PP l I ME ) ... . ··- ···--- - - ---- - -- -
4 5
1 l 191 VP = V PP T IMF: I 7 (192 VP= VS I 1 ·- - - - -r19°3-- vP·-~·--v· -~ "'"'~-·r -· ·· 7 (194 VP= V ~ MAN TlME ) 1 __ (195 VP= VS flM t > 1 .i.i<i-b ·vp ···; --v····f i'Mt M••;···-· -· -·- - ·-
I 5 • • • • • • > (GROUP•••••• )
··--· ··--- ------ ---
6 1 7
- - - ( l • • • • .-.-.-.-.-. • • •• • • • • • • • • • • I -
1 1
4 (6 •••••• a
(l NP l2 NP ( 3 NP (4 NP
------:.5·--------- -C GT<OUP .. • .. • J 11 • •. • • • I
= .. -· =
llP N s )
OP I\ )
N - ,.. .. . ___ ·-
N s i
6 7 11 PP: PRfP NP a
4 5
6
--------------, I 7 •• • • • • I (GROUP•••••• )
11 •••••• • • • • • • I
-- ... ·-·· --·-- - ·-- ·· ·- ..
5 6
7 1
(8 •••••• I (GROUP
11
(l ~A~• BY P I 12 ~AN 1: ADV I
...... )
• • • • • • • • • • • • • • • • • • • ••••• 7 11 TIME= FREij TIM OUR
• • • • • • • • • • • • __ ___ i ________________ Cl TIM.E = t ---··--- -
7 CJ TIMc = DU~ I 7 C4 Tl~t = FKEQ I I f5-···ta,.;t:: -;· ··~-~t'cf. li0R ) 7 (6 TIME = fK~U TIM ) 1 (7 llMl: =TIM)
- ··-··--·-· ·····,a r IM·t· ·:s·, ·uc·o1n:cT··--···----
" ' q • • • • • • ) ~ (GROUP •••••• )
••••••
,-1-·· ~-; .-. •. • • .·-;;·.-·--~--. :-.-~-;-:~ • • • • • • •• ,. • • • • • • ; •·•·- ·····- ·--------6 7 7
. ·· ·-- ··1 - - -·
7 7
---- -···· ... .. ·- - .
Cl PLACE= o~s, OK!G ) (2 PLACE~ )
· - ·,1-PCAC-c-~···ur~i- ·'l (4 PLALE; 0151 I C ~ l'LACt. = LUC. I
... ···- -·-- ,- ·----- -·- It> . PLACt'. =·-1.)K l G··T-·· ...... . ... ----- --·- ·-·--····-···-··· ··-·· - ·· .
" C l O • • • • • • I 5 (GkOUP •••••• )
... .. ·--···-6 -- - ·----- - ·--- ··--- I l • • • • • • • • • •• • l
4 5
7 Cl OP= PU O~T ) 1 Cl UP • DET )
C l l • • • • • • ) CGROUP •••••• )
b Cl •••••• •••••• I ·-··-··--- 7----------·--··-Tt Dt:T = -A"Rr··s--1 7 Cl Utf = AKT )
4 Cl2 •••••• I ·---5-------------, .... " .... , K--ouJ>· • • • • • • ·1--· ····--------·-6 Cl •••••• •••••• t
Cl AIH = INDl:f I 7 - --7 -- ·- ·· - ··c2 AMT = Ot:f ·,-· ·-··-·· ········· · ··- ··- ··- --·-·-·-··
" ~ ( 13 • • ••• • I &GROUP•••••• I ·-·--·- · ·-·-----------b -·-- -- , ,-··:;·;·;·~-;:-.-;~ -.-~--;· ·;-~-;·. :-·;-·~-;::-~-~----;-;;-~-;-~ • • • • • • • • • • • • •
7 7 ····--1.c------------1 1
11 N = SINCfRITY) C2 ~ = fACT I
-·- - r3 N. = ·pf~N- -,.---· - - ·· ·--·--
14 ~ a liUo.JK I l 5 N -= ~ ,\.~ )
. - 7 Cb N = GN: ,--· ----····---·
7 7 1 7
(7N=lf) Ctt N • f30Y I
19·N • TAuTE7-----·-·-··· · ClU ~ = lHING)
-------------
" - ~-(14 - ------- •••••• I lGMOUP~-.-.-.-.-.-.--.,.---·---- ---- ---------·-··- · ··-·· ...... .
6 Cl •••••• • • • • • • • • • • • • •••••• •••••••••••• • • • • • • • 7 Cl V • CONOESCENO I
·-····--·1--------------.... ,-2__...v---•-o~rrEVn----1 Cl V • CONVINCE I 7 (4 V • OECIOE I 7 I ~--V--OTS[ IR£ .. . I -------·-7 16 V • GI VE I 1 11 V ~ HAPPEN I
·-- · · .:tr'
4
1 1 1
115 ••••••
ce V = U : A'/E ) Cq V = SEE ) ClO V = HMPT ---
5 CGROUP •••••• 6 I l • • • • • • • • • • • • • • • • • • • •••••
-- - ----.,----------------~( l ADJ = HUtn~r )
7 C 2 AD J = F- I t{ M ) 7 C 3 A~J = tl U : ..- ) --- . -···· ·· -
• •••••
7 14 - - - -----AOJ = (i, ~ l: tN ) 7 (5 ADJ= T/\l.l )
4 116 •••••• ) ......;._5 _____________ _ (G HOUP ••• ~-. -. -;- ·-·-- · ··-- --- -
6 1
C l • • • • • • . . . . . . . .. ~ ,. . . ..... Cl Pol= Ul/Gtil TO I -- --, C 2 M = .Mu S l -,-- --- ·-- - . --- - · - ·--- -· · ·- -·
1 1
13 M = C/\N) C 4 M = ~• IL L I -------__ 4 ____ - ---------,~l 7.. . . • • )
5 IG~GUP •••••• 6 C l • • •••• . . . . . .
---- 1
7 ll P~ l: P = LIN I Ii PR t p = or )
3 CUT ••• ••• ••• ••• •• •• •• ••• •••••••••••• ••. ) - --·- 4 --- - - - -------- -,-r--•.... --.---,--- ·- ----------- ---·· ····•-· ··- ·
5 ((.;ROUP•••••••••••••••••• ....... •••••• b C • • • • • • ) ___ i_____________ -- -·-· ·cc~ i ·· x NP u,·-.,- i_T ___ ······ - .
6 I 1 l ) 6 Cl l. ) ----,, - ·, j 4 i--- - - - -6 c 4 3 ) 6 C 5 5 )
. . . . . .
------------------fbi,-,- - - - - - -- -- ----- - --···--------------
••
6 4 c 2 •••••• ,
5 CGROUP •••••• •••••••••••• • • • • • • • • • • • • • ••••• • • • • • • • -----~- -----•••••• ••••••
4 !,
6 1 1
t,
6
I • • • • • • I 1 'z
(l 1 ) C 2 2 )
• • • • • • J $ X NP ,\IJ)( V ro NP y nv SUM l $ ) $ x N·P-·Aux-··v--N-I_L __ m;·-v· ov-··su°M { -~ .>
--------------,., :i " 7 - ,- - - - - - . b t 6 6 6 6 b 6 6 6
l't 4t OE EO ) (, 5 ) ---------------rb-;; -,-----·---- -- - -- ------- ------ -- ----- ---- - ------ - - ---11 0 ) 10 a ,
- - - --- - i cj--··9- - ,-- --
( l O 3 ) (11 11 )
----~ , l z--f2-) -
'3 •••••• )
---·------ - -·-- - ·- --- --- - ·- - ---· -
CGROUP •••••• •••••• •••••• •••••• •••••• •••••• •••••• -------- ------ -, . . . . . . ) 6 7
6 6 6 6
Cl 1 -.-r·2 Cl 3
"· 0
Cl$ XV TOYS ) ) ) )
)
-·---·•----------------------------------------------·---
•
6 6
15 5 t C6 b t
~ C4 •••••• t -----------------::.__,;:;....;.. ________________________________ _ 5
6 (GMOUP •••••• •••••• • ••••• • • • • • •
I • • • • • • • • • • • • ) 7 C 1 S X T OU M Y • t
••••••••••••••••••
1 c2 s x ,-ooarv·-:,:---:-,-·------------6 Cl l ) b ____________ ~l l 2 )
---6 li7~,---·-----6 14,) 6 cs O) 6 . (b -t> -.----------
6 17 7 ) 4 C 5 • • • • • • ) ---,,------------5 IGKOUP •••••• •••••• •••••• •••••• • • • • • • • • • • • • • •••••
b I • • • • • • ) 7 11 S X 'NP AUX Y S t tJff 1 f" ----·- ----·- --·---·--·-· . ----·-----------6 Cl 2 ) b CJ 5) b ·--7-,. It_,_) ----·----·····- - - ·-·-.. .. .. ----------------6 15 0 ) 6 16 6 t
• ••
• • •
---6---------------rr ·1-·-------------·- ·-.. ---- ---- · ·---- --------------·---- - --4 16 •••••• J
5 CGMOUP •••••• •••••• •••••• •••••• •••••• •••••• •••••• I _______ b_______ --·· ·-··-·. ·-,·~-~-~ ~- ~-~--- T ·- ·- .. ----·-·-·--·-··•"•·--- ---·-.. ... _,_ .. _____ _ 7 Cl S X DOY Y S)
6 Cl 1 ) --6----------ri-2,· 6 13 0 I 6 C 4 4 J 6 ------r~ 5 , 6 16 6)
3 CBT ) --3-----------, "S'f iH~-. • • • J -----··- ·- -- ·----··- ----------------4 C l • • • • • • J
5 CGROUr •••••• I CJ
7
-----.. -... , , -.-.-.-.-.-.-.=-----·-----Cl J"STI • S I
' -- ·- ·-------
;
-·~
\
\
'
APPENDIX A, Ill
LISTING OF THE PUNCHED CARDS FOR THE
S-EXPRESSION FOR THE EXPANDED GRAMMAR
(IC~ (1 !GROUP 11 Cl S • $PRE NP AUX VP S) (2 S • S NP AUX VP tt))) (2 LISPOOlO - · (GROUP Cl 11 PRE • Q NEGt (2 PRE. •t (3 PRE= NEGI (4 P~E ~ Ott ti ·(3 CGROLISP0020
UP I 1 I l AUX = T 00 MI ( 2 AlJX • T 00 t ( 3 AUX • T DO I ) I I I I" C GROUP t 1 IL I SPOO 30 l VP• HAVE EN BE ING V NP PP MAN TIME) (2 VP= BE AOJI 13 VP• SE ING BLISP0040
--- E ADJ> 14 -VP • "BE ING VI "VP• BE . ING. V"TIMEI 16 VP • BE fNG ·v MANI f7LISPOO~O VP• AE ING V MAN TIMEI 18 VP• BE ING VS) C9 VP• BE !NOV S tlMEt 11LISP0060
0 VP• BE ING VS MANI Ill VP• BE ING VS MAN TIMEI 112 VP • BE ING V NLISP0070 - ·Pl 11°1 VP · • BE ING V NP TIMEJ Ti°i•··vp • BE JNG V NP MANI llS VP·• BE ING LISP0080
V NP MAN TIMEI 116 VP c BE ING V PPI Cl7 VP= BE ING V PP TIME) Cl8 VP irLJSP0090 BE ING V PP MANI I 19 VP • BE ING V PP MAN TIME I 120 VP • BE ING V PP) ILISPOlOO
--21 VP• BE ING ··v-- pp ·TJMEl -· ·122 VP• BE ING V PP MANI 123 vP ·• BE ···rNG. V PPLISPOllO MAN TIMEI 124 VP • BE ING V PP SI 125 VP = BE ING V PPS TIME) C26 VP =LISPOl20 8E ING V PPS MANI 127 VP• BE ING V PPS MAN TIME> 128 VP = BE ING V PLISP0130
- ·p ·NPJ 129 .VP =· et · ING V ?P NP TIMEl .. T30. VP _·= BE "ING ·· v PP NP. MAN) l'.31 vr,··LISP0140 • BE ING V PP NP MAN TIMEI 132 VP• BE : NG V PP PPJ 133 VP = BE ING V PPLISP0150
PP TIMEI 134 VP• BE ING V PP PP MANI (35 VP= BE ING V PP PP MAN TIMEILISP0160 .. ll6 VP• ·eE ING. V NPI 137 VP=· BE ING V NP TlMEI 138 VP 11 ·et 1NG -V NP MLISP0170
ANI 139 VP• BE ING V NP ~AN TIMEI 140 VP= BE ING V NP SI C4l VP• BE ILISP0180 NG V NP S Tl~E) C42 VP= BE ING V NP 5 MANI 143 VP= BE ING V NP S MAN TLISP0190 IME) 144 VP• BE ING V NP NPI 145 VP= BE ING V NP NP TIMEI .f46- ·vp ··= BE . L.ISP0200 ING V NP NP MANI C47 VP• RE ING V NP NP MAN TIMEI 148 VP= BE ING V NP LISP0210 PPI 149 VP• BE ING V NP PP TIMEI 150 VP= 8E ING V NP PP MAN) 151 VP: Ll5P0220
·· ·eE · lNG ~ ~p PP MAN T1MEt 152 ~p = HAVE EN BE ADJI (53 VP= HAVE EN B~ INLISP0230 G BE ADJ> 154 VP• HAVE EN BE ING VI 155 VP= HAVE EN BE ING V MANI 156 LISP0240 VP= HAVE EN BE ING V MAN TIME) 157 VP= HAV~ EN BE ING V NPI 158 VP• HLISP0250
·- AVE EN BE - ING V NP MANI I 59 VP = HAVE EN BE ING V "NP "MAN TIME) - ,6o··vp ·=-·crsP0260 HAVE EN BE ING V NPI 161 VP= HAVE EN BE ING V NP MANI 162 VP II HAVE EN LJSP0270 BE ING V NP MAN TIMEI 163 VP• HAVE EN BE ING V NP NPI 164 VP= HAVE EN LISP0280
- BE ._ING V NP . NP .TIME) f 65 VP it HAVE EN BE ING V NP NP MANI . (66 yp ···• H,(VE L.JSP0290 EN ~E ING V NP NP MAN TIMEI (67 VP• HAVE EN BE ING V NP PP) C68 VP• HALISP0300 VE EN BE ING V NP PP MANJ (69 VP• HAVE EN BE ING V NP PP TIME) 170 VP =LISP0310
-·-·HAVF."-·or1H: INu · v NP ·sr ·11r· vP =-·- HAVE . EN BE ING V NP S MANf··· c12··vp ·. HAVLISP0320 E EN BE ING V NP S MAN TIMEI C73 VP• HAVE EN BE : NG V NP S TIMEI (J4 VPLISP0330
= HAVE EN BE ING V NP TIME) 175 VP• HAVE EN BE ING V NP TIMEI 176 VP =LISP0340 - ··- HAVE -· EN. BE ·1NG V PPl -- (77 ·vp ·• HAV£ -·1:N · BE ING V pp,- (78 VP= HAVE EN BE .LISP0350.
ING V PP MANI 179 VP• HAVE EN BE ING V PP MANI (RO V~ = HAVE EN BE ING LISP0360 V PP MAN TIMEI ce1 VP• HAVE EN BE ING V PP MAN TIME) (82 VP: HAVE EN BLISP0370
-- E-·rNG" V pp·-·NP1 ··-,83""VP ______ _ HAVE EN BE" ING V pp NP MANI 184 VP = .HAVE . EN BE LISP0380 ING V PP NP MAN TIME) 185 VP= HAVE EN BE INCi V PP NP TIME I 186 VP = HAVLISP0390 E EN BE ING V PP PPI 187 VP• HAVE EN BE ING V PP PP MANI (88 VP• HAVE LISP0400
--·EN··· AE ING v· PP --PP MAN . TIMEI 189 VP · • HAVE EN BE ING V PP PP TIMEI C90 VPLISP0410 = HAVE EN BE ING V PPS) 191 VP= HAVE EN BE ING V PPS ~ANI 192 VP= HLl~P0420
AVE F.N BE ING _V __ P_P _S __ ~_AN _f.l _ME> .... L?_3_V,P_~ __ HAVE CN BE ING _V PP ___ S_J __ I_ME) _ 194 Ll~P0430 VP= HAVE EN BE ING V PP TIMEI 195 VP• HAVE EN BE ING V PP TIMEI f96 VPLIS?0440
= HAVE EN BE ING V SI (97 VP= HAVE EN BE ING VS MANI 198 VP• HAVE ENLISP0450 BE ING VS MAN TIME) 199 VP• HAVE EN BE ING VS TIME) (100 VP• HAVE ELISP0460
- .N f3E !NG V TIME·, ·· C 1of ""vp ··-~ - HAVE .EN v, (1·0·2 VP :s HAVE EN . " MAN·;-·· -,--1·03 VP =LISP0470 HAVE EN V MAN TIMEI ( 104 VP• HAVE EN V NPJ ClOS VP= HAVE EN V NPJ (lOLISP0480
--· 6 _Vr? • __ HAV_E . . ~N __ v __ ~_e __ M_~_r-i,_l_l()_l __ VP • t:t~Y.E __ ~_N_ v_ ~PJ'1ANl _'1J)~ _v._e_~_1'1.~YE EN VLISP0490 NP MAN TIMEI I 109 VP• HAVE EN V NP MAN TIMEJ (110 VP• HAVE EN V NP NPLISPO~OO
> 1111 VP• HAVE EN V NP NP MANI 1112 VP• HAVE EN V NP NP MAN TIMEI lllLISPO~lO ___ 3 ___ v r, · - _HAVE EN _ v_ Ne_N_e. __ tJ1!1E.1 ... _J __ l l.~-VP ~--t1AVE . . EN __ .v.,. NP. -~PL_J 11_, __ VP_-~--- t:tAVE EL I SPO 5 20
NV NP PP MANt Cll6 VP• HAVE EN V NP PP MAN TIMEI 1117 Ii,·· • HAVE EN V NLISP0530
'
PPP TIME) (118 VP= HAVE EN V NP 5) (119 VP• Ht,VE EN V Ni->~ MAN I (120 L I SP)S'• G VP• HAVE EN V NP S MAN TIME) (121 VP= HAVE EN V t~P S T!M t: I ( lt.l. VP 2 1•Ll ~, , 1 1 '., ', 1 AVf EN V NP TJMEI 1123 VP= HAVE ~NV NP TJMEI 112 11 VI'= HAVE EN V PP) ILl •, ; •J -,r, , , 125 VP= HAVE EN V PP) (126 VP= HAVE EN V PP MMd 11 1 7 VP= HAV E P l V P \.l ' , ;:i n •, / (1
P MANI fl28 VP:: HAVE EN V PP MAN TIME) (129 VP= HA VI !:NV PP MAN Ti'~tl L l :iP ti :,1 ,11 11~0 VP= HAVE EN V PP NPI (131 VP• HflVE t . N V PP NP MANI 113,ii VP= H AV I j c., ,; , 1:, ·, ,1
E EN V PP NP MAN TIME) (133 VP= HAVE EN V PP NP llM l l I13 1~ V ;.> : It /W e. r. 1~ 1.1 ·.~ · J 1,,, , V PP P P ) f 1 3 5 VP = H A VE E N V PP PP M AN I I l 3 6 V P =- II A v E. I. N V fl P P P ,. 1 I\ r-. r L I . , ; ' \ J , ; • • 1
IMEi 1137 VP= · HAVE EN V PP PP T(MEI 1138 VP= H flV[ F.N V PP SI 11 .3 4 VP = L l ~, • ' Ot,, ', HA VE EN V PP S MAN I I 14 0 VP = HAVE E N V r> fl S MI\ N I I M ( I I 11• l VI' = HA V F. EL I :,:, JJ ;. 1 , · ,
NV PPS TIM[I 1142 VP= HAVE EN V PP TI MEI 11 1•':\ VP = HAVE EN V r>P T l ,.,,E ILl ~ •) Ofi 1• 1•
I l 4 4 VP = HAVE £ N V S I I 14 5 VP = HAV E EN V ~ MI\ "4 I I l 4 6 VP = HA V L U , V SL I SI' U t, ') u MAN TIMF.) flt• 7 VP= HAVE FN VS TIMFI I14A VP = HAVF FN V TlM F. I 11 1,'t VP LI SP OM .O = VI (150 VP= V MflNI 1151 VP= V MAN TIM E ) 11 ':> ?. vr = V NP) 11r, , VD = VL l ",P0 ', 7n NP) 1154 VP: V NP MANI ll "> 'j vP = V NP MtiNI !l'i6 vr = V NO M/I N l ( Mf ) f\ l l ',l ' () f, 1· 1,
'.,7 VP = V NP MAN T JME I 1158 VP = V NP NP I I I ~q V ~ :: V NP rw M,\N I t I ~,O VPL I c, :,nv,,, = V NP N P MAN T I M E I I 1 6 1 V P = V NP N P T I M ti I l b ;, V P = V N .> fl P I I I 6 1 V P L I ~. P O / O J
= V NP PP MAN I I 1 6 4 VP = V NP PP MAN Tl ME I I 1 AS VP = V NP P :-, T I M [ I r I 6 6 1. I V CJ ·1 I l VP II V NP SI 1167 VP= V NP S MANI I16A VP = V NP S M" •'I Tl ~lf: 1 tlh 9 VP= l. 1:, :J t , .' ?J V NP c; TIME) 1170 VP= V NP TIME) (171 VP = V NP Tll-H" IJ U VP = V PP ) I Ll tP O /: ,) 17) VP =· v PP) (174 VP='-'' PP MAN) (17' . , = V PP ,~A N ) (176 VP ~ VP ~' M~ L l ",~ (.,. ; .• ,·1
N TIMEI 1177 VP:: V PP MAN TIMEI 1178 VP = V PP NP) 11 79 VI ' ~ V PP t.P MA L l '. , •' 0 / ·,, , N I I 1 8 0 VP = V PP NP MAN T I ME ) I l 8 1 V P = ·; P P N I' T I M [ I ! I U •· V iJ = V PP P P I. I ,. ' :"ii r . .
1 1 1 e 3 v P = v PP PP MAN , 1 1 8 4 v P = v PP PP MAN r J Mr. I I l fl i; v 1' = v Pr> ;J .> r I r " :, , r: ,, IMEI 1186 VP= V PP 5 1 1187 VP= V PPS MI\NI flA8 VP :: V or S MM 'i Tl'-1[ ) t 1°. :• , / ·1J
flAQ VP= V PPS TJMF.I 1190 VP= V PP TIM E I 1191 VP = V PP TIM t: 1 IJQ? V fl 1 f c,1'J / •D = V . c; ) I 1 9 1 VP = V ~ MAN I I 1 9 4 VP = V S MAN T I ME ) I l 't ':, 1/ r> = V .S I I ~~ E I ! L I v r 1 " :i, i
196 VP= V TlMf.!ll) 15 (GROUP 11 (1 NP= l)P N S I 12 NP = DP NI 1 3 NP .:: Nl.l ) Pln : ::i I 14 NP= N Sl)ll !6 (GROUP 11 fl PP= PR EP NP)lll 17 I GR 0 I1P 11 1 1 n r,N =L l :, ,-J,·I ,:1) B Y P I ( 2 ~ A N = A D \' I ) ) ) I 8 f GR OU P ( 1 I 1 T I M [ = r R ( U I l M ,-, 1 11 ~ I I 7. I I M f. = I L I '.-> P i) r1 ·• 1
13 Tl ME = DUR I f 4 T IM E = FREQ I ( 5 T I ME = FR E O () llR I I t, I I Mi: ~ F R~ Q T IM I I L I ;, P (l /j , , O 7 TIME= TIMI 18 Tl~E = TIM DURIJI) 19 ((,ROUP 11 11 f'l l. ACF.:: DE~! O~ Jr,I ( 1. 1:,P Oi', :,0 2 PLA(E . :sl f3 PLACE= DE5Tl 14 PLACE= DJjTl 15 PLA C:t = L OCI lb µ LA E = Ll ., h,,c ,, v ORIGJJll (10 !GROUP 11 (1 DP= PD DETI 12 DP= DETIIII Ill I C1l~OUiJ 1 1 11 i. l ' . ,>(1 tl r, DET = ART s, (2 DET • ARTllll 112 !GROUP 11 (I Mn= IN lJE = 1 (2 Mn = iJFr t , ·, , 1-- ,:0 111 ·,- ··,13 ·· 1GROUP 11 <°l N = SINCERITY) 12 N = FACll 1 ·\ N:: PLANI 11• N = B O l ', ,);/(- , ,1 OKI (5 N = MAN) 16 N = ONE) 17 N = ITI 10 NII AO Y I i9 N - rAALEI I l :1 N = I 1 ~ · •t1 ' q'),l
THTNGll)I f14 !GROUP 11 11 V = CONDESCFNOI I' V = 1"1- L P · Vl' I 1 '3 V = co r-.v1 1 l ", ::,e, ,, i ·, N(EI 14 V = DECIDE I 15 V = DI5LIKF.I 16 V = Cd 1/F I 17 V = H,\ :>PENI 111 V = L ; ,.J:J -,.' (1 EAVE) (9 V = SEEi 110 V = TEMPTl))I 115 I r,,~n 1,1P 11 ()MU . HONE :- 1I (? /\ :, 1 1 ,.) , , , -, , , J = FJRMI (3 ADJ s DEEPJ (4 ADJ .., GREEN I I S /,1) , t = TA Ll I I ' I If> ( (, l~l) IJI ' f '.l I ' · ',• .. , .,
11 M =OUGHT . TOI 12 M: MUST) 13 M.: CA 1,t 14 M ~- WILi. : l l l I 17 ((JfWUP ( 11 l ', ,•v 1 ' , 11
11 PREP= ONI (2 PREP II OFl))II (UT fl luROUP fll - • X ,.., , IP Y i11 l l L l · ,),, , r,, 11 f2 21 13 4) 14 31 (5 ~I 16 bill f2 (GROUP Ill~ X ,~P AtJ;< V TO I\P Y 1\YI i , , ,_, , : ,
SlJM Z sj · 11 S X NP AUX V NIL NP Y BY SUM l 11 11 11 11 12 l.l 13 7) I'• ~. ;\,.l ' , , '_, . ,,-,
E ED I I 5 5 l I 6 6 I f 7 0 I ( 8 8 I I 9 9 l I 10 3 I I l 1 1 l I I 1 2 l 2 I II ( 3 tr, f-W l 1 ~ f • ; ' , ,-, C , '· , I l S X V T O Y S II I 1 1 I ( 2 2 I f; 3 I I 4 ()I I S 5 I I t:. b II l I ... I (', R OU P II l i I : , ·' . , 1 , ~ X T O O M Y S I ( 2 S X T DO BE' ·( S I I I l 1 I ( 7. ;, I ( :-1 3 I I 4 5 I I 5 0 I I b b I I L I ~ P • l l 0 7 71)) (5 !GROUP <11 S X Q NP AUX Y SIi 11 11 12 21 13 51 (4 41 I'., 01 I6 L LPI U, 0
6 I f 7 7 11 I I 6 I GR OlJP ( ( l S X DO V Y S II ( 1 1 I I 2 Z I I 3 0 I I 4 4 I I S ~ I I L I 0~ P I n .} 0
6 61.11) I ATI . (STRT 11· fGROUP i'f" (1 · INSTl = 5111)11 . L l ~ ,>J040
APPENDIX B
SAMPLE DERIVATION TEST
,.._ . ,-
"i
FU
NC
TIO
N
EV
AL
QU
OT
E
HA
S B
EE
N E
NT
ER
ED
, A
RG
UM
EN
TS
..
DE
RIV
N
IL
(IN
ST
1 R
1
1)
(CS
1 1
Z)
( Z S
=
$ N
P A
UX
VP
$)
( $
NP
AU
X V
P $
)
s (CS
Z 1
1
) ( 1
V
P =
V
N
P IP
MA
N)
( $
NP
AU
X (
V
N
P IP
MA
N )
$
) S
V
P
(CS
3 1
Z
) (Z
AU
X=
T
DO
) (
$ N
P
( T
D
O )
(
V N
P IP
MA
N )
$
) S
A
UX
V
P
(CS
4 1
1)
(1 I
P=
TO
NP
) (
$ N
P (
T
D
O )
(
V N
P (
T
O N
P )
MA
1-.
$ )
S
AU
X
VP
IP
(C
S 5
1
1)
(1 M
AN
= B
Y S
UM
) (
$ N
P
( T
D
O )
(
V N
P (
T
O N
P )
(
BY
SU
M )
)
$ )
S
AU
X
VP
IP
M
AN
(C
S 6
1
1}
(1 N
P=
DE
T N
) (
$ (
DE
T N
)
( T
D
O )
(
V N
P {
T
O N
P )
(
BY
SU
M )
)
$ )
S
NP
·
AU
X
VP
IP
M
AN
(C
S 6
1 1
) (1
NP
= D
ET
N)
( $
( D
ET
N) (
T
D
O)
( V
(
DE
T N
)
( T
O N
P )
(
BY
SU
M )
) $
) S
N
P
AU
X
VP
N
P
IP
MA
N
{C
S 6
1
t}
{1 N
P :a
D
ET
N)
( $
( D
ET
N
) (
T
DO
) (
V
(
DE
T N
)
( T
O (
D
ET
N
) )
( B
Y S
UM
)
) $
) S
N
P
AU
X
VP
N
P
IP
NP
M
AN
(C
S 7
1
1)
( 1 N
=
PR
v:i:-
'J
( $
( D
ET
(
PR
OP
) i
( T
D
O
) {
V
( D
ET
N
) (
TO
(
DE
T N
)
) (
BY
S
UM
)
) $
) S
NP
N
A
UX
V
P
NP
IP
;-r
p M
P~N
I· I I
;, L ~ ·- ft
(CS
7
1 2.
) (2
. N
=
C
OM
)
( $
( D
ET
(
PR
OP
) )
(
T
DO
) (
V
(
DE
T (
C
OM
)
) (
TO
(
DE
T N
)
) (
BY
SU
M )
)
$ )
S
NP
N
A
UX
V
P
NP
N
IP
N
P
MA
N
(CS
7
1 1
) (1
N
=
P
RO
P)
( $
( D
ET
(
PR
OP
)
) (
T
DO
) (
V
(
DE
T (
C
OM
))
( T
O (
D
ET
(
PR
OP
)
) )
( B
Y S
UM
)
) $
) S
N
P
N
AU
X
VP
N
P
N
IP
NP
N
M
AN
(C
S 8
:!
1)
(1 P
RO
P=
DO
RIT
A)
( $
( D
ET
(
( D
OR
ITA
) )
) (
T
D
O )
(
V
( D
ET
(
CO
M )
)
( T
O (
D
ET
(
PR
OP
)
) )
( B
Y S
UM
) )
$
) S
N
P
N P
RO
P
AU
X
VP
N
P
N
IP
NP
N
M
AN
(C
S 8
1
2.)
(2.
PR
OP
= D
A V
E)
( $
( D
ET
(
( D
OR
ITA
) )
) (
T
D
O )
(
V
( D
ET
(
CO
M )
) (
T
O (
D
ET
(
( D
AV
E )
)
) )
( B
Y
S
NP
N
P
RO
P
AU
X
VP
N
P
N
IP
NP
N
P
RO
P
MA
N
SU
M)
) $
) (C
S 9
1 1
) (1
DE
T =
T
HE
) ($
(
( T
HE
)(
( D
OR
ITA
)))(
TD
O)(
V(
DE
T(
CO
M))(
TO
( D
ET
( (
DA
VE
))))(
S
NP
DE
T
N
PR
OP
A
UX
V
P
NP
N
IP
N
P
N
PR
OP
M
AN
B
Y S
UM
)) $
) (C
S 9
1
1)
(1 D
ET
= T
HE
) (
$ (
( T
HE
) (
(
DO
RIT
A )
)
) (
T
DO
) (
V
(
( T
HE
) (
C
OM
)
) (
TO
(
DE
T (
(
DA
VE
)
) )
) S
N
P D
ET
N
P
RO
P
AU
X
VP
N
P D
ET
N
IP
N
P
N
PR
OP
(
BY
SU
M )
) $
) M
AN
(C
S 9
1
1)
(1 D
ET
= T
HE
) (
$ (
( T
HE
) (
(
DO
RIT
A )
) )
(
T
DO
) (
V
(
( T
HE
)
( C
OM
)
) (
TO
(
( T
HE
) (
(
S N
P D
ET
N
P
RO
P
AU
X
VP
N
P D
ET
N
IP
N
P D
ET
N
P
RO
P
DA
VE
) )
)
) (
BY
SU
M )
)
$ )
MA
N
(CS
10
1 2
.) ( 2
. C
OM
=
BO
OK
) (
$ (
( T
HE
) (
(
DO
RIT
A )
)
) (
T
DO
)
{ V
(
( T
HE
)
( (
BO
OK
)
) )
( T
O (
(
TH
E )
(
S
NP
DE
T
N
PR
OP
A
UX
V
P
NP
DE
T
N
CO
M
IP
NP
DE
T
N
( D
AV
E )
)
) )
( B
Y S
UM
) )
$
) P
RO
P
MA
N
I I .,
(CS
11
1
2)
(2 V
=
HA
ND
) (
$ (
( T
HE
) (
(
DO
RIT
A )
)
) (
T
DO
) (
(
HA
ND
) (
(
TH
E )
(
( B
OO
K )
)
) (
TO
(
(.
S
NP
DE
T
N P
RO
P
AU
X
VP
V
NP
DE
T
N C
OM
IP
N
P D
ET
T
HE
) (
(
DA
VE
)
) )
) (
BY
SU
M )
)
$ )
N
PR
OP
M
AN
8
98
Z3
(U
T 2
1
2)
(2 +
$N
P A
UX
V
NIL
NP
$ B
Y S
UM
$+
) (
+
( (
TH
E )
(
( B
OO
K )
)
) (
T
DO
) B
E E
D (
(
HA
ND
)
( T
O (
(
TH
E
) (
( D
A V
E )
)
) )
S
NP
DE
T
N
CO
M
AU
X
VP
V
IP
NP
DE
T
N P
RO
P
( B
Y (
(
TH
E )
(
( D
OR
ITA
) )
)
) )
+
) M
AN
N
P D
ET
N
P
RO
P
90
04
5
((U
T 4
1
2)
CR
=
3 (1
+
$ V
T
O $
+)
(WA
S A
PP
LIC
AB
LE
) )
(UT
4 1
2.)
( 2. +
$ T
D
O B
E $
+)
( +
(
( T
HE
) (
(
BO
OK
)
) )
( T
B
E )
ED
(
( H
AN
D )
(
TO
(
( T
HE
) (
(
DA
VE
)
) )
) (
S
NP
DE
T
N
CO
M
AU
X
VP
V
IP
NP
DE
T
N
PR
OP
M
AN
B
Y (
(
TH
E )
(
( D
OR
ITA
) )
) )
)
+
) N
P D
ET
N
P
RO
P
90
05
1
(UT
7
1 1
) ( 1
+
$ D
ET
PR
OP
$ +
) (
+ (
(
TH
E )
(
( B
OO
K )
)
} (
T
BE
) E
D (
(
HA
ND
) (
T
O (
(
TH
E )
(
( D
A V
E
) )
) )
( B
Y
S
NP
DE
T
N C
OM
A
UX
V
P V
IP
N
P D
ET
N
P
RO
P
MA
N
( (
( D
OR
ITA
) )
)
) )
+
) N
P N
P
RO
P
90
05
8
(UT
7
1 1
) (1
+
$ D
ET
PR
OP
$ +
) (
+
( (
TH
E )
(
( B
OO
K )
)
) (
T
BE
) E
O
( H
AN
D )
(
TO
(
( (
DA
VE
) )
)
) (
BY
(
( (
5 N
P D
ET
N
C
OM
A
UX
V
P V
IP
N
P N
P
RO
P
MA
N
NP
N P
RO
P
DO
RIT
A )
) )
) )
+ )
9
00
62
(U
T 8
1
1)
(1 +
$ E
D V
$
+)
( +
(
( T
HE
) (
(
BO
OK
)
) )
( T
B
E )
(
( H
AN
D )
ED
(
TO
(
( (
DA
VE
)
) )
) (
BY
(
( (
S
NP
DE
T
N
CO
M
AU
X
VP
V
IP
NP
N
PR
OP
M
AN
N
P N
P
RO
P
DO
RIT
A )
)
) )
) +
)
90
10
5
EN
D O
F E
VA
LQ
UO
TE
, V
AL
UE
IS
..
NIL
APPENDIX C
SELECTED EXAMPLES
,
-· --· .. ·- -- - ~--,--- .....---~~- --.\... ~ . ' . - .
-: ; :, 1
FU
NC
TIO
N
EV
AL
QU
OT
E
HA
S B
EE
N E
NT
ER
ED
, A
RG
UM
EN
TS
..
BU
RE
AD
((
At)
)
AR
GU
ME
NT
S O
F B
UR
EA
D1
5 A
= B
* C
{
*D
S1
E
*
) IF
/1 F
*
{G)
IF/2
H
T
IF/1
*
I J
52
*
K S
3 T
IF/2
*
L
M IF
/ 3
(N)
S4
*
(IF
/ 4
)
AR
GU
ME
NT
S O
F E
XP
AN
DR
[o
utp
ut
of
scan
] ((
A 1
= (
B (
(OR
R (
C (
(OR
R (
OR
R (
D (
51
E))
(H
(T
IF/
1))
(I
(J S
2))
) X
O)
((IF
/ 1
) F
)))
{K (
S3
(T
IF/
2))
) (L
(M
({
IF/
3) (
(OR
R N
X
O)
S4
))))
) ((
OR
R G
X
O)
{(I
F/
2)
(OR
R {
IF/
4)
XO
))))
))))
VA
LU
E O
F E
XP
AN
DR
((
A=
BC
D S
t E
IF
/ 1
F G
IF
/ 2
IF/
4)
(A=
B
CD
Si
E IF
/ 1
F G
IF
/ 2
) (A
= B
CD
Si
E IF
/ 1
F IF
/ 2
IF/
4)
(A =
B
C
D
St
E IF
/ 1
F IF
/ 2
) (A
=
B
C
H T
IF /
1 IF
/ 1
F G
IF
/ 2
IF/
4)
(A =
B
C
H
TIF
/ 1
IF/
1 F
G I
F/
2)
(A=
BC
H T
IF/
t IF
/ 1
F IF
/ 2
IF/
4)
(A=
B C
H T
IF/
1 IF
/ 1
F IF
/ 2
) (A
=
B C
I J
S
2 I
F/
1 F
~ IF
/ 2
IF/
4)
(A=
B
C I
J
S2
IF
/ 1
F G
IF
/ 2
) (A
=
B C
I J
S
2 I
F/
1 F
IF/
2 IF
/ 4
) (A
=
B C
I J
S
2 I
F/
1 F
IF1
l (A
= B
C I
F/
1 F
G IF
/ 2
IF/
4)
(A=
B
C
IF
/ 1
F G
IF
/ 2)
(A
=
B
C IF
/ 1
F IF
/ 2
IF/
4} (A
=
B
C I
F/
1 F
IF/
2)
(A=
B
K S
3 T
IF/
2 G
IF
/ Z
IF/
4)
(A=
B
K S
3 T
IF/
2 G
IF
/ 2
) (A
= B
K S
3 T
IF/
2 IF
/ 2
IF/
4)
(A=
B
K S
3 T
IF/
2 IF
/ 2
) (A
= B
L M
IF
/ 3
N S
4 G
IF
/ 2
IF/
4)
(A=
B
L M
IF
/ 3
N S
4 G
IF
/2)
(A=
B
L M
IF
/ 3
N S
4 I
F/
2 IF
/ 4
) (A
= B
L M
IF
/ 3
N S
4 I
F/
2.)
(A=
B
L M
IF
/ 3
S4
G IF
/ 2
IF/
4)
(A=
B
L M
IF
/ 3
S4
G IF
/ 2)
(A
= B
L M
IF
.' 3
S4
IF
/ 2
IF/
4)
(A=
BL
M IF
/ 3
S4
I•
/ 2
))
VA
LU
E O
F B
UR
EA
D1
((
t (7
3 A
= B
CD
S1
E
IF/
1 F
G I
F/
2 IF
/ 4
) (7
4 A
= B
CD
S1
E IF
/ 1
F IF
/ 2
IF/
4)
(75
A=
B
C H
T
IF/1
IF
/ 1
F G
IF
/ 2
tF/
4)
(76
A=
B C
H T
IF/
1 IF
/ 1
F IF
/ 2
IF/
4)
(77
A
= B
C
IF
/ 1
F G
IF
/ 2
IF/
4)
(78
A=
B
C
IF
/ t
F IF
/ 2
IF/
4)
(79
A=
B
C I
J
S2
IF
/ 1
F G
IF
/ 2
IF/
4)
(80
A=
B
C I
J
S2
IF
/ 1
F IF
/ 2
IF/
4))
(2
(8
1 A
=
B
C
D
S1
E IF
/ 1
F G
IF
/ 2
) ( 8
2 A
=
B
C
D
S 1
E
IF/
1 F
IF/
2) (
8 3
A =
B
C H
T
IF /
1 IF
/ 1
F
G I
F/
2)
( 84
A
=
B C
H T
IF/
1 IF
/ 1
F IF
/ 2)
(8
5 A
=
B
C IF
/ 1
F G
IF
/ 2)
(8
6 A
=
B
C I
F/
1 F
IF/
2)
(87
A=
B
C
I .T
S2
IF
/ 1
F G
IF
/ 2
) (8
8 A
= B
C I
J
S2
IF
/ 1
F IF
/ 2
)) (
3 (
89
A=
B
L M
IF
/ 3
N S
4 G
IF
/ 2
IF/
4)
(90
A=
B
L M
IF
/ 3
N
S4
IF
/ 2
IF/
4)
(91
A=
B
L
M
IF
/ 3
S4
G I
F/
2 IF
/ 4
) (9
2 A
= B
L
M
IF
/ 3
S4
IF
/ 2
IF/
4))
(4
(9
3 A
= B
L M
IF
/ 3
N S
4 G
IF
/ 2
) (9
4 A
= B
L :
M I
F/
3 N
S4
IF
/ 2
) (9
5 A
= B
L M
IF
/ 3
S4
G I
F/
2)
(96
A =
BL
M IF
/ 3
S4
IF
/ 2
))
(5 (
97
A=
BK
S3
TIF
/ 2
G I
F/
2 IF
/ 4
) (9
8 A
= B
K S
3 T
IF/
2 IF
/ 2
IFi
4))
(6
(9
9 A
= B
K S
3 T
IF/
2 G
IF
/ 2
)
(10
0 A
= B
K S
3 T
IF/
2 IF
/ 2
)))
t-Ui\Cl JU~ lMEl:S~AN
tYALQUGJE ~AS BEEN E~TEREO, ARGUM~Nliee
---------------------------------------" L
C D I:.
f F G
T
-t:-"O Uf ~VALijllOl E, YALUt l ~ • • CCA CM 11) ISi) Cb I~ IG)) IF) CC l~I CO))))I
- ···- ··- ··-·----------------------------- -------------fUM. Tl LN t:VI\L1o.lJC TE ~h!, bE:(N Et-.Tl:kt:D, AktiUM l: NT >•.
~ T lJ f :, ·-- -- - -----t. IL
-----·- ·r£r , 11 2 i
s· j
0
TRAT 't
'1H x -----7:I f\i5T 7( \ AUX-V 0 l ; 6 I H tJ l 1) l l
l It ~ PkC+J h H O 10 ll .. "i .... ··-·--·---------------------- - ·-... -----· ··- . -----· . - . -- ··· ·-· ·- ··- -· . - ...... .. . •·• ..... ·-·· .. .... . CLEfT X 1,
ll 13 14 ······- ,- - -- ,3 --,· ,.---·-----------·· --··-····- ----·------ - ----- - ·--·-·
ARGu~t~TS Lf EX~~NC~ H.l:t: I -· --·-- --·--··- ·---·--·------- - · . ·---- - ---·-- ·- -··-- ---- ·- - ···-- - ---- ----- ---· ---·--···- -- ·· ..
VALUE Gf t:X~A~u~ - l f"H E: -) r · ------··· ----
AKGUM~~ 1 S UF E~PA~U~ . . C $ I . ·- .... . - ---- · --- . ·------------·-·----··-·· .. --·-·--·-- - ·--- -·- --···- -- . ----···-· -.. -- ..
VALUE: Cf- EXf'ANCI( ··11,,1
ARGU~l~TS G~ ~X~A~OR
·-- ---- --- ·-·---· ----- -
- ··r111··r,·-n-t1-.u ll-iH rxTCU~t Ix li7?.ux-vn1rnTn1 ···- - ·. - ···- - ·-·-----
VALUE CF EXPA"1C'( -'"" .... ,-, 'O"y-s-,'"".-t X ... t..-.. ""'t•-x-~-u"'"N.,..~ ... , -x-,-A-t .... , ,.·-v-,-,--·-·-:-·------ - - - - -- ····-··
ENO Gt EVAL~~Ol[, VALUE I~•• -·.-n 417T IT $ HiA~ X .l.....::U--=N~~-=-r-=--x -,-A-u_x_v-.-,-, -, -1 ,.-. ITf l JI ' ' .... l - ' ( u ) n ll )- ·' ' L l l ) ) ri
'
' - ...
PART IV
11 COMPUTER SUP?OTI. ':' FOR .LE:X1CON
DEVELOPMENT AND USE 1:
D. Lieberman
D. Lochak
This Part has been accepted for presentation at the Fourth Annual Meeting of the AMTCL, July 26-27, 1966 Los Angeles, California
.... * •sa::: \ ~ ,- .
Computer Support_ for Lexicon Development_ and Use
Introduction
Internal Data Organization
Tape Organization
Facilities
Contents
Overall (Supervisory) Control
Figures
Page
1
2
s
6
18
follow 21
Intr·oduction
A large lexicon, consisting initially of about 7000 words,
is being con1:3tructed as part of a transformational grammar
of English being developed at the IBM Research Center (see
Part I, section 2. 2, this report). The form of this lexicon is
an adaptation of ideas set forth in Chapte1 · 2 of Aspects of the
Theory of Syntax by N. Chomsky (Ref. 1 ).
The required computer programs fall into three main
classes:
1. The usual clerical programs involved in any kind of
l,.!xical development--additions, deletions, modifications,
partial or complete printouts in convenient formats,
scans of various sorts to assist the lexicographer, etc.
2. programs to apply the redundancy rules either for ex
perimental pruposes, or to form a full derived lexicon.
3. programs to provide partial or full, base or derived
lexicons, in a format suitable for input to a grammar
tester currently under development.
Only the first of the above three classes of programs is de
scribed in this paper.
Internal Data Organization
The discussion below assumes some familiarity with the
linguistic basis for the lexicon as presented in Ref. 1.
The data could be organized in a straightforward way by
storing with each word all of its features, with each feature
appropriately marked+ or - . However, a much more com
pact and manipulable representation can be achieved by taking
advantage of certain properties of the lexicon. Specifically,
each word has a set of classes of features associated with it,
and within each class, all features are relevant, i.e., each
feature is marked either + or - for that word- -there is no
"does not apply" mark. Thus, if each class is listed in full
just once, then for each word in the lexicon only the features
marked plus for that word need be a part of the entry for that
word. The features marked minus are automatically recov
erable by reference to the full list of features for the given
class - -all features not marked plus for that word are auto
matically minus. We could as well have used the convention
that only minuses would be listed with each word and recover
the pluses automatically. However, since it is expected that
there will be many more minuses than pluses in the lexicon,
it is more economical to use the convention that only features
marked plus will be explicitly listed with each word.
As a further economy, one can number the features in
each class, and then use the numbers rather than the full
~ - - - --- ~ --
2
feature specification for coding the individual words.
The lexicon contains five types 0f features:
SC - Syntactic category
SS - Strict subcategorization (categorical contexts)
CO - Co-occurrence (feature contexts)
IN - Inherent
RU - Transformational rule selection
3
There is only one class of SC features, but for each SC feature
there is a separate class of each of the other types of features.
This point becomes important here only because numbers
rather than full feature specifications will be used for coding.
For example, the code SS3 will not represent the same feature
when used to code a noun as it will when used to code a verb.
Thus, it would seem that each class would have to be uniquely
labeled and the coding for each word in the lexicon would have
to include a reference to the relevant classes. However, one
can again take advantage of a particular property of the lexi
con, namely, that among all of the features marked plus for
any word, there can be only one of type SC. Thus, if the full
lists of features are organized with respect to the SC features,
there is no need for additional labeling. The SC code associ
ated with each word will automatically reference the appro
priate lists for the other types of features.
The programming was done in SNOBOL, with extensive
use of the tree functions. The tree-like formats described
below were motivated by the use of the SNOBOL tree functions
and do not necessarily have linguistic significance.
The GLOSSARY (the full lists of feature specifications) as
described above could have the format shown in Figure 1., with
. --- --:--~ -· - . ~ . ,,
the SC type of feature in a special position. However, the
programming and the input format for glossary modification
can be simplified if all the feature types are represented uni
formly. Therefore, at the expense of some redundancy, the
glossary format actually used is as shown in Figure 2.
4
The format for the LEXICAL ENTRIES would follow al
most directly from the linguistic theory were it not for the
existence of homographs. If we decided not to give homo
graphs any special treatment, one might use the lexical entry
format shown in Figure 3. However, programming consider
ations made it desirable to define a logical unit in such a way
as to explicitly connect homographs. This was done by estab
lishing a dummy root, with the lexical entries as branches.
Thus, a two-member homograph has the internal format shown
i.n Figure 4. Si.nee homographs were represented by using a
dummy root, i.t turned out to be convenient to also use a dum
my root with non-homographic entries. Thus, a non-homo
graphi.c entry has the internal format shown in Figure 5. The
cost of the dummy node on tape is just two characters (open
and close parentheses i.n the SNOBOL linear representation of
trees). Si.nee each lexical entry wi.11 require 50 to 100 charac
ters, the addi.ti.onal storage space occupied by the dummy node
i.s negligible.
It is perhaps worth mentioning here that the above discus
sion of formats i.s concerned only with internal machine (and
tape) formats. As far as the lexicographer is concerned, each
entry is a separate entity wh~ther or not it is homographic
with some other entry. The dummy nodes are "unseen" by the
lexicographer.
. . .... . . ... .\ . ,,. . 4.. .. .
The Redundancy Rules are represented by strings. Each
string consists of the characters RD, followed by a number
(the redundancy rule number), followed by a period, followed
by a sequence of feature types and numbers separated by com
mas, followed by a slash, followed by a sequence of feature
types and numbers separated by commas. The interpretation
is that any entry which satisfies the first segment of feature
types and numbers is modified in accordance with the second
set of features. For example, if SC 1 represents the feature
NOUN, IN 1 the feature HUMAN, and IN 2 the feature ANI
MATE, then a redundancy rule (for example, Rule 23) that all
+HUMAN nouns are also +ANilv1ATE would be represented in
ternally in the form:
RD23. SC1, IN1 /INZ.
5
Each feature type can be preceded by a minus. The absence of
a minus sign is interpreted as a plus.
Tape Organization
The first physical tape record is the glossary. The sec
ond physical tape record contains all the redundancy rules in
numerical order with the individual rules separated by a
double dash. The third physical record is the beginning of the
lexicon proper (the lexical entries). The logical units (of the
form of Figure 4 or Figure 5 in the SNOBOL linear represen
tation of trees) are blocked ten to a physical record, with a
double slash as a separator between logical units. Also, to
increase processing speed, each block, as it is formed, is
automatically provided with a 4-digit key representing the
first two letters of the last lexical entry in the block. The key
6
is determined by the mapping:
A-OZ
B -03 I I
I I
Z -27
The last lexical entry is the fictitious word ZZZZZZ. Its
purpose is to simplify the routine for insertion of new words
into the lexicon. With ZZZZZZ as the last entry, all new
words will be inserted somewhere within the lexicon, i. e. ,
there will be no occasion to tack a new word onto the end of
the lexicon. Thus, the algorithm for inserting a new word is
simply: insert the new word in front of the first entry in the
lexicon which is alphabetically greater than it. There is no
need to add the proviso: unless the end of file is reached, in
which case put the new word after the last word. If, using our
procedure, we do reach the end of file, it is an indication of
an error condition, and an error comment is printed out.
Facilities
The following facilities have been programmed.
GLMOD
GLPNT
RDMOD
RDPNT
LXMOD } LXMODA
LXPNT
LXSCN
LXSFT
glossary modifications
printout of glossary
redundancy rule modification
redundancy rule printout
lexicon entry modification (provision is made for two forms of input data organization)
printout of all lexical entries
printout of lexical entries with specified feature patterns
printout of all different feature patterns
t
t
The programming for application of the redundancy rules is
not yet completed.
The facilities listed above and the corresponding input
data formats and control cards are described in detail imme -
diately below.
GLMOD - glossary modification
This facility is used to build the glossary through the use
of additions and deletions. The glossary is i_nitialized by
forming (with a special program) a tape record consisting of
the characters GLOS, which are interpreted as the node con
tents of the root of the glossary tree (see Figure 2). Once
this record is formed by the special initializing program, the
remainder of the glossary can be built by using the GLMOD
facility.
The input for a glossary modification consists of the fol
lowing cards:
7
1. A control card consisting of $GLMOD starting in column 1.
2. A sequence of packets (one or more), each packet con
sisting of:
a. A header card consisting of (-)SCn starting anywhere
after column 1. The parentheses are used to indicate that
the 11 - 11 sign is optional, and are not part of the input. Any
number (including zero) of blanks may separate any of the
input characters, but the order of characters must be as
above. The header card indicates which node immediately
dominated by GLOS leads to the part of the glossary to be
modified by the packet it heads. If the " - 11 sign is present,
the indicated node is deleted (along with everything it
dominates). If the 11 -
11 sign is not used and the indicated
node is not present, it is created at this point in the pro
cedure and is then available while the remaining cards in
the packet are being processed.
b. One or more cards each containing one expression
of the form
(-)
SC
ss co IN RU
(-)n / string of char (but no "(", ")", or",")
8
where the braces and parentheses are used according to
the usual linguistic conventions used in Part I (2. 2) of this
report. and are not a part of the input. The string of
characters following the slash is a feature specification.
Column 1 must not be blank. However, blanks may be
used anywhere up to the slash and will be ignored by the
program. Blanks to the right of the slash will be treated
as part of the input data. The characters "(", ")", and
"," cannot be used as node contents because they are used
by the SNOBOL system as separators in the SNOBOL
linear representation of trees.
The optional minus to the left of the inner braces is
used to delete an entire category type. When this minus
is used, it is meaningless to have anything to the right of
the inner braces since it would be deleted. If a card
starts with a minus and has additional data following the
symbol indicating category type, the card is not rejected
as being ill-formed. Rather, the additional data is ig
nored. If the category type to be deleted is not present
.e l
9
in the portion of the glossary indicated by the header card,
an error comment is printed out.
The optional minus to the right of the inner braces 1s
used to delete the feature number (and the associated fea
ture specification it dominates) indicated by n. Again,
anything on the card to the right of n is meaningless, if
n is preceded by minus, and is ignored by the progran1.
If neither minus is used, the feature number and fea
ture specification will be added to the glossary. If the
number is already in the glossary, it will not be duplica
ted. The new feature specification will replace the old
one, or will simply be added if there was no old one.
Note that the header card only indicates or creates a
node with contents n immediately dominated by GLOS. In
order to assign a feature specification to an SC type of
feature, a card of the type currently being described must
be used.
To illustrate the use of GLMOD, suppose we start with the
initial record GLOS and the sequence of cards:
$GLMOD
SC 8
SC 8 / STR 1 SS 1 / STR 2 SS 4 / STR 3 IN Z / STR 4
SC 3
CO 7 / STR 4 SS 4 / STR 5 CO 5 / STR 6 SS Z / STR 7 SC 3 I STR 8
1.0
Then the resulting glossary is as shown in Figure 6.
Note that sibling nodes with numerical contents are ordered
from left to right in increasing numerical value independently
of the order in which they were entered into the glossary, but
sibling nodes whose contents are feature types are ordered
from left to right in the order in which they were entered into
the glossary. If a feature type under a particular node is de
leted and then added in again, it will appear as the rightmost
branch of the particular node dominating it. The program can,
if necessary, be easily modified so as to order. the feature
type nodes within a sibling set in some pre-dei.ermined way
(for example, alphabetically), but there does not seem to be
any need for it.
GLPNT - Printout of the glossary
The control card for obtaining a printout of the glossary
consists of $GLPNT starting in column 1. The current print
out format is shown in Figure 7.
RDMOD - Redundancy rule modification
The redundancy rules are initialized by a special program
which forms a tape record (following the glossary record)
consisting of a real or fictitious redundancy rule followed by
a double slash. If a fictitious rule is used for initialization,
it can be replaced by a real rule later by using the RDMOD
facility. Actually, all that is needed for initialization is the
string RD1. / /.
The input for redundancy rule modification consists of the
following cards:
1. A control card consisting of $RDMOD starting in column 1.
- - ~ - --- -- ... -. ~ ~· ~'- · - . ..-- .. ---
•
2. A sequence of car:is, each containing one redundancy rule
in the form described above in the section on Internal Data
Organization, except that blanks may be inserted anywhere
(to make the card more readable). This sequence of c?rds
must be ordered according to redundancy rule number (low to
high).
No distinction is made in the input. between modification
and addition. If a new rule has the same rule number as one
of the old rules, the old rule is replaced by the new one.
Otherwise, the new rule is simply inserted in its proper nu
merical order. The double dash separators are not included
in the input- -they are inserted automatically by the program.
RDPNT - Printout of redundancy rules
The control card is $RDPNT starting in column 1. The
present printout format is identical to the internal format
since very little work has been done so far with the redun
dancy rules. If necessary, a more readable printout format
will be provided in the future.
LXMOD - Lexicon entry modification - Form 1
The minimum initialization required for the lexicon is a
record (the third tape record) consisting of the characters
ZZZZZZ representing the fictitious last word of the lexicon.
The reasons for using this fictitious word as a part of the
lexicon were discussed above.
The input data format for LXMOD was determined by the
manner in which the lexicographers carried out their work.
Rather than code a given word all at once for all relevant fea
tures, the lexicographers preferred to consider one feature
at a time and to code all relevant words with respect to that
11
.. ... • .. "'"" ' • J,
12
feature. The work was done directly at a key-punch machine.
For each feature, the result is a packet of cards consisting of
a header card identifying the given feature, and a sequence of
cards containing the words which are to be marked+ with re
spect to that feature. However, before the packet can be used
as input data, some additional information must he supplied to
distinguish among homographs. For example, if nouns were
being coded with respect to the feature S83, there is nothing in
the header card containing S83 to indicate that the coding is
meant to apply only to the noun form of a homo graphic set. In
order to distinguish among homographs, an additional card is
used containing more information regarding the feature content
of the words which are to be marked + with respect to the fea
ture indicated on the header card. For the above example, the
additional card would specify that the word must be a noun.
However, the distinction may be at a lower level, as for ex
ample, in words like bat (baseball bat, or the bat which flies),
in which case the condition card might contain +NOUN and
+ANIMATE (SC 1, IN 2) to select the flying bat or +NOUN and
-ANIMATE (SC 1, -IN 2) to select the baseball bat.
The input cards for the LXMOD form of lexicon entry
modification (for words already in the lexicon--new word ad
ditions will be described later) consist of the following:
1. A control card with $LXMOD starting in column 1.
2. A sequence of packets, each packet consisting of:
a. A header card indicating the feature type and number
to be added. Column 1 must be blank. The feature type
symbol must consist of two characters and must occupy
columns 2-3. Only one feature number is permitted, but
it can be anywhere on the card fallowing the feature type
symbol.
b. Optionally, a condition card specifying sufficient f ea
ture content to permit correct selection among homo
graphs. Column 1 must be blank. The characters IF
must appear in columns Z-3. The feature types and num
bers start anywhere after column 3. If more than one
feature type and number is specified, a comma is used as
a separator. Blanks may appear anywhere within the
series of feature types and numbers. Only one card of
this type may be used (at present).
c. A sequence of word cards containing the words to be
marked. Each card must start in column 1. There can
be any number of words on a card, with one or more
blanks as separators. A word cannot be continued from
one card to the next.
3. The last packet must be followed by a card with XX in
columns 1 - Z.
13
The first step in the LXMOD routine is alphabetic sorting
and rearrangement of the input data. If only one packet were
allowed, the need for sorting could be eliminated by requiring
that the sequence of words in the input data be in alphabetic
order. This, in fact, is what is done in the second form of
lexical entry modifications, called LXMODA, described below.
However, the purpose of the LXMOD facility is to permit the
processing of several packets in one run. It would be very in
efficient to run through the lexicon separately for each packet.
Therefore, as the first step in the LXMOD routine, the input
data is rearranged. For each word in the input data, a logical
..
record is formed consisting of a number indicating the word
length, the word itself, the material in the header card of the
packet containing the word, and the material on the condition
card if one was used. All blanks are deleted. The nur..1ber is
separated from the word by a comma, and the condition is
separated from the header by a slash. For example, given
the packet
SS 18 Header Card IF SC 20, SS 4, IN 7 Condition Card
I I I I
\fORD Word Card
one of the logical records, after rearrangement, would be
4, WORDSS18/SC20, SS4, 1N7.
The logical records are then sorted in a field consisting of the
word and (for reasons discussed below in connection with addi
tions of new words) the two characters immediately following
the word. The inclusion of the two additional characters does
not affect the ordering of different word forms, but only the
ordering of different occurrences of the same form. Multiple
occurrences of the same form could result from the same
word occurring in mo~e than one packet, or from homographs
in the same or different packets.
After the sort, the resulting list is compared with the
existing lexical entries in one pass and the appropriate modi
fications are made.
U a word (with specified feature content if a condition is
used) is not present in the lexicon, a comment to that effect is
printed out. The word is not automatically inserted. This
•
•
•
•
lS
policy was adopted in order to prevent some of the typographi
cal errors in the input data from entering the lexicon. Simi
lar precautions were not taken in the gloss :i ry modification
procedure because the glossary is small enough so that error
detection and correction involves very little work. The volume
of lexical entries, on the other hand, is large enough to make
error detection and correction a significant problem and
should be taken into account at every stage of the processing.
New words (which are not necessarily new forms) are
added by including a packet with a header card which, in place
of a feature type and number, contains the characters AA fol
lowed by a tree in SNOBOL linear form. This tree becomes
the part of the lexical entry dominated by the new form (see
Figures 4 and 5). The tree must contain the branches SC, SS,
CO, IN, RU, and as much additional coding as required to
distinguish the new form from homographic forms, if present.
It is advisable, although not required by the programs, to in
clude at least the coding for the SC type of feature. To illus -
trate, a packet for entering new noun forms (SC 1) might con
sist of:
AA(SC(i), SS, CO, IN, RU) WORD WORD - - - - - - - -
Header Card
Word Cards
It was mentioned above that in sorting the input words, the
sort field was extended to include the first two non-blank .char
acters on the header card associated with a given word. The
reason for this can be given, now that the procedure for en
tering new words has been described. It is desirable to permit
' ....
new words to receive additional coding, during the run in
which they are first entered into the lexicon, by permitting
them to appear in other packets simultaneously with their ap
pearance in a new-word packet. But since additional coding
can be applied only to words already in the lexicon, a word
appearing in a new-wo1·d packet must be processed before oc
currence of the same word in other pack,~ts. This sequence
l I..>
of processing is achieved by extending the sort field as de
scribed above and using the characters AA as the first non
blank characters (columns Z-3) on the new-word packet header
card.
The LXMOD facility can also be used to print out selected
lexical entries. This is done by forming a packet with a
header card containing the characters ZZ in columns Z-3.
The optional condition card can also be used. The use of ZZ
as the symbol for selecte d printout ensures that printout will
be the last process applied to a given word, i.e., the printout
will contain all modifications which may have been applied to
the given word during the run in which the word was selected
for printout. The format of the p:dntout is the SNOBOL linear
representation of the subtree dominated by the word being
printed out (see Figures 4, 5).
Since sorting the input words requires that all of the input
be in core at once, there are space limitations on the number
of words that can be handled in one run. The precise number
depends on the amount of coding and conditions associated with
the various words. However, the limit appears to be in the
range of 500-700 words. The running time for processing 500-
700 words is somewhat under 5 minutes (roughly, 1 / 3 of the
time for compilation, 1 / 3 for sorting, and 1 / 3 for the actual
modification of the lexical entries).
LXMODA - Lexicon entry L1odifications - Form 2
The LX?viODA facility performs the same functions as the
LXMOD facility, but takes sorted input data and can therefore
bypass the sorting routine. Thus, processing time is de
creased, and more importantly, space limitations are elimi
nated. LX?viODA is used for the initial loading of large word
classes, and for the coding of large subclasses. Since the
lexicographers normally work with alphabetized word lists,
no extra work is required to obtain sorted input data.
The input format for LXMODA is the same as for LXMOD
(described above) except that the control card contains
$LXMODA starting in column 1, and there can be only one
packet per run.
LXPNT - Printout of all lexical entries
The control card for printout of all lexical entries con
tains $LXPNT starting in column 1. The present printout
format is shown in Figure 8.
LXSCN - Printout of lexical entries with specified feature patterns
The input cards are:
1. A control card containing $LXSCN starting in column 1.
17
2. A card with a sequence of feature types and numbers, with
a comma as a separator between successive feature-number
specifications. A minus may precede a feature type. Other -
wise, plus is implied. Blanks may occur anywhere.
A lexical entry is considered as satisfying the specification if
it does not contradict it, i.e., the feature pattern is considered
..; \ . .,....
to be a partial rather than an exhaustive description. For ex
ample, if the feature specification were SC 1, all lexical en
tries marked +SC 1 would be printed out regardless of the re
mainder of their coding. If the specifications wer~ -SC 1, all
entries except those marked +SC 1 would be printed out.
The printout format is the SNOBOL linear representation
of the subtree dominated by the word being printed out (see
Figures 4, 5).
LXSFT - Printout of all different feature patterns
If each feature pattern is thought of as defining a class of
lexical entries, then LXSFT provides a list of all the classes
and the corresponding feature patterns.
The control card is $LXSFT starting in column 1.
The printout format is the SNOBOL linear representation
of the subtree dominated by the first word in the lexicon with
the given feature pattern.
Overall (Supervisory) Control
The non-modificational facilities (GLPNT, RDPNT,
LXPNT, LXSCN, LXSFT) require only an input tape. The
modificational facilities (GLMOD, RDMOD, LXMOD,
LXMODA) require an input tape (the current lexicon) and an ·
output tape (the modified lexicon). If only one section of the
lexicon is modified, the other sections must be copied onto
the output tape in the correct order. For example, if a run
involves only redundancy rule modification (RDMOD), the
glossary must be copied onto the output tape before the redun
dancy rule modification is carried out, and the lexical entries
must be copied after the redundancy rule modification. Also,
if both modificational and non-modificational facilities are
''-'
------~-..-,.-. ..--..,----,-...,.,,..,._,.~----........... --.,--.:-,,..__, ........ .......,..=,....:= , _ ____ __
used in the sam e run, some means must be provided for se
lecting the version of the lexicon (old or new) to which the non
modificational facilities are to be applied. These aspects of
system management are handled by the following control cards
and conventions.
The input tape (the current lexicon) is mounted on channel
B 5 (logical unit 1 O).
The output tape (the modified lexicon), if used, is mounted
on channel AS (logical unit 9).
In a non-modificational run, only an input tape need be
used. An output tape can be used simultaneously, if desired,
to obtain a copy of the lexicon. If only an input tape is used,
the only additional control card required is a card with
$NDRUN starting in column 1. This card is the final control
card. Its function is to rewind and unload the tape. The re
maining control cards can be in any order, but it will save
some running time to carry out the processing in the order:
glossary- -redundancy rules- -lexical entries.
In a modtficational run, an additional control card is re
quired for each segment of the lexicon which does not undergo
modification. These cards are $NDGL, $NORD, and $NDLX
for the glossary, the redundancy rules, and the lexical entries,
respectively, and all start in column 1. The function of these
cards is to copy the respective segment of the lexicon onto the
output tape. If a given segme-nt of the lexicon is modified, the
presence of the corresponding $NDXX card will have no effect,
provided that it follows (not necessarily immediately) the mod
ification card and associated data cards in the input data.
Modifications or copies must be done in the order: glossary--
• • "I \ •f:(4, • •
redundancy rules- -lexical entries. Non-modificational con
trol cards can be placed anywhere, so long as they do not
separate some other control card from its associated data
cards. However, it will save running time if all of the glos
sary processing is done before all of the redundancy rule pro
cessing, and the lexical entry processing is done last. The
final card (just as in the non-modificational case) is $NDRUN
starting in column 1. A recommended outline of input data
and control card sequence is shown in Figure 9.
A run with only the following control cards:
$NDGL
$NORD
$NDLX
$NDRUN
will yield a copy of the lexicon.
In a run involving both modificational and non-modifica
tional facilities, the selection of the version of the lexicon to
be used with a given non-modificational control card is gov
erned by the convention that the most recent version of the
relevant segment of the lexicon is used. Thus, if at the time
the non-modificational control card is processed, the relevant
segment of the lexicon has undergone modification, the modi
fied version is used. Otherwise, the unmodified version is
used. For example, if it is desired to print out the current
glossary, then modify it and print out the modified version,
the following sequence of cards is used:
$GLPNT
$GLMOD
$GLPNT
input data for glossary modification
additional processing
If no additional processing is desired, the second $GLPNT
would be followed by the sequence:
$NDGL
$NORD
$NDLX
$NDRUN
The second $GLPNT card could be placed anywhere before the
$NDRUN card, but the above sequence is preferable because
it keeps the rewinding of the tape to a minimum.
Reference
1. N. Chomsky, "Aspects of the Theory of Syntax", The
M. I. T. Press, Cambridge, Massachusetts, 1965.
t I .
~
... __
_ ,
AD
J
fea
ture
fea
t.
fea
t.
specif
ica
tio
n
spec.
spec.
Fig
ure
1.
A p
oss
ible
glo
ssa
ry
fo
rmat
wit
h t
he S
C t
yp
e o
f fe
atu
re i
n a
sp
ecia
l p
osi
tio
n.
: ' . " f
spec.
spec.
feat.
sp
ec.
Fig
ure
Z.
Th
e g
loss
ary
fo
rmat
actu
all
y u
sed
, w
ith
all
featu
re t
yp
es
rep
resen
ted
un
ifo
rmly
.
·J
I .
!
• I I ri II :,
·1
3
etc
.
Fig
ure
3.
A p
oss
ible
lex
ical
en
try
for
111a
t.
'
·,
Fig
ure 4
.
·1
-D
UM
MY
RO
OT
Th
e l
ex
ical
en
try
fo
rmat
actu
all
y u
sed
, il
lustr
ati
ng
th
e r
ep
resen
tati
on
of
ho
mo
gra
ph
ic e
ntr
ies.
I l i'
I l I . ~
.,-
DU
MM
Y R
OO
T
Fig
ure
5.
Th
e l
ex
ical
en
try
fo
rmat
actu
all
y u
sed
, il
lust
rati
ng
th
e r
ep
resen
tati
on
of
no
n-h
om
og
rap
hic
en
trie
s.
I I ., 1
'
ST
R6
) (S
TR
4)
(ST
R7
) (S
TR
S)
(ST
R8
S
TR
1}
(S
TR
Z)
(ST
R3
}
(ST
R4
Fig
ure
6
SC 1 NOUN/ IN i =HUMAN=/ IN 2 =ANI}JATE=/ IN 3 =ABSTRACT=/ IN 4 =PROPER=/ ss 1 DET l*•*I ss 2 DETl•••IS/ ss 3 •••IS/ ss 4 •••I
SC 2. VERB/ ss i •••/NP/ ss 2 •••IS/ ss 3 •••/NP/S/ ss 4 ·••I PP/
Figure 7. Glos aary Printout Format
ADAM /SC/ 1 /SS/ /CO/ /IN/ 1 /RU/ ADDITION /SC/ 1 /SS/ /CO/ /IN/ /RU/ ADDRESS /SC/ 1 /SS/ /CO/ /IN/ /RU/ ADJUSTMENT /SC/ 1 /SS/ /CO/ /IN/ /RU/ ADMINISTRATION /SC/ 1 /SS/ /CO/ /IN/ /RU/ ADMIRAL /SC/ 1 /SS/ /CO/ /IN/ 1 /RU/ ADMIRATION /SC/ 1 /SS/ /CO/ /IN/ /RU/ ADMISSION /SC/ 1 /SS/ /CO/ /IN/ /RU/ ADOPTION /SC/ 1 /SS/ /CO/ /IN/ /RU/ ADULT /SC/ 1 /SS/ /CO/ /IN/ 1 /RU/ ADVANTAGE /SC/ 1 /SS/ /CO/ /IN/ /RU/ ADVENTURE /SC/ 1 /SS/ /CO/ /IN/ /RU/ ADVERTISEMENT /SC/ 1 /SS/ /CO/ /IN/ /RU/ ADVERTISING /SC/ 1 /SS/ /CO/ /IN/ /RU/ ADVICE /SC/ 1 /SS/ /CO/ /IN/ /RU/ ADVISER /SC/ 1 /55/ / CO/ /IN/ 1 /RU/ ADVOCATE /SC/ 1 /SS/ /CO/ /IN/ 1 /RU/ AEROPLANE /SC/ 1 /SS/ /CO/ /IN/ /RU/
Figure 8, Lexical entry printout format.
$NDGL
$NORD
$NDLX $NDRUN
all processing having to do with the glossary
all redundancy rule processing
all lexical entry processing
Figure 9. Outline of recommended input data and control card 1equence for a modificational run .
. -~--= . ------ --_ ....... ..:::.::::::.-----, .... .,..,..,_,..,,,.,...--~ ... -_.- - ·- - ----
Unclassified Security Classification
DOCUMENT CONTROL DA TA • R&D (Security cl•••lllc•tlon ol title, body ol •betr•ct •nd lnde1rlnl _.note ,'lon muet be entered wflen the onr•II report i• el1111•illed)
I . ORI GINA TING ACTIVl'!'Y (Corpor•te euthor) 2• .. EPO .. T IECU .. ITY C L.AISIFlt;ATIO•I
IBM- T. J. Watson Research Center Unclassified
Yorktown Heights, New York 10598 Z b . GROUP
L
J. Al!PORT TITLE
"Specification and Utilization of a Transformational Grammar. 11
4 . OESCRIPTIVI! NOTES (Type ol report and lncluelve d•tH)
Scientific Reoort 5. AUTHOR(SJ (L••t nane, llret n•me, Initial)
'
Lieberman, David V. et al
6 , REPORT DATE 1, . T-OTAL. NO . 01' PAGEi 7b. NO . 01" REl"I
April 1966 308 12 la. CONTRACT OR GRANT NO. la. 0 .. IGINATO .. 'I REPORT NUMBE .. (SJ
AF 19(628)-5127 b. P .. OJIIC T NO .
c . .,,. OTHII .. "JPO .. T No(I) (Any ot11e,n1o1111ber• dl•t may ..... ,,,..d thl• report
d.
10, AVAILABILITY/LIMIYATION NOTICES
11 , SUPPL EMEN TA"Y NOTEI U. SPONIO .. ING MILITARY ACTIVITY
Electronic Systems Di vision Air Foree Systems Command - USAF Laurence G. Hanscom Field, Mass,
13, ABSTRACT
Scientific Report No. 1 contains four (4) parts: Part I - The IBM Core Grammar of Enslish.
Our current grammar of English is presented in full, and numerous derivations are carried out in detail to illustrate the current generative power of the grammar.
Part II - Desisn of a Grammar Tester. The design considerations on which the present version of the tester wa.s based are discussed, and a set of tentative input, output and control formats are presented.
Part W - Prosrammin& for the Grammar Tester. A LISP implementation of the grammar tester is presented. The overall flow of control and the various special functions are described.
Part IV - Comfuter SUffOrt for Lexicon DeveloEment. A program package (programmed in SNOBOL) to facilitate the compilatior • modification, scanning, etc., of the lexicon is described.
(D. v. Lieberman)
DD FORM 1 JAN t• 1473 Unclassified
.! . Security Cla•• ification
Unclassified Securit Clr-ssification
u . LINK A LINK B LINK C KEY WORDS
ROL.E WT ROL.E WT ROL.E WT
Language Processing
Linguistics
Grammar
Syntax
Lexicography
INSTRUCTIONS
1. ORIGINATING ACTIVITY: Enter the name and address of the contractor, subcontractor, grantee, Department of Defense act iv it y or other organization ( corporate author) issuing the report,
2a. REPORT SECURITY CLASSIFICATION: Enter the overall security classification of the report, Indicate whether "Restricted Data" is included. Marking is to be in accor~ ance with appropriate security regulations,
2b. GROUP: Automatic downgrading is specified in DoD Di· rective 5200, 10 and Armed Forces Industrial Manual. Enter the group number. Also, when applicable, show that optional markings have been used for Group 3 and Group 4 as author• ized.
3. REPORT TITLE: Enter the -::omplete report title in all capital letters. Titles in all CJISes should be unclassified. lf a meaningful title caMot be selected without classification, show title classification in all capitals in parenthesis immediately .following tl\e title,
4, DESCRIPTIVE NOTES: If appropriate, enter the t ypc of rel,lort, e. g,, interim, progress, summary, annual, or final, Give the inclusive dates when a specific reporting pd iod is covered.
S. AUTHOR(S): Enter the name(s) of author(s) as ·shown on or in the report, Ent et last name, ,first name, middle initial, If :r.ilitary, ·show rank en-:i branch of service, The name of the principal oathor is an absolute minimum requirement.
6. REPORT DAT'.!:: Enter the date of the report as day, month, year; or month, year, If more than one date appears on the report, use date of public at ion.
7a. TOTAL NUMBER OF PAGES: The total page count shou~d follow normal pa1inat4on procedures, i, e., enter the number of pages containing information.
7b . NUMBER OF REFERENCES: Enter the total number of references cited in the report,
8a. CONTRACT OR GRANT NUMBER: U appropriate, enter the applicable number 'of the contract or grant under which the report was written.
Sb, 8c, & 8d. PROJECT NUMBER: Enter the appropriate military department identification, such as project number, subproject number, system numbers, task nurfiber, t!tc,
9a. ORIGINATOR"S REPORT NUMBER(S): Enter the offi• cial report number by which the document will be identified and controlled by the ori1inating activittt• This number must be unique to this report.
9b. OTHER REPORT NUMBER(S): If the report has been assigned any other report numbers ( either by the originator or by the sponsor), also t-nter this number(s),
10, AVAILABILITY/LIMITATION NOTICES: Enter any limitations on further dissemination of the report, other than those
GPO 886• 551
impos•?d by security classification, using st~ndard' statements such as:
(1) "Qualified requesters may obtain copies of this report from DDC."
(2) "Foreign announcement and dissemination of this report by DDC is not authorized."
(3) "U. S. Government agencies may obtain copies of this report directly from DOC, Other qualified DOC users shall request through
(4) "U. S. military agencies may obtain copies of this report directly from DDC. Other qualified users shall request thrOUf!:h
"
" (5) "All distribution of this report is controlled. Qual•
ified DOC users shall request through
" If the report has been furnished tc the Office of Technical
Services, Department of Commerce, for sale to the public, indicate this fact and enter the prictf, if known.
11, SUPPLEMENTARY NOTES: Use for additional explanatory notes,
12, SPONSORING MILITARY ACT!VITY: ·Enter the name of the departmental project office or laboratory sponsoring (payin~ for) the research and development, Include addre&s,
13 . ABSTRACT: Enter an abstract giving a brief and factual summary of the document indicative of the report, even though it may also appt: u elsewhere in the body of the technical re• port . If adffitional space is required, a continuation sheet shall be attached .
It is highly desirable that the abstrac t of classified reports be unclassified. Each paragraph of the abstract sh"ll end with an indication of the military security classification of the information in the paragraph, represeftted as (TS), (SJ . (CJ, nr (U) .
There is no limitation ,ra the length of the abstract. How • ever, the suggested length is from 1 SO t'.> 225 words.
I ' 14. KEY WORDS: Key words are technically meaningful terms or short phrases that characterize a report and may be used as index entries for cataloging the report . Key words must be selected so Uiat no security classification is required. Identi· fiers, such as equipment model designation, trade name, military project code name, geographic location, may be usert as key words but will be followed by an indication of technical context. The assignment of links, rules, and weights is optional .
Unclassified Security Classification
-- ------- -
' • •
IBM - Research Division P. O. Box 218
Yorktown Heights, New York 10598
MEMORANDUM TO:
SUBJECT:
ENCLOSURE 1:
THOMAS J. WATSON RESEARCH CENTER
July 22, 1966
Distribution List
Scientific Report No. 1 - Interim entitle d, "Specification and Utilization of a Transform~tional Grammar," by D. Lieberman
Form DD 1473
Copies of the subject Scientific Report, prepared for the Air Force Cambridge Research Laboratories, Office of Aerospace Research, United States Air Force, under Contract AF 19(628)-5127, which was recently disseminated, contained a Form DD 1473 with incomplete information.
Accordingly. you are requested to substitute the enclosed Form DD 1473 for the one contained in -the subject Scientific Report.
JHS/ et Enclosure
Man Reaearch Contract•
-I •
Unclas siiied Security Classification
.. DOCUMENT CONTROL DA TA • R&D . -(Security cl•Hlllcatlon ol lllle , body al •balr•cl •nd indeicin, .,nolalion mual be enlered wh•n lhe over•II raport i • cla s s , t ied)
1 OJ:llr.lNATIN G ACTIVITY (Corporate author) 2• - REPORT SIE CURI TV CLASSIFICATION
IBM - T. J. Watson Research Center Unclassified 2b GROUP
Yorktown Heights, New York 10598 3 nEPORT TITLE
"Specification and Utilization of a Transformational G .::- a1r.,mar. II
4 DESCRIPTIVE NOTE~ (Type al reporl •nd lnc/ualve d•tea)
Scientific Interim Reoort S AUTHOR(S) (L••t name, llral name , Initial)
Lieberman, David v. et al 6 - REPORT DATE 7a . TOTAL. NO . OF PAGES l 7b. NO . OF REF!I
March 1966 308 12 811 CONTRACT OR GRANT NO . AF19{628)-5127 9•- Ol'IICIINA TOR'S REPORT NUMBER(S)
h . PROJECT No , 4641, 02
c DOD Element 62405304 lb . OTHIEA AIEPOAT NO(S) (Any olhernumbera that m•y be •••1"1ed th I• reporl)
d DOD Subelement 674641 AFCRL- 66- 270 10 A. VA IL ABILITY / LIMITA.TION NO rlCIES
Distribution of this document is unlimited.
1 I SUPPL EMIENTARY NOTES 12 , SPONSORING MILITARY ACTIVITY
Hq. AFCRL, OAR (CRB) United States Air Force L. G. Hanscom Field1 Bedford1 Mass.
13 ABSTRACT
Scientific Report No. 1 contains four ( 4) parts:
Part I - The IBM Core Grammar of English. Our current grammar of English is presented in full, and numerous derivations are carried out in detail to illustrate the current generative power of the grammar.
Part ll - Deaisn of a. Gramrnar Tester. The design considerations on which the present version of the tester was baaed are discussed, and a set of tentative input, output and control formats are present ed.
Part m ·- _?rogramming for the Grammar Teater. An LISP implementation of the grammar tester is presented. The over-all flow of control and the various special functions are described.
Part IV - Com2uter Suf!?ort for Lexicon Develo;ement. A program package (programmed in SNOBOL) to facilitate the compilation, modification, scanning, etc., of the lexicon is described.
(D. V. Lieberman)
DD FORM I JAN 154 1473 Unclassified
Security Classification
Unclassified ----S~curity Classificittion 14
KEY W0 .. 05
Language Processing
Linguistic a
Grammar
Syntax
Lexicography
. . . ._
•
LINK A LINK
.. 01.1: WT WT
INSTRUCTJCNS ~ ( 1, ORIGINATING ACTIVITY: Enter the name and address of the contractor, subcontractor, 1r·antee, Department of Defenae activity or other or1anization (corporate author) i-•uin1 the report.
2a. REPORT SECURTY CLASSIFICATION: Enter the overall security clauifica\ion or the report, Indicate whether "Re• tricted Data" is included. Markin& h.' to be in accordance with appropriate security re1wations,
2b. GROUP: Automatic downcradin1 is specified in DoD Directive 5200, 10 and Armed Forces Industrial Manual, Enter the i,tronp number. Also, when applicable, show that optional markings have been used for Group 3 and Group 4 as author-ized. ·
3, REPORT TITLE: Enter the complete report title in all capital letters, Title• in. all ca•~• should be unclanified. If a meaninlful title caMot be ae,lected witlaout claHUication, 11how title claHificaUon in all capitals in parentheaia immediately followins the title,
4. DESCRIP'l'IVE NOTES: If appropriate, enter the type of report, e. I•, interim, prosress, summary, annual, or final, Give the inclusive dates when a specific reportin1 p~riod ia COVf!red,
5. AUTHOR(S): Enter the name(1) of author(,) at1 shown on or in th~ report, Ent et 1 Ht name, first name, middle initial, Ir :r.ilita~y, 11how rank an-i branch of service, The name or the prinl'ipal .. :•thor ilt an abaolute minimum requirement.
( . , t,, REPORT DAT~ Enter the date of the report u day, month, year; or month, year, Ir more than one date appears nn the rep<'rt, us.- date or oublicatlon.
'in. TOTAL NUMB~R OF PA(;ES: The total pa1e count ,-hould follow normal pa1ination procedure,, i, e,, enter the 11umber nf P•lt!B containh," information.
71.J. NlJMltER OF REFERENCES: Enter the total number of rcferenc~s c-ited in tt:e report,
· 1 Ba. CONTNAC'f OR GRANT NUMBER: If appropriate, enter the .. pplicable number nr the contract or ~•nt unde, which the rf'POrt w .. writhtrlo .
!It:,, 8c, &, 8d. PROJECT NUMBER: Enter the appropriate 1,;ilit .,.,y depart"'vnt identificutlon, •uch H project number, ,ubproject number, sy• tf'm nur.,t,e,1, task number, etc,
na. ORIGINATOP.'S RF.PORT, NUMBER(S): Ent"" the official r"()ort i,umbf!r by which the document will be identified ""d controlled by thw ori11natlna activity, Thi• number muat hf' _uniquf' to th, .. repnrt, t •
1
9~. OTHE',R ~~:PORT Nl:MBER(S): If th~ report has been a-• igned 1•ny ~ther n,,crt number• (either lw tM. orifinator or b ;· the apon11or.), 111 sn enter thi • number( 1),
10, AVA,IL~BILITY;LIMITATJON NOTICES: Enter any Um-it .. tions on further rli11umination of the report, other than tho• e
imposed by security classification, usin& standard statements such as:
(l) "Qualified requesters may obtain copies or this report from DDC. ''
(2)
(3)
(4)
(5)
"Forei1n aMouncement and dia•emination of this report by DOC is not authorized."
"U. S. Government ag~ncies may obtain co!)ies of this report directly from DOC, Other qualified DDC users shall request through
"U. S. military agencies may obtain copies of this report directly from DOC. Other qualHied users •hall request through
"
" "All distribution of this report is con troll ed. Qualified DDC uaera shall request through
" ----------------- · If the report h111 been furni • hed to thf! Office of Technical Services, Department of Commerce, for sale to the public, indicate this fact and enter the price, if k'1o·wn.
11, SUPPLEMENTARY NOTES: Use for additional explanatory notes.
12, SPONSORING MILITARY ACTIVITY: Entt>r the name of -the departmental project office or laboratory sponi.orin1 (pa) .. in,1 for) the research and development, Include addres•, 13 ABSTRACT; Enter an ab11tract 1ivin1 a brif'r and factual summary of the document indi'cative of the report, even thou1h it may also appear elsewhere in the body of the technical report. If additional apace is required, a continuation sheet shall ' bl.' attached.
It is hi1hly desirable that the ab1trar.t or d11ssified report• be unclaaaified. Each para1raph of the abstract shall end with an indication of the military security claHification of the in• formation in the p• r• 1raph, represented as rrs, . rs, . (C , . or (U) .
There is no limitation on the len1th' of the whstract . However, the su11ested len1th is from l SO t? 22!i words .
14. KEY WORDS: Kev words are technically mcanin1ful term• or short phraae, that characterize a report and may be used aa index entries for catalo1in1 the report. Key words mu!lt be selected so that no security claHification is required. Identifiers, 1uc:h as' equipment model desisnation, trade name, military proJeft code name, 1eo1ra~hic loc• Oon, may be ur1ed u key words but will be followed by an indication of trrhnkal context. The as1ipment or links, rules, and wciithts is llptional.
Uncla• aified Security Classification
