File size: 37,307 Bytes
6fa4bc9 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 | {
"paper_id": "P83-1003",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T09:19:36.649889Z"
},
"title": "Crossed Serial Dependencies: i low-power parseable extension to GPSG",
"authors": [
{
"first": "Henry",
"middle": [],
"last": "Thompson",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Cognitive Science University of Edinburgh Hope Park Square",
"location": {
"addrLine": "Meadow Lane Edinburgh",
"postCode": "EH8 9NW",
"country": "SCOTLAND"
}
},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "An extension to the GPSG grammatical formalism is proposed, allowing non-terminals to consist of finite sequences of category labels, and allowing schematic variables to range over such sequences. The extension is shown to be sufficient to provide a strongly adequate grammar for crossed serial dependencies, as found in e.g. Dutch subordinate clauses. The structures induced for such constructions are argued to be more appropriate to data involving conjunction than some previous proposals have been. The extension is shown to be parseable by a simple extension to an existing parsing method for GPSG.",
"pdf_parse": {
"paper_id": "P83-1003",
"_pdf_hash": "",
"abstract": [
{
"text": "An extension to the GPSG grammatical formalism is proposed, allowing non-terminals to consist of finite sequences of category labels, and allowing schematic variables to range over such sequences. The extension is shown to be sufficient to provide a strongly adequate grammar for crossed serial dependencies, as found in e.g. Dutch subordinate clauses. The structures induced for such constructions are argued to be more appropriate to data involving conjunction than some previous proposals have been. The extension is shown to be parseable by a simple extension to an existing parsing method for GPSG.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "In a recent paper (Bresnan Kaplsn Peters end Zaenen 1982) (hereafter BKPZ), a solution to the Dutch problem was presented in terms of LFG (Kaplan and Bresnan 1982) , which is known to have considerably more than context-free power. (Steedman 1983) and (Joshi 1983) have also made proposals for solutions in terms of Steedman/Ades grammars and tree adjunction grammars (Ades and Steedman 1982; Joshi Levy and Yueh 1975) .",
"cite_spans": [
{
"start": 18,
"end": 44,
"text": "(Bresnan Kaplsn Peters end",
"ref_id": null
},
{
"start": 138,
"end": 163,
"text": "(Kaplan and Bresnan 1982)",
"ref_id": "BIBREF5"
},
{
"start": 232,
"end": 247,
"text": "(Steedman 1983)",
"ref_id": "BIBREF7"
},
{
"start": 252,
"end": 264,
"text": "(Joshi 1983)",
"ref_id": "BIBREF3"
},
{
"start": 368,
"end": 392,
"text": "(Ades and Steedman 1982;",
"ref_id": "BIBREF10"
},
{
"start": 393,
"end": 418,
"text": "Joshi Levy and Yueh 1975)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "In this paper I present a minimal extension to the GPSC formalism (Gazdar 1981c) ",
"cite_spans": [
{
"start": 66,
"end": 80,
"text": "(Gazdar 1981c)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "CONS(CADR (Q')(a' )(CA~(Q' )),CDDR (Q ' )) (~ where Q' is short for SI, Z~,b ' ,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "CO~S(CAR (Q ' )(a') (S') ,CDR(Q ' ))",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "(2 where Q' is short for Ziqh ' , ADJOIN(Z' ,b' ).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "( 3 These By suitably combining the rules (A) -(E), together with the meta-generated rules (Bi) -(Di), (Bii) and (Cii), we can now generate examples (2) (4). (4), which is fully crossed, is very similar to the example in section II.1, and uses meta-generated expansions for all its VP nodes:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "A) S' -> omdat NP VP B) VP -> V VP (probeer) C) VP -> NP V VP (leren) D) VP -> NP V",
"eq_num": "(spreken)"
}
],
"section": "",
"sec_num": null
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "S' Nikki Nederlands V b [Vc,Vd] probeer V c V d i I te leren spreken (A) (Bii) ( Cii ) (Di) (E)",
"eq_num": "(E)"
}
],
"section": "",
"sec_num": null
},
{
"text": "Once again I include the relevant rule name in the margin, and indicate with subscripts the rule name feature introduced to enforce subcategorisation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Sentences (2) and (3) each involve two metagenerated rules and one ordinary one. For reasons of space, only (3) is illustrated below.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "(2) is similar, but using rules (B), (Cii), and (Di). For our purposes simple interpretations of (B) -(D) will suffice:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "s' (A) ~P vP (Rii) a ik [vP,Zb] (ci) .~Pc [Vb,Vc]~ ~ (E),(Di) Nikki V",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "B') v'(vP') c') v' (NP' ,~') D') v'(NP').",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "The semantics for the metarules is also reasonably straightforward, given that we know where we are going:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "I') F(V') ==> CONS(F(CAR(Z:V')),CDR(Z',V')) II') F(V',VP') ==> CONS(F(CADR(Q'),CAR(Q')), cm~(Q')),",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "where Q' is short for VPlZl, V '. (I') will give semantics very much like those of rule (2) in section II.2, while (II') will give semantics like those of rule (I). (E \u00b0) is just like (3):",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "E') ADJ01N(Z' ,W ' )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "It is left to the enthusiastic reader to work through the examples and see that all of sentences (I) - ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "C0NSP(L) -T(~x [~y",
"authors": [],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "C0NSP(L) -T(~x [~y.[~z.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "CADR(L) -CAR(CDR(L))",
"authors": [],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "CADR(L) -CAR(CDR(L))",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "How much context-sensitivity is required to provide reasonable structural descriptions: Tree adjoining gran~nars",
"authors": [
{
"first": "A",
"middle": [],
"last": "Joshi",
"suffix": ""
}
],
"year": 1983,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Joshi, A. 1983. How much context-sensitivity is required to provide reasonable structural descriptions: Tree adjoining gran~nars, version submitted to this conference.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Tree adjunct grammars",
"authors": [
{
"first": "A",
"middle": [
"K"
],
"last": "Joehi",
"suffix": ""
},
{
"first": "L",
"middle": [],
"last": "Levy",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "So",
"suffix": ""
},
{
"first": "K",
"middle": [],
"last": "Yueh",
"suffix": ""
}
],
"year": 1975,
"venue": "Journal of Comp .... and System Sciences",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Joehi, A.K., Levy, L. So and Yueh, K. 1975. Tree adjunct grammars. Journal of Comp .... and System Sciences.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Lexicalfunctional grammar: A formal system of grammatical representation",
"authors": [
{
"first": "R",
"middle": [
"M"
],
"last": "Kaplan",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Bresnan",
"suffix": ""
}
],
"year": 1982,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kaplan, R.M. and Bresnan, J. 1982. Lexical- functional grammar: A formal system of grammatical representation. In J. Bresnan, editor, The mental representation of grammatical relations. MIT Press, Cambridge, MA.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Predicate Raising in French and Sundry Languages. ms",
"authors": [
{
"first": "P",
"middle": [],
"last": "Seuren",
"suffix": ""
}
],
"year": 1972,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Seuren, P. 1972. Predicate Raising in French and Sundry Languages. ms., Nijmegen.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "On the Generality of the Nested Dependency Constraint and the reason for an Exception in Dutch",
"authors": [
{
"first": "M",
"middle": [],
"last": "Steedman",
"suffix": ""
}
],
"year": 1983,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Steedman, M. 1983. On the Generality of the Nested Dependency Constraint and the reason for an Exception in Dutch. In Butterworth, B., Comrie, E. and Dahl, 0., editors, Explanations of Language Universals. Mouton.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Chart Parsing and Rule Schemata in GPSG",
"authors": [
{
"first": "H",
"middle": [
"S"
],
"last": "Thompson",
"suffix": ""
}
],
"year": 1981,
"venue": "Proceedings of the Nineteenth Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Thompson, H.S. 1981b. Chart Parsing and Rule Schemata in GPSG. In Proceedings of the Nineteenth Annual Meeting of the Association for Computational Linguistics.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "On the order of words",
"authors": [
{
"first": "A",
"middle": [],
"last": "Ades",
"suffix": ""
},
{
"first": "M",
"middle": [],
"last": "Steedman",
"suffix": ""
}
],
"year": 1982,
"venue": "Linguistics and Philosophy",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ades, A. and Steedman, M. 1982. On the order of words. Linguistics and Philosophy. to appear.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Cross-serial dependencies in Dutch",
"authors": [
{
"first": "J",
"middle": [
"W"
],
"last": "Bresnan",
"suffix": ""
},
{
"first": "R",
"middle": [],
"last": "Kaplan",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Peters",
"suffix": ""
},
{
"first": "A",
"middle": [],
"last": "Zaenen",
"suffix": ""
}
],
"year": 1982,
"venue": "Linguistic Inquir",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Bresnan, J.W., Kaplan, R., Peters, S. and Zaenen, A. 1982. Cross-serial dependencies in Dutch. Linguistic Inquir[ 13.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Phrase structure grammar",
"authors": [
{
"first": "G",
"middle": [],
"last": "Cazdar",
"suffix": ""
}
],
"year": 1981,
"venue": "The nature of syntactic representation. D. Reidel",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Cazdar, G. 1981c. Phrase structure grammar. In P. Jacobson and G. Pullum, editors, The nature of syntactic representation. D. Reidel, Dordrecht.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"uris": null,
"num": null,
"type_str": "figure",
"text": "rules are most easily understood in reverse order. Rule 3 simply appends the interpretation of the immediately dominated b to the sequence of interpretations of the dominated sequence of b's. Rule 2 takes the first interpretation of such a sequence, applies it to the interpretations of the immediately dominated a and S, and prepends the result to the unused balance of the sequence of b interpretations. We now have a sequence consisting of first a sentential interpretation, and then a number of h interpretations. Rule I thus applies the second (b type) element of such a sequence to the interpretation of the immediately dominated a, and the first (S type) element of the sequence."
},
"TABREF2": {
"html": null,
"text": "Parsin~As for parsing context-free grammars with the non-terminals and schemata this proposal allows, very little needs to be added to the mechanisms I have provided to deal with non-sequence schemata in",
"type_str": "table",
"num": null,
"content": "<table><tr><td colspan=\"9\">II.3 GPSG, as described in (Thompson 1981 b). We simply</td><td/><td>I) omdat ik probeer Nikki te leren Nederlands te spreken 2) omdat ik probeer Nikki Nederlands te leren spreken 3) omdat ik Nikki probeer te leren Nederlands te spreken 4) omdat ik Nikki Nederlands probeer te leren</td></tr><tr><td colspan=\"9\">treat all non-terminals as sequences, many of only</td><td/><td>spreken</td></tr><tr><td colspan=\"9\">one element. The same basic technique of a bottom-</td><td/><td>5) * omdat ik Nikki probeer Nederlands te leren</td></tr><tr><td colspan=\"9\">up chart parsing strategy, which substitutes for</td><td/><td>spreken.</td></tr><tr><td colspan=\"9\">matched variables in the active version of the</td><td/><td>With</td><td>the</td><td>proviso</td><td>that</td><td>(I)</td><td>is</td><td>often</td><td>judged</td></tr><tr><td colspan=\"4\">rule, will do the job.</td><td/><td colspan=\"4\">By restricting only one</td><td/><td>questionable, at least on stylistic grounds, this</td></tr><tr><td colspan=\"3\">sequence variable</td><td colspan=\"6\">to occur once in each non-</td><td/><td>pattern of judgements seems fairly stable among</td></tr><tr><td colspan=\"9\">terminal, the task of matching is kept simple and</td><td/><td>native speakers of Dutch from the Netherlands.</td></tr><tr><td colspan=\"2\">deterministic.</td><td colspan=\"7\">Thus we allow e.g. SIZIb but not</td><td/><td>There is some suggestion that this is not the</td></tr><tr><td>ZlblZ.</td><td>The</td><td/><td colspan=\"3\">substitutions</td><td>take</td><td>place</td><td>by</td><td/><td>pattern of judgements typical of native speakers of</td></tr><tr><td colspan=\"9\">concatenation, so that if we have an instance of</td><td/><td>Dutch from Belgium.</td></tr><tr><td colspan=\"9\">rule (~) matching first [a] and then [3,b,b,b] in</td><td/></tr><tr><td colspan=\"9\">the course of bottom-up processing, the Z on the</td><td/><td>III.2 Grammar rules for the Dutch data</td></tr><tr><td colspan=\"9\">right hand side will match [b,b], and the resulting</td><td/></tr><tr><td colspan=\"9\">substitution into the left hand side will cause the</td><td/><td>This pattern leads us to propose the following</td></tr><tr><td colspan=\"6\">constituent to be labeled [S,b,b].</td><td/><td/><td/><td/><td>basic rules for subordinate clauses:</td></tr><tr><td colspan=\"9\">In making this extension to my existing system,</td><td/></tr><tr><td colspan=\"9\">the changes required were all localised to that</td><td/></tr><tr><td colspan=\"9\">part of the code which matches rule parts against</td><td/></tr><tr><td colspan=\"9\">nodes, and here the price is paid only if a</td><td/></tr><tr><td colspan=\"7\">sequence variable is encountered.</td><td colspan=\"2\">This suggests</td><td/></tr><tr><td colspan=\"9\">that the impact of this mechanism on the parsing</td><td/></tr><tr><td colspan=\"8\">complexity of the system is quite small.</td><td/><td/></tr><tr><td/><td colspan=\"7\">III. APPLICATION TO DUTCH</td><td/><td/></tr><tr><td colspan=\"9\">Given the limited space available, I can present</td><td/></tr><tr><td colspan=\"5\">only a very high-level</td><td colspan=\"2\">account</td><td>of how</td><td>this</td><td/></tr><tr><td colspan=\"9\">extension to GPSG can provide an account of crossed</td><td/></tr><tr><td colspan=\"9\">serial dependencies in Dutch. In particular I will</td><td/></tr><tr><td colspan=\"9\">have nothing to say about the difficult issue of</td><td/></tr><tr><td colspan=\"9\">the precise distribution of tensed and untensed</td><td/></tr><tr><td>verb forms.</td><td/><td/><td/><td/><td/><td/><td/><td/><td/></tr><tr><td colspan=\"4\">III. 1 The Dutch data</td><td/><td/><td/><td/><td/><td/></tr><tr><td colspan=\"9\">Discussion of the phenomenon of crossed serial</td><td/></tr><tr><td colspan=\"2\">dependencies</td><td>in</td><td colspan=\"2\">Dutch</td><td colspan=\"2\">subordinate</td><td>clauses</td><td colspan=\"2\">The is</td><td>result</td><td>is again</td><td>prepended</td><td>to the unused</td></tr><tr><td colspan=\"11\">balance, if any. bedeviled by considerable disagreement about just</td><td>The patient reader can satisfy</td></tr><tr><td colspan=\"4\">what the facts are.</td><td colspan=\"5\">The following five examples</td><td colspan=\"2\">himself</td><td>that</td><td>this will</td><td>produce</td><td>the following</td></tr><tr><td colspan=\"8\">form the core of the basis for my analysis:</td><td/><td colspan=\"2\">(crossed) interpretation:</td></tr></table>"
},
"TABREF3": {
"html": null,
"text": "VP -> ... V ... ==> VPIZ -> ... ZlV ...",
"type_str": "table",
"num": null,
"content": "<table><tr><td colspan=\"8\">reflected in rules associated with each VP rule</td></tr><tr><td colspan=\"8\">which introduces a VP complement, allowing the verb</td></tr><tr><td colspan=\"5\">to be lowered onto the complement.</td><td/><td colspan=\"2\">As this rule</td></tr><tr><td colspan=\"8\">must also expand VPs with verbs lowered onto them,</td></tr><tr><td colspan=\"2\">we want e.g.</td><td/><td/><td/><td/><td/><td/></tr><tr><td/><td colspan=\"5\">cii) vPlz -> ~P wlzlv.</td><td/><td/></tr><tr><td colspan=\"8\">Rather than enumerate such rules, we can use</td></tr><tr><td colspan=\"8\">metarules to conveniently express what is wanted:</td></tr><tr><td colspan=\"7\">I) H) vP -> ... v vP o-> vPlz -> ... vP:z:v.</td><td/></tr><tr><td colspan=\"8\">(I) will apply to all three of (B) -(D), allowing</td></tr><tr><td colspan=\"7\">compound verbs to be discharged at any point.</td><td>(II)</td></tr><tr><td colspan=\"8\">will apply to (B) and (C), allowing the lowering</td></tr><tr><td>(with</td><td colspan=\"2\">compounding</td><td>if</td><td>needed)</td><td>of</td><td>verbs</td><td>onto</td></tr><tr><td colspan=\"2\">complements.</td><td colspan=\"6\">We need one more rule, to unpack the</td></tr><tr><td colspan=\"8\">compound verbs, and the syntactic part of our</td></tr><tr><td colspan=\"3\">effort is complete:</td><td/><td/><td/><td/><td/></tr><tr><td colspan=\"2\">E) wlz -> W Z,</td><td/><td/><td/><td/><td/><td/></tr><tr><td colspan=\"8\">where W is an ordinary variable whose range</td></tr><tr><td colspan=\"8\">consists of V. This slight indirection is necessary</td></tr><tr><td>to</td><td>insure</td><td>that</td><td colspan=\"3\">subcategorisation</td><td colspan=\"2\">information</td></tr><tr><td colspan=\"4\">propagates correctly.</td><td/><td/><td/><td/><td>.</td></tr><tr><td/><td/><td/><td/><td/><td/><td/><td colspan=\"2\">Taken straight, these give us (I) only.</td><td>For (2)</td></tr><tr><td/><td/><td/><td/><td/><td/><td/><td colspan=\"2\">-(4), we propose what amounts to a verb lowering</td></tr><tr><td/><td/><td/><td/><td/><td/><td/><td colspan=\"2\">approach, where verbs are lowered onto VPs, whence</td></tr><tr><td/><td/><td/><td/><td/><td/><td/><td colspan=\"2\">they lower again to form compound verbs.</td><td>(5) is</td></tr><tr><td/><td/><td/><td/><td/><td/><td/><td colspan=\"2\">ruled out by requiring that a lowered verb must</td></tr><tr><td/><td/><td/><td/><td/><td/><td/><td colspan=\"2\">have a target verb to compound with. The resulting</td></tr><tr><td/><td/><td/><td/><td/><td/><td/><td colspan=\"2\">compound may itself be lowered, but only as a unit.</td></tr><tr><td/><td/><td/><td/><td/><td/><td/><td colspan=\"2\">This approach is partially inspired by Seuren's</td></tr><tr><td/><td/><td/><td/><td/><td/><td/><td colspan=\"2\">transformational account in terms of predicate</td></tr><tr><td/><td/><td/><td/><td/><td/><td/><td colspan=\"2\">raising (Seuren 1972).</td></tr><tr><td/><td/><td/><td/><td/><td/><td/><td colspan=\"2\">So the interpretation of the compound labels is</td></tr><tr><td/><td/><td/><td/><td/><td/><td/><td colspan=\"2\">that e.g. [V,V] is a compound verb, and [VP,V,V! is</td></tr><tr><td/><td/><td/><td/><td/><td/><td/><td colspan=\"2\">a VP with a compound verb lowered onto it.</td><td>It</td></tr><tr><td/><td/><td/><td/><td/><td/><td/><td>follows</td><td>that</td><td>for</td><td>each</td><td>VP rule,</td><td>we</td><td>need</td><td>an</td></tr><tr><td/><td/><td/><td/><td/><td/><td/><td colspan=\"2\">associated</td><td>compound</td><td>version</td><td>which</td><td>allows</td><td>the</td></tr><tr><td/><td/><td/><td/><td/><td/><td/><td colspan=\"2\">lowering of (possibly compound) verbs from the VP</td></tr><tr><td/><td/><td/><td/><td/><td/><td/><td colspan=\"2\">onto the verb, so we would have e.g.</td></tr><tr><td/><td/><td/><td/><td/><td/><td/><td/><td>Di) VPIZ -> NP ZIV,</td></tr><tr><td/><td/><td/><td/><td/><td/><td/><td colspan=\"2\">where we now use Z as a variable over sequences of</td></tr></table>"
},
"TABREF5": {
"html": null,
"text": "that it is indeed weakly equivalent to TAG, then strong support will be lent to the claim that an interesting new point on the Chomsky hierarchy between CFGs and the indexed grammars has been found.r\" is simply p applied to the pair <q,r>, where TRUE and FALSE are the left and right pair element selectors respectively.In order to effectively construct and manipulate lists, some method of",
"type_str": "table",
"num": null,
"content": "<table><tr><td colspan=\"8\">believe my proposal accounts for all the judgements</td><td colspan=\"2\">reasonably concise and satisfying account of at</td></tr><tr><td colspan=\"3\">cited in their paper.</td><td colspan=\"5\">On the other hand, I do not</td><td>least</td><td>the</td><td>Dutch</td><td>phenomena</td><td>without</td><td>radically</td></tr><tr><td colspan=\"8\">believe they can account for all of the following</td><td colspan=\"2\">altering the grammatical framework of GPSG.</td></tr><tr><td colspan=\"8\">conjunction judgement, the first three based on</td><td/></tr><tr><td colspan=\"8\">(4), the next two on (3), whereas under the</td><td colspan=\"2\">Further</td><td>work</td><td>is</td><td>clearly</td><td>needed</td><td>to</td><td>exactly</td></tr><tr><td colspan=\"10\">standard GPSG treatment of conjunction they all fall out of our analysis: 6) omdat ik Nikki Nederlanda wil leren spreken en Frans wil laten schrijven because I want to teach Nikki to speak Dutch and let [Nikki] write French 7) * omdat ik Nikki Nedrelands wil leren spreken en Frans laten schrijven 8) omdat ik Nikki Nederlands wil leren spreken en Carla Frans wil laten schrijven because I want to teach Nikki to speak Dutch and let Carla write French. 9) omdat ik Nikki wil leren Nederlands te spreken en Frans te schrijven because I want to teach Nikki to speak Dutch and to write French their end is required. Numerous possibilities exist, of which we have chosen a relatively inefficient but conceptually clear approach. We compose lists of triples, rather than pairs. Normal CONS pairs are given as <TRUE,car,cdr>, while NIL is <FALSE,,>. Given this approach, we can define the following shorthand, with which the semantic rules given in sections II.2 and III.3 can be translated into the lambda calculus: TR= -Ix [~y [~]] can be shown determining establish the status of this augmented GPSG with respect to generative capacity and parsability. It is intriguing to speculate as to its weak equivalence with the tree adjunction grammars of Joahi et al. Even in the weakest augmentation, allowing only one occurence of one variable over sequences in any constituent of any rule, the apparent similarity of their power remains to be formally established, but it at least appears that like tree adjunction grammars, these grammars cannot generate anbncn with both dependencies crossed, and like them, it can generate it with any one set crossed and the other nested. Neither can it generate WW, although it can with a sequence variable ranging over the entire alphabet, if it FALSE-~x.Lky.LyJ]</td></tr><tr><td colspan=\"7\">IO) * omdat ik Nikki wil leren Nederlands te</td><td/><td/></tr><tr><td/><td colspan=\"5\">spreken en Carla Frans te schrijven</td><td/><td/><td/></tr><tr><td/><td/><td>or</td><td/><td/><td/><td/><td/><td/></tr><tr><td/><td>...</td><td colspan=\"5\">en Frans (ts) laten schrijven</td><td/><td/></tr><tr><td colspan=\"8\">(6) contains a conjoined [VP,V,V], (8) a conjoined</td><td/></tr><tr><td colspan=\"8\">[VP,V], and (7) fails because it attempts to</td><td/></tr><tr><td colspan=\"5\">conjoin a [VP,V,V] with a [VP,V].</td><td colspan=\"3\">(9) conjoins an</td><td/></tr><tr><td colspan=\"8\">ordinary VP iaside a [VP,V], and (10) fails by</td><td/></tr><tr><td>trying</td><td colspan=\"2\">to conjoin</td><td colspan=\"5\">a VP with either a non-</td><td/></tr><tr><td colspan=\"4\">constituent or a [VP,V].</td><td/><td/><td/><td/><td/></tr><tr><td colspan=\"8\">It is certainly not the case that adding this</td><td/></tr><tr><td colspan=\"8\">small amount of 'evidence' to the small amount</td><td/></tr><tr><td colspan=\"8\">already published establishes the case for the deep</td><td/></tr><tr><td colspan=\"6\">embedding, but I think it is suggestive.</td><td/><td>Taken</td><td/></tr><tr><td/><td/><td/><td/><td/><td/><td/><td/><td/><td>above</td><td>in</td><td>fact</td><td>receive</td><td>the</td><td>same</td></tr><tr><td colspan=\"8\">together with the obvious way in which the deep</td><td colspan=\"2\">interpretation.</td></tr><tr><td colspan=\"8\">embedding allows some vestige of compositionality</td><td/></tr><tr><td colspan=\"8\">to persist in the semantics, I think that at the</td><td colspan=\"2\">III.4 Which structure is right -evidence from</td></tr><tr><td colspan=\"8\">very least a serious reconsideration of the BKPZ</td><td colspan=\"2\">conjunction</td></tr><tr><td colspan=\"3\">proposal is in order.</td><td/><td/><td/><td/><td/><td colspan=\"2\">The careful reader will have noted that the</td></tr><tr><td/><td/><td/><td/><td/><td/><td/><td/><td colspan=\"2\">structures proposed are not the same as those of</td></tr><tr><td/><td/><td colspan=\"3\">IV. CONCLUSIONS</td><td/><td/><td/><td>BKPZ.</td><td>Their structures have the compound verb</td></tr><tr><td colspan=\"8\">It is of course too early to tell whether this</td><td colspan=\"2\">depending from the highest VP, while ours depend</td></tr><tr><td colspan=\"2\">augmentation</td><td>will</td><td>be</td><td>of</td><td>general</td><td>use</td><td>or</td><td colspan=\"2\">from the lowest possible.</td><td>With the exception of</td></tr><tr><td colspan=\"2\">significance.</td><td colspan=\"6\">It does seem to me to offer a</td><td/></tr></table>"
}
}
}
} |