File size: 63,779 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 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 | {
"paper_id": "C80-1007",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T13:05:25.208235Z"
},
"title": "A CONTEXT-FREE GRAMMAR OF FRENCH*",
"authors": [
{
"first": "Morris",
"middle": [],
"last": "Salkoff",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Universit& de Paris 7",
"location": {
"country": "L.A.D.L"
}
},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "Summarx. I present here a method that allows one to construct a CF grammar of a natural language that correctly accounts for verbal selection rules. This goes contrary to the prevailing opinion, following Chomsky 5, that such a construction is impossible. My method consists essentially in separating the semantic function of a selection rule, namely, the exclusion of certain noun sub-classes, from the syntactic relation between the elements (verb, subject, object:) linked by this relation of selection. When the verb and object (subject) are separated by intervening levels of complement construction, the selection can still be satisfied by a double classification of verbs: according to the kind of subject they take, and also according to the type of verb that can follow them (in the complement construction). Conjunctions and sentences with respectively can also be treated within the framework of the CF approximation proposed here. like the latter, is recursively extendable to \u00a7O. Introduction sentences of theoretically unbounded length.",
"pdf_parse": {
"paper_id": "C80-1007",
"_pdf_hash": "",
"abstract": [
{
"text": "Summarx. I present here a method that allows one to construct a CF grammar of a natural language that correctly accounts for verbal selection rules. This goes contrary to the prevailing opinion, following Chomsky 5, that such a construction is impossible. My method consists essentially in separating the semantic function of a selection rule, namely, the exclusion of certain noun sub-classes, from the syntactic relation between the elements (verb, subject, object:) linked by this relation of selection. When the verb and object (subject) are separated by intervening levels of complement construction, the selection can still be satisfied by a double classification of verbs: according to the kind of subject they take, and also according to the type of verb that can follow them (in the complement construction). Conjunctions and sentences with respectively can also be treated within the framework of the CF approximation proposed here. like the latter, is recursively extendable to \u00a7O. Introduction sentences of theoretically unbounded length.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "It is now quite generally supposed that a natural language cannot be adequately described by a CF grammar. This opinion was first advanced by Chomsky 5 who discussed this problem from the point of view of phrase structure grammars. He presents there a fragment of a CF phrase structure grammar in terms of noun phrases NP, verb phrases, VP, etc., which are familiar from immediate constituent analysis. These rules cannot treat verbal selection rules properly;",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Chomsky ~ (ch. 8) had already tried himself to correct this defect within the framework of a CF phrase structure grammar, but the difficulties he encountered seem to have persuaded him that only a transformational grammar could handle such a problem. Harman 13 proposed another solution to the problem of treating verbal selection rules in a CF grammar; he added a set of subscripts to the CF rules used in Chomsky 5, which were chosen so that only those subjects and objects which satisfied the selection rules could appear with a given type of verb. Chomsky 8 showed that this method would not suffice if the sentences subscripted as Harman had suggested were themselves embedded in complement constructions. Thus, where Harman's system will not generate such aberrant sentences as *Bill elapsed, it will not be able to exclude the generation of such a sequence when it is embedded in a complement construction, as in *John persuaded Bill to elapse.",
"cite_spans": [
{
"start": 251,
"end": 269,
"text": "Harman 13 proposed",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Further arguments for the inadequacy of a CF grammar were adduced from the fact that sentences containing respectively cannot be assigned an appropriate structure in the framework of a CF grammar.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "This was noted by Chomsky 5 ( \u00a74.2) in his discussion of the algebraic language w w; the relation between this language and sentences containing respectively was discussed by Bar-Hillel & Shamir I, and then taken up again by Chomsky 8 together with examples taken from the comparative construction in English. Later, Postal 22 exhibited a construction in Mohawk which is similar to the one with respectively, and As a result of these considerations, Chomsky 8 concluded that a coherent description of recursively embedded sentences or of verbal selection rules could not be obtained in a natural way by any CF grammar, and that consequently no CF grammar could adequately describe a natural language. However, it turns out that this question is not so easily disposed of as it would appear, and recent work by Joshi & Levy 18 shows that a CS grammar containing rich context-dependent rules can be used to analyze trees that describe a CF language. They did this by an extension of a theorem of Peters & Ritchie 21 , who showed that CS rules of a certain type can be used not to generate sentences, i.e., not to characterize them, but only to verify their well-formedness, by applying the context-dependent parts of these rules as constraints on the set of trees that schematize these sentences. In this case, the language described by these trees is a CF language.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Joshi & Levy generalized the kinds of CS rules that can be used for this result and defined CS rules that can describe conditions on the context whose action is close to that of certain transformations. These rules are expressed as Boolean combinations of predicates that describe the left and/or right context of a node, or the upper and/or lower contexts (the nodes above and below a given node). Roughly speaking, a tree is said to be analyzable with respect to a grammar containing such rules if one of the rules is satisfied at each node of the tree.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "In that case, the language which consists of the terminal strings of all the trees analyzed by the grammar is a CF language, even though the rules take the context into account ~. Hence these terminal strings can be described by \u00a7Note that the formalism used by Joshi & Levy for displaying conditions on trees is close to the notation used for rewrite rules, and can lead to some confusion, lit need only be remembered that these context-dependent rules are not used to generate structures. some CF language. Now the string grammar proposed by Harris 15 and which analyzes English (Sager 23) and French (Salkoff 2~'25) can be shown to be of just the form described by Joshi & Levy. It contains CS rules of the type described by them, and is used to analyze a tree, rather than to generate it. It would thus appear that English or French can be described by some CF language, although the string grammar gives no clear clue as to what its form would be. I shall show here that such a CF grammar can be written for French, and that it can treat, in a linguistically appropriate fashion, the problem of the expression of verbal selection rules in nested complement constructions. I have chosen French because systematic data giving a wide coverage of the French lexicon are available (Gross 12, Boons et al.3) ; however, the very nature of this construction makes quite plausible its extension to other natural languages. Only the method used will be outlined in this brief article, and an example of its application to embedded complement constructions; for more details, consult Salkoff 25 (chap. 3)",
"cite_spans": [
{
"start": 581,
"end": 591,
"text": "(Sager 23)",
"ref_id": null
},
{
"start": 603,
"end": 618,
"text": "(Salkoff 2~'25)",
"ref_id": null
},
{
"start": 1281,
"end": 1291,
"text": "(Gross 12,",
"ref_id": null
},
{
"start": 1292,
"end": 1306,
"text": "Boons et al.3)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "I now construct CF rules that correctly describe sentences in which related pairs like verb-subject, verb-object, etc., that are linked by a relation of selection, may be separated by constructions of unbounded length. Each such CF rule is the expansion of a sentence schema S. The verbal selection rules are accounted for in this method by separating the semantic function of a selection rule, namely, the exclusion of certain noun sub-classes, from the syntactic relation between the pairs carrying this function (generally, a verb and a noun phrase). Each selection rule is decomposed into two independent parts: one part is the choice of a noun not classified in certain noun sub-classes, in such a way as to express the semantics of that selection rule;",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "the second part is the use of the noun phrase containing this N for the subject or object of a given verb in ~ rule schema, which amounts to satisfying the complete verbal selection rule.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Conjunctional sequences, including sentences containing respectivement can be handled by this method, but not within the strict mathematical framework of a CF language. The resulting CF grammar of French can be compared with a transformational grammar, and it is seen that the two are more similar than has been thought. \u00a7|. The base rules",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "In order to set forth the selection rules as clearly as possible, I shall begin by using in the rules developing S, noun phrases bearing three subscripts, i.e., complex symbols:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "(I) NP ;",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "where x is a function F: subx,y,z ject s, object ~, or i~direct object io; y is the morphology M: singular, plural,...; and z is a semantic su~-class S~ these sets have no elements in common.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "With this notation, typical rules for S will have the following form:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "(2)a S \u00f7 NP t V. NP s~y,z i o,y,z b S + NP t V. P NP.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "s,y~z J io,y,z c S + NPs,y,z t V k NPo,y~z P NPio,y,z, etc.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "The verb is subscripted according to the complements it takes.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "In this notation, the CF rules no longer constitute a strict constituent grammar of the type discussed by Chomsky 5'8. My notation brings out the grammatical relations between the elements of the sentence schemata, which is not possible \u00a7in a direct way in a phrase structure grammar. The complex symbols are useful in order to explain clearly the process of sentence embedding;",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "they will be eliminated in a second step and replaced by the noun phrases without subscripts used in the verbal selection rules.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "For clarity, I shall use only the subscript F (s, o, or i o) in the rules for S. Only an abbreviated list of these rules can be given here; for a complete list, cf. Salkoff 25. A first subgroup of rules contains non-sentential objects: A third group of rules yield embedded sentences. One example will be treated here, as it occurs in independent sentences and in relative clauses, to illustrate the method. The new notation oNPs denotes a noun phrase having a double function F: it must be an accept- \u00a7To do so, one has, for example, to reinterpret the tree structure of the sentence (cfo Chomsky7).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": "(3) S ~ NP t V 1 (Max dort) S S \u00f7 NP t V",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": "able object of the verb V30 which precedes \u00a7 , and also an acceptable subject of the main verb of S I. The sentence schema for S 1 is a sentence deformation (in Harris '17 terminology); there are about ten such deformations in French. Another one is the following:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": "(5) S + NP t V32 S 3 (Max apprend ... s S 3 \u00f7 ~ . NP ~ V1 ... \u00a2 Paul ~ dormir) 1o s ... etc.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": "Each such schema S i contains as many rules as S itself. certain values of GNj. This is captured in the double verb classification: V~ ~,(Vj,~,,) is that verb sub-class which requiresJ'JGNi Jfor subject, when the direct (indirect) object is GN i, (GN i ). Lexicographlcal work shows that there are'about 40 different prepositions appearing in the objects P N and N P N. Since the double verb classification must be carried out for each value of Pi' this amounts to a triple classification of verbs. \u00a73. Elimination of the complex symbols The schema (12) generates only acceptable sentences; each verb in the lexicon is classified according to which of the sub-classes defined by (12) it belongs to; hence no verb will ever appear in a schema of type (12) unless it is acceptable there. Then, since the process defined by (I0) is such that only acceptable nouns can be chosen for the noun phrases GN (= N') in these schemata, each schema must in fact give rise to an acceptable sentence\u2022 The situation is quite different, however, for the rules containing oNPs, NP o or NPio. These cannot be developed as written, for two reasons: (1) only noun phrases of the type N\" are available, so that verbal selection rules can be satisfied; (2) the syntactic functions expressed by the subscripts on these noun phrases can be obtained only by a sub-classification of the verbs appearing with them. Thus, in order for oNPs (in 4) to be an acceptable object of the verb V a that precedes, and also an acceptable subject for the verb V b of the embedded sentence containing it, the verb V b must be subclassified according to type of subject, and V a has to be sub-classified according to the type of V b that may follow.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": "An even more complex classification is needed to handle relative clauses like (7), which begin with NP o. This noun phrase must be an acceptable object for the last verb, say Vc, in the S which follows; however, S can contain an pro pro unbounded number of embedded verbs before V c appears. Hence, V c is not known at the moment when the lexical entry is chosen for the N\" which represents NP o. The problem, then, is to 'transmit' the selectional characteristics of the noun in NP o to the rule that will later develop Ve, by using the embedded verbs as carriers for the selectional information\u2022 This transmission of selectional information necessitates a sub-classification both of embedded verbs and of the schemata of the type S pro\" \u00a731 Elimination of oNPs I subdivide the sets S]S 2, S 3, ... (cf.4 and 5) into S~ subsets, where i runs through the 31 possible values of the subject N\" (which replaces oNPs). These subsets then constitute a classification of the schemata S I, .., according to the type of subject the verb of the schema:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": "(13) S~ \u00f7 N] \u00f7 N] \u00f7 N] \u00f7 N]",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": "I subdivide the same way: This new way of ordering the rules is the basis for the sub-classification of verbs V30, which take the object S I. A verb V30 accepts only the sub-sets S~ whose subject N~ is an acceptable object forlthat verb\u2022 This is a selection rule between verbs: the verb V30 selects an object having a verb of a certain type t.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": "(14) S 1 pro,l de V 1 de V",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": "The generation of reeursively embedded sentences which satisfy verbal selection rules is now obtained as follows. First, let us choose a rule developing the matrix sentence , for example The same method can be used for generating acceptable relative clauses NP rl (in 6). As an example, I rewrite one of the NP rl in terms of the noun phrases N':",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": "(17)a NP rl \u00f7 N~ que N]t V30 S l pro,i b S~ro,i \u00f7 (@)i de V 1 i)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": "By choosing a verb V30 in the subclass (N],Sp, i.e., one taking N'.. as its subject and as second verb (in S!ro )J one whose subject is N[, I guarantee that the N i in a is both an acceptable object of V30 and an acceptable subject of the verb in S1",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": "pro \u00a732 Elimination of N_P_o",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": "The development sketched in \u00a731 will not do for relative clauses like NP r2 (in 7), which have the form NP o que Spr o. This can be schematized roughly as NP o que.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": "\u2022 V i .... V~ V c , where Vi, Vj, .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": ". are embedded verbs o~ the type V30, V31, ..., and V c is the last verb of 'qpro' the one for which NP o must be an acceptable obj ect.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": "In order to transmit the selectional characteristics of NP o to the rule that develops Vc, and this within the framework of a CF grammar, I can proceed as follows. I subscript Spro in (7) by k, which is also the subscript on the noun phrase N~ that replaces NP o (just as S I, S 2, .... were subscripted for the type of subject); then the schema SI~ for embedded sentences will have two subscripts: one for ~, and a second one for the type of subject the verb takes. This yields the following kind of development: ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": "(18) NP r2 \u00f7'N~ que Spro, k Spro, k \u00f7 N~ t V 2 (~)k + N~ t V",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": "V 2 (~)k pro,j j",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": "If rule b is chosen, sentence embedding terminates; then, choosing a V 2 in the sub-class taking an object of type N~ (as indicated by @k ) guarantees that N~ in (18) is an acceptable object for that V 2. If-rule a is chosen, sentence embedding continues; a verb V32 is chosen, in the sub-class (hi, S],), until a rule of type _b is chosen.",
"cite_spans": [
{
"start": 162,
"end": 166,
"text": "(18)",
"ref_id": "BIBREF6"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": "The reader will notice two features of this method of using the selection rules to generate relative clauses\u2022 (I) The subdivision of S I into a set of S~ rule schemata does not increase the number of rules in S. The same number of rules would be obtained by inserting the noun phrases Nk into S (or SI), and this must be done in any case in order to express the verbal selection rules (in whatever fashion)\u2022 In the decompositions of SI,..., used above, the point was only to present the original schemata so as to make the subject or object of the verb in the schema stand out, for further reference.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": "(2) The two kinds of selection made explicit in these schemata, the one between verbs, and the other (better known) between verb and object (or subject), appear only once in the grammar. Both types of selection are used in each step of sentence embedding, but in no case does this entail rewriting the two kinds of selection in the grammar each time a deeper level of embedding is attained. \u00a74. Conjunction; respectively It has been shown by Chomsky 5 that conjunctions can be described in a CF grammar only by using an infinite number of rules, represented by rule schemata; if one restricts oneself to strict CF grammar, one introduces an excessive structuring of the conjoined forms\u2022 An approximate sol-ution can nevertheless be given to this problem, in the framework of a finite CF grammar, in the following way. I construct a sequence of conjoined noun phrases: i Denoting by Gcf the CF grammar containing the rules GN i, GN i-I, ..., GN I, I can. set up the series of grammars G~f, G 2 l cf' \"''' Gcf' each representing a better approximation to the infinite G~f, which contains a noun phrase of un-grammar bounded c length.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": "For any practical purpose, such as generation (or analysSs) of sentences, it is clear i that one of the Gcf will be large enough to yield the desired precision.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": "However, another approximation is available which is less costly, from the viewpoint of the number of rules required, and which yields the same result for G~f. This is the rule schema proposed by Chomsky & Sch5tzenberger 9 for handling conjunction in a CF grammar.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": "For the case of noun phrase conjunction, this schema is as follows:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": "(22)a GN \u00f7 N'; b GN + N\" (et N')*",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": "The star indicates that the group (et N') can be iterated as many times as is necessary. This schema is therefore an abbreviation for an infinite number of rules.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": "With such a rule schema in it, my grammar is no longer strictly CF; however, it is clearly f~ithful to the spirit of the approximation for l outlined above, since the language described Gcf by my grammar is the same as that reached asymptotically by the series of grammars G~f, 2 Gcf,.., G~f obtained with (21) . The rule schema (22) can be compared to an alggrithm for generating any l by choosing the number one of the grammars Gcf of iterations.",
"cite_spans": [
{
"start": 306,
"end": 310,
"text": "(21)",
"ref_id": "BIBREF7"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": "There exists a set of structures in natural language which cannot be described by the methods developed until now, namely those containing either respectivement, or the distributives qui or selon que: (23) Although these strings cannot be generated by a CF grammar \u00a7 , a procedure is nevertheless avail- \u00a7--The applicability-~f this argument to the linguistic case is not quite as simple as this brief formulation of the argument might lead one to suppose, in the way it is generally used in discussing sentences with respectivement. It is only the language containing just the sentences (23) , and only those, that cannot be generated by a CF grammar. However, in order for this conclusion to apply to the generation of the entire French language by a CF grammar, it must be shown that there exists no sublanguage of French containing these sentences in respectivement as a subset that can be generated by a CF grammar. Cf. Gross II ( \u00a78.1) for this argument. able for including this type of sentence in the CF approximation under discussion here.",
"cite_spans": [
{
"start": 201,
"end": 205,
"text": "(23)",
"ref_id": "BIBREF9"
},
{
"start": 588,
"end": 592,
"text": "(23)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": "I add Kleene rules to the grammar, and a condition on these rules, as follows: (25) is equivalent to: The methods I have sketched here can certainly be applied to other natural languages and will account in a natural way for the general phenomena of verbal selection rules in embedded sentences. One may wonder why this work has not been carried out before.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": "(26) N 1 et N 2 .. V 1 et V 2 .. N 1 et N 2",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": "Historically, attacks against the adequacy of CF grammar for describing natural language arose at a moment when it was necessary to explore the nature of the transformational grammar just proposed. This new style of grammar seemed so much better adapted than CF phrase structure grammars to explaining sentence relations that any more effort towards developing a detailed CF grammar seemed fruitless. To discourage such efforts, Chomsky 5 (chap. 5) declared that \"any grammar that can be constructed in terms of this theory [CF phrase structure grammar] will be extremely complex, ad hoc and 'unrevealing'\". These remarks were reaffirmed (Chomsky 8) and bolstered by an argumentation based on the inherent inadequacy of CF grammar for describing verbal selection rules.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": "A second criticism arose from the analysis of constructions, like respectivement, whose description could not be obtained within the strict framework of a CF grammar. We have seen above that such a statement is at best unclear. It may be correct that a mathematically rigorous description of this construction is not possible in a strict CF grammar; even so, we are under no obligation to transfer this observation bodily to the domain of linguistics.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": "The type of description that I elaborated above, in which a rule of interpretation is added to a rule generating the form of sentences containing respectivement, is now used in recent work in generative semantics.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": "Moreover, it can be seen that the CF grammar presented here is but a short step removed from a transformational grammar. In all transformational theories, a transformation includes (among other things) a relation between sentences. Most authors also include operations that deform one sentence into another, or which modify an abstract structure so as to derive sentences from it. The CF grammar I have proposed contains the information that establishes relationships between sentences, but it does not contain the operations or the metalinguistic assertions that make the transformation explicit. By a small extension of the CF framework I can also obtain the equivalent of a transformation, as follows. As an example, I consider the passive transformation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": "The passive transformation consists in matching an active phrase with its passive counterpart. The statement of the transformation can stop there, as does Harris 'I~, or one can add the specification of the computer operations needed to create the active and passive trees, as in generative grammar.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": "In the CF grammar presented here, I have two independent rules, one for the active form, and another for the passive of the first: Each of these rules has an independent set of selection rules that are expressed in the choice of the N\" for the NP. Adding these selection rules, (27) becomes: It was just to avoid this kind of useless duplication that justified the introduction of transformations. Suppose now that I factorize the selection rules from a set of forms that constitute an equivalence class, for example, from the 'active' and the 'passive' forms; I place a separator p between the forms of the equivalence class: In this formulation, the selection rules are no longer duplicated; moreover, we can interpret the separator p between the members of the equivalence class as indicating a relation between the sentence schemas so separated. The factorization of the selection rules, together with the introduction of the separator can be read as the definition of a transformational rule between the sentence schemata.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": "Of course, rule (29) is no longer CF, but it represents a rather natural extension of the CF framework which makes the latter much more similar to a transformational grammar than one might have thought possible up til now. However, the reader will note that the concept of a transformation is indispensable as a tool for the construction of this CF grammar, and then for its extension towards a transformational grammar by means of the factorization of selection rules. Furthermore, this CF grammar does not generate the sentences of the language 'weakly', in the meaning given this word by Chomsky; in fact, it provides them an 'adequate' grammatical structure as well as a linguistically justifiable relationship to other sentences of the language.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": "Finally, let us note that although the entire set of rules of the CF grammar proposed here is large (of the order of 109 rules), it is nonetheless finite. Furthermore, the size of the grammar is of no theoretical consequence, since it could be stored quite handily, not in some static memory (e.g., a pile of discs), but in a dynamic form (that is, in the form of schemata) where each rule is generated at the moment when the program of syntactic analysis (or generation) requires it. In this way, the set of rules would be reduced to a series of sub-programs that can generate either one rule, or a sub-set of rules, or all the rules. During analysis or generation, a call for rules would activate their synthesis by the appropriate sub-program. Such a program of analysis by synthesis reduces the number of rules to a smaller number of sub-programs, but a string grammar reduces them still more, down to a set of about 150 strings (the rewrite rules) together with about 200 restrictions (the CS portions attached to the CF rules).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": "The size of the CF grammar required to describe selection rules adequately also explains why all attempts at automatic syntactic analysis by means of strictly CF grammars undertaken until now have failed. The authors of these CF grammars limited their effort to including some rudimentary linguistic facts; the average size of this sort of CF grammar was of the order of several thousand rules (cf. Kunolg,20).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
},
{
"text": "Under these conditions, there was no question of providing only linguistically acceptable analyses. However, in the last few years, other CS variants of a CF grammar have been proposed, and partly worked out. In particular, the augmented transition network grammar of Bobrow & Fraser 2, especially in the form given it by Woods 28, has predicates associated with the transitions, predicates that are so many context-sensitive tests. This kind of grammar is then quite similar to string grammar, i.e., to a CF grammar together with CS conditions on the rules. Unfortunately, none of the grammars based on the ideas of Bobrow and Woods has been worked out in sufficient detail to make a linguistic comparison with string grammar possible. ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Main rule schema.",
"sec_num": null
}
],
"back_matter": [],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Syntactic Structures, The Hague Mouton 6. --1963. Formal properties of grammars",
"authors": [
{
"first": "J.-P",
"middle": [],
"last": "Boons",
"suffix": ""
},
{
"first": "A",
"middle": [],
"last": "Guillet",
"suffix": ""
},
{
"first": "C",
"middle": [
";"
],
"last": "Leclere",
"suffix": ""
},
{
"first": "L",
"middle": [
"A D L"
],
"last": "Univ",
"suffix": ""
},
{
"first": "Paris",
"middle": [],
"last": "De",
"suffix": ""
}
],
"year": 1955,
"venue": "Topics in the theory of generative grammar",
"volume": "7",
"issue": "",
"pages": "5--1957",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Boons, J.-P., Guillet, A. & Leclere, C., 1976. Classes de constructions transitives, Rap- port de Recherche N \u00b0 6, L.A.D.L., Univ, de Paris 7, Place Jussieu, Paris 4. Chomsky, N., 1955. The logical structure of linguistic theory, New York, Plenum (1975). 5. -- 1957. Syntactic Structures, The Hague Mouton 6. -- 1963. Formal properties of grammars, in Handbook of Mathematical Psychology, Vol. 2, New York, John Wiley 7. -- 1965. Aspects of the theory of syntax, Boston, MIT Press 8. -- 1966. Topics in the theory of genera- tive grammar, in Current ~ends in Linguistics, Vol. 3, The Hague, Mouton 9. Chomsky, N. & Sch~tzenberger, M., 1963. The algebraic theory of context-free languages, in",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Grammaire transformationnelle du frangais: le verbe",
"authors": [
{
"first": "M",
"middle": [],
"last": "Gross",
"suffix": ""
}
],
"year": 1968,
"venue": "Mathematical Models in Linguistics",
"volume": "12",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Gross, M., 1968. Grammaire transformation- nelle du frangais: le verbe, Paris, Larousse II. -- 1972. Mathematical Models in Linguis- tics, New Jersey, Prentice-Hall 12. -- 1975. M~thodes en Syntaxe, Paris, Her- mann",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Generative grammars without transformation rules: a defense of phrase structure, Language",
"authors": [
{
"first": "G",
"middle": [],
"last": "Harman",
"suffix": ""
}
],
"year": 1963,
"venue": "",
"volume": "39",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Harman, G., 1963. Generative grammars with- out transformation rules: a defense of phrase structure, Language, Vol. 39, N \u00b0 4.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Discourse analysis",
"authors": [
{
"first": "Z",
"middle": [],
"last": "Harris",
"suffix": ""
}
],
"year": 1952,
"venue": "",
"volume": "28",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Harris, Z. 1952. Discourse analysis, Langu- age, Vol. 28, N \u00b0 1",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "String analysis of sentence structure, The Hague, Mouton J6. --1964. The elementary transformations",
"authors": [],
"year": 1968,
"venue": "Papers in structural and transformational linguistics",
"volume": "17",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "J5. -- ]962. String analysis of sentence str- ucture, The Hague, Mouton J6. -- 1964. The elementary transformations, in Harris, 1970, Papers in structural and trans- formational linguistics, Dordrecht, Reidel 17. 1968. Mathematical structures of lan- guage, New York, John Wiley",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Constraints on structural descriptions: local transformations",
"authors": [
{
"first": "&",
"middle": [],
"last": "Joshi",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Levy",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Kuno",
"suffix": ""
}
],
"year": null,
"venue": "Computation laboratory",
"volume": "6",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Joshi & Levy, ]977. Constraints on structur- al descriptions: local transformations, SIAM J. of Computing, Vol. 6, N o 2 19. Kuno, S., 1963. The multiple-path syntactic analyzer for English, Report N \u00b0 NSF-9, Computa- tion laboratory, Harvard, Boston. 20. -- 1965. The predictive analyzer and a path elimination technique, Comm. of the Assn. for Comp. Mach., Vol 8, p. 453",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Context-Sensitive immediate constituent analysis",
"authors": [
{
"first": "S",
"middle": [],
"last": "Peters",
"suffix": ""
},
{
"first": "R",
"middle": [],
"last": "Ritchie",
"suffix": ""
}
],
"year": 1969,
"venue": "Proc. of the ACMSymposium on 'Theory of Computing",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Peters, S. & Ritchie, R., 1969. Context-Sen- sitive immediate constituent analysis, Proc. of the ACMSymposium on 'Theory of Computing', New York, ACM",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Limitations of phrase structure grammars",
"authors": [
{
"first": "P",
"middle": [],
"last": "Postal",
"suffix": ""
}
],
"year": 1964,
"venue": "The structure of language",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Postal, P., 1964. Limitations of phrase str- ucture grammars, in The structure of language, ed. by Fodor & Katz, New Jersey, Prentice-Hall.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "The string parser for scientific literature",
"authors": [
{
"first": "N",
"middle": [],
"last": "Sager",
"suffix": ""
}
],
"year": 1973,
"venue": "Natural Language Processing",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sager, N., 1973. The string parser for sci- entific literature, in Natural Language Proc- essing, ed. by R. Rustin, New York, Algorithmics Press.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Transition network grammars for natural language analysis",
"authors": [
{
"first": "M",
"middle": [],
"last": "Salkoff",
"suffix": ""
}
],
"year": 1970,
"venue": "Comm. of the Assn. for Comp. Mach",
"volume": "25",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Salkoff, M., 1973. Une grammaire en cha~ne du frangais, Paris, Dunod 25. -- 1979. Analyse syntaxique du frangais: grammaire en cha~ne, Amsterdam, J. Benjamins 26. Woods, W., 1970. Transition network grammars for natural language analysis, Comm. of the Assn. for Comp. Mach., Vol. 13, p. 591",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "*I should like to thank M. Gross for many helpful comments, and myself for an excellent typing job",
"authors": [],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "*I should like to thank M. Gross for many helpful comments, and myself for an excellent typing job.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"uris": null,
"text": "(4)a S + NP t V30 S 1 (Max convainc ...S S 1 + NP de Vl ... Paul de dormir) 0 S * NP de V 2 NP . .Paul d'oter cela) 0 S 0",
"num": null,
"type_str": "figure"
},
"FIGREF1": {
"uris": null,
"text": "15) N]t V30 S~ I Now the verbs in the sub-class V30 have been subclassified in the lexicon according to the type of acceptable subject, N i, and also according to the type of acceptable complement S~. By choosing in (15) a verb in the sub-class (Nj,Si) , I obtain an acceptable sentence. %The selection between verbs mentioned here has already been suggested by Z. Harris 16 in the framework of a system of sentence generation based on the concept of the verb as an operator acting on its arguments (approximately, its subject and object)\u2022 Selection between verbs was also used by M. Gross I0 in order to account for constructions like Je coul~s manger un g~teau, ?? Je co~2~s d~tester Max; here, the first verb (of movement) selects for the type of verb that can follow it. 1 Next, S i is developed, using the schema (13), by one of two tynes of rules: (16)a S~l + N]z de V31 S~; b S~l \u00f7 N~ de V 2 NP o If rule a is chosen, another sentence is embedded, anda verb V31 in the sub-class (N[,S]) is chosen from the lexicon. But if rule b is chosen sentence embedding terminates with that rule.",
"num": null,
"type_str": "figure"
},
"FIGREF2": {
"uris": null,
"text": "a GN 1 + N\" ; b GN 2 \u00f7 N\" et N\" ; c GN 3 \u00f7 N\" et N\" et N\" d GN I \u00f7 N\" et N\" ... et N\" (! times) k 42",
"num": null,
"type_str": "figure"
},
"FIGREF3": {
"uris": null,
"text": "a N s (et Ns)* V N o (et No)* b N s (et N )* V (et V)* N (et No)* s o These rules contain all common conjunctions of subject, verbs and direct object. Moreover, they cover the sequences of classes observed in sentences containing respectivement. They don't have the structure one would like to associate with such sentences.In order to describe the respectivement sentences, I add the following condition to the starred parentheses: the number of iterations of each occurrence of the star is the same; and a structure, or rule of interpretation, is imposed on the starred groups, as follows:1 I , No (etINo),(25)N s (et Ns)* V (et V)This grouping pairs the N s and the N o that are to be associated with each other via respectivement;",
"num": null,
"type_str": "figure"
},
"FIGREF4": {
"uris": null,
"text": "adverb respeetivement. \u00a75. Conclusions",
"num": null,
"type_str": "figure"
},
"FIGREF5": {
"uris": null,
"text": "27)a Sac t \u00f7 NP s t V 2 NP o b Spa s \u00f7 NP o t ~tre V2~ (par NP s)",
"num": null,
"type_str": "figure"
},
"FIGREF6": {
"uris": null,
"text": "28)a Sac t ~ NP s t V 2 NP o ; NP s \u00f7 N~; NP o \u00f7 N i b Spa s \u00f7 NP o t ~tre Vi~ (par NPs) ; NP o \u00f7 N i ; NP s \u00f7 N~ This is of course a wasteful repetition of identical selection rules.",
"num": null,
"type_str": "figure"
},
"FIGREF7": {
"uris": null,
"text": "29) S \u00f7 NP s t V 2 NPo/p/ NP o t ~tre V2~ (par NPs)/p/ I1 t ~tre V2e NP o (par NPs); + N~ \" NP o + N] NP s",
"num": null,
"type_str": "figure"
},
"FIGREF8": {
"uris": null,
"text": "Bar-Hillel & Shamir,E., 1960. Finite-State Languages, in Language & Information, New York, Addison-Wesley, (1964). 2. Bobrow, D. & Fraser, B., 1969. An augmented state transition network analysis procedure, Proc. of the International Joint Conference on Artificial Intelligence.",
"num": null,
"type_str": "figure"
},
"TABREF1": {
"text": "the complex symbols give us no \u00a7Sentences like Max emp$che que la table ne tombe \u00f7 Max emp$che la table de tomber, in which the raised object (table) does not have to be compatible with the verb emp@oher, are accounted for by different rules\u2022 indication yet as to how the verbal selection rules are to be satisfied. \u00a72. Selection Rules",
"num": null,
"type_str": "table",
"html": null,
"content": "<table><tr><td>GN2,z \u00f7 N\\{N + Nh}; ... S</td><td/><td/></tr><tr><td>Inserting the noun phrases GN~ { into (8), and</td><td/><td/></tr><tr><td>replacing the subscripts i an~J]_ ' by the single</td><td/><td/></tr><tr><td colspan=\"3\">With the schemata S l, I can account for the recursive embedding of sentences, like Luc con-vainc Paul d'apprendre \u00a2 Max ~ dire aux dl~ves que...; other schemata are needed to account for sentence embedding in relative clauses: (6)a NP rl \u00f7 NP que NP t V30 S I (l'homne o s s pro que Max convainc... A second type of relative clause is this: (7) NP r2 \u00f7 NP que S (le livre que... o pro Spr \u00b0 \u00f7 NP s t V 2 (~)o ... Paul lit) + NP s t VL~ (~)o P NPio .Paul fair de . . . ces articles) pro o s lire) pro S 3.1 + d \u2022 NP d V 2 (~)o \"\" ~ Paul pro io s \u2022 . . ~ life) . etc. With these rules, it is possible to describe re-cursively embedded sentences inside relative subscript ~, I obtain the following rule schema-ta: (12) S \u00f7 (GNj) s t Vj,j, (GNj,) \u00b0 ; I_<j,j'_<31 S \u00f7 (GNj) s t V.,j,,j Pi (GNj,,)io I~j,j\"_<31 S \u00f7 (GNj) s t Vj, m (GNj,) \u00b0 Pi (GNj\")io 1_<ms (j 'xj\"xk) The subscripts are not independent; in general, a verb accepts a certain GNj, (GN:,,) only for clauses, although According to the kind subject, or as direct or indirect object, a verb of noun allowed as is said to select for that sub-class\u2022 The major-ity of the selection rules thus concern the fol-lowing three rules for S: (8)a S \u00f7 NP s t V 2 NP \u00b0 (Luc porte un chapeau) b S + NP t V 3 P. NP, (Max d~pend de Luc) S 1 iO c S \u00f7 NP t V 4 NP P. NP, (Max attribue S O i iO la m~daille d S~c) The selection rules vary with the preposition Pi for verbs V 3 and V~. In the sentence analyzer based on the string grammar, these selection rules are contained in a system of contextual rules attached to each lexical entry for a verb that can appear in (8)\u2022 Experience shows that five noun sub-classes are needed for such a sys-tem of selection rules: N t, 'time'; Ns, senten-tial; Nh, 'human'; Nc, concrete; and Nnom, nom-inalizations. These sub-classes are used in the verbal entries to indicate the unacceptable con-texts for a verb classified in V2, V3, or V~. The analyzer then uses these contextual rules to disallow an unacceptable decomposition in a sen-tence analysis. These contextual rules can be replaced by CF rules in the following way. Let (9) N \\ {N. + N. + ...} = N\" i ] denote any noun except one belonging to sub-class Ni, or to N~, etc.; the bar \\ means 'min-us'. If N\" is substituted for the noun N in any NP, and carried over into every rule developing NP, the terminal rule for the noun in NP will be (]0) N\" \u00f7 N d , where N d is a lexical entry. Each choice for N d is compared with the list of sub-classes Ni,N., ..., attached to N'. If N d belongs to any ~f these sub-classes, it is dis-carded; if N d doesn't belong to these sub-class-es the conditions expressed in (9) are satisfied. Now, if the selection rule of a given verb is that sub-classes N., N~, , are unacceptable as i d \"'\" subject (object), then the noun phrase contain-ing N d satisfies that selection rule, and will be the only noun phrase permitted in that syn-tactic position. I now define noun phrases GN containing all the combinations of excluded noun classes from the five named above (there are 31 such GN): (l|)a GN + N, if no sub-classes are excluded; \u2022 . \u2022 J .</td></tr><tr><td>b GNi \u00f7 N\\{Nt};</td><td>GN2 \u00f7 N\\{Ns};</td><td>... ;</td></tr><tr><td colspan=\"2\">GN 5 \u00f7 N\\{Nno m} ;</td><td/></tr><tr><td colspan=\"3\">c GNi, 2 \u00f7 N\\{N t + Ns};GNi, 3 \u00f7 N\\{N t + N h}</td></tr><tr><td colspan=\"2\">\u2022 ..GNI,5 + N\\{N t + Nnom};</td><td/></tr></table>"
}
}
}
} |