| { | |
| "paper_id": "C86-1010", | |
| "header": { | |
| "generated_with": "S2ORC 1.0.0", | |
| "date_generated": "2023-01-19T13:14:20.984963Z" | |
| }, | |
| "title": "", | |
| "authors": [], | |
| "year": "", | |
| "venue": null, | |
| "identifiers": {}, | |
| "abstract": "", | |
| "pdf_parse": { | |
| "paper_id": "C86-1010", | |
| "_pdf_hash": "", | |
| "abstract": [], | |
| "body_text": [ | |
| { | |
| "text": "the Category Cooccurrence Restriction (CCR), is introduced in analogy to existing devices of GPSG in order to express constraints on the cooccurrence of categories within local trees (i.e. trees of depth one)", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "which at present are stated with Immediate Dominance (ID) rules and metarules.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "In addition to providing a uniform format for the statement of such constraints,", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "CCRs permit generalizations to be expressed which presently cannot be captured in GPSG.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Sections l.l and 1.2 introduce CCRs and presuppose only a general familiarity with GPSG.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The ideas do not depend on details of GPSG and can be applied to other grammatical formalisms. Sections 1.3 -1.5 discuss CCRs in relation to particular principles of GPSG and ass~ne familiarity with Gazdar et al. (] .985) (henceforth abbreviated 'GKPS'). Finally, section 2 contains proposals for using CCRs to avoid the analyses with metarules given for English in GKPS.", | |
| "cite_spans": [ | |
| { | |
| "start": 199, | |
| "end": 215, | |
| "text": "Gazdar et al. (]", | |
| "ref_id": null | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Category Cooecurrence Restrictions (CCRs)", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "1.", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The reasons for proposing CCRs to state restrictions on the eooccurrence of categories within local trees are analogous to those for introducing Inmlediate Dominance (ID) and Linear Precedence (LP) rules in GPSG (of GEPS, .", | |
| "cite_spans": [ | |
| { | |
| "start": 166, | |
| "end": 170, | |
| "text": "(ID)", | |
| "ref_id": null | |
| }, | |
| { | |
| "start": 207, | |
| "end": 221, | |
| "text": "GPSG (of GEPS,", | |
| "ref_id": null | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "I,i The Principle of CCRs", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "A context free rule binds information of two sorts in a single statement, namely (a) information about which daughters a rook has in a local tree and (b) information about the order in which the daughters appear. By separating this information in ID and LP rules, GPSG is able to state generalizations of the sort \"A preceeds B in every local tree which contains both as daughters,\" which cannot be captured in a context free grammar (CFG).", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "I,i The Principle of CCRs", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Now consider an ID rule such as the following:", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "I,i The Principle of CCRs", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "(i) S --> A, B, C", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "I,i The Principle of CCRs", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The fundmnental motivation for CCRs rests on the insight that such an ID rule itself combines two different kinds of information in a single statement, namely (a) information involving immediate dominance relations, here that <S, A>~ <S, B>, and <S, C> are ordered pairs of categories in which the first category inmlediately dominates the second and (b) information about the cooccurrence of categories in a single local tree. By distinguishing and separately representing these types of information it becomes possible to state generalizations of the following sort, which cannot be captured in the ID/LP format:", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "I,i The Principle of CCRs", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "(2)", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "I,i The Principle of CCRs", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Any local tree with S as its root must have A as a daughter.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "I,i The Principle of CCRs", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "(3) No local tree with C as a daughter also has D as a daughter.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "I,i The Principle of CCRs", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "(2) and (3) restricting the cooccurrence of categories in local trees are Category Cooccurrence Restrictions, which are expressions of first arder predicate logic using two primitive predicates, R(cx, t) 'cx is the root of local tree t ' and D(~, t) 'a is a daughter in local tree t'.", | |
| "cite_spans": [ | |
| { | |
| "start": 236, | |
| "end": 249, | |
| "text": "' and D(~, t)", | |
| "ref_id": null | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Statements such as", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "[2] CCRs have the form Vt: ~, where 1T :is a schema and the notion of a possible schema is defined as follows:", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Statements such as", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "(i) (R(a, t)) and (D(~,t)) are of form g; (it)", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Statements such as", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "if ~ is of form g, then (~) is of form n; (iiJ) if Ip and x are both of form I~, then (~0Kr) is of form ~, where K C (A, V, D, e}; (iv) constants designating categories occur as first arguments within all coastituent predicate expressions; (v) the same variable t bound by the quantifier Vt occurs as second argument within all constituent predicate expressions; (vi) these are all expressions of form ~. Using this notation, (2) and (3) may be restated as (5) mid (6), respectively: ", | |
| "cite_spans": [ | |
| { | |
| "start": 77, | |
| "end": 80, | |
| "text": "I~,", | |
| "ref_id": null | |
| }, | |
| { | |
| "start": 81, | |
| "end": 92, | |
| "text": "then (~0Kr)", | |
| "ref_id": null | |
| }, | |
| { | |
| "start": 240, | |
| "end": 243, | |
| "text": "(v)", | |
| "ref_id": null | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Statements such as", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "EQUATION", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [ | |
| { | |
| "start": 0, | |
| "end": 8, | |
| "text": "EQUATION", | |
| "ref_id": "EQREF", | |
| "raw_str": "(5) S }[ A ]l", | |
| "eq_num": "(" | |
| } | |
| ], | |
| "section": "Statements such as", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "(7) S -> NP, VP VP -~ V, VP S -> AUX, NP, VP VP ~> V, NP VP -> AUE, VP VP -> V, NP, VP", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Statements such as", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The ID rules of (7) admit local trees whose brancbes are among the following: The theory would appear to gain in simplicity if a way could be found to eliminate these distinctions.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Statements such as", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "(8) <S,", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Statements such as", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "[5] In order to simplify the present exposition,", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Statements such as", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "that share a conmmn mother as a local tree. This set of local trees must then be filtered with appropriate CURs so as to characterize the same set of local trees admitted by 7.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Statements such as", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "A single CCR covers the trees with S as root:", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Statements such as", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "(9) ", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Statements such as", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "VP AUX VP V 0 1 l 1 0 1 1 1 0 1 i 0 1 1 i 0 0 l 0 I 0 I 0 1 0 i 0 0 0 i 0 0 1 0 1 ] 1 0 1 1 0 0 ] 0 0 0 1 0 ] O 0 i 0 0 0 i 0 0 0 0 0 0 0 0 NP A \"l\"", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Statements such as", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "(II) ~(AUX A V) iff (~AUX v ~V) lines I, 2, 5, 6 ~(AUX A ~V A NP) iff (~AIJX v V v ~NP) 3 & 7 ~(AUX A ~VP) iff ('~AIIX v VP) 5 -8 ~(~AUX A ~V) iff (AUX v V) II, 12, 15, 16 ~(~VP A V A ~NP) iff (VP v ~V v NP) ]4 & 16", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Statements such as", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The normalized terms of (Ii) are conjoined in the CUR of (12), which is reformulated with conditionals in (13) and then simplified in (14)'. Next, (14) is reformulated as the three OORs of (15), which taken together with (8) and (9) admit the same set of local trees as the ID rules of (7):", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Statements such as", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "EQUATION", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [ | |
| { | |
| "start": 0, | |
| "end": 8, | |
| "text": "EQUATION", | |
| "ref_id": "EQREF", | |
| "raw_str": "(12) VP I[(~AIIX v NV)^ (,-AUXv Vv ~NP) A (~AUR v VP) a (AUX v V) ^ (VP v~ V v NP)]] (13) VP [[(AUX D~V) A (hUX ~ (V v~NP)) ^ (AUX DVP) A(AUX vV) A (V ~(VPvNP))][", | |
| "eq_num": "(" | |
| } | |
| ], | |
| "section": "Statements such as", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "(15) CCR 2: VP [[ AUg ~ ~V ]J CCR 3: VP I[ AUg ~ (VP ^ ~P)) ]t CCR 4: VP [[ V D (VP v NP) ][", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Statements such as", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The CCRs of (15) have been formulated only on the basis of VP trees, however, and therefore fail to capture generalizations that apply to all local trees.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Statements such as", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "In particular, any local tree with AUX as daughter -regardless of its root -must have a VP as sister, so CCR 3 may be restated as two simpler CCRs, CCR 2' and CCR 4', where CCR 2' does not depend on the root category.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Statements such as", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Furthermore, CCR 4 can be rewritten as CCR 5' since V cannot be a daughter of S. The following final set of CCRs thus emerges:", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Statements such as", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "(16) COR I': S ][ NP A VP ]] CCR 2': ][ AUX ~ VP ][ CCR 3': VP ][ AUX e ~Y ]] CCR 4': VP l[ AU\u00d7 D,--NP ]l CCR 5': ][ V m (VP v NP) ]]", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Statements such as", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "It may first appear that the description with CCRs in (8) and (16) constitutes no clear gain over the ID rules of (7). The latter, however, are highly redundant and express none of the generalizations achieved in (16).", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Statements such as", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Furthermore, the replacement of ID rules with CCRs is the essential prerequisite for the elimination of metarules described in section 2.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Statements such as", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The ~ttempt to replace all ID rules with individual CCRs would lead to very complicated descriptions.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "].3 The Complement-Type Principle", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Fortunately, the idea of CCRs can be utilized in a general principle that replaces all", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "].3 The Complement-Type Principle", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": ".lexJca] ID rules (i.e. those which have a head that is an extension of a SUBCAT category;", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "].3 The Complement-Type Principle", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "cf GKPS, p. 54), so that only nonleA'ical ID rules need be explicitly reformulated with individual CCRs. Shieber (1983) and Pollard (1985) have proposed that a list-or stack-valued feature (SYNCAT or SUBCAT) be introduced whose value contains the complements of a head category.", | |
| "cite_spans": [ | |
| { | |
| "start": 105, | |
| "end": 119, | |
| "text": "Shieber (1983)", | |
| "ref_id": null | |
| }, | |
| { | |
| "start": 124, | |
| "end": 138, | |
| "text": "Pollard (1985)", | |
| "ref_id": null | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "].3 The Complement-Type Principle", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "This paper uses TYP as a syntactic feature with a semantically oriented and lexJcally determined semantic type as its value. Following the convention of GKPS (p. 189), '<~, B>' will be written for <TYP(~), TYP(~)> where ~ and are categories.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "].3 The Complement-Type Principle", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Given the structure of complex types in GKPS as single-valued functions, the types may be viewed as lists or stacks.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "].3 The Complement-Type Principle", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "A Complement-Type Principle (CTP) can now be stated which has the form of a schematic CCR with conditions on variables: [-AUX, BSE] if its mother is VP, which has the type <NP, S>. The use of CTP in dealing with metarules will be shown in section 2 below, but first another general aspect of the metarule problem must be discussed. In the structural analysis of bought and read books NP is the complement of the V dominating bought and read but not of the V dominating read.", | |
| "cite_spans": [ | |
| { | |
| "start": 120, | |
| "end": 131, | |
| "text": "[-AUX, BSE]", | |
| "ref_id": null | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "].3 The Complement-Type Principle", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "(]7) (a)]IX[BAR 0, +H, TYP <6 I, <...<Sn_ l, 5n>...>>] ]1 X[TYP 5n] (b) [IX[BAR 0, +H, TYP <61, <...<6n_l,", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "].3 The Complement-Type Principle", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "[7] Uszkoreit (1984, p. 65) has already expressed a similar view. as well as tile Linear Precedence statements are fulfilled.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Metaru]es and Lexical", | |
| "sec_num": "1.4" | |
| }, | |
| { | |
| "text": "[8] A tree is an ordered pair consisting of a legal root category and a list of daughters, where each dau~,ter is either a tree or a word form. Word forms and their lexieal categories are specified by tile lexicon, defined by a list of basic lexical entries and metalexical rules.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Sunmlary of the Formalism", | |
| "sec_num": "1.5" | |
| }, | |
| { | |
| "text": "The gramlmar defines two binary relations over categories, ID and LP (the latter constitutiag the Linear Precedence statements).", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Sunmlary of the Formalism", | |
| "sec_num": "1.5" | |
| }, | |
| { | |
| "text": "A binary relation R ~ is the extensional closure of R iff for each <~, g> in R, R ~ toni:sins every <y, 6> such that y and 6 are extensions (oF GKPS, p. 27) of ~ and 6, respectively.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Sunmlary of the Formalism", | |
| "sec_num": "1.5" | |
| }, | |
| { | |
| "text": "A local tree with root C and daughters C~, ..., C", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Sunmlary of the Formalism", | |
| "sec_num": "1.5" | |
| }, | |
| { | |
| "text": "\u2022 . .o ~ n", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Sunmlary of the Formalism", | |
| "sec_num": "1.5" | |
| }, | |
| { | |
| "text": "must fulfill him condltlons that <C , C.~ E ID= for 1 < i < n and <C., C.> ~ LP E+ (i.e? t~e transitive %-1 . extensional elo~ure of LP) where 1 < 1 < n-1 and j = i+l.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Sunmlary of the Formalism", | |
| "sec_num": "1.5" | |
| }, | |
| { | |
| "text": "The proposed formalism utilizes more restricted memm tilmt GPSG but offers greater possibilities for expressing generalizations.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Sunmlary of the Formalism", | |
| "sec_num": "1.5" | |
| }, | |
| { | |
| "text": "The el iminat :ion of metarules and the introduction of CCRs give it a taore Ii~uogeneous struct:are and place cooccurrence restrictions of various kinds in the center of attention.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Sunmlary of the Formalism", | |
| "sec_num": "1.5" | |
| }, | |
| { | |
| "text": "For the present it may be best to regard this formalism as a particular variant of GPSG since most of tile central notions of the latter are retained. All that is sought is a simplification of GPSG as described in GKPS.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Sunmlary of the Formalism", | |
| "sec_num": "1.5" | |
| }, | |
| { | |
| "text": "Given the ricll palette of formal.tams recently proposed for kinds of unification gra~mlar~ it seems rather ingenuous to create a new name for thin modification of GPSG, as though tile multitude of remaining open questions were thereby answered. What we need is a metaformalism that will relate the insights of all the current formalisms through formal invariants preserved under translation from one formalism to another, and that will then truly deserve a name of its own.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Sunmlary of the Formalism", | |
| "sec_num": "1.5" | |
| }, | |
| { | |
| "text": "[8] The assmnption here is that any work done by tile Feature Specification Defaults (FSDs) of GKPS can be accomplished with suitably defined FCRs and CC~s.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Sunmlary of the Formalism", | |
| "sec_num": "1.5" | |
| }, | |
| { | |
| "text": "This will he illustrated in section 2 hut cannot be shown in general in this paper.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Sunmlary of the Formalism", | |
| "sec_num": "1.5" | |
| }, | |
| { | |
| "text": "The Elimination of Metarules", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "2.", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "GKPS allows metarules to be used in ways that intuitively seem undesirable. For example, a metarule may simply indicate that. a daughter h of S is optional :", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "General Remarks", | |
| "sec_num": "2.1" | |
| }, | |
| { | |
| "text": "(lS) ( s -> w, h ) -~ ( s--~ w )", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "General Remarks", | |
| "sec_num": "2.1" | |
| }, | |
| { | |
| "text": "The metarule is superfluous if A is enclesed in parentheses in tile corresponding ID rules: But the formalism of GKPS does not permit more than one clement, to be enclosed in parentheses, so the following cannot he an II) rule:", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "General Remarks", | |
| "sec_num": "2.1" | |
| }, | |
| { | |
| "text": "(19) S --> (A), B, C S --> (A), B, D", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "General Remarks", | |
| "sec_num": "2.1" | |
| }, | |
| { | |
| "text": "(22) S -~ A, (B, C)", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "General Remarks", | |
| "sec_num": "2.1" | |
| }, | |
| { | |
| "text": "Aside from the use of parentheses to indicate single optional elements, none of tile ahhreviatory conventions proposed in Chomsky/Hal ]e ( 1968, pp. 393-399) are enlployed in GPS(]. Thus, the rules of (19) cannot be abbreviated with braces as in (23):", | |
| "cite_spans": [ | |
| { | |
| "start": 137, | |
| "end": 157, | |
| "text": "( 1968, pp. 393-399)", | |
| "ref_id": null | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "General Remarks", | |
| "sec_num": "2.1" | |
| }, | |
| { | |
| "text": "(23) s-> (A), B, ( C ) D", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "General Remarks", | |
| "sec_num": "2.1" | |
| }, | |
| { | |
| "text": "Since such abbreviatory conventions for expressing coocurrence restrictions are not provided by GPSG, it. is not ~.mrprising that timir work is assumed by metarules. GEPS in fact ,!~tates that metarules \"amount to notifing more than a novel type of rule-collapsing convention for rules\" (p. 66).", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "General Remarks", | |
| "sec_num": "2.1" | |
| }, | |
| { | |
| "text": "Now that CCRs have been presented above in section 1.2 for restating a simple GPSG tllat does not contain metarules,", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "General Remarks", | |
| "sec_num": "2.1" | |
| }, | |
| { | |
| "text": "we Call examine |low they may be used tO e]inlinate metarules fram the GPSG proposed for English in GKPS.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "General Remarks", | |
| "sec_num": "2.1" | |
| }, | |
| { | |
| "text": "[9] Note that tile metarule does not provide for the omission of a sJnK.le complement from a Kraal ol\" money to tile linffuists or gratefu] to the ;ttJnJstrV /br ~he money. Most of the work of this metaru]e can be taken care of simply by the CTP since a lexical head Y with the type <6 I, <...<6n, <hiP, S>>...>> has the complements 61, ..., 6 if its mother is VP (of type <NP, S>) and {he complements &l' '''' 6n, NP if the mother is S. Further restrictions must determine when V has which mother. In addition to the FCRs of (29) and (30), retained from GKPS, the new FCR of (31) is introduced:", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "General Remarks", | |
| "sec_num": "2.1" | |
| }, | |
| { | |
| "text": "(30) [+INV, BAR 2] D [+SUBJ] (FCR I0) (31) [INV] ~ [+V, -N]", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "General Remarks", | |
| "sec_num": "2.1" | |
| }, | |
| { | |
| "text": "INV is a HEAD feature subject to the Head Feature Convention (cf GKPS, pp. 94-99), so a V 2 mother of V[+INVJ must be specified <INV, +> and therefore also <SUBJ, +>. If V is specified <INV, -> (note that (31) requires it to have some specification for INV), then its mother is *lot an extension of V 2 (providing for coordination) or it is specified <SUBJ, -> according to the following CCR: ", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "General Remarks", | |
| "sec_num": "2.1" | |
| }, | |
| { | |
| "text": "CCR contains a disjunction of root descriptions and thus does not conform to the schemata for simple CCRs with atomic categories presented in section 1.1 above. The disjunction is to he read \"the root is not an extension of V 2 or it is an extension of [-SUBJ] .\"", | |
| "cite_spans": [ | |
| { | |
| "start": 253, | |
| "end": 260, | |
| "text": "[-SUBJ]", | |
| "ref_id": null | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Note that this", | |
| "sec_num": null | |
| } | |
| ], | |
| "back_matter": [ | |
| { | |
| "text": "It appliesto any ]exical ID rule with a category specified <tIAR, 2> in the RItS and produces a rule with the specification <NULL, +> added to this category.It turns out that S'1%1] lnay be eliminated with two simple statements.An FCR expresses the fact that a category is ~pecified for NUI,L (i.e. NULL takes the value + or -) if and only if it also is <BAR, 2>:A CCR then stipulates that a category specified <NULL, +> mu'4t have a lexical category as its sister in a local tree:This is equivalent to the condition that STN1 -like all metarule:~ -may only apply to lexical IB rules. Note that a root category is not indicated in (40) and that parasitic gaps (of GKPS, pp. 162 if) are provided for.As in GKPS, an FCR requires that a category specified <NUI,L, +> also be specified for SLASH:The distribution of SI,AStI is in turn governed by the CAP, HFC, and FFP.GKPS also postulates an FSD for NULl, : Taken together, the two FCRs of (39) and (44) plus the two CCRs of (40) and (45) accomplish all the work of STM1 and STM2 and result in the same analyses for English as adopted in GKPS.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "The Extraposition", | |
| "sec_num": "2.4" | |
| } | |
| ], | |
| "bib_entries": { | |
| "BIBREF0": { | |
| "ref_id": "b0", | |
| "title": "The Sound Pattern of English. llarper N Row", | |
| "authors": [ | |
| { | |
| "first": "N", | |
| "middle": [ | |
| "/ M" | |
| ], | |
| "last": "Chomsky", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "", | |
| "middle": [], | |
| "last": "Halle", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1968, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Chomsky, N. / M. Halle (1968): The Sound Pattern of English. llarper N Row, New York et al.", | |
| "links": null | |
| }, | |
| "BIBREF2": { | |
| "ref_id": "b2", | |
| "title": "Phrase Structure Grammar without Metarules", | |
| "authors": [ | |
| { | |
| "first": "", | |
| "middle": [], | |
| "last": "Generalized Phrase Structure Grammar", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Oxford", | |
| "middle": [], | |
| "last": "Blackwell", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "C", | |
| "middle": [], | |
| "last": "Pollard", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": null, | |
| "venue": "Proceedings of the West Coast Conference on Formal Linguistics", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Generalized Phrase Structure Grammar. Blackwell, Oxford. Pollard, C. (i[985): \"Phrase Structure Grammar without Metarules, \" Proceedings of the West Coast Conference on Formal Linguistics (Los Angeles) , Stanford Linguistics Association.", | |
| "links": null | |
| }, | |
| "BIBREF4": { | |
| "ref_id": "b4", | |
| "title": "Research on Interactive Acquisition and Use of Knowledge. SRI", | |
| "authors": [ | |
| { | |
| "first": "/", | |
| "middle": [ | |
| "M" | |
| ], | |
| "last": "Robinson", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "", | |
| "middle": [], | |
| "last": "Tyson", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1983, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Robinson / M. Tyson (1983): \"The Formalism and Imp i enlentat ion of PATR-I I, \" Research on Interactive Acquisition and Use of Knowledge. SRI, Menlo Park, California. Uszkoreit, H. (1984): Word Order and Constituent Structure in German. Ph.D. dissertation, University of Texas at Austin.", | |
| "links": null | |
| } | |
| }, | |
| "ref_entries": { | |
| "TABREF5": { | |
| "text": "under a category (,n the right side of the table", | |
| "num": null, | |
| "type_str": "table", | |
| "html": null, | |
| "content": "<table><tr><td colspan=\"2\">indicates</td><td colspan=\"4\">that the category</td><td>is</td><td colspan=\"3\">a daughter</td><td>in a given</td></tr><tr><td colspan=\"8\">local tree; \"0\" means it is absent.</td><td colspan=\"2\">If a local tree</td></tr><tr><td colspan=\"3\">with the root</td><td colspan=\"6\">on the left side of the</td><td>table and the</td></tr><tr><td colspan=\"2\">daughters</td><td colspan=\"2\">marked</td><td>\"1\"</td><td>in</td><td colspan=\"2\">a given</td><td>line</td><td>is</td><td>to</td><td>be</td></tr><tr><td colspan=\"10\">admitted by the grarmuar, then a \"1\" appears under the</td></tr><tr><td>root</td><td colspan=\"2\">category</td><td>in</td><td>the</td><td colspan=\"3\">corresponding</td><td/><td>line;</td><td>\"0\"</td></tr><tr><td colspan=\"2\">indicates</td><td colspan=\"7\">that the tree is not admitted.</td></tr><tr><td colspan=\"4\">A corresponding</td><td colspan=\"4\">CCR of the form</td><td colspan=\"2\">VP I[('~]]</td><td>can now</td></tr><tr><td colspan=\"3\">be formulated,</td><td colspan=\"3\">where (0 is</td><td colspan=\"3\">a Boolean</td><td>expression</td><td>in</td></tr><tr><td colspan=\"3\">conjunctive</td><td>normal</td><td colspan=\"2\">form.</td><td/><td colspan=\"3\">The terms of co</td><td>are</td></tr><tr><td colspan=\"10\">constructed from the lines designating inadmissible</td></tr><tr><td colspan=\"4\">trees as follows:</td><td/><td/><td/><td/><td/></tr></table>" | |
| }, | |
| "TABREF11": { | |
| "text": "PAS, AGR 6n, TYP <61,<...<6n_l,<6n,S>>...>>l g V[+PAS, AGR 6n_l, TYP <6~I,<61,<...<6n_i,S>...>>> ] and V[+PAS, AGR 6n_], TYP 461,<...<6n_],S>...>> ]", | |
| "num": null, | |
| "type_str": "table", | |
| "html": null, | |
| "content": "<table><tr><td colspan=\"5\">2.2 The Passive Metarule</td><td>2.3 The 'Subject-Aux Inversion' (SAI) Metarule</td></tr><tr><td colspan=\"5\">GKP8 (p. 59) presents a Passive Metarule (PM) of</td><td>The second metarule for English discussed in GEPS</td></tr><tr><td colspan=\"5\">remarkable simplicity and generality:</td><td>is the 'Subjeet-Aux Inversion' (SAI) 60-65):</td><td>Metarule (pp.</td></tr><tr><td>(24)</td><td/><td colspan=\"3\">VP --> W, NP</td></tr><tr><td/><td/><td/><td/><td>(28)</td><td>V2[-SUBJ] \"--> W</td></tr><tr><td/><td colspan=\"2\">VP[PAS]</td><td colspan=\"2\">-@ W, (PP[by])</td></tr><tr><td/><td/><td/><td/><td>V2[+INV, +SUBJ] --~ W, NP</td></tr><tr><td colspan=\"5\">PM states that for every lexical ID rule expanding VP</td></tr><tr><td colspan=\"5\">and containing NP and any multiset W of categories in</td><td>This applies to all lexical ID rules expanding VP.</td></tr><tr><td colspan=\"5\">the RHS, expanding VP[PAS] and optionally containing PP[by] in there is a corresponding lexical ID rule</td><td>however, admitted only by derived IB rules produced by its local trees are [II] Because of (29),</td></tr><tr><td colspan=\"5\">place of NP in its RHS. Although the head V dominated</td><td>application to base lexical</td><td>ID rules expanding</td></tr><tr><td colspan=\"5\">by VP[PAS] is not mentioned in PM, it must be</td><td>categories specified VP[+AUX]:</td></tr><tr><td colspan=\"5\">specified <VFOEN~ PAS> in a local tree by virtue of</td></tr><tr><td colspan=\"5\">the Head Feature Convention.</td><td>(29)</td><td>[+INV] = [+AUX, FIN]</td><td>(FCR 1)</td></tr><tr><td colspan=\"5\">As noted in section 1.4, however, PM does only a</td></tr><tr><td colspan=\"5\">small part of the work for passive, the main task</td></tr><tr><td colspan=\"5\">\"falling to the Lexical Rule for Passive Forms.</td></tr><tr><td>Moreover,</td><td colspan=\"2\">some</td><td colspan=\"2\">of the predictions of</td><td>PM are</td></tr><tr><td colspan=\"5\">incorrect. Thus, PM applies to the lexical ID rule</td></tr><tr><td colspan=\"5\">introducing V[SUBCAT 20], to which bother belongs:</td></tr><tr><td>(25)</td><td colspan=\"4\">VP[AGR S] --> HI20], NP</td></tr><tr><td colspan=\"5\">But the derived ID rule for V[20, PAS] incorrectly</td></tr><tr><td colspan=\"5\">allows a PP[PFORM by] complement.</td><td>[10] Furthermore,</td></tr><tr><td colspan=\"2\">sentences like</td><td/><td colspan=\"2\">That Santa Claus exists .is believed</td></tr><tr><td>by Kim.</td><td colspan=\"4\">are grammatical, but PM does not: apply to</td></tr><tr><td colspan=\"2\">the lexical</td><td colspan=\"2\">ID rule</td><td>introducing V[SUBCAT 40] for</td></tr><tr><td colspan=\"2\">beldt:.ve :</td><td/><td/></tr><tr><td>(26)</td><td colspan=\"4\">VP --> H[40], S[FIN]</td></tr><tr><td colspan=\"5\">Let PAS be a Boolean-valued feature restricted to</td></tr><tr><td colspan=\"5\">[+V, -N] categories. Then we may state the following</td></tr><tr><td colspan=\"5\">Metalexical Rule for Passive Forms:</td></tr><tr><td colspan=\"2\">(27) V[-where</td><td/><td/></tr><tr><td colspan=\"5\">(i) 6 n-l' 6 n 6 {NP, S} and</td></tr><tr><td colspan=\"5\">(ii) :if 6 = NP then 6' : PP[by] else 6' = S. n n n</td></tr><tr><td colspan=\"5\">Note that 6 , and 6 are the categories of the</td></tr><tr><td colspan=\"5\">--1 direct, object! and subject . n</td><td>of V[-PAS], respectively.</td></tr><tr><td colspan=\"5\">By CTP V[-PAS] with mother VP (of type <6 , S>) has</td></tr><tr><td colspan=\"4\">complements 6 , ....</td><td>6 , while V[+PAS] nith mother</td></tr><tr><td colspan=\"5\">VP (of type <~ ,, S>) hnsleomplements 6 ..... n-t , l and, opt*onally, 6 n.</td><td>, 6 n-z</td></tr><tr><td colspan=\"5\">[I0] V[PAS] is specified <SUBCAT, 2> in ,h~n was</td></tr><tr><td colspan=\"5\">bothered ~Y his boss.</td></tr></table>" | |
| }, | |
| "TABREF12": { | |
| "text": "for the distribution of INY (cf CKPS, pp. 30-31) then becomes unnecessary.", | |
| "num": null, | |
| "type_str": "table", | |
| "html": null, | |
| "content": "<table><tr><td/><td colspan=\"4\">I[ V[-INV] 31 (~V 2 v [-SUBJ]) [12]</td></tr><tr><td colspan=\"6\">Although GKPS provides for ,an embedded inverted</td></tr><tr><td colspan=\"6\">sentence in What dJd you see? , no embedded nonhead</td></tr><tr><td colspan=\"3\">S is specified <INV, +>.</td><td colspan=\"3\">This fact is captured with</td></tr><tr><td colspan=\"2\">a CCR:</td><td/><td/><td/></tr><tr><td>(33)</td><td colspan=\"2\">([ ~S[-H, +INV] ]1</td><td/><td/></tr><tr><td colspan=\"2\">A special</td><td colspan=\"2\">Feature Specification</td><td colspan=\"2\">Default to account</td></tr><tr><td>[ll]</td><td>Recall</td><td colspan=\"2\">the use of aliases</td><td>in GKPS (p.</td><td>61)</td></tr><tr><td/><td colspan=\"5\">whereby 'VP' stands for V2[-SUBJ] and 'S' for</td></tr><tr><td/><td colspan=\"2\">V2[+SUBJ].</td><td/><td/></tr><tr><td>[12]</td><td/><td/><td/><td/></tr></table>" | |
| } | |
| } | |
| } | |
| } |