File size: 37,975 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 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 |
{
"paper_id": "W98-0140",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T06:05:29.608682Z"
},
"title": "Formal Analyses of the Hungarian Verbal Complex",
"authors": [
{
"first": "Temese",
"middle": [],
"last": "Szalai",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "UCLA Linguistics",
"location": {
"addrLine": "3125 Campbell Hall",
"postCode": "90095-1543",
"settlement": "Los Angeles",
"region": "CA"
}
},
"email": ""
},
{
"first": "Edward",
"middle": [],
"last": "Stabler",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "UCLA Linguistics",
"location": {
"addrLine": "3125 Campbell Hall",
"postCode": "90095-1543",
"settlement": "Los Angeles",
"region": "CA"
}
},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "",
"pdf_parse": {
"paper_id": "W98-0140",
"_pdf_hash": "",
"abstract": [],
"body_text": [
{
"text": "The verbal complexes in Dutch, German, and Hungarian have interesting structures, providing good tests for formal syntactic theories. These structures have posed a problem for theories in the transformational tradition that have assumed just two, distinctly different kinds of movement operations: strictly local, morphologically motivated head movement and unbounded phrasal movement (Chomsky 1986) . The problem is that while some verbal complexes seem to consist of only heads, thus allowing a head-movement analysis, there are closely related constructions which involve projections !arger than bare heads, thereby requiring phrasal movements of some kind. The (synchronic) similarities between these constructions and also historical considerations suggest that we are missing a generalization by proposing both a head movement analysis and a phrasal one. The TAG formalism does not rest on any assumption of distinctly different head vs. phrasal movement operations, and so the TAG analysis of West-Germanic verb raising proposed by Kroch and Santorini ( 1991) fares rather well.",
"cite_spans": [
{
"start": 385,
"end": 399,
"text": "(Chomsky 1986)",
"ref_id": null
},
{
"start": 1039,
"end": 1066,
"text": "Kroch and Santorini ( 1991)",
"ref_id": "BIBREF8"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "This paper explores a new idea from the transformational tradition: an analysis of Hungarian and Germanic verbal complexes that involves phrasal movement only (Koopman & Szabolcsi, forthcoming, hereafter K & Sz). By dropping the assumption that there are two fundamentally different kinds of movement involved, this analysis avoids the problem with earlier transformationa! approaches to verbal complexes. Moreover, the essence of the analysis is easily formalized in a very simple fragment of transformational grammar that has been formalized by Stabler (1996 Stabler ( , 1997 . Like the TAG formalism, this formalism involves operations on trees. The proposed analysis cannot, however, be duplicated in the TAG formalism, because it is based on extensive \"remnant movements\", of the kind that have gotten a lot of attention especially since Kayne's (1994) influential proposals, and \"heavy piedpiping\" (Nkemnji 1995 , Koopman 1996 . (A remnant is a constituent from which extractions have taken place.) The Hungarian verbal complexes \"roll up\" the tree as remnants increasing in complexity without bound.",
"cite_spans": [
{
"start": 547,
"end": 560,
"text": "Stabler (1996",
"ref_id": null
},
{
"start": 561,
"end": 577,
"text": "Stabler ( , 1997",
"ref_id": "BIBREF11"
},
{
"start": 843,
"end": 857,
"text": "Kayne's (1994)",
"ref_id": "BIBREF3"
},
{
"start": 904,
"end": 917,
"text": "(Nkemnji 1995",
"ref_id": null
},
{
"start": 918,
"end": 932,
"text": ", Koopman 1996",
"ref_id": "BIBREF6"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Specifically, K & Sz consider the data in the following paradigm, all of which mean \"I will not want to begin to go home.\"",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "(1) Nem fogok akarni kezdeni hazamenni NEO will+ lS want-inf begin-inf home+go-inf",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "(2) Nem fogok akarni hazamenni kezdeni NEO will+ ls want-inf home+go-inf begin-inf",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "(3) Nem fogok hazamenni kezdeni akarni NEO will+ ls home+go-inf begin-inf want-inf \"Haza\" is a verbal modifier (P) that cannot appear in sentence final position. Kenesei (1989) ",
"cite_spans": [
{
"start": 162,
"end": 176,
"text": "Kenesei (1989)",
"ref_id": "BIBREF4"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": ":-\"e--..l --..l--~ Sp- .... u 1 ..,~.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": ".,, vi u1 pc:uuauy iuv uc;u v1uv11). vcifically, once a lower verb fails to invert its complement, this un-inverted string cannot be inverted by a higher verb. Thus, the following orders are impossible on the relevant reading:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "*Vl [V2[P[V3 [_ V4]]]] *Vl [[V3 [P V4]] V2] *Vl [V3[ V2 [[PV4] _]])",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "K & Sz propose that the acceptable patterns are derived by extracting the arguments of the verbs and then moving the VPs, now containing nothing except the verb, into !arger and larger structures:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Vl V2V3 [PV4] -> Vl V2 [[PV4] V3]-> Vl [[P V4] V3] V2",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "In the linguistic literature, this type of movement is referred to as \"remnant movement\". This analysis also makes use of \"heavy piedpiping\" in which a feature of a sub-part triggers movement of a !arger piece of the structure. K & Sz make a number of theoretical assumptions that dictate this type of strategy. The formalization of these assumptions forms the underpinnings of the analysis to be proposed here.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "The assumptions as laid out by K & Sz are, first of all, that all languages are binary branching with underlying Spec-Head-Complement order, following Kayne (1994) . Secondly, they adopt the Universal Base Hypothesis (Sportiche 1993 , Cinque 1997 , Koopman 1996 , which requires that cross-linguistic variation be attributal to factors other than hierarchical differences. Further, they propose that certain categories (DP, CP and PredP) must be licensed by moving into the specifier of a special licensing projection (LP(DP), LP(CP), LP(PredP)). These licensing projections generalize the role of \"CASE\" in Case Theory. All movement must be overt and motivated by features. They further assume a number of restrictions on movement and principles that force movement. In particular, we have the COMP+ restriction, which is closely related to the Left Branch \u2022 Condition.",
"cite_spans": [
{
"start": 151,
"end": 163,
"text": "Kayne (1994)",
"ref_id": "BIBREF3"
},
{
"start": 217,
"end": 232,
"text": "(Sportiche 1993",
"ref_id": null
},
{
"start": 233,
"end": 246,
"text": ", Cinque 1997",
"ref_id": null
},
{
"start": 247,
"end": 261,
"text": ", Koopman 1996",
"ref_id": "BIBREF6"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "A maximal projection can move if it meets either of the following two requirements.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMP+ Restriction on Movement:",
"sec_num": null
},
{
"text": "(a) if it is the rightmost sister of a minimal projection and it has no ancestor which is the leftmost daughter of a maximal projection (b) if it is the leftmost daughter of a maximal projection and that maximal projection is ( 1) the rightmost sister of a minimal projection and (2) has no ancestor which is the leftmost daughter of a maximal projection",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMP+ Restriction on Movement:",
"sec_num": null
},
{
"text": "In addition, they assume the following two principles, from Koopman (1996) , which force movement in a number of cases.",
"cite_spans": [
{
"start": 60,
"end": 74,
"text": "Koopman (1996)",
"ref_id": "BIBREF6"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "COMP+ Restriction on Movement:",
"sec_num": null
},
{
"text": "A projection is interpretable iff it has lexical material at some stage in the derivation Modified LCA: No projection has both an overt Spec and an overt head at the end of the derivation. These principles in combination with the restrictions on movement simplify the syntactic analysis of the above data quite considerably. The derivations are reduced to a more-orless mechanical operation in which consituents \"roll up\" the tree. Word order differences come from limited sources of optionality. One source of optionality is the amount of material that can pied-pipe. The other source of optionality is the optionality of the functional category PredP, which is discussed in more detail below. A skeleton derivation for an inverted order involving only two verbs has been schematized below to illustrate the character of this analysis.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Principle of Projection Activation (PPA):",
"sec_num": null
},
{
"text": "(1) WP is an extension ofVP. All VPs are dominated by a WP. Spec, WP should always be filled. When there is no particle (P) or lower WP or CP to fill this position, the entire VP can move into Spec, WP. WP2",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Principle of Projection Activation (PPA):",
"sec_num": null
},
{
"text": "~ pi W' ~ W2 VP2 ~ V' ~ V2 ti",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Principle of Projection Activation (PPA):",
"sec_num": null
},
{
"text": "(2) All WPs are dominated by a CP. This CP can be selected by another auxiliary (here V t ). VP 1 is dominated by a WP. The lower WP moves into the Spec of the higher WP.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Principle of Projection Activation (PPA):",
"sec_num": null
},
{
"text": "/\"-....",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "W'",
"sec_num": null
},
{
"text": "/\"-....",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "W2 VP2",
"sec_num": null
},
{
"text": "/\"-....",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "V'",
"sec_num": null
},
{
"text": "/\"-....",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "V2",
"sec_num": null
},
{
"text": "/\"-....",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Wl VPI",
"sec_num": null
},
{
"text": "/\"-....",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "V'",
"sec_num": null
},
{
"text": "/\"-....",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "V1 CP2",
"sec_num": null
},
{
"text": "/\"-....",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "C'",
"sec_num": null
},
{
"text": "(3 ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "c t\u2022 j",
"sec_num": null
},
{
"text": "--------------- CP2k L'(CP) /\"-.... /\"-.... C' L(CP) WPl /\"-.... --------------- c tj WP2j W'",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "c t\u2022 j",
"sec_num": null
},
{
"text": "/\"-.... /\"-....",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "c t\u2022 j",
"sec_num": null
},
{
"text": "/\"-.... /\"-....",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Pi W' Wl VPl",
"sec_num": null
},
{
"text": "/\"-.... /\"-....",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "W2 VP2 V'",
"sec_num": null
},
{
"text": "VI tk /\"'-..",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "V'",
"sec_num": null
},
{
"text": "Above we have a fully inverted order. To obtain an un-inverted order, the sources of optionality, namely presence of PredP and amount of pied-piped material, need to be exploited.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "V2 t;",
"sec_num": null
},
{
"text": "Inspired by Koster (1994) and Zwart of the VP which obligatorily dominates WP in certain circumstances. WP will move to Spec, PredP. PredP must then be licensed in an LP(PredP) position. WP will then cause large portions of structure to pied-pipe.",
"cite_spans": [
{
"start": 12,
"end": 25,
"text": "Koster (1994)",
"ref_id": "BIBREF7"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "V2 t;",
"sec_num": null
},
{
"text": "Using the type of strategy outlined above it is possible for constituents to \"roll up\" the \u2022 tree, forming unbounded dependencies. The technology proposed by K & Sz can be used to generate anbncndnen type languages. In fact, this style of derviation derives languages weil outside the class of mildly context sensitive languages. In this framework, the same kind of derivation, \"rolling up\" constituents by moving remnants, easily derives the language a 11 b 11 c 11 d-\"en. Roughly,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "V2 t;",
"sec_num": null
},
{
"text": ".\" -> eaabbccdd[ee] -> [ee]eaabbccdd -> d[ee]eaabbccdd -> [dd]d(ee]eaabbcc -> \".",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "V2 t;",
"sec_num": null
},
{
"text": "-> aaabbbcccdddeee",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "V2 t;",
"sec_num": null
},
{
"text": "In fact, it is possible to obtain unboundedly many counting dependencies in this fashion. These derivations require very !arge trees which make use of very little recursion, although extensive use is made of mechanical operations to ensure regularities between structures. This suggests that, if K & Sz are on the right track, TAG formalisms of their analysis would require many large elementary trees, leaving important regularities to the characterization of the elementary tree set.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "V2 t;",
"sec_num": null
},
{
"text": "lt is easy to adapt Stabler's (1996 Stabler's ( , 1997 ) Derivational Minimalism to formalize this type of derivation, using only phrasal movement from certain structural configurations to derive the acceptable structures without allowing the unacceptable ones. This adaptation will then also allow unbounded counting dependencies to be captured in Derivational Minimalism, which has already been shown to be capable of capturing copying languages (Cornell 1996 , Stabler 1997 .",
"cite_spans": [
{
"start": 20,
"end": 35,
"text": "Stabler's (1996",
"ref_id": null
},
{
"start": 36,
"end": 54,
"text": "Stabler's ( , 1997",
"ref_id": "BIBREF11"
},
{
"start": 448,
"end": 461,
"text": "(Cornell 1996",
"ref_id": "BIBREF2"
},
{
"start": 462,
"end": 476,
"text": ", Stabler 1997",
"ref_id": "BIBREF11"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "V2 t;",
"sec_num": null
},
{
"text": "To adapt this derivation to Stabler's framework, certain aspects of the K & Sz proposal need tobe formalized.The COMP+ restriction on movement has already been discussed. The additional principles and restrictions on movement can be formalized in terms of features in the Derivational Minimalism framework. For example, the requirement that all movement be overt is translated into Derivational Minimal-ism by requiring that all attractor features be strong (+X features only).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "V2 t;",
"sec_num": null
},
{
"text": ". The PPA will be formalized by requiring that all lexical entries bear at least one strong attractor feature. This will ensure that all minimal projections have something in their specifiers at some stage of the derivation. To capture the Modified LCA , all empty heads will have a strong attractor feature. Additionally, a mechanism will be established to verify that when an overt lexical item licenses a constituent that constituent has additional licensee features if it is overt.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "V2 t;",
"sec_num": null
},
{
"text": "The universal base that K & Sz assume is ensured through feature selection. Lexical items will select features in the following order for the relevant domain: lpred >> lc >> ld >> pred >> inf >> w >>v Using these mechanisms, it is easy to formalize the basics of the K & Sz analysis in Derivational Minimalism. Because the formalism is so simple and the analysis so mechanical, the prospects here look quite good. Additionally, the type of analysis proposed here allows for any number of counting dependencies to be enforced. Derivational Minimalism can handle these dependencies quite simply, by \"rolling up\" constituents. Languages like these cannot be defined in standard TAGs (Vijay-Shanker and Weir 1994). The lack of recursion makes this type of analysis challenging in standard TAGs. Moreover, the regularities of the data will not be readily observable as the regularities seem to have mechanical properties.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "V2 t;",
"sec_num": null
}
],
"back_matter": [],
"bib_entries": {
"BIBREF1": {
"ref_id": "b1",
"title": "The Minima/ist Program",
"authors": [
{
"first": "N",
"middle": [],
"last": "Chomsky",
"suffix": ""
}
],
"year": 1995,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Chomsky, N. 1995. The Minima/ist Program. MIT Press, Cambridge, Massachusetts.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "A minimalist grammar for the copy language",
"authors": [
{
"first": "T",
"middle": [],
"last": "Cornell",
"suffix": ""
}
],
"year": 1996,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "\u2022 Cornell, T. 1996. A minimalist grammar for the copy language, SFB 340 Technical Report #79, University ofTubingen, http:// www.sfs.nphil.uni-tuebingen.de/-comell/\"",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "The Antisymmetry of Syntax",
"authors": [
{
"first": "R",
"middle": [],
"last": "Kayne",
"suffix": ""
}
],
"year": 1994,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kayne, R. 1994. The Antisymmetry of Syntax. MIT Press, Cambridge, Massachusetts.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Logikus-e a magyar szorend?",
"authors": [
{
"first": "I",
"middle": [],
"last": "Kenesei",
"suffix": ""
}
],
"year": 1989,
"venue": "Altalanos Nyelveszeti Tanulmanyok",
"volume": "17",
"issue": "",
"pages": "5--152",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kenesei, I. 1989. \"Logikus-e a magyar szorend?\" Altalanos Nyelveszeti Tanul- manyok 17, l 05 -152.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Verbal Complexes. forthcoming",
"authors": [
{
"first": "H",
"middle": [],
"last": "Koopman",
"suffix": ""
},
{
"first": "A",
"middle": [],
"last": "Szabolcsi",
"suffix": ""
}
],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Koopman, H. and A. Szabolcsi. Verbal Com- plexes. forthcoming.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "The Spec-Head Configuration",
"authors": [
{
"first": "H",
"middle": [],
"last": "Koopman",
"suffix": ""
}
],
"year": 1996,
"venue": "Syntax at Sunset, UCLA Working Papers in Syntax and Semantics l",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Koopman, H. 1996. The Spec-Head Configu- ration. In E. Garret and F. Lee, eds\" Syntax at Sunset, UCLA Working Papers in Syntax and Semantics l.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Predicate lncorporation and the Word Order of Dutch",
"authors": [
{
"first": "J",
"middle": [],
"last": "Koster",
"suffix": ""
}
],
"year": 1994,
"venue": "Paths Towards Universal Grammar",
"volume": "",
"issue": "",
"pages": "255--276",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Koster, J. 1994. \"Predicate lncorporation and the Word Order of Dutch\" in G. Cinque, J.- Y. Pollock, L. Rizzi and R. Zannuttini, eds, Paths Towards Universal Grammar, 255- 276, Georgetown Univ. Press: Washington, D.C ..",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "The derived constituent structure of the West Germanic Verb Raising construction",
"authors": [
{
"first": "A",
"middle": [
"S"
],
"last": "Kroch",
"suffix": ""
},
{
"first": "B",
"middle": [],
"last": "Santorini",
"suffix": ""
}
],
"year": 1991,
"venue": "",
"volume": "",
"issue": "",
"pages": "269--338",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kroch, A.S. and B. Santorini. 1991. The derived constituent structure of the West Germanic Verb Raising construction. In Freidin, R., ed\" Principles and parameters in comparative grammar, pages 269-338. MIT Press, Cambridge, Massachusetts. Nkenmji, M. 1995. Heavy pied-piping in Nweh. Ph.D. Dissertation, UCLA.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Sketch of a reductionist approach to syntactic variation and dependencies",
"authors": [
{
"first": "D",
"middle": [],
"last": "Sportiche",
"suffix": ""
}
],
"year": 1995,
"venue": "Evolution and Revolution in Linguistic Theory",
"volume": "",
"issue": "",
"pages": "356--398",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sportiche, D. 1995. Sketch of a reductionist approach to syntactic variation and dependencies. In H. Campos and P. Kempchinsky, eds\" Evolution and Revolution in Linguistic Theory, pages 356-398. Georgetown University Press, Washington, D.C\" Stabler, E. 1996. Computing quantifier scope.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Ways of Scope Taking",
"authors": [],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "In A. Szabolcsi, ed., Ways of Scope Taking, Kluwer, Boston.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Derivational Minimalism",
"authors": [
{
"first": "E",
"middle": [],
"last": "Stabler",
"suffix": ""
}
],
"year": 1997,
"venue": "Logical Aspects of Computational Linguistics",
"volume": "",
"issue": "",
"pages": "68--95",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Stabler, E. 1997. Derivational Minimalism. In C. Retore, ed., Logical Aspects of Computational Linguistics, pages 68-95. Springer-Verlag (Lecture Notes in Computer Science 1328), NY.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "The equivalence of four extensions of context free grammar formalisms",
"authors": [
{
"first": "K",
"middle": [],
"last": "Vijay-Shanker",
"suffix": ""
},
{
"first": "D",
"middle": [],
"last": "Weir",
"suffix": ""
}
],
"year": 1994,
"venue": "Mathematical Systems Theory",
"volume": "27",
"issue": "",
"pages": "511--545",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Vijay-Shanker, K. and D. Weir. 1994. The equivalence of four extensions of context free grammar formalisms. Mathematical Systems Theory, 27 :511-545.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Morphosyntax ofVerb Movement",
"authors": [
{
"first": "C",
"middle": [],
"last": "Zwart",
"suffix": ""
},
{
"first": "J-W",
"middle": [],
"last": "",
"suffix": ""
}
],
"year": 1997,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Zwart, C.J-W. 1997. Morphosyntax ofVerb Movement. Kluwer, Dordrecht",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"uris": null,
"type_str": "figure",
"text": "r1 r.9A 1 99\"' p~er1.p :,.., ... enllu annthar ea.vt-",
"num": null
}
}
}
} |