File size: 79,819 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 | {
"paper_id": "C88-1012",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T12:16:12.138204Z"
},
"title": "Software Support for Practical Grammar Development",
"authors": [
{
"first": "Bran",
"middle": [],
"last": "Boguraev",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "John",
"middle": [],
"last": "Carroll",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Ted",
"middle": [],
"last": "Briscoe",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Claire",
"middle": [],
"last": "Grover",
"suffix": "",
"affiliation": {},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "Even though progress in theoretical linguistics does not necessarily rely on the construction of working programs, a large proportion of current research in syntactic theory is facilitated by suitable computational tools. However, when natural language processing applications seek to draw on the results from new developments in theories of grammar, not only the nature of the tools has to change, but they face the challenge of reconciling the seemingly contradictory requirements of notational perspicuity and efficiency of performance. In this paper, we present a comparison and an evaluation of a number of software systems for grammar development, and argue that they are inadequate as practical tools for building wide-coverage grammars. We discuss a number of factors characteristic of this task, demonstrate how they influence the design of a suitable software environment, and describe the implementation of a system which has supported efficient development of a large computational grammar of English?",
"pdf_parse": {
"paper_id": "C88-1012",
"_pdf_hash": "",
"abstract": [
{
"text": "Even though progress in theoretical linguistics does not necessarily rely on the construction of working programs, a large proportion of current research in syntactic theory is facilitated by suitable computational tools. However, when natural language processing applications seek to draw on the results from new developments in theories of grammar, not only the nature of the tools has to change, but they face the challenge of reconciling the seemingly contradictory requirements of notational perspicuity and efficiency of performance. In this paper, we present a comparison and an evaluation of a number of software systems for grammar development, and argue that they are inadequate as practical tools for building wide-coverage grammars. We discuss a number of factors characteristic of this task, demonstrate how they influence the design of a suitable software environment, and describe the implementation of a system which has supported efficient development of a large computational grammar of English?",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "A number of researzh projects within the broad area of natural language processing (NLP) and theoretical linguistics make use of special purpose programs, which are beginning to be known under the general term of \"gm.nmar development environments\" (GDEs). Particularly well known examples are reported in Kaplan (1983) (see also Kiparsky, 1985) , Shieber (1984) , Evans (1985) , Phillips and Thompson (1985) , Jensen et al. (1986) and Karttunen (1986) . In all instances the software packages cited above fall in the class of computational tools used in theoretical (rather than applied) Projects. Thus Kaplan's Grammar-writer's Workbench is an implementation of a particular linguistic theory (Lexical Functional Grammar;, Kaplan and Bresnan, 1982) ; similarly, Evans' ProGram incorporated an early version of Generalized Phrase Structure Grammar (GPSG, Gazdar and Pullum, 1982) , whilst PATR-II is a \"virtual linguistic machine\", developed by Shieber as a tool for experimenting with a variety of syntactic theories.",
"cite_spans": [
{
"start": 305,
"end": 318,
"text": "Kaplan (1983)",
"ref_id": null
},
{
"start": 329,
"end": 344,
"text": "Kiparsky, 1985)",
"ref_id": "BIBREF14"
},
{
"start": 347,
"end": 361,
"text": "Shieber (1984)",
"ref_id": "BIBREF23"
},
{
"start": 364,
"end": 376,
"text": "Evans (1985)",
"ref_id": "BIBREF4"
},
{
"start": 379,
"end": 407,
"text": "Phillips and Thompson (1985)",
"ref_id": "BIBREF16"
},
{
"start": 410,
"end": 430,
"text": "Jensen et al. (1986)",
"ref_id": "BIBREF8"
},
{
"start": 435,
"end": 451,
"text": "Karttunen (1986)",
"ref_id": "BIBREF11"
},
{
"start": 724,
"end": 749,
"text": "Kaplan and Bresnan, 1982)",
"ref_id": "BIBREF9"
},
{
"start": 855,
"end": 879,
"text": "Gazdar and Pullum, 1982)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Tools for Grammar Development",
"sec_num": "1."
},
{
"text": "These systems differ in their goals. Particular implementations of a theory may be used for observing how theory-internal devices interact with each other, or to maintain internal consistency as the grammar is being developed. On the other hand, formalisms for encoding linguistic information in a uniform way underpin effm~s to compare and evaluate alternative linguistic theories (Shieber, 1987) . Neither type O f system is adequate to the task of grammar development on a large scale or for incorporating such a grammar into a practical NLP system, due to factors such as efficiency of encoding (largely neglected in such systems) or verbosity and redundancy of the formal notation. Within the frameworks of their aecomodating projects, these are in no way inadequacies of the computational tools; still, the applicability of the tools remains limited outside the strictly theoretical concem.",
"cite_spans": [
{
"start": 382,
"end": 397,
"text": "(Shieber, 1987)",
"ref_id": "BIBREF26"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Tools for Grammar Development",
"sec_num": "1."
},
{
"text": "developed at Yorktown Heights (Jensen et al., 1986) . Both are capable of impressive coverage and this is, to some extent, due to the more flexible formalisms employed. A common feattne of these formalisms is that they all fall prey to what Kaplan 0987) refers to as \"the procedural seduction\" of computational linguistics: whatever the basis for the notation is, it incorporates a handle for explicit intervention into the interpretation of the grammar at hand.",
"cite_spans": [
{
"start": 30,
"end": 51,
"text": "(Jensen et al., 1986)",
"ref_id": "BIBREF8"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Tools for Grammar Development",
"sec_num": "1."
},
{
"text": "Sometimes the nature of the task for which the g~ammar is being developed justifies a form~J notation incolporating 'hooks' for explicit procedures. Thus a number of matchine translation (MT) projects~ especially ones employing a ~ransfer strategy, make use of format systems for grammar specification, which, in addition to mapping surface strings into con~esponding language structures, identify operations to be associated with nodes and / or subtrees (Vauquois & Boitet, 1985; Nagao et al., 1985) .",
"cite_spans": [
{
"start": 455,
"end": 480,
"text": "(Vauquois & Boitet, 1985;",
"ref_id": "BIBREF27"
},
{
"start": 481,
"end": 500,
"text": "Nagao et al., 1985)",
"ref_id": "BIBREF15"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Tools for Grammar Development",
"sec_num": "1."
},
{
"text": "In general, the effects of the temptation to allow, for example, the EVALuation of arbitrary LISP expressions on the ares of the ATN or the addition of \"procedural programming facilities\" to the rule-based skeleton of 1BM's PLNLP have been discussed at length in the recent literature addressing the issues of declarative formalisms from a theoretical perspective (see Shieber, 1986a , and references therein). However, from the point of view of developing a realistic grammar with substantial coverage, the opening of the procedural 'back door', while perhaps useful fo: 'patching' the inadequacies in the linguistic theory during the exercise, can turn the whole process of grammar development and maintenance into an orgea~isational nightmare, as side effects accumulate and ripple effects propagate.",
"cite_spans": [
{
"start": 369,
"end": 383,
"text": "Shieber, 1986a",
"ref_id": "BIBREF24"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Tools for Grammar Development",
"sec_num": "1."
},
{
"text": "A ~parate problem with allowing procedural attachment into the grammar formalism stems from the inevitable commitment to a particular version of a particular theory. Even wben a deliberate effort is made to develop a flexible and general framework capable of accomodating a range of 'underlying' linguistic operations, such a framework is bound eventually to become inadequate, especially as modem theories of grammar (strive to) become more declarative and tend to make reference to larger bodies of knowledge. A case ha point is the ARIANE system (Vauquois & Boitet, 1985) : even though it was designed as a completely integrated programmaing environment, with the aim of enabling implementation of, and experimentation with, different linguistic theories, in reality the system has been unable to cope with radically new grammatical frameworks and computational strategies for text analysis.",
"cite_spans": [
{
"start": 549,
"end": 574,
"text": "(Vauquois & Boitet, 1985)",
"ref_id": "BIBREF27"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Tools for Grammar Development",
"sec_num": "1."
},
{
"text": "The question then arises of the optimal way of developing a practical grammar. This paper will report on our experience in building such a grammar, with a particular emphasis on how a number of constraining factors have influenced the design and implementation of the software tools for supporting the linguist's work.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Tools for Grammar Development",
"sec_num": "1."
},
{
"text": "On the other hand, a number of syntactic formalisms have been used to develop wide-coverage grammars for use in practical NLP systems. The best known of these is the Augmented Transition Network formalism due to Woods (1970) . More recent examples are the DIAGRAM grammar (Robinson, 1982) of SRI's TEAM natural language interface (Grosz et al., 1987) ",
"cite_spans": [
{
"start": 212,
"end": 224,
"text": "Woods (1970)",
"ref_id": "BIBREF29"
},
{
"start": 272,
"end": 288,
"text": "(Robinson, 1982)",
"ref_id": "BIBREF21"
},
{
"start": 330,
"end": 350,
"text": "(Grosz et al., 1987)",
"ref_id": "BIBREF7"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Design Considerations",
"sec_num": "2."
},
{
"text": "Currently with the IBM (UK) Science Centre. The work described here was supported by research grant GR/D/87321 from the UK Science and Engineering Research Council.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "and the PEG grammar",
"sec_num": null
},
{
"text": "For the last two yearn we have been engaged in a project aimed at substantial grammar development, as part of a larger effort to produce an integrated system for wide-coverage morphological and syntactic analysis of English. The overall objectives of tile combined effort arc described in a number of papers (see Russell et at., 1986; Phillips arid Thompson, 1987, and Briscoe et al., 1987) . We aimed to achieve comprehensive coverage of English in two years, using only one linguist and one programmer full-time; the complete natural language toolkit was to be made available to the research community outside the immediate enviromnent whetx~ the grammar was being developed. Consequently, the software support for the linguist had to exhibit a number of characteristics to encourage high productivity, Particularly critical among these are e.flicieney of implementation, perspicuity of rewesentatlon, ease of use and robt, stness of pofo~mance.",
"cite_spans": [
{
"start": 313,
"end": 334,
"text": "Russell et at., 1986;",
"ref_id": "BIBREF22"
},
{
"start": 335,
"end": 368,
"text": "Phillips arid Thompson, 1987, and",
"ref_id": null
},
{
"start": 369,
"end": 390,
"text": "Briscoe et al., 1987)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "and the PEG grammar",
"sec_num": null
},
{
"text": "Current theories of syntax have much to otter to practical systems; such theories, however, are under coustant development. For veu\u00a2 pragmatic reasons, a project like outs ought to exploit a developed theory, For equally pragmatic reasons, it ought to be able to take advantage both of developments within the particular theory and of the evolving treatment of wuious linguislie phenomena. The question of tim relationship between the thcoretic~d Rn'malism and the formalism adopted m implement a practical grammar based on that theory then becomes of ceutral iml;~)rtance. For i~stance, it would bc inappropriate to adopt a direct imp!ementation of, say GPSG, since tire rate of change of the theory itself is likely to make such an implementation obsolete (or at least incapable of irmorporating subsequent linguistic analyses) quite rapidly -. file bdcf lifcspan of Ewms' ProGram is a case in point. ()nly when theou and grammar are beiug developed in very close collaboration, or even wifltin the same group ---as in, for example, the })ewlctt.-Packard NLP project, whose cornerstotm is the linguistic framewolk of Head-Driven t'hrase Structm'e Grannnar (Proudian and Pollard, 1985; PollaN aud Sag, 1987) --could such ~ul approach work. l}owever, itr mJ effint like om\"a, it is of critical impmtauce to strike the right balance between i)eit~g failhfu[ to the spirit nf a tbeo~y mid being uncommii:ted with respect to a particular vcrsien of it, as well as remaiuing tlexiNe within tile overall iianlcwoN of 'close' or related theories. Attempts to be too flexible, however, arc iikely to lead tit situations of wqich the PATII..II system is an example: the ability to model a wide t' rage of theoretical devices and mr(lyrical ti'amcworks is penalised by its unsuitability \"for any major attempt at building natural-language grannnars\" (Shicber, 1984:364).",
"cite_spans": [
{
"start": 1158,
"end": 1186,
"text": "(Proudian and Pollard, 1985;",
"ref_id": "BIBREF19"
},
{
"start": 1187,
"end": 1208,
"text": "PollaN aud Sag, 1987)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "and the PEG grammar",
"sec_num": null
},
{
"text": "For a varict~/ of rea:;ons0 iuiollectual ~aid pragmatic, we chose to carry out the ~:rammar devclopnmni within ihe li'amewofl~ of GPSG (see Bogm'aev, 1988, iir mine detail~;). Ihiscoe et al. (1987) discuss further stone o:~' the major issues concerning tile dynamic intcractiou between the vltl'ions rtfle ty0es lind constrait~ls i~ (;PSG a~d their impact on the mplememability of the fl~co~y presented iu Gazdar et al. (1985) . Frnm flm practical pempcetiw o1' computational grammar development, lberc are we impmtant COHCll.ISiOIIS. In order to achieve implementability, tire interpretation of the GPSG lonnaiism ~equires a number of ms|dcfions. In order to provide flexibility and expressive power, the lbn~alism itself needs a nmnber of extensions. In this light, the design of software support for gr~:urunar development becmnes similar to the task of designing a special tin,pose, high level computer hnlgtlage, lollowed by an h~qfl~mentatkm of an interactive programming oMiomnent for it.",
"cite_spans": [
{
"start": 406,
"end": 426,
"text": "Gazdar et al. (1985)",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "3o Our App~'ot4ch",
"sec_num": null
},
{
"text": "The gmmma,\" specification formalism, presented in detail in Can'o]l et al. (1988), i~; in flint a metaogrummaticN formalism which avoids tire direct implementatimr of one particular synlactie lheory. While remaining close to the nf:~talion of GPSG, this formalism is nonethc!es:~ capable of specifying a range of syntactic thcoxie.,', and grammars. The specific choices during he design of such language have been heavily influenced by tile desire to be moderately committed to a theoretical framework without being unrteeessafily constrained wit(fin that framework. Fielding the fight balance places out' system half way between the extreme positions exemplified by ProGram and the Grammar..wliter~s Workbench, on the one hal(!, and PATR-II, on tire other.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "3,1 7he Formalism",
"sec_num": null
},
{
"text": "The recta-grammatical lbrmalism is designed to sttpl\u00d7ut a pariictdar model of grammar development, suggested by, for example, Kay (1985) . We maintain clear separation between a recta-grammar, which is \"the seat of linguistic universals\" (Kay, 1985:276) , and an equivalent (in the sense that it describes exactly the same language) object grammar, coupled directly to the l)alscr. The process of compiling the fonner into the latter constitutes the core of otlr GI)E. A nnmber of iV(l' projects, also seeking substantial coverage, make a seemingly similar distinction between a source and object grammar-see, for instance, ARIANE's static and dynamic (or procednraI) grammars (Vanquois & Boitet, 1985) . However, there are differences, tirsly in interpretation--the dynamic grammar largely incorporates whatever execution strategy is employed lbr transfer--.and secondly ill emphasis--a dynamic grammar is (necessarily) derived manually Ii'mn astatk: one. Such efforts, then, do not have the notion of recta-grammar compilation, and consequently require less functionality from their suPtx, rt environments. We amplify this point below.",
"cite_spans": [
{
"start": 126,
"end": 136,
"text": "Kay (1985)",
"ref_id": "BIBREF13"
},
{
"start": 238,
"end": 253,
"text": "(Kay, 1985:276)",
"ref_id": null
},
{
"start": 677,
"end": 702,
"text": "(Vanquois & Boitet, 1985)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "3,1 7he Formalism",
"sec_num": null
},
{
"text": "Tim scparatiou between source and object grammars is the key to two of the eousiderations discussed in the previous section. By stopping short of embodying a particular theory, the fonnalism of the recta-grammar provides the linguist with an expressively flexible and powerful device Ibr grammar writing. By assuming a parser, whose underlying operation is based on a restrictive version of unification, the ohject gram,nat allows an efficient implementation. Morn specifically, the object grammar is made up of phrase structure rules with feature complexes as categories; parsing with it is based on flxedarity, term unification.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "3,1 7he Formalism",
"sec_num": null
},
{
"text": "The recta-grammatical formalism is flexible and powerful. For example, it incolporates rule types for explicitly specifying feature propagation patterns, rather than 'hard-wiring' feature propagation into tile interpretion of Ihe rules (as in GPSG), arid provides a variety of alternative rule formats, for example, PS er ID/LP rules, (non)-linear, (non)-lexieed metarules, and so forth. The meta-grammar can be designed to be perspicuous, flexible aud expressively powerful with little regard lor issues of computational cmnplexity because this complexity 'disappears' during compilation into the object grammar, 1caving a well-defined, invariant and computationally tractable object grammar to be deployed at parse time. The process of compilation is based on ordered application of the various types of meta-grammatical ntle to a set of 'base' PS or ID rules.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "3,1 7he Formalism",
"sec_num": null
},
{
"text": "The questions of optimal software envirmm~ent fro' supporting grammar development, particularly in a rule-based folanalism like ours, are very similar to the questions of interactive support for program developmant. A ~annber of special-pulpose tools have to be brought together in a lightly inzegrated 'sbeli' and organiscd around the core linguistic 'engine', which performs the reduction (compilation) of lneta-into object grammar. These tools must suport",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Environment",
"sec_num": "3.2"
},
{
"text": "(1) rapid, incremental grammar development,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Environment",
"sec_num": "3.2"
},
{
"text": "(2) interactive granmar debugging, and",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Environment",
"sec_num": "3.2"
},
{
"text": "(3) version maintenance and control.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Environment",
"sec_num": "3.2"
},
{
"text": "The grammar development environment incorporates a number of moduh's, oLganised round the compilation process. In particular, tire core functionality is provided by a morphological analyser, a parser lor ihe object grammar, and a generator. Tire user interface consists of a comntalld line inteqgreter, a number of special puqmse viewing modules for recta-grammatical constructs, and a component for displaying parse trees on non-graphics terminals. The system is designed to be completely portable and machine-independent, which influenced tire deliberate choice not to use any advanced graphics facilities. (These can incmporated if desired ---indeed the system has been ported to both the Apple Macintosh and Xerox 1186 workstation).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Environment",
"sec_num": "3.2"
},
{
"text": "The need lor a pa~er fro' grammar development is uncontroversial; it assists thc linguist in finding gaps in grammatical coverage, checking the correctness of the syntactic description and weeding out spurious analyses. Our parser provides facilities for viewing syntactic descriptions in a variety of ways and batch parsing a growing corpus of examples to check the consistency of the developing grammar. Less obvious is the utility cf a generator. Karttunen & Kay (1985 :2950 discuss the use of such a component to generally explore the predictions made by a grammar concerning particular constructions.",
"cite_spans": [
{
"start": 450,
"end": 471,
"text": "Karttunen & Kay (1985",
"ref_id": "BIBREF12"
},
{
"start": 472,
"end": 477,
"text": ":2950",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Detecting Overgeneration",
"sec_num": "3.2.1"
},
{
"text": "However, their approach would not highlight the roles involved in overgcneration, particularly as the granlmar grows in size. Our generator allows the linguist to guide generation either implicitly, by specifying rule-sets of interest, or explicitly, by directly manipulating (partial) syntax trees. For example, if the focus of interest is relative clauses, then she can request the GDE to ignore inappropriate rules (for example, those relating to coordination) and ask for automatic generation of examples with a specified maximum length whose root node is that appropriate to dominate a relative clause. Alternatively, she can build a syntax tree interacfively by selecting the rule to apply from a menu of rule names generated automatically on specification of the next node to expand. Combining the two approaches allows automatic generation, fcr example, of specific types of relative clause; generation after building the partial syntax tree:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Detecting Overgeneration",
"sec_num": "3.2.1"
},
{
"text": "r,e i NP[+wh] S[SLASH NP]",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Detecting Overgeneration",
"sec_num": "3.2.1"
},
{
"text": "would produce oNectrelative clansessuch as:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Detecting Overgeneration",
"sec_num": "3.2.1"
},
{
"text": "who every cat liked who kim likes e \" Automatic generation is a more natural technique for aiding discovery of ovcrgencration than parsing, because with the latter it is necessary for the linguist to guess where overgeneration may occur.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Detecting Overgeneration",
"sec_num": "3.2.1"
},
{
"text": "The major potential bottleneck in grammar development is compilation, since changes to the grammar can only be fully evaluated by parsing or generating relevant examples. Complete grammar compilation is increasingly time consuming as the grammar grews; however, it does not have to he performed that often, given the ability to perlbrm incremental grammar compilation. Tile term \"incremental\" here is taken to mean both as little as possible and as rarely as possible. By analogy with high-level languages for rapid prototyping, where disruptions of the program development cycle ale avoided at all costs (consider, for instance, asynchronous garbage collection in Lisp), the intrusion of the grammar compiler into the linguist's work is kept to a minimum. Firstly, gran~mar compilation takes place 'on demand', so that the user need never worry about having to explicitly invoke it. Secondly, even though rules in large grammars tend to interact quite closely, it is rarely necessary to recompile the whole source every time an individual rule is changed. The GDE software caches compiled data to minimise the effort required during recompilation, and, by maintaining a model of the dynamic dependencies between a cluster of interconnected rules, it '.s able to ensure that the minimum amount of cached data is discarded when the grammar is changed. A consequence of this design is that individual components and rules at source level can be declared, and redefined, in any order. For example, the role",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Efficient Grammar Compilation",
"sec_num": "3.2.2"
},
{
"text": "S --> NP, VP.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Efficient Grammar Compilation",
"sec_num": "3.2.2"
},
{
"text": "nmy be defined before it is even decided which features make up Ss, NPs and Vps. The user may postpone this decision until she actually ~vants to use the ride for parsing a sentence. This experimental style of dcvclopmcnt parallels even turther that promoted by highly interactive systems, since it allows easy experimentation with small fragments of the grammar, without requiring, for instance, compilation of the complete source or loading of all declarations.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Efficient Grammar Compilation",
"sec_num": "3.2.2"
},
{
"text": "Incremental compilation is made possible by designing the grammar compiler as a modular unit, comprising separate components for the interpretation of each of the statement types (for example alias declarations, feature propagation rules, or feature default statements) in the source (meta-grammatical) language. This has made it possible to combine these components into an integral package for efficient grammar compilation, as well as m incorporate them into individual commands, directly available to the linguist.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Efficient Grammar Compilation",
"sec_num": "3.2.2"
},
{
"text": "There are two further important consequences of our grammar compilation design. The first is the ability to monitor the effects of grammar expansion, by selectively filtering subsets of source grammar rules through specific compilation procedures. So, for example, the effects of a particular metarule can be assessed by applying it to a specified subset of 'base' rules. The second is the crucial capacity of source level debugging. In a development model which distinguishes between meta-and object grammars, efficient work is only possible if l%ulty grammar rules can be traced back to their original source in the recta-grammar. In our system, the output of a single command is usually sufficiant to pinpoint an error in the source. Nodes in parse trees are labelled with the name of the gramnmr rule licensing the local tree rooted at that node. Unlike some other systems, such as ProGram, the name of an object grammar talc always uniquely encodes the complete derivation path of the rule. Thus, for example, the rule name VP/TAKES NP (PASSIVE/+) uniquely identifies the rule derived from the application of the PASSIVE metarule to the rule introducing vps taking a single NP complement which requires a PP 'agent' phrase (distinguished from the version without the PP by /+). \"Ihus faults in object grmnmar rules can easily be traced back to their meta-grammatical source.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Effective Grammar Debugging",
"sec_num": "3.2.3"
},
{
"text": "The use of unique rule names enhances the ability to view all or parts of the recta-grammar, as well as the results of partial compilation, along a number of dimensions, by means of patterns, with wild cards ranging over rule types and the names of rules. To facilitate this type of grammar browsing, arbitrary view requests can be constructed by using patterns eompositionally; thus in a particular grammar of ours, the patteru VP/PHRASAL* (*) & =NULL refers to the collection of VP rules introducing phrasal verbs which have had metarales applied to them resulting in the imroduction of the feature NULL. View requests may be further modified by indicating the level of detail required, i.e. whether the rules should be shown in their original source form, or partially or fully compiled.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Effective Grammar Debugging",
"sec_num": "3.2.3"
},
{
"text": "Viewing parse trees particularly facilitates source level debugging. Displaying a tree from the perspective of role names associated with the nodes, for example that resulting from parsing the phrase 'men and women': N/COORDI CONJ/NA CONJ/NB men and women can reveal whether right or wrong rules get activated. Fully displaying the category structures on tree nodes (Figure 1) gives an indication whether feature propagation regimes have been specified correctly. Viewing the gross structure of the tree, in this case ((men) (and women))",
"cite_spans": [],
"ref_spans": [
{
"start": 366,
"end": 376,
"text": "(Figure 1)",
"ref_id": null
}
],
"eq_spans": [],
"section": "Effective Grammar Debugging",
"sec_num": "3.2.3"
},
{
"text": "suggests whether the parse is correct or not; furthermore, in the case of multiple parses, nodes with common analyses can be factored out, thus helping localise the source of the error.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Effective Grammar Debugging",
"sec_num": "3.2.3"
},
{
"text": "Errors are only dealt with at source level; editing facilities incorporate knowledge about file syntax of all constructs in the metao grammatical formalism The process of editing is integrated with extensive bookkeeping, which frees the grammar writer from the task of explicitly maintaining version backups and checks for consistency of the object grammar with respect to a particular meta-grmnmar.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Effective Grammar Debugging",
"sec_num": "3.2.3"
},
{
"text": "The command interpreter is sensitive to work context and is capable, at any stage, to prompt for input appropriate to the current state in tile grammar development process. For example, if the linguist has parsed a sentence which resulted in three analyses, she can display the category associated with any node of any of the analyses by typing In this fashion, potentially highly-ambiguous commands, such as view are localised to the current context. One of the unexpected consequences of this design is that it makes the system relatively accessible to inexperienced users and has made tcasible the use of the system tbr educational purposes.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Effective Grammar Debugging",
"sec_num": "3.2.3"
},
{
"text": "The desig, of a software system for grammar development clearly depeuds on 01e linguistic choices for, aud pragmatic requirements of, the NLP task. It is not surprising timt a number of MT efforts, motivated by the need tbr st~bstantial coverage, have implemented their own GOEs. Pethaps file most comprehensive of these is the METAL-SHOP research environment of the METAL MT system (White, 1987) , wltich includes facilities for selective viewing of parse trees, tracing of the grammar rules as they are invoked by the parser, and editing the grammar at source. The system makes, and conforms to, a clear-cat distinction between descriptive grammar rules and separate mechanisms for their interpretation, tlowever, since the formal model used is titat of augmented phrase structure grammar which does not undergo auy compilation into object grammar, the fimetionality of the METAL-SHOP GDE, while adequate in the practical context it is used in, remahts below that of the system we describe.",
"cite_spans": [
{
"start": 383,
"end": 396,
"text": "(White, 1987)",
"ref_id": "BIBREF28"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Collc|usiol~",
"sec_num": "4."
},
{
"text": "Even though we have worked within a particular theoretical fi'~wuework, thole are genoralisations to be made concerning practical grammar development within the framework of any of the current syntactic thee, ties. In particular, it is important to realise that software support tbr :inch a task does not imply, arm should not be reduced to, tile provision of' a set of computational tools for e.g. gtanlmar editing, inspocting th4; output from a parser, or comfortably interacting with the system..Ln effozt of this scale crucially requi~es critical evaluation of the u,deriylng lingntstle theory, so that the right combination o[ pragmatically motivated and linguistically correct modifications and revisions is ~bund and implementexl, We are not alone in our findings; our approach to making computational sense of GPSG is similar to the (unimplemenled) plvposals of Shieber (1986b) and Ristad (1987) .",
"cite_spans": [
{
"start": 870,
"end": 885,
"text": "Shieber (1986b)",
"ref_id": "BIBREF25"
},
{
"start": 890,
"end": 903,
"text": "Ristad (1987)",
"ref_id": "BIBREF20"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Collc|usiol~",
"sec_num": "4."
},
{
"text": "The system described above is fully implemented and running on a number of hardware configurations. A wide-coverage grarmnar involving two woman/yeal~ of effort has been developed. A set of programs in Common Lisp, together with a user manual (Carroll et al., 1988) and description of our grammar (Grover et al., 1988) are available through the Artificial Intelligence Applications Institute in Edinburgh.",
"cite_spans": [
{
"start": 243,
"end": 265,
"text": "(Carroll et al., 1988)",
"ref_id": "BIBREF3"
},
{
"start": 297,
"end": 318,
"text": "(Grover et al., 1988)",
"ref_id": "BIBREF6"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Collc|usiol~",
"sec_num": "4."
}
],
"back_matter": [],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "A natural language toolkit: reconciling theory with practice",
"authors": [
{
"first": "B",
"middle": [],
"last": "Boguraev",
"suffix": ""
}
],
"year": 1988,
"venue": "Natural Language Parsing and Linguistic Theories, Reidel, Dordl~echt",
"volume": "",
"issue": "",
"pages": "95--130",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Boguraev, B. (1988) 'A natural language toolkit: reconciling theory with practice' in Rohrer C. & U. Reyle (ed.), Natural Language Parsing and Linguistic Theories, Reidel, Dordl~echt, pp. 95-130.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "oll (1987) ~A formalism and environment for the development of a lalge grammar of",
"authors": [
{
"first": "E",
"middle": [],
"last": "Briscoe",
"suffix": ""
},
{
"first": "C",
"middle": [],
"last": "Grover",
"suffix": ""
},
{
"first": "B",
"middle": [],
"last": "Boguraev",
"suffix": ""
},
{
"first": "& J",
"middle": [],
"last": "Can",
"suffix": ""
}
],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Briscoe, E., C. Grover, B. Boguraev & J. Can'oll (1987) ~A formalism and environment for the development of a lalge grammar of",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Proceedings of lOth International Cot~ference on Artilicial Intelligence",
"authors": [
{
"first": "",
"middle": [],
"last": "English",
"suffix": ""
}
],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "English', Proceedings of lOth International Cot~ference on Artilicial Intelligence, Milan, Italy, pp. '103-'/08.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "The Grammar Development Envb'onment: User Manual",
"authors": [
{
"first": "J",
"middle": [],
"last": "Carroll",
"suffix": ""
},
{
"first": "B",
"middle": [],
"last": "Boguraev",
"suffix": ""
},
{
"first": "C",
"middle": [],
"last": "Grover",
"suffix": ""
},
{
"first": "&",
"middle": [
"E"
],
"last": "Briscoe",
"suffix": ""
}
],
"year": 1988,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Carroll, J., B. Boguraev, C. Grover & E. Briscoe (1988) The Grammar Development Envb'onment: User Manual, Technical Report no. 127, Computer Imboratory, University of Cambridge.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "ProGram ---a development tool for GPSG grammars",
"authors": [
{
"first": "R",
"middle": [],
"last": "Evans",
"suffix": ""
}
],
"year": 1985,
"venue": "Linguistics",
"volume": "23",
"issue": "2",
"pages": "213--243",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Evans, R. (1985) 'ProGram ---a development tool for GPSG grammars', Linguistics, vol. 23(2), pp. 213-243.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Generalized Phrase Structure Gratmnar, Oxlbrd: Blackwell and Cambridge",
"authors": [
{
"first": "G",
"middle": [],
"last": "Gazdar",
"suffix": ""
},
{
"first": "E",
"middle": [],
"last": "Klein",
"suffix": ""
},
{
"first": "G",
"middle": [],
"last": "Pullum",
"suffix": ""
},
{
"first": "& I",
"middle": [],
"last": "Sag",
"suffix": ""
}
],
"year": 1985,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Gazdar, G., E. Klein, G. Pullum & I. Sag (1985) Generalized Phrase Structure Gratmnar, Oxlbrd: Blackwell and Cambridge: Harvard University Press.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "The Alvey Natural Language Too& Project Grammar: A Wide-Coverage Computational Gratrmlar of English, Lancaster Working Papers in Linguistics",
"authors": [
{
"first": "C",
"middle": [],
"last": "Grover",
"suffix": ""
},
{
"first": "E",
"middle": [],
"last": "Briscoe",
"suffix": ""
},
{
"first": "B",
"middle": [],
"last": "Boguraev",
"suffix": ""
},
{
"first": "& J",
"middle": [],
"last": "Carn311",
"suffix": ""
}
],
"year": 1988,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Grover, C., E. Briscoe, B. Boguraev & J. Carn311 (1988) The Alvey Natural Language Too& Project Grammar: A Wide-Coverage Computational Gratrmlar of English, Lancaster Working Papers in Linguistics, no. 47.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "II~,AM: An experiment in the design of transportable natural language interfaces",
"authors": [
{
"first": "B",
"middle": [],
"last": "Grosz",
"suffix": ""
},
{
"first": "D",
"middle": [],
"last": "Appelt",
"suffix": ""
},
{
"first": "M",
"middle": [],
"last": "Douglas",
"suffix": ""
},
{
"first": "& F",
"middle": [],
"last": "Pelcira",
"suffix": ""
}
],
"year": 1987,
"venue": "Artificial Intelligence",
"volume": "32",
"issue": "2",
"pages": "173--244",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Grosz, B., D. Appelt, M. Douglas & F. Pelcira (1987) \"II~,AM: An experiment in the design of transportable natural language interfaces', Artificial Intelligence, vol. 32(2), pp. 173-244.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "PLNLP, PEG a~ul CRITIQUE: ?7tree contributions to computing in the ht#nanities",
"authors": [
{
"first": "K",
"middle": [],
"last": "Jensen",
"suffix": ""
},
{
"first": "G",
"middle": [],
"last": "Heidom",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Richardson",
"suffix": ""
},
{
"first": "& N",
"middle": [],
"last": "Haas",
"suffix": ""
}
],
"year": 1986,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jensen, K., G. Heidom, S. Richardson & N. Haas (1986) PLNLP, PEG a~ul CRITIQUE: ?7tree contributions to computing in the ht#nanities, Research Report RC 11841, Computer Science Department, IBM TJ Watson Research Center, Yorktown Heights, NY.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Lexical-functional grammar: a formal system for graramatical representation",
"authors": [
{
"first": "R",
"middle": [
"& J"
],
"last": "Kaplan",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Bresnan",
"suffix": ""
}
],
"year": 1982,
"venue": "",
"volume": "",
"issue": "",
"pages": "173--281",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kaplan, R. & J. Bresnan (1982) 'Lexical-functional grammar: a formal system for graramatical representation' in J. Bresnan (ed.), The Mental Representation of Grammatical Relations, MIT Press, Cambridge, MA, pp. 173-281.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Three seductions of computational psycholinguistics",
"authors": [
{
"first": "R",
"middle": [],
"last": "Kaplan",
"suffix": ""
}
],
"year": 1987,
"venue": "Linguistic Theory and Computer Applications",
"volume": "",
"issue": "",
"pages": "149--188",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kaplan, R. (1987) 'Three seductions of computational psycholinguistics' in P. Whiteloek et al. (ed.), Linguistic Theory and Computer Applications, Academic Press, New York, pp. 149-188.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "D-PATR: A development envil~nment for unification-based grammars",
"authors": [
{
"first": "L",
"middle": [],
"last": "Karttunen",
"suffix": ""
}
],
"year": 1986,
"venue": "Proceedings of llth International Congress on Computational Linguistics",
"volume": "",
"issue": "",
"pages": "74--80",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Karttunen, L. (1986) 'D-PATR: A development envil~nment for unification-based grammars', Proceedings of llth International Congress on Computational Linguistics, Bonn, Germany, pp. 74-80.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Parsing in a free word order language",
"authors": [
{
"first": "L",
"middle": [],
"last": "Karttunen",
"suffix": ""
},
{
"first": "&",
"middle": [
"M"
],
"last": "Kay",
"suffix": ""
}
],
"year": 1985,
"venue": "Natural Language Parsing",
"volume": "",
"issue": "",
"pages": "279--306",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Karttunen, L. & M. Kay (1985) 'Parsing in a free word order language' in Dowty, D., L. Karttunen & A. Zwicky (ed.), Natural Language Parsing, Cambridge University Press, Cambridge, pp. 279-306.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Parsing in functional unification grammar",
"authors": [
{
"first": "M",
"middle": [],
"last": "Kay",
"suffix": ""
}
],
"year": 1985,
"venue": "Natural Language Parsing",
"volume": "",
"issue": "",
"pages": "251--278",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kay, M. (1985) 'Parsing in functional unification grammar' in Dowty, D., L. Karttunen & A. Zwicky (ed.), Natural Language Parsing, Cambridge University Press, Cambridge, pp. 251-278.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "LFG manual",
"authors": [
{
"first": "C",
"middle": [],
"last": "Kiparsky",
"suffix": ""
}
],
"year": 1985,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kiparsky, C. (1985) LFG manual, Manuscript, XEROX Palo Alto Research Center, Palo Alto, CA.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "The Japanese Government Project for Machine Translation",
"authors": [
{
"first": "M",
"middle": [],
"last": "Nagao",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Tsujii",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Nakamura",
"suffix": ""
}
],
"year": 1985,
"venue": "Computational Linguistics",
"volume": "11",
"issue": "2",
"pages": "91--110",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Nagao, M., Tsujii, J. & Nakamura, J. (1985) 'The Japanese Government Project for Machine Translation', Computational Linguistics, vol. 11(2), pp. 91-110,",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "GPSGP --A parser for generalised phrase structure grammars",
"authors": [
{
"first": "J",
"middle": [
"& H"
],
"last": "Phillips",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Thompson",
"suffix": ""
}
],
"year": 1985,
"venue": "Linguistics",
"volume": "23",
"issue": "2",
"pages": "245--261",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Phillips, J. & H. Thompson (1985) 'GPSGP --A parser for generalised phrase structure grammars', Linguistics, vol. 23(2), pp. 245-261.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "A parser and an appropriate computational representation for GPSG",
"authors": [
{
"first": "J",
"middle": [
"& H"
],
"last": "Phillips",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Thompson",
"suffix": ""
}
],
"year": 1987,
"venue": "Cognitive Science Working Papers",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Phillips, J. & H. Thompson (1987) 'A parser and an appropriate computational representation for GPSG' in Klein, E. & N. Haddock (ed.), Cognitive Science Working Papers, Centre for Cognitive Science, University of Edinburgh.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Head-driven Phrase Structure Grammar",
"authors": [
{
"first": "C",
"middle": [
"& I"
],
"last": "Pollard",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Sag",
"suffix": ""
}
],
"year": 1987,
"venue": "CSLI Lecture Notes Number",
"volume": "12",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Pollard, C. & I. Sag (1987) Head-driven Phrase Structure Grammar, CSLI Lecture Notes Number 12, CSLI, Stanford, CA.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Parsing head-driven phrase structure grammar",
"authors": [
{
"first": "D",
"middle": [
"& C"
],
"last": "Proudian",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Pollard",
"suffix": ""
}
],
"year": 1985,
"venue": "Proceedings of 23rd Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "167--171",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Proudian, D. & C. Pollard (1985) 'Parsing head-driven phrase structure grammar', Proceedings of 23rd Annual Meeting of the Association for Computational Linguistics, Chicago, IL, pp. 167-171.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Revised generalized phrase structure grammar",
"authors": [
{
"first": "E",
"middle": [],
"last": "Ristad",
"suffix": ""
}
],
"year": 1987,
"venue": "Proceedings of 25th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "243--250",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ristad, E. (1987) 'Revised generalized phrase structure grammar', Proceedings of 25th Annual Meeting of the Association for Computational Linguistics, Stanford, CA, pp. 243-250.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "DIAGRAM: A grammar for dialogues",
"authors": [
{
"first": "J",
"middle": [],
"last": "Robinson",
"suffix": ""
}
],
"year": 1982,
"venue": "Communications of the ACM",
"volume": "25",
"issue": "1",
"pages": "27--47",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Robinson, J. (1982) 'DIAGRAM: A grammar for dialogues', Communications of the ACM, vol. 25(1), pp. 27-47.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "A dictionary and morphological analyser for English",
"authors": [
{
"first": "G",
"middle": [],
"last": "Russell",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Pulman",
"suffix": ""
},
{
"first": "G",
"middle": [],
"last": "Ritchie",
"suffix": ""
},
{
"first": "& A",
"middle": [],
"last": "Black",
"suffix": ""
}
],
"year": 1986,
"venue": "Proceedings of 11th International Congress on Computational Linguistics",
"volume": "",
"issue": "",
"pages": "277--279",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Russell, G., S. Pulman, G. Ritchie & A. Black (1986) 'A dictionary and morphological analyser for English', Proceedings of 11th International Congress on Computational Linguistics, Bonn, Germany, pp. 277-279.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "Th~ design of a computer language for linguistic information",
"authors": [
{
"first": "S",
"middle": [],
"last": "Shieber",
"suffix": ""
}
],
"year": 1984,
"venue": "Proceedings of lOth International Congress on Computational Lingu:stics",
"volume": "",
"issue": "",
"pages": "362--366",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Shieber, S. (1984) 'Th~ design of a computer language for linguistic information', Proceedings of lOth International Congress on Computational Lingu:stics, Stanford, California, pp. 362-366.",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "An Introduction to Unification-based Approaches to Grammar",
"authors": [
{
"first": "S",
"middle": [],
"last": "Shieber",
"suffix": ""
}
],
"year": 1986,
"venue": "CSLI Lecture Notes Number",
"volume": "4",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Shieber, S. (1986a) An Introduction to Unification-based Approaches to Grammar, CSLI Lecture Notes Number 4, CSLI, Stanford, CA, and University of Chicago Press.",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "A simple reconstruction of GP3G",
"authors": [
{
"first": "S",
"middle": [],
"last": "Shieber",
"suffix": ""
}
],
"year": 1986,
"venue": "Proceedings of llth International Conference on Computational Linguistics",
"volume": "",
"issue": "",
"pages": "211--215",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Shieber, S. (1986b) 'A simple reconstruction of GP3G', Proceedings of llth International Conference on Computational Linguistics, Bonn, Germany, pp. 211-215.",
"links": null
},
"BIBREF26": {
"ref_id": "b26",
"title": "Separating linguistic analyses from linguistic theories",
"authors": [
{
"first": "S",
"middle": [],
"last": "Shieber",
"suffix": ""
}
],
"year": 1987,
"venue": "Linguistic Theory and Computer Applications",
"volume": "",
"issue": "",
"pages": "1--36",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Shieber, S. (1987) 'Separating linguistic analyses from linguistic theories' in P. Whitelock et al. (ed.), Linguistic Theory and Computer Applications, Academic Press, New York, pp. 1-36.",
"links": null
},
"BIBREF27": {
"ref_id": "b27",
"title": "Automated Translation at Grenoble University",
"authors": [
{
"first": "B",
"middle": [],
"last": "Vauquois",
"suffix": ""
},
{
"first": "C",
"middle": [],
"last": "Boitet",
"suffix": ""
}
],
"year": 1985,
"venue": "Computational Linguistics",
"volume": "11",
"issue": "1",
"pages": "28--36",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Vauquois, B. & Boitet, C. (1985) 'Automated Translation at Grenoble University', Computational Linguistics, vol. 11(1), pp. 28-36.",
"links": null
},
"BIBREF28": {
"ref_id": "b28",
"title": "The research environment ill the METAL project",
"authors": [
{
"first": "J",
"middle": [],
"last": "White",
"suffix": ""
}
],
"year": 1987,
"venue": "Machine translation: Theoretical and methodological issues",
"volume": "",
"issue": "",
"pages": "225--246",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "White, J. (1987) 'The research environment ill the METAL project' in Nirenburg, S. (ed.), Machine translation: Theoretical and methodological issues, Cambridge University Press, Cambridge, UK, pp. 225-246.",
"links": null
},
"BIBREF29": {
"ref_id": "b29",
"title": "Transition network grammars for natural language analysis",
"authors": [
{
"first": "W",
"middle": [],
"last": "Woods",
"suffix": ""
}
],
"year": 1970,
"venue": "Communications of the ACM",
"volume": "13",
"issue": "8",
"pages": "591--606",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Woods, W. (1970) 'Transition network grammars for natural language analysis', Communications of the ACM, vol. 13(8), pp. 591-606.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"text": "POS~, +PLU, -PART, -PRO, +COUNT, CONJ NULL,. SUBCAT NULL, NFORM NORM, PER 3, PN-] N[-POSS, +PLU, -PART, -PRO, +COUNT, CONJ AND, SUBCAT NULL, NFORM NORM, PER 3, PN -] men N[..-POSS, +PLU, -PART, -PRO, +COUNT, SUBCAT NULL, NFORM NORM, PER 3, PN -] POSS, +PLU, -.PART, -PRO, +COUNT, SUBCAT NULL~ NFORM NORM, PER 3, PN -]",
"uris": null,
"num": null,
"type_str": "figure"
},
"FIGREF1": {
"text": "Figure 1. Fully Detailed Parse Tree for 'men and women'.",
"uris": null,
"num": null,
"type_str": "figure"
}
}
}
} |