| { | |
| "paper_id": "C67-1007", | |
| "header": { | |
| "generated_with": "S2ORC 1.0.0", | |
| "date_generated": "2023-01-19T12:35:35.403261Z" | |
| }, | |
| "title": "", | |
| "authors": [], | |
| "year": "", | |
| "venue": null, | |
| "identifiers": {}, | |
| "abstract": "", | |
| "pdf_parse": { | |
| "paper_id": "C67-1007", | |
| "_pdf_hash": "", | |
| "abstract": [], | |
| "body_text": [ | |
| { | |
| "text": "1.0 Here, we will present a rather simplified description of an algorithm for transformational analysis (decomposition) of English sentences.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Our purpose here is not to discuss the transformational theory 3 the full details of the theoretical formulations of the algorlthm 3 or ofthe grammar W. Rather, we will present a set of examples of the decomposition and some discussion of them with the hope that it will give enough insight into the capability of the algorithm and indicate to some extent the power of transformational analysis\u2022", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Transformations are certain relations among sets of sentences and in particular, it is possible to relate a given sentence to a set of elementary sentences (kernel sentences) by means of transformations. It should be emphasized tha t i t is not assumed and also not im-pl~ed in the algorithm that any kind of prior analysis (either strlng analysis or constituent analysis) is requlred as a prere~uisltelfor the present algorithm. ~Such a detailed description will appear later elsewhere. \u2022 the ~omaln of the transformation to other \"sentence forms. This exte~.slon which contains infinitely many sentence forms can be represented by+ first listing a finite number of sentence forms in the extension and all the remaining sentence forms in the extension are obtained by certain recurslve rules (see the i-llsts in 1.3).", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "I.i", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "A unan~.z, transformation transforms one sentence form into another sentence form and a bi~nary transformation transforms a pair of sentence forms into another sentence form. Each unary transformation defined on a sentence form may be represented by a sequence of class marks constituting another sentence form. Most binary transformations can be defined as interruptions of certain unary transformation sequences at stated positions by certain other sequences of class marks. These Interruptlng sequences are not sentence forms but are deformatlons_-o~ sen-\"", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "1.3", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "-------\"--'se ~ o~ <+ tence forms corresponding to the ~ sentence form of the binsry transformation. For example, John was detained by the old woman decom~ses into woman detained John and woman t be old with a passive transformation on the first kernel and a binary transformation on the sentence John was detained by the woman and the kernel sentence woman t be old. ~", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "1.3", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The sentence form corresponding to the passive transformation, N t be en V by N is then interrupted by the sequence AN before the last AN is a deformation of the kernel sentence form N t be A", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "1.3", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "symbol.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "1.3", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "-which is the second sentence form of the binary transformation. The resulting sentence form is thus N t be en V by A B,. In the resulting sentence form the shared symbol N appears only once. Such a symbol which two transformation sequences \u2022 share (or on which t_hey overlap) be ignore here the article th.._~e for simplicity. 3. Sequences each of which represents a deformed kernel-form and is ~he concept of the residue can be extended to shared sequences as well as sequences which replace a given symbol in another sequence. The term carrier is used in this context. This device has been extensively used in this algorithm. not a sentence form, but, when substituted for a symbol in a sequence (of ~et I or 2 or 3), preserves the character of that sequence (e.g. er V or/L , n A of N).", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "1.3", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "There are also rules for inserting sequences from the second set into other sequences or into sequences of the third set, without changing the character of either.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "1.3", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "All insertion or replacement rules are stated in the interruption lists appearing between every pair of adjacent symbols of each sequence. ", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "1.3", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The dictionary for Transformation^Crannnar must carry far more de- The analysis is preceded by a replacement of the Words in the sentence by corresponding entries in the dictionary.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": ":al", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The process of analyzing a sentence begins in postulatlng (in turn) all those strings in the grammar which may occur at the beglnnlngP--q~o//~ of a sentence (and whose initial symbol is the s~me as the first symbol in the data). (See i I of #30). Each verified postulate forces other", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "2.3", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "\u2022 postulates as its consequences I until the termlnal period of the sentence is found which is consistent with a hypothesis. It is qulte likely that an analysis will produce more than one correct reading of a sentencej because structural ambiguity is even more frequent in transformational grammar than it is in the mere s~ring analysis.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "2.3", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "-7-3.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "2.3", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Four examples of decomposition obtained by the algorithm follow.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Examples of decomposition", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "These examples are intended to exhibit the power of the algorithm. ~eads is a V for nF principal as found in dictionary. This example illustrates the process of analysis in some detail. Because of space limitations for this paper a rather simple structure had to be chosen for this purpose. A short dictionary of the words in the sentence has been prepared and also a small set of grammar strings in provided for this illustration. Both were greatly simplified so that rich grammatical material will not obscure the demonstratl6n of the choice of hypotheses, their verification or rejection, the use of the carrler~ changes of levels in analysis and the exploration of alternative readings.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Examples of decomposition", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The analysis always begins with the strlng ~30 postulated. A decomposition ends I when the program associated with thls~trlng is finished. All possible sentence beginnings are included in i I of ~30.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Examples of decomposition", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "--After-t-hee-nd of--~30-aiternatfve-decompositlons are sought.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Examples of decomposition", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "When a new string is postulated on the basis of an i-llst of .... another strlngj the verification of thenew string takes place in the next level of a push-down memory~ so that the state of computation of the suspended string is not affected.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Examples of decomposition", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Whenever two or more alternative paths open up for the analy~s~i~sj each must be pursuedto a successful completion or until failure occurs. (The analysis must produce every possible decomposition of a structurally ambiguous sentence). In our analyslsj different paths are pursued ~ serially. Every time an inspection of i-lists allows more than one hypothesls~ .one is chosen~ while a list of the remaining ones together with all relevant positions of the.memory goes on top of another push-down storage. The contents of that \u2022storage is examined . after the end of the chosen path. The analysis ends'after all posslble paths have been explored and thlsstorage is empty. ~n the example of analysis given herej we markbypassed open branches by asterisks on the left margin and their resumption by slmilar aster~ x-nominalization of 2o (1,2,3,a,%10) erV ", | |
| "cite_spans": [], | |
| "ref_spans": [ | |
| { | |
| "start": 828, | |
| "end": 847, | |
| "text": "of 2o (1,2,3,a,%10)", | |
| "ref_id": null | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "Examples of decomposition", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "kernel: x-V N '(N,V", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Examples of decomposition", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": ". he -~ve x /~2> h. x <2> -insure x <OCin)", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "", | |
| "sec_num": null | |
| } | |
| ], | |
| "back_matter": [ | |
| { | |
| "text": "End ~. Ker~e~ 2: x -tell story <I> (a). Resume 20. / Data:x < 2> . (level 2) contlnue~20The only string beglnning with x among those of i 3 allowed as object of be is I0 Data:x (To abbreviate, we will,just say t~-t--this branch will be very much llke the last one, except that, due to the difference between strings 2 and 3~ it will give the output: .", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "annex", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "!References (To be published).", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "2.", | |
| "sec_num": null | |
| } | |
| ], | |
| "bib_entries": { | |
| "BIBREF0": { | |
| "ref_id": "b0", | |
| "title": "The last open branch, marked ~ fails immediately", | |
| "authors": [], | |
| "year": null, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "The last open branch, marked ~ fails immediately.)", | |
| "links": null | |
| } | |
| }, | |
| "ref_entries": { | |
| "FIGREF0": { | |
| "text": "The kernel sentence forms (for English) are defined as the string of class marks N ~ ~ followed by one of the kernel Object strings: ~, N, ~, ~P__~, __~, e~, D, A (m Noun; ~: ~ense/aux; ~: verb; ~: preposition; D: adverb; ~: adjective; ~ : zero). Thus John bou~h't'a book; Nar~ will come etc. are kernel sentences. Each transformation is characterized by certain permutations, deletions or additions of specific class marks or constants. In the resultant of a transformation one may look for s ubsequenceswhich remain~xg~n~ even when the resultant is subjected to further transformations. The 5asic features of the algorithm are a) stating the various invarlant sequences and b) formulating I) a grammar of such Invarlant sequences, 2) a corre~ spondlng recognition procedure, and 3) a systematic procedure for computing the kernel sentences as well as other kernel-like sentences and the corresponding transformational history.", | |
| "num": null, | |
| "type_str": "figure", | |
| "uris": null | |
| }, | |
| "FIGREF1": { | |
| "text": "of the sequences in the first set represent unary transformations of kernel forms. Many are extended (often by permitting the replacement of certain symbols with selected sequences from the third set) to include analogous unary transforms of kernel-llke forms. The second set of sequencesj together with the rules of their insertion in the sequences for unary transformations, account for most of the binary transformations. Other binary transformations are represented by replacement in pairs of class marks in unary transformation sequences by members of the third sets most of which consist of nomlnalizations. An arbitrarily long English sentence form can be seen as composed of a finite number of such sequences recurstvely embedded in one another. 2.1 Corresponding to the above three subsets of sequences and their mutual embedding rules, we recognize three sets of strings. Each string is a program for comparing one of the sequences with a portion of the analyzed sentence form of the data. The program is equipped to permit interruption by other such programs according to the i-lists of the sequence. Each string, when entirely matched by a segment Of data, replaces that segment with the carrier of the string. The carrier is sometimes null. In strings from the second set it is usually the residue of the binary insert (e.g. the center symbol of a noun phrase: N of AN, of~,etc.). In strings from the third set the carrier is a class-mark-llke symbol which, by replaclng a classmark in a formderlved from a kernel form I extends it to one simi---4 --larly derived from a kernel-llke form. Let the carrier be~[nV~] for a noun phrase built around an nV. The extended passive form: N[or~[nV]] t be en V by N represents the form of the sentence John's travel to Italy was described by Haryas soon as the carrier of the str~ng replaces in the data the nomlr~ ! segment John's travel to Italy. The carrier from all strings in the first set is s, a symbol of a wellformed sentence. The program'of eachl string, whose sequence is a deformed (Or trans-forme~) kernel or kernel-like form, reconstructs that form for decomposition and attaches \u00a3o it a labe___~l descrlptive of the deformation (or transformation). The result of a decomposition is a set of kernel or kernel-llke sentences with labels. Some of the kernel sentences are / incomplete and have blanks in them because a transformation may de t ~ ....... elements. Some kernel-llke sentences may contain, instead of a wo/rd) a class-mark-llke symbol (e.g,~) with a reference.to aprevlous com-) ponent of the decomposition. If that previous component is a kernel sentence (with or without blanks), then the label (describlr~ the deformation) with the kernel-llke form (containing the reference) with its label, together constitute a description of the transformation undergone by the component kernel sentence. If the previous component itself is a kernel-llke sentence with a reference in turn to another component, both'kernel-llke sentences and all three labeis constitute the description of the transformatlonundergone by the c~,nponent kernel sentence ultimately referred to s etc. If the symbol x appears, instead of a word, in a kernel or ker' nel-llke sentence, it replaces a regular noun there. It is introduced in the sentence as a carrier from a nominallzation such as a teacher of Latln, .the driving instructor, etc. The same x must appear in two or more sentences of the decomposition \u2022(onewhere the nominal stands for a noun, and one in the sentence of whlch the nominallzatlon is a deformation, e.g. x -teach Latin). Which x's require identical substitutions is discoverable, because each x has in a sharp bracket (< >) the names of every prevlous llne in which the same x appeared, often no actual substltutionls posslble and the x serves only to identlfy ~ with each other, two or more blanks in different components. The substitution of the noun replacing N for x in lines aj bj . . . d is implied when one kernel-llke component has the form of strings (programs) constitute the major portion of granmmtlcal material in the algorithm. Another body o\u00a3 such material is the dlctlonar~. \u2022 The dictionary associates to each English word a symbol representing the wordts grannnatlcal class~ together with markers of certain additional characteristics the word may reveal by restricting its environment in the sentence. Some words may occur in more than one role and have therefore several equlvalents in thedictlonary. (e.g. the word labor should be given four different class marks: present tense Vs V(untensed verb)j (nomlnallzatlon deslgnatlngthe activity of laboring)~ er'V (nominal-Izatlon designating the actor(s), possibly laborers in aggregate)).", | |
| "num": null, | |
| "type_str": "figure", | |
| "uris": null | |
| }, | |
| "FIGREF2": { | |
| "text": "tails than is needed for the String Analysis alone. Thus for example the transformational analysis must be able to discover in Johnts sleep not only a nouh phrase~ but also the incomplete kernel sentence Johnsleep ~ which underlies each transformation containing such a noun phrase. Hence\u2022 the class marks: nV (sleep)j -entrY in the String Analysis dictionary contains information /about: the L~nd of objects required by the verb V. An nV may require objects differ/~t from its V and this must be indicated (e.g. th~ attacked the enemy vs. they made an attack \" on the enemy).Noun phrases like n V, IngV, etc. can occur in place o\u00a3 a sentence object or a subject of a sentence but only when it is organized ', \\ .around a verb requiring such subjects or obJectsj and such, verbs are marked accordingly in the dictionary.The subject and object restrictions for a verb or a verb-related-6-wordare recorded in pairs~because they are not mutually independent. (0-\" is the label for a subject (Z) requirement; _.~_~for an object (~) requirement of a tensed or untensed verb and some in_~ occurrences; t~nV labels an object requirement of nV-nominallzatlonj ~ingV those of an i~ V-nomlnalizatlonl etc. When neededj~ I is distinguished from ~ 2 (which usually is the same as the corresponding ~-~) to mark the form assumed by the object when it precedes the verb or verb related word (compare for instance house construction with construction of house where c~ nVl (the same as o~ ) is N, while ~ nV2 (the same as nV ) IsP [of] N).)", | |
| "num": null, | |
| "type_str": "figure", | |
| "uris": null | |
| }, | |
| "FIGREF3": { | |
| "text": "forms are sentence forms In which 1) there is a verb (Vw) requiring a sententlal subject or a sententlal object or both or 2) there is a noun (N w) or fidJectlve (Aw) requiring sententlal complements.", | |
| "num": null, | |
| "type_str": "figure", | |
| "uris": null | |
| }, | |
| "FIGREF4": { | |
| "text": "3~; ~r-: N[or x];\u00a2~= N{A/PN/D. o-: S[nV/inO]; to. ~, ~, ~[nV/ingv] etc.] a -T[a] good -A [A-ly =well] story -N teller-erV [& : human, count; ~J=~erVl: N/N[nV]/~;~JerV2; PN[or x or N: nV .~ Grammar Strings used in example 5-Nominal strings (each gives a noun-like carrier): I\u00b0 T[ the/a/an] ll i N[or x; or~: nV/ingV/nA/nl~] 2", | |
| "num": null, | |
| "type_str": "figure", | |
| "uris": null | |
| }, | |
| "FIGREF5": { | |
| "text": "as matchedfromdata), carrier: x [subclasses required from subject .of VZllustratlon of the process of analysis: Data:. N[John] pres.V[3,be] T[a] A[good] N[story] erV[teller]30 allows the following strilgs beginning with N to interupt 30 here: ~,20. Try 20, mark ~ for the branch opening with 9 on level 2.", | |
| "num": null, | |
| "type_str": "figure", | |
| "uris": null | |
| }, | |
| "FIGREF6": { | |
| "text": "[teller]. (level 3) Try 2, mark ~.__~ for Data: A[goodJ N[story] er V[teller]. (level ~). A---A ~/ N=N note:i I of 2 has string 5 beginning withN. Mark ~-~ for the bypassed branch, end 2. kernel I: story-be good. Resume I. Data: ~[story] ~l> erV[tener]. (level 3) continue ~I $/~ N=N note:i I of I has string ~ beginning with N. Mark open branch ~-~. end 1. Resume 20.End 20. Ke~del 2: John pres. be story < I> (a). Resume 30. story ls a proper object f~r teller", | |
| "num": null, | |
| "type_str": "figure", | |
| "uris": null | |
| } | |
| } | |
| } | |
| } |