File size: 73,588 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 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 | {
"paper_id": "P80-1013",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T08:43:04.468629Z"
},
"title": "CAPTURING LINGUISTIC GENERALIZATIONS WITH METARULES IN AN ANNOTATED PHRASE-STRUCTURE GRAMMAR",
"authors": [
{
"first": "Kurt",
"middle": [],
"last": "Konolige",
"suffix": "",
"affiliation": {},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "",
"pdf_parse": {
"paper_id": "P80-1013",
"_pdf_hash": "",
"abstract": [],
"body_text": [
{
"text": "Computational models employed by current natural language understanding systems rely on phrase-structure representations of syntax.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1."
},
{
"text": "Whether implemented as augmented transition nets, BNF grammars, annotated phrase-structure grammars, or similar methods, a phrase-structure representation makes the parsing problem computatlonally tractable [7] . 2. A set of metarules for deriving additional grammar rules from the basic set.",
"cite_spans": [
{
"start": 207,
"end": 210,
"text": "[7]",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1."
},
{
"text": "Since metarules operate on grammar rules rather than phrase markers, the transformational effect of metarules can be pro-computed before the grammar is used to analyze input, The computational efficiency of a phrase-structure grammar is thus preserved,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1."
},
{
"text": "formulations for PSGs have recently received increased attention in the linguistics literature, especially in [4] , which greatly influenced the formalism presented in this paper.",
"cite_spans": [
{
"start": 110,
"end": 113,
"text": "[4]",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Metarule",
"sec_num": null
},
{
"text": "Our formalism differs significantly from [4] in that the metarules work on a phrase-structure grammar annotated with arbitrary feature sets (Annotated Phrase-structure Grammar, or APSG [7] ).",
"cite_spans": [
{
"start": 41,
"end": 44,
"text": "[4]",
"ref_id": null
},
{
"start": 185,
"end": 188,
"text": "[7]",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Metarule",
"sec_num": null
},
{
"text": "Grammars for a large subset of English have been written using this formalism [9] , and its computational viability has been demonstrated [6] .",
"cite_spans": [
{
"start": 78,
"end": 81,
"text": "[9]",
"ref_id": null
},
{
"start": 138,
"end": 141,
"text": "[6]",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Metarule",
"sec_num": null
},
{
"text": "Because of the increased structural complexity of APSGs over PSGs without annotations, new techniques for applying metarules to these structures are developed in this paper, and the notion of a match between a metarule and a grammar rule is carefully defined.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Metarule",
"sec_num": null
},
{
"text": "The formalism has been implemented as a computer program and preliminary tests have been made to establish its validity and effectiveness.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Metarule",
"sec_num": null
},
{
"text": "Metarules are used to capture linguistic generalizations that are not readily expressed in the phrase-structure rules. Consider the two sentences:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M etarules",
"sec_num": "2."
},
{
"text": "1, John gave a book to Mary 2. Mary was given a hook by John Although their syntactic structure is different, these two sentences have many elements in common.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M etarules",
"sec_num": "2."
},
{
"text": "In particular, the predicate/argument structure they describe is the same: the gift of a book by john to Mary.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M etarules",
"sec_num": "2."
},
{
"text": "Transformational grammars capture this correspondence by transforming the phrase marker =This research was supported by the Defense Advanced Research Projects Agency under Contract N00039-79-C-0118 with the Naval Electronics Systems Command.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M etarules",
"sec_num": "2."
},
{
"text": "The views and conclusions contained in this document are those of the author and should not be interpreted as representative of the official policies, either expressed or implied, of the U.S. Government. The author is grateful to Jane Robinson and Gary Hendrix for comments on an earlier draft of this paper. for (1) into the phrase marker for (2).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M etarules",
"sec_num": "2."
},
{
"text": "The underlying predicate/argument structure remains the same, but the surface realization changes. However, the recognition of transformational grammars is a very difficult computational problem. = By contrast, metarules operate directly on the rules of a PSG to produce more rules for that grammar.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M etarules",
"sec_num": "2."
},
{
"text": "As long as the number of derived rules is finite, the resulting set of rules is still a PSG, Unlike transformational grammars. PSGs have efficient algorithms for parsing [3] .",
"cite_spans": [
{
"start": 170,
"end": 173,
"text": "[3]",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "M etarules",
"sec_num": "2."
},
{
"text": "In a sense, all of the work of transformations has been pushed off into a pre-processing phase where new grammar rules are derived. We are not greatly concerned with efficiency in pre-processing, because it only has to be done once.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M etarules",
"sec_num": "2."
},
{
"text": "There are still computationa! limitations on PSGs that must be taken into account by any metarule system.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M etarules",
"sec_num": "2."
},
{
"text": "Large numbers of phrase-structure rules can seriously degrade the performance of a parser, both in terms of its running time == , storage for the rules, and the ambiguity of the resulting parses [6] .",
"cite_spans": [
{
"start": 195,
"end": 198,
"text": "[6]",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "M etarules",
"sec_num": "2."
},
{
"text": "Moreover, the generation of large numbers of rules seems psychologically implausible.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M etarules",
"sec_num": "2."
},
{
"text": "Thus the two criteria we will use to judge the efficacy of metarules will be: can they adequately capture linguistic generalizations, and are they \u00a2omputationally practicable in terms of the number of rules they generate. The core component of an APSG is a set of context-free phrase-structure rules.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M etarules",
"sec_num": "2."
},
{
"text": "As is customary, these rules are input to a context-free parser to analyze a string, producing a phrase-structure tree as output.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M etarules",
"sec_num": "2."
},
{
"text": "In addition, the parse tree so produced may have arbitrary feature sets, called annotations, appended to each node.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M etarules",
"sec_num": "2."
},
{
"text": "The annotations are an efficient means of incorporating additional information into the parse tree.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M etarules",
"sec_num": "2."
},
{
"text": "Typically, features will exist for syntactic processing (e.g., number agreement), grammatical function of constituents (e.g., subject, direct and indirect objects), and semantic interpretation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M etarules",
"sec_num": "2."
},
{
"text": "Associated with each rule of the grammar are procedures for operating on feature sets of the phrase markers the rule constructs.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M etarules",
"sec_num": "2."
},
{
"text": "These procedures may constrain the application of the rule by testing features on candidate constituents, or add information to the structure created by the rule, based on the features of its constituents.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M etarules",
"sec_num": "2."
},
{
"text": "Rule procedures are written in the programming language LISP, giving the grammar the power to recognize class 0 languages. The use of arbitrary procedures and feature set annotations makes APSGs an *There has been some success in restricting the power of transformational grammars sufficiently to allow a recognizer to be built; see [8] .",
"cite_spans": [
{
"start": 333,
"end": 336,
"text": "[8]",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "M etarules",
"sec_num": "2."
},
{
"text": "[10] has shown that, for a simple recursive descent parsing algorithm, running time is a linear function of the number of rules.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "=*Shell",
"sec_num": null
},
{
"text": "For other parsing schemes, the relationship between the number of rules and parsing time is unclear. ='~SThis is without considering infinite schemas such as the one for coniunction reduction.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "=*Shell",
"sec_num": null
},
{
"text": "Basically, the problem is that the formalism of It is unfortunately the very power .of APSGs (and ATNs) that makes it difficult to capture linguistic generalizations within these formalisms. Metarules for transforming one annotated phrase-structure rule into another must not only transform the phrase-structure, but also the procedures that operate on feature sets, in an appropriate way.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "=*Shell",
"sec_num": null
},
{
"text": "Because the transformation of procedures is notoriously difficult,* one of the tasks of this paper will be to illustrate a declarative notation describing operations on feature sets that is powerful enough to encode the manipulations of features necessary for the grammar, but is still simple enough for metarulos to transform.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "=*Shell",
"sec_num": null
},
{
"text": "Every rule of the APSG has three parts:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Notation",
"sec_num": "4."
},
{
"text": "1. A phrase-structure rule;",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Notation",
"sec_num": "4."
},
{
"text": "2. A restriction set (RSET) that restricts the applicability of the rule, and",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Notation",
"sec_num": "4."
},
{
"text": "3. An assignment set (ASET) that assigns values to features.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Notation",
"sec_num": "4."
},
{
"text": "The RSET and ASET manipulate features of the phrase marker analyzed by the rule; they are discussed below in detail.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Notation",
"sec_num": "4."
},
{
"text": "Phrase-structure rules are written as:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Notation",
"sec_num": "4."
},
{
"text": "CAT -> C 1 C 2 ... Cn",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Notation",
"sec_num": "4."
},
{
"text": "where CAT is the dominating category of the phrase, and C 1 through C n are its immediate constituent categories. Terminal strings can be included in the rule by enclosing them in double quote marks.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Notation",
"sec_num": "4."
},
{
"text": "A feature set is associated with each node in the parse tree that is created when z string is analyzed by the grammar. Each feature has a name (a string of uppercase alphanumeric characters) and an associated value. The values a feature can take on (the domain of the feature) are, in general, arbitrary. One of the most useful domains is the set \"\u00f7,-,NIL\", where Nil is the unmarked case; this domain corresponds ~ to the binary features used in [2). More complicated domains can be used; for example, a CASE feature might have as its domain the set of tuplos ~<1 SG>,<2 SG>,c3 SG>,<I PL>,<2 PL>,<3 PL>'~. Most interesting are those features whose domain is a phrase marker. Since phrase markers are just data structures that the parser creates, they can be assigned as the value of a feature. This technique is used to pass phrase markers to various parts of the tree to reflect the gr;llmmatical and semantic structure of the input; examples will be given in later sections.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Notation",
"sec_num": "4."
},
{
"text": "We adopt the following conventions in referring to features and their values:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Notation",
"sec_num": "4."
},
{
"text": "-Features are one-place functions that range over phrase markers constructed by the phrase-structure part of a grammar rule. The function is named by the feature name.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Notation",
"sec_num": "4."
},
{
"text": "-These functions are represented in prefix form, e.g., (CASE NP) refers to the CASE feature of the NP constituent of a phrase marker.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Notation",
"sec_num": "4."
},
{
"text": "In cases where there is more than one constituent with the same category name, they will be differentiated by a \"~/\" suffix, for example,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Notation",
"sec_num": "4."
},
{
"text": "*it is sometimes hard to even understand what it is that a procedure does, since it may involve recursion, side-effects, and other complications.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "VP-> V NP \u00a7I NP~2",
"sec_num": null
},
{
"text": "has two NP constituents.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "VP-> V NP \u00a7I NP~2",
"sec_num": null
},
{
"text": "-A phrase marker is assumed to have its immediate constituents as features under their category name, e.|., (N NP) refers to the N constituent of the NP.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "VP-> V NP \u00a7I NP~2",
"sec_num": null
},
{
"text": "-Feature functions may be nested, e.g., (CASE (N NP)) refers tO the CASE feature of the N constituent of the NP phrase marker.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "VP-> V NP \u00a7I NP~2",
"sec_num": null
},
{
"text": "For these nestings, we adopt the simpler notation (CASE N NP), which is assumed to be right-associative.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "VP-> V NP \u00a7I NP~2",
"sec_num": null
},
{
"text": "-The value NIL always implies the unmarked case. At times it will be useful to consider features that are not explicitly attached to a phrase marker as being present with value NIL.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "VP-> V NP \u00a7I NP~2",
"sec_num": null
},
{
"text": "-A constant term will be written with a preceding single quote mark, e.s. , tSG refers to the constant token SG.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "VP-> V NP \u00a7I NP~2",
"sec_num": null
},
{
"text": "The RSET of a rule restricts the applicability of the rule by a predication on the features of its constituents.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Restrictions",
"sec_num": "4.1."
},
{
"text": "The phrase markers used as constituents must satisfy the predications in the RSET before they will he analyzed by the rule to create a new phrase marker.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Restrictions",
"sec_num": "4.1."
},
{
"text": "The most useful predicate is equality: a feature can take on only one particular value to be acceptable. For example, in the phrase structure rule: S -> NP VP number agreement could be enforced by the predication:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Restrictions",
"sec_num": "4.1."
},
{
"text": "(NBR NP) -{NBR VP)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Restrictions",
"sec_num": "4.1."
},
{
"text": "where NBR is a feature whose domain is SG,PL~.* This would restrict the NBR feature on NP to agree with that on VP before the S phrase was constructed.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Restrictions",
"sec_num": "4.1."
},
{
"text": "The economy of the APSG encoding is seen here: only a single phrase-structure rule is required.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Restrictions",
"sec_num": "4.1."
},
{
"text": "Also, the linguistic requirement that subjects and their verbs agree in number is enforced by a single statement, rather than being implicit in separate phrase structure rules, one for singular subject-verb combinations, another for plurals.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Restrictions",
"sec_num": "4.1."
},
{
"text": "equality, there are only three additional predications: inequality (#), set membership (e) and set non-membership (It).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Besides",
"sec_num": null
},
{
"text": "The last two are useful in dealing with non-binary domains.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Besides",
"sec_num": null
},
{
"text": "As discussed in the next section, tight restrictions on predications are necessary if metarules are to be successful in transforming grammar rules.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Besides",
"sec_num": null
},
{
"text": "Whether these four predicates are adequate in descriptive power for the grammar we contemplate remains an open empirical question; we are currently accumulating evidence for their sufficiency by rewriting DIAGRAM using just those predicates.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Besides",
"sec_num": null
},
{
"text": "predications for a rule are collected in the RSET of that rule.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Restriction",
"sec_num": null
},
{
"text": "All restrictions must hold for the rule to be applicable. As an illustration, consider the subcategorizatlon rule for dltransitlve verbs with prepositional objects (e.g.. eJohn gave a book to Mary\"):",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Restriction",
"sec_num": null
},
{
"text": "VP -> V NP PP RSET: (TRANS V) = ~DI; (PREP V) : (PREP PP)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Restriction",
"sec_num": null
},
{
"text": "The first restriction selects only verbs that are marked as dltransitive; the TRANS feature comes from the lexical entry of the verb. Dltransitiv verbs with prepositional arguments are always subcategorized cy the particular preposition used, e.g., \"give a always uses Ire\" for its prepositional argument. *How NP and VP categories could \"inherit\"",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Restriction",
"sec_num": null
},
{
"text": "the NBR feature from their N and V constituents is discussed in the next section.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Restriction",
"sec_num": null
},
{
"text": "The second predication restricts the preposition of the PP for a given verb.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Restriction",
"sec_num": null
},
{
"text": "The PREP feature of the verb comes from its lexical entry, and must match the preposition of the PP phrase*",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Restriction",
"sec_num": null
},
{
"text": "A rule will normally assign features to the dominating node of the phrase marker it constructs, based on the values of the constituents f features.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Assignments",
"sec_num": "4.2."
},
{
"text": "For example, feature inheritance takes place in this way. Assume there is a feature NBR marking the syntactic number of nouns. Then the ASET of a rule for noun phrases might be:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Assignments",
"sec_num": "4.2."
},
{
"text": "NP -> DET N ASET: (NBR NP) := (NBR N)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Assignments",
"sec_num": "4.2."
},
{
"text": "This notation is somewhat non-standard; it says that the value of the NBR function on the NP phrase marker is to be the value of the NBR function of the N phrase marker.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Assignments",
"sec_num": "4.2."
},
{
"text": "An interesting application of feature assignment is to describe the grammatical functions of noun phrases within a clause.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Assignments",
"sec_num": "4.2."
},
{
"text": "Recall that the domain of features can be constituents themselves.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Assignments",
"sec_num": "4.2."
},
{
"text": "Adding an ASET describing the grammatical function of its constituents to the ditransitive VP rule yields the following: A rule may also assign feature values to the constituents of the phrase marker it constructs.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Assignments",
"sec_num": "4.2."
},
{
"text": "VP -> V",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Assignments",
"sec_num": "4.2."
},
{
"text": "Such assignments are context sensitive, because the values are based on the context in which the constituent Occurs.*\" Again, the most interesting use of this technique is in assigning functional roles to constituents in particular phrases. Consider a rule for main clauses:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Assignments",
"sec_num": "4.2."
},
{
"text": "The three features SUBJ, DIROBJ, and INDOBJ of the VP phrase marker will have as value the appropriate NP phrase markers, since the DIROBJ and INDOBJ features will be assigned to the VP phrase marker when it is constructed.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "S -> NP VP ASET: (SUBJ VP) := (NP S),",
"sec_num": null
},
{
"text": "Thus the grammatical function of the NPs has been identified by assigning features appropriately.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "S -> NP VP ASET: (SUBJ VP) := (NP S),",
"sec_num": null
},
{
"text": "Finally, note that the grammatical Functions were assigned to the VP phrase marker.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "S -> NP VP ASET: (SUBJ VP) := (NP S),",
"sec_num": null
},
{
"text": "By assembling all of the arguments at this level, it is possible to account for bounded deletion phenomenon that are lexically controlled. Consider subcategorization for Equi verbs, in which the subject of the main clause has been deleted from the infinitive complement (\"John wants to gem): =Note that we are not considering here prepositional phrases that are essentially mesa-arguments to the verb, dealing with time, place, and the like. The prepositions used for mesa-arguments are much more variable, and usually depend on semantic considerations.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "S -> NP VP ASET: (SUBJ VP) := (NP S),",
"sec_num": null
},
{
"text": "\"*The assignment of features to constituents presents some computational problems, since a context-free parser will no longer be sufficient to analyze strings.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "S -> NP VP ASET: (SUBJ VP) := (NP S),",
"sec_num": null
},
{
"text": "This was recognized in the original version of APSGs [7] , and a two-pass parser was constructed that first uses the context-free component of the grammar to produce an initial parse tree, then adds the assignment of features in context.",
"cite_spans": [
{
"start": 53,
"end": 56,
"text": "[7]",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "S -> NP VP ASET: (SUBJ VP) := (NP S),",
"sec_num": null
},
{
"text": "Here the subject NP of the main clause has been passed down to the VP (by the S rule), which in turn passes it to the infinitive as its subject.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "VP-> V INF ASET: (SUBJ INF) := (SUBJ'VP)",
"sec_num": null
},
{
"text": "Not all linguistic phenomenon can be formulated so easily with APSGs; in particular, APSGs have trouble describing unbounded deletion and conjunction reduction.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "VP-> V INF ASET: (SUBJ INF) := (SUBJ'VP)",
"sec_num": null
},
{
"text": "Metarule formulations for the latter phenomena have been proposed in",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "VP-> V INF ASET: (SUBJ INF) := (SUBJ'VP)",
"sec_num": null
},
{
"text": "[5], and we will not deal with them here.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "VP-> V INF ASET: (SUBJ INF) := (SUBJ'VP)",
"sec_num": null
},
{
"text": "Metarules consist of two parts: a match template with variables whose purpose is to match existing grammar rules; and an instantiatlon template that produces a new grammar rule by using the match template~s variable bindings after a successful match.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Metarules for APSGs",
"sec_num": "5."
},
{
"text": "Initially, a basic set of grammar rules is input; metarules derive new rules, which then can recursively be used as input to the metarules. When (if) the process halts, the new set of rules, together with the basic rules, comprises the grammar.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Metarules for APSGs",
"sec_num": "5."
},
{
"text": "We will use the following notation for metarules:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Metarules for APSGs",
"sec_num": "5."
},
{
"text": "MF => IF CSET: C1, C2, .. Cn",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Metarules for APSGs",
"sec_num": "5."
},
{
"text": "where MF is a _matchln| form, IF is an instantiation form, and CSET is a set of predications. Both the MF and IF have the same form as grammar rules, but in addition, they can contain variables.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Metarules for APSGs",
"sec_num": "5."
},
{
"text": "When an MF is matched against a grammar rule, these variables are bound to different parts of the rule if the match succeeds.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Metarules for APSGs",
"sec_num": "5."
},
{
"text": "The IF is instantlated with these bindings to produce a new rule.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Metarules for APSGs",
"sec_num": "5."
},
{
"text": "To restrict the application of metarules, additional conditions on the variable bindings may be specified (CSET); these have the same form as the RSET of grammar rules, hut they can mention the variables matched by the MF.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Metarules for APSGs",
"sec_num": "5."
},
{
"text": "Metarules may be classified into three types: I. Introductory metarules, where the MF is empty (=> IF).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Metarules for APSGs",
"sec_num": "5."
},
{
"text": "These metarules introduce a class of grammar rules.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Metarules for APSGs",
"sec_num": "5."
},
{
"text": "metarules, where the IF is empty (MF =>).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Deletion",
"sec_num": "2."
},
{
"text": "These delete any derived grammar rules that they match. 3. Derivation metarules, where both MF and IF are present. These derive new grammar rules from old ones.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Deletion",
"sec_num": "2."
},
{
"text": "There are linguistic generalizations that can he captured most perspicuously by each of the three forms. We will focus on derivation metarules here, since they are the most complicated.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Deletion",
"sec_num": "2."
},
{
"text": "An important part of the derivation process is the definition of a match between a metarule matching form and a grammar rule.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Matching",
"sec_num": "6."
},
{
"text": "The matching problem is complicated by the presence of RSET and ASET predications in the grammar rules.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Matching",
"sec_num": "6."
},
{
"text": "Thus, it is helpful to define a match in terms of the phrase markers that will be admitted by the grammar rule and the MF. We will say that an MF matches a grammar rule just in case it admits at least those phrase markers admitted by the grammar rule. This definition of a match is sufficient to allow the formulation of matching algorithms for grammar rules complicated by annotations.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Matching",
"sec_num": "6."
},
{
"text": "We divide the matching process into two parts: matching phrase-structures, and matching feature sets.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Matching",
"sec_num": "6."
},
{
"text": "Both parts must succeed in order for the match to succeed.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Matching",
"sec_num": "6."
},
{
"text": "For phrase-structures, the definition of i match can be replaced by a direct comparison of the phrase-structures of the MF and grammar rule.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Matching Phrase-structures",
"sec_num": "6.1."
},
{
"text": "Variables in the MF phrase-structure are used to indicate Idofllt care a parts of the grammar rule phrase-structure, while constants must match exactly. SIn|le lower case letters are used for variables that must match single categories of the grammar rule. A typical MF might be: S ->.a VP which matches S -> NP VP with a=NP; S -> SB VP with IBSB; S-> 'IT' VP with aJ'IT'; etC.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Matching Phrase-structures",
"sec_num": "6.1."
},
{
"text": "A variable that appears more than once in an MF must have the same binding for each occurrence for a match to be successful, e.$., All of these are considered to be valid, independent matches. Double and single letter variables may be intermixed freely in an MF.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Matching Phrase-structures",
"sec_num": "6.1."
},
{
"text": "VP -> V",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Matching Phrase-structures",
"sec_num": "6.1."
},
{
"text": "While double letter variables match multiple categories In l phrase structure rule, string variables match parts of a category.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Matching Phrase-structures",
"sec_num": "6.1."
},
{
"text": "String variables occur in both double and single letter varieties; as expected, the former match any number of consecutive characters, while the litter match sln|le characters.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Matching Phrase-structures",
"sec_num": "6.1."
},
{
"text": "String variables are assumed when an MF category contains i mixture of upper and lower case characters, e.g.: String variables are most useful for matching category names that may use the ~ convention.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Matching Phrase-structures",
"sec_num": "6.1."
},
{
"text": "Vt -> V",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Matching Phrase-structures",
"sec_num": "6.1."
},
{
"text": "So far variables have matched only the phrase-structure part of grammar rules, and not the feature annotations.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Feature Matching",
"sec_num": "6.2."
},
{
"text": "For feature matching, we must return to the original definition of matching based on the admissibility of phrase markers. The RSET of a grammar rule is a closed formula involvlng the feature sees of the phrase marker constructed by the rule; let P stand for this formula.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Feature Matching",
"sec_num": "6.2."
},
{
"text": "If P is true for a given phrase marker, then that phrase marker is accepted by the rule; if not, It ts rejected.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Feature Matching",
"sec_num": "6.2."
},
{
"text": "Similarly, the RSET of a matching form is an open formula on the feature sets of the phrase marker; let R(xl,x2...Xn) stand for this formula, where the x I are the variables of the RSET.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Feature Matching",
"sec_num": "6.2."
},
{
"text": "For the MF;s restrictions to match those of the grammar rule, we must be able to prove the formula:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Feature Matching",
"sec_num": "6.2."
},
{
"text": "P => tea 1)(EX2)_.(EXn) R(xl,x2,-.Xn)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Feature Matching",
"sec_num": "6.2."
},
{
"text": "That Is. whenever P admits a phrase marker, there exists some blndin| for R0s free variables that also admits the phrase marker.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Feature Matching",
"sec_num": "6.2."
},
{
"text": "Now the importance of restricting the form of P and R can be seen. Proving that the above implication holds for general P and R can be a hard problem, requiring, for example, a resolution theorem prover.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Feature Matching",
"sec_num": "6.2."
},
{
"text": "By restricting P and R to simple conjunctions of equalities, inequalities, and set membership predicates, the match between P and R can be performed by a simple and efficient algorithm.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Feature Matching",
"sec_num": "6.2."
},
{
"text": "When a matarule matches a grammar rule, the CSET of the metaruia Is evaluated to see if the metaruie can indeed be applied. For example, the MF: VP-> \"BE\" xP CSET: x ~t 'V will match any rule for which x is not bound to V.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Instanttation",
"sec_num": "6.3."
},
{
"text": "When an MF matches a rule, and the CSET is satisfied, the Instantlatlon form of the metarule is used to produce i new rule. TN~ variables of the IF are instantiated with their values from the match, producing I new rule.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Instanttation",
"sec_num": "6.3."
},
{
"text": "In addition, restriction and assignment features that do not conflict with the IF's features are carried over from the rule that matched. This latter is a very handy property of the instanttation, since that is usually what the metarule writer desires. Consider metarule that derives the subject-aux inverted form of a main clause with a finite verb phrase: This does not preserve number agreement, nor does it restrict the VP to being finite. Of course, the metarule could be rewritten to have the correct restrictions in the IF, but this would sharply curb the utility of the metarules, and lead to the proliferation of metaruies with slightly different RSETs.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Instanttation",
"sec_num": "6.3."
},
{
"text": "to, for example, verbs with separable particles: Make up a story for me => Make me up a story. This is the reason the double-letter variable \"uu' was used in DATMOVE. As long as the final constituent of a VP rule is a PP, DATMOVE can apply to yield a dative construction.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Instanttation",
"sec_num": "6.3."
},
{
"text": "In the passive transformation, the NP immediately following the verb is moved to subject position; the original subject moves to an age.rive BY-phrase:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Passive",
"sec_num": "7.2."
},
{
"text": "(1) John gave a book to Mary => (2) A book was given to Mary by John. PASSIVE deletes the NP immediately following the verb, and adds a BY-prepositional phrase at the end. PPL is a past participle suffix for the verb.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Passive",
"sec_num": "7.2."
},
{
"text": "In the predicate/argum=nt structure, the BY-phrase NP substitutes for the original subject, while the new subject is used in place of the original object NP. Applying PASSIVE to the ditransittve rule yields: e.g.. \"A book was given to Mary by John\" will be analyzed by this rule to have a PA feature of (\"givea mJohn~ na book\" \"Mary\"), which is the same predicate/argument structure as the corresponding active sentence. PASSIVE can also apply to the rule generated by DATMOVE to yield the passive form of VpIs with dative objects: AP -> V PPL NP PP#A RSET: (DATMOVE V) = f+;",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Passive",
"sec_num": "7.2."
},
{
"text": "AP -> V",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Passive",
"sec_num": "7.2."
},
{
"text": "(TRANS V) = 'DIs ASET: (PA VP) := '((V VP) (NP PP#A) {NP VP) (SUBJ VP)); e.g., \"Mary was given a book by John\".",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Passive",
"sec_num": "7.2."
},
{
"text": "A system has been designed and implemented to test the validity of this approach. It consists of a matcher/instantiator for met,rules, along with an iteration loop that applies all the met.rules on each cycle until no more new rules are generated. Met.rules fur verb subcategorization and finite and non-finite clause structures have been written and input to the system. We were especially concerned:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Implementation",
"sec_num": "8."
},
{
"text": "-To check the perspicuity of metarules for describing significant fragments of English using the above representation for grammar rules.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Implementation",
"sec_num": "8."
},
{
"text": "-To check that a reasonably small number of new grammar rules were generated by the metarules for these fragments.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Implementation",
"sec_num": "8."
},
{
"text": "Both of these considerations are critical for the performance of natural language processing systems. Preliminary tests indicate that the system satisfies both these concerns; indeed, the metarules worked so well that they exposed gaps in a phrase-structure grammar that was painstakingly developed over a five year period and was thought to be reasonably complete for a large subset of English 19]. The number of derived rules generated was encouragingly small: Subcategorizatlon:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Implementation",
"sec_num": "8."
},
{
"text": "1 grammar rule 7 metarules -> 20 derived rules Clauses: 8 grammar rules 5 metarules => 25 derived rules 9. Conclusions Metarules, when adapted to work on an APSG representation, are a very powerful tool for specifying generalizations in the grammar. A great deal of care must be exercised in writing metarutes, because it is easy to state generalizations that do not actually hold. Also, the output of metarutes can be used again aS input to the metarules, and this often produces surprising results.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Implementation",
"sec_num": "8."
},
{
"text": "Of course, language is complex, and it is to be expected that describing Its generalizations will also be a difficult task.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Implementation",
"sec_num": "8."
},
{
"text": "The success of the metarule formulation in deriving a small number of new rules comes in part from the Increased definitional power of APSGs over ordinary PSGs. For example, number agreement and feature inheritance can be expressed simply by appropriate annotations in an APSG, but require metarules on PSGs. The definitional compactness of APSGs means that fewer metarules are needed, and hence fewer derived rules are generated.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Implementation",
"sec_num": "8."
},
{
"text": "4.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "3.",
"sec_num": null
},
{
"text": "7.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "6.",
"sec_num": null
},
{
"text": "10.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "9.",
"sec_num": null
}
],
"back_matter": [
{
"text": "We are now ready to give a short example of two met,rules for dative movement and passive transformations. The predicate/argument structure will be described by the feature PA, whose value is a list:where V is the predicating verb, and the NPs are its arguments. The order of the arguments is significant, since:(\"gave\" \"John\" \"a book\" \"Mary\") <=> gift of a book by John to Mary 'gave\" \"John' \"Mary m \"a book') <=> ?? gift of Mary to a hook by John Adding the PA feature, the rule for ditransltlve verbs with prepositional objects becomes: The SUBJ feature is the subject NP passed down by the S rule.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "An Example: Dative Movement and Passive",
"sec_num": "7."
},
{
"text": "In dative movement, the prepositional NP becomes a noun phrase next to the verb:1. John gave a book to Mary => 2. John gave Mary a bookThe first object NP of (2) fills the same argument role as the prepositional NP of (1).Thus the dative movement met,rule can be formulated as follows: DATMOVE accepts VPs with a trailing prepositional argument, and moves the NP from that argument to just after the verb. The verb must be marked as accepting dative arguments, hence the DATIVE feature restriction in the RSET of the instantlation form. Also, since there is no longer a prepositional argument, the PREP feature of the VP doesn't have to match it. As for the predicate/argument structure, the NP#D constituent takes the place of the prepositional NP in the PA feature. DATMOVE can be applied to the dltransltlve VP rule to yield the dltransitive dative construction. There are other grammar rules that dative movement will apply",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Dative Movement",
"sec_num": "7.1."
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "An Experimental Parsing System for Transition Network Grammars",
"authors": [
{
"first": "W",
"middle": [],
"last": "Woods",
"suffix": ""
}
],
"year": 1973,
"venue": "Natural Lan~uase Processins",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "W. Woods, 'An Experimental Parsing System for Transition Network Grammars, ~ R. Rustin (ed.), Natural Lan~uase Processins, Prentice-Hall, Englewood Cliffs, New Jersey, 1973.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Aspects of the Theory of 5.,yntax",
"authors": [
{
"first": "N",
"middle": [],
"last": "Chomsky",
"suffix": ""
}
],
"year": 1965,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "N. Chomsky. Aspects of the Theory of 5.,yntax, MIT Press, Cambridge, Mass., 1965.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "An Efficient Context Free Parsing Algorithm",
"authors": [
{
"first": "J",
"middle": [],
"last": "Early",
"suffix": ""
}
],
"year": 1970,
"venue": "CAC_M",
"volume": "13",
"issue": "",
"pages": "94--96",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "J. Early, \"An Efficient Context Free Parsing Algorithm,\" CAC_M, Vol. 13 (1970) 94-I02.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "English as a Context-Free Language",
"authors": [
{
"first": "Gerald",
"middle": [],
"last": "Gazdar",
"suffix": ""
}
],
"year": 1979,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Gerald Gazdar, 'English as a Context-Free Language\" University of Sussex, (unpublished paper, April, 1979).",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Unbounded Dependencies and Coordinate Structure",
"authors": [
{
"first": "Gerald",
"middle": [],
"last": "Gazdar",
"suffix": ""
}
],
"year": 1979,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Gerald Gazdar, \"Unbounded Dependencies and Coordinate Structure' University of Sussex, (submitted to Inquiry, October, 1979).",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "A Framework for a Portable NL Interface to Large Data Bases, m Technical Note 197",
"authors": [
{
"first": "Kurt",
"middle": [],
"last": "Konollge",
"suffix": ""
}
],
"year": 1979,
"venue": "Artificial Intelligence Center, SRI International",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kurt Konollge, 'A Framework for a Portable NL Interface to Large Data Bases, m Technical Note 197, Artificial Intelligence Center, SRI International, Menlo Park, California (October 1979).",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "A Framework for Speech Understanding",
"authors": [
{
"first": "H",
"middle": [],
"last": "William",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Paxton",
"suffix": ""
}
],
"year": 1977,
"venue": "Artificial Intelligence Center, $RI international",
"volume": "142",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "William H. Paxton, 'A Framework for Speech Understanding,' Technical Note 142, Artificial Intelligence Center, $RI international, Menlo Park, California (June 1977}.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Automatic Syntactic and Semantic Analysis, e Proceedln|s of the Interdisciplinary Conference on Automated Text Processing",
"authors": [
{
"first": "S",
"middle": [
"R"
],
"last": "Petrtck",
"suffix": ""
}
],
"year": 1976,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "S.R. Petrtck, 'Automatic Syntactic and Semantic Analysis, e Proceedln|s of the Interdisciplinary Conference on Automated Text Processing, {November 1976).",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "DIAGRAM: A Grammar for Dialogues",
"authors": [
{
"first": "Jane",
"middle": [],
"last": "Robinson",
"suffix": ""
}
],
"year": 1980,
"venue": "Artificial Intelligence Center, SRI International",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jane Robinson, 'DIAGRAM: A Grammar for Dialogues.' Technical Note 20$, Artificial Intelligence Center, SRI International, Menlo Park, California {February 1980).",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Observations on Context-Free Parsing",
"authors": [
{
"first": "B",
"middle": [
"A"
],
"last": "Shell",
"suffix": ""
}
],
"year": 1976,
"venue": "Statistical Methods in Linl|uistics",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "B.A. Shell, 'Observations on Context-Free Parsing,' Statistical Methods in Linl|uistics, (1976).",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"num": null,
"text": "NP PP ASET: (DIROBJ VP) := (NP VP); (INDOBJ VP) := (NP PP).This ASET assigns the DIROBJ (direct object) feature of VP the value of the constituent NP. Slmilarly~ the value of INDOBJ (indirect object) is the NP constituent of the PP phrase.",
"type_str": "figure",
"uris": null
},
"FIGREF1": {
"num": null,
"text": "a a matches VP -> V NP NP with a=NP but not VP -> V NP PP Single letter variables must match a single category in a grammar rule. Double letter variables are used to match a number of consecutive Catllorils (including none) fR the rule. MF with more thin one double letter variable may match t rule in several different ways: VP -> V uu vv matches VP -> V NP PP with uu'(), vvs(NP Pp); uu=(N P), vvm(PP ); uum(NP VP), vv-().",
"type_str": "figure",
"uris": null
},
"FIGREF2": {
"num": null,
"text": "NP~la NPuu matches VP -> V NP~I NP with a=1, uu=(); VP -> V NP/~I NP~2 with aal, uu=(# 2); etc.",
"type_str": "figure",
"uris": null
},
"FIGREF3": {
"num": null,
"text": "not carried over during an instan.iation, the result of matching and Instantlating the metarule would be:SAI -> AUX NP VP",
"type_str": "figure",
"uris": null
},
"FIGREF4": {
"num": null,
"text": "metarule for the passive transformation is: met.rule PASSIVE VP -> V NPuu vv ASET: (PA VP) :: ~(a (SUBJ VP) bb (NPuu VP) cc); => AP -> V PPL vv PP#A RSET: (PREP PP#A) = ~BY; ASET: (PA VP) :: '(a (NP PP#A) bb (SUBJ VP) cc).",
"type_str": "figure",
"uris": null
},
"FIGREF5": {
"num": null,
"text": "PPL PP PP#A RSET: (TRANS V) = 'DIs (PREP V) = (PREP PP); ASET: (PA VP) := '((V VP) (NP PP#A) (SUBJ VP) (NP PP));",
"type_str": "figure",
"uris": null
}
}
}
} |