File size: 77,672 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 | {
"paper_id": "P85-1031",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T09:39:44.949320Z"
},
"title": "AN ECLECTIC APPROACH TO BUILDING NATURAL LANGUAGE INTERFACES",
"authors": [
{
"first": "Brian",
"middle": [],
"last": "Phillips",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Tektronix, Inc",
"location": {}
},
"email": ""
},
{
"first": "J",
"middle": [],
"last": "Michael",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Tektronix, Inc",
"location": {}
},
"email": ""
},
{
"first": "James",
"middle": [
"H"
],
"last": "Freiling",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Tektronix, Inc",
"location": {}
},
"email": ""
},
{
"first": "Steven",
"middle": [
"L M"
],
"last": "Alexander",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Tektronix, Inc",
"location": {}
},
"email": ""
},
{
"first": "Steve",
"middle": [],
"last": "Essick",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Tektronix, Inc",
"location": {}
},
"email": ""
},
{
"first": "Sheldon",
"middle": [
"N"
],
"last": "Rehfu~",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Tektronix, Inc",
"location": {}
},
"email": ""
},
{
"first": "",
"middle": [],
"last": "Ichollt",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Tektronix, Inc",
"location": {}
},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "INKA is a natural language interface to facilitate knowledge acquisition during expert system development for electronic instrument trouble-thooting. The expert system design methodology develops a domain definition, called GLIB, in the form of a semantic grammar. This grammar format enables GLIB to be used with the INGLISH interface, which constrains users to create statements within a subset of English. Incremental patting in INGLISH allows immediate remedial information to be generated if a user deviates from the sublanguage. Sentences are translated into production rules using the methodology of lexical-functional grammar. The system is written in Sms/ltalk and, in INK,A, produces rides for a Prolog inference engine.",
"pdf_parse": {
"paper_id": "P85-1031",
"_pdf_hash": "",
"abstract": [
{
"text": "INKA is a natural language interface to facilitate knowledge acquisition during expert system development for electronic instrument trouble-thooting. The expert system design methodology develops a domain definition, called GLIB, in the form of a semantic grammar. This grammar format enables GLIB to be used with the INGLISH interface, which constrains users to create statements within a subset of English. Incremental patting in INGLISH allows immediate remedial information to be generated if a user deviates from the sublanguage. Sentences are translated into production rules using the methodology of lexical-functional grammar. The system is written in Sms/ltalk and, in INK,A, produces rides for a Prolog inference engine.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "The ides/ natural language interface would let any user, without any prior training, interact with a computer. Such an interface would be useful in the knowledge acquisition phase of expert system development where the diagnostic knowledge of a Hilled practitioner has to be elicited. As technicians are not farnifiar with formal knowledge representation schemes, a trained intermediary, a knowledge engineer, is generally employed to handcraft the interns/ format. This process is time-consuming and expensive.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "INTRODUCTION",
"sec_num": null
},
{
"text": "INKA (INglish Knowledge Acquisition) permits task experts to express their knowledge in a subset of English, and have it automatically translated into the appropriate representational formalism. In particular, the version of INKA to be discussed here accepts input in a sublanguage called GLIB which permits the statement of facts and rules relevant to the troubleshooting of electronic systems (Freiling et al., 1984) , and translates these statements into Prolog unit clauses for later proce~ng by a specialized inference mechanism. Experiments with INKA to date have enabled us to construct mfflcient troubleshooting rules to build a localizing troubleshooter for a simple circuit.",
"cite_spans": [
{
"start": 395,
"end": 418,
"text": "(Freiling et al., 1984)",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "INTRODUCTION",
"sec_num": null
},
{
"text": "INKA is designed as one of the tools of DETEKTR, an environment for building knowledge based electronic instru. ment troubleshooters (Freiling & Alexander, 1984) . DETEKTR supports an expert system development methodology which is outlined below. The design goal of INKA is that it serve as a natural language input system to facilitate transfer of knowledge during the knowledge acquisition phase of expert system development. IIqKA is not intended to stand alone as the sole mechanism for knowledge transfer, but to be supt A summer intern at Tektronix, currently at the University of llfinois, Champs/gn-Urbana.",
"cite_spans": [
{
"start": 133,
"end": 161,
"text": "(Freiling & Alexander, 1984)",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "INTRODUCTION",
"sec_num": null
},
{
"text": "ported by components capable of managing a coherent dis/ogue with the task expert. McKeown (1984) has po/nted out a number of important aspec~ of the pragmatics that relate to the usage phase of an expert system. Similar pragmatics are required to insure adequate construction of the system's knowledge base during the knowledge ac~n phase of an expert system's development. The most important pragmatic facility is one to estimate the degree of epistemi\u00a2 coverage of the knowledge acquired so far, and to prompt the task expert for more knowledge in areas where the coverage is weak. It is unfeasible to assume that any task expert can simply perform a ~memory dump\" of expertise into some natural language interface and be done with it.",
"cite_spans": [
{
"start": 83,
"end": 97,
"text": "McKeown (1984)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "INTRODUCTION",
"sec_num": null
},
{
"text": "This paper discusses the natural language technology used in building INKA. The system incorporates a diverse collection of natural language technologies in its construction. Specifically, INKA utilizes a semam/c grammar (Burton, 1976) to characterize the domain sublanguage, lexical-functional sem~aics (Kaplan & Bresnan, 1982) to translate to the internal form of representation, and an interface that includes leftcorner parsitlg with in-line guidance to address the Linguistic coverage problem that aris~ with sublanguages. We feel this eclectic approach is a useful for building application-oriented natural language interfaces. Although we are describing a knowledge acquisition application, the methodology can be used for any application whose sublanguage can be stated in the prescribed grammar formalism.",
"cite_spans": [
{
"start": 221,
"end": 235,
"text": "(Burton, 1976)",
"ref_id": null
},
{
"start": 304,
"end": 328,
"text": "(Kaplan & Bresnan, 1982)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "INTRODUCTION",
"sec_num": null
},
{
"text": "Tereisias (Davis, 1977) provides a natural language environment for debugging a knowledge base. INKA at present contains no facilities to modify an existing rule or to test the evolving knowledge base for some level of integr/ty; these are to be future additions.",
"cite_spans": [
{
"start": 10,
"end": 23,
"text": "(Davis, 1977)",
"ref_id": "BIBREF3"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "INTRODUCTION",
"sec_num": null
},
{
"text": "INKA is written in Smalltalk (Goidberg & Robson, 1983) and runs on both the Tekuroulx Magnolia Workstation and the 4404 Artificial Intelligence System. INKA makes extensive use of the bit-mapped display and three-button mouse on these systems.",
"cite_spans": [
{
"start": 29,
"end": 54,
"text": "(Goidberg & Robson, 1983)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "INTRODUCTION",
"sec_num": null
},
{
"text": "The major bottlenecks in building knowledge based systems have proven to be related to the definition and acquisition of knowledge to be processed.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "LANGUAGE AS A KNOWLEDGE ENGINEERING TOOL",
"sec_num": null
},
{
"text": "The first bottleneck occurs in the knowledge definition phase of system development, where symbolic structures are defined that represent the knowledge necessary to accomplish a particular task. A bottleneck arises because of the ~ortage of knowledge engineers, who are skilled in defining these structures and using them to express relevant knowledge.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "LANGUAGE AS A KNOWLEDGE ENGINEERING TOOL",
"sec_num": null
},
{
"text": "The second bottleneck occurs in the knowledge acquisition phase, which involves the codification of the knowledge necessary for a system to function correctly. A bottleneck arises here because in current practice, the presence of the knowledge engineer is required throughout this timeconsuming process.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "LANGUAGE AS A KNOWLEDGE ENGINEERING TOOL",
"sec_num": null
},
{
"text": "In the course of defining a viable methodology for the construction of expert systems (Frelling & Alexander 1984; Alexander et al. 1985) , we have identified cermia classes of problems where the task of definin$ the knowledge structures and the task of actually building them can be effectively separated, with only the former being performed by a trained knowledge engineer. The problem of building a large collection of knowledge-based troubleshooters for electronic instrumeats is an example. In order to support the construct/on of a large class of such systems, it makes sense to perform the knowledge definition step for the overall domain initially, and to build domain-specific developmera tools, which include problem-oriented mbsets of Enghsh and special purpose graphical displays, that can be reused in the development of each individual knowledge-based system.",
"cite_spans": [
{
"start": 86,
"end": 113,
"text": "(Frelling & Alexander 1984;",
"ref_id": null
},
{
"start": 114,
"end": 136,
"text": "Alexander et al. 1985)",
"ref_id": "BIBREF0"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "LANGUAGE AS A KNOWLEDGE ENGINEERING TOOL",
"sec_num": null
},
{
"text": "Even in the context of such an approach, we have found that there is usually a shortage of capable knowledge engineers to carry out the knowledge deflnltioa phase, and that a welldefined methodology can be of great value here in aiding nonlinguistically oriented computer scientists to carry out this verbal elicitation task. The major issue is how to gee started defining the forms into which knowledge is to be cast.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "LANGUAGE AS A KNOWLEDGE ENGINEERING TOOL",
"sec_num": null
},
{
"text": "We have found it an effect/ve technique tO begin this procem by recording statements made by task experts on tape, and transcribing these to fairly natural En~)i~. When enough recording has been done, the statements begin to take on recognizable patterns. It is then pom/ble to build a formal grammar for much of the relevant utterances, using linguistic engineering techniques such as semantic grammars The symbols of this grammar and the task specific vocabulary provide convenient points for defining formal sub-structures, which are pieced together to define a complete symbolic representation. Once the grammar is reasonably well-defined, the mapping to symbolic representation can be carried out with mapping tenhniques such as the f-structure constraints of lexical-fuactioaal grammar.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "LANGUAGE AS A KNOWLEDGE ENGINEERING TOOL",
"sec_num": null
},
{
"text": "Up to this point, we can imagine that the entire task has been carried out on paper, or some machine-readable equivalent. Even in such a rudimentary form, the exercise is useful, because it provides a conveniently formal documentation for the knowledge representation decisions that have been made. However, it is also the case that these formal definitions, if appropriately constructed, provide all that is necessary to construct a problem specific interface for acquiring utterantes expressed in this sublanguage. In fact, the idea of using this technique to build acquisition interfaces, using INGLISH, actually occurred as a result of wondering what to do with a grammar we had constructed simply in order to document our representation structures (Freiling et al. 1984 ).",
"cite_spans": [
{
"start": 753,
"end": 774,
"text": "(Freiling et al. 1984",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "LANGUAGE AS A KNOWLEDGE ENGINEERING TOOL",
"sec_num": null
},
{
"text": "We do not intend to imply that it is possible in complex knowledge based system applications to simply build a gram. mar and immediately begin acquirin~ knowledge. Often the process leading to construction of the grammar can be quite complex. In our case, it even involved building a simple prototype troubleshooting system before we had gained sufficient confidence in our representation structures to attempt a knowledge acquis/tion interface.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "LANGUAGE AS A KNOWLEDGE ENGINEERING TOOL",
"sec_num": null
},
{
"text": "Nor do we intend to claim that all the knowledge necessary to build a complete expert system need be computed in this fashion. Systems such as INKA can be justified on an economic bash if they make pom/ble only the transfer of a ~'~ nificam fraction of the relevant knowledge.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "LANGUAGE AS A KNOWLEDGE ENGINEERING TOOL",
"sec_num": null
},
{
"text": "The knowledge acquisition language developed for electron/c devine troubleshooting is called GLIB (General Language for Insumneat Behavior), and is aimed primarily at describing observations of the static and dynamic behavior of electrical signals as measured with oscilloscopes, voltmeters, and other standard electronic test instruments (Freiling et al. 1984) . The grammatical structure of GLIB is that of a semantic grammar, where non-terminal symbols represent units of interest to the problem domain rather than recognizable linguistic categories.",
"cite_spans": [
{
"start": 339,
"end": 361,
"text": "(Freiling et al. 1984)",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "GLIB -A PROBLEM SPECHrIC SUBLANGUAGE",
"sec_num": null
},
{
"text": "This semantic grammar formalism is an important part of the DETEKTR methodology because the construction of semantic grammars is a technique that is easily learned by the apprentice knowledge engineer. It also ma~es possible the establishment of very strong constraints on the formal language developed by this process. Two of the design constraints we find it advisable to impose are that the language be unambiguous (in the formal sense of a unique derivation for each legal sentence) and that it be context-free. These constraints, as will be seen, make pom/ble features of the interface which cannot normally be delivered in other contexts, such as menus from which to select all legal next terminal tokens. While increasing complexity of the acquisition sublanguage may make these goals unfeas/ble past a certain point, in simple systems they are features to be cherished. Figure I shows a fragment of the GLIB grammar. In the DETEKTR version of INKA, sentences in this language are accepted, and mapped into Proiog terms for proceming by a Prolog based diagnostic inference engine. At present, the eric/ration is unguided: responsibility res/des with the user to ensure that all relevant statements are generated. We are still studying the issues involved ia determining completeness of a knowledge base and assimilating new knowledge. One outcome of these studies should be means of guiding the user to areas of the knowledge base that are incomplete and warrant further elaboration. Future enhancements to the system will include explanation and modification facilities, so that knowledge may be added or changed after testing the inference engine.",
"cite_spans": [],
"ref_spans": [
{
"start": 878,
"end": 886,
"text": "Figure I",
"ref_id": null
}
],
"eq_spans": [],
"section": "GLIB -A PROBLEM SPECHrIC SUBLANGUAGE",
"sec_num": null
},
{
"text": "INGLISH -INterface enGLISH (Ph/Ilips & Nicholl, 1984) -allows a user to create sentences either by menu selection, by typing, or by a mixture of the two. This allows the self-paced transition from menu-driven to a typed mode of interact/on. In-line help is available. To assist the v/pist, automatic spelling correction, word completion, and automatic phrase completion are provided. INGLISH constrains users to create statements within a subset of English, here GLIB.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "THE NATURAL LANGUAGE INTERFACE DESIGN",
"sec_num": null
},
{
"text": "A statement can be entered as a sequence of menuselections using only the mouse. A mouse-click brings up a menu of words and phrases that are valid extensions of the Figure 1 : A fragment of GLIB current sentence fragment. Once a selection is made from the menu using the mouse, the fragment is extended. This sequence can be repeated until the sentence is completed. Creating a sentence in this manner compares with the NLMENU system (Tennant etal., 1983) . Unlike NLMENU, keyboard entry is also possible with IHGLISH. Gilfoil (1982) found that users prefer a command form of entry to menudriven dialogue as their experience increases. When typing, a user who is unsure of the coverage can invoke a menu, either by a mouse-click or by typing a second space character, to find out what INGLISH expects next without aborting the current statement. Similarly, any unacceptable word causes the menu to appear, giving immediate feedback of a deviation and suggestions for correct continuation. A choice from the menu can be typed or selected u~ng the mouse. |NGLISH in fact allows all actions to be performed from the keyboard or with the mouse and for them to be freely intermingled. As only valid words are accepted, all completed sentences are wellformed and can be translated into the internal representation. Figure 5 , in the \"INGLISH\" window, shows a complete sentence and its translation, and a partial sentence with a menu of continuations. The numbers associated with each menu item provide a shorthand for entry, i.e., \"~12\" can be typed instead of \"RESISTANCE\". As menu entries can be phrases, this can save significant typing effort.",
"cite_spans": [
{
"start": 435,
"end": 456,
"text": "(Tennant etal., 1983)",
"ref_id": null
},
{
"start": 520,
"end": 534,
"text": "Gilfoil (1982)",
"ref_id": "BIBREF7"
}
],
"ref_spans": [
{
"start": 166,
"end": 174,
"text": "Figure 1",
"ref_id": null
},
{
"start": 1310,
"end": 1318,
"text": "Figure 5",
"ref_id": null
}
],
"eq_spans": [],
"section": "THE NATURAL LANGUAGE INTERFACE DESIGN",
"sec_num": null
},
{
"text": "Input is processed on a word-by-word basis. Single spaces and punctuation characters serve as word terminators. Words are echoed as typed and overwritten in uppercase when accepted. Thus, if lowercase is used for typing, the progress of the sentence is easily followed. An invalid entry remains visible along with the menu of acceptable continuations then is replaced when a selection is made.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "THE NATURAL LANGUAGE INTERFACE DESIGN",
"sec_num": null
},
{
"text": "The spelling corrector (a Smalltalk system routine is used) only corrects to words that would be acceptable in the current syntactic/semantic context. As Carbonell and Hayes (1983) point out, this is more efficient and accurate than attempting to correct against the whole application dictionary.",
"cite_spans": [
{
"start": 154,
"end": 180,
"text": "Carbonell and Hayes (1983)",
"ref_id": "BIBREF2"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "THE NATURAL LANGUAGE INTERFACE DESIGN",
"sec_num": null
},
{
"text": "Word completion is provided with the \"escape\" character (cf. DEC, 1971) . When this is used, INGLISH attempts to complete the word on the basis of the characters so far typed. If there are several possibilities, they are displayed in a menu.",
"cite_spans": [
{
"start": 61,
"end": 71,
"text": "DEC, 1971)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "THE NATURAL LANGUAGE INTERFACE DESIGN",
"sec_num": null
},
{
"text": "Automatic phrase completion occurs whenever the context permits no choice. The completion will extend as far as poss/ble In an extreme case a dngle word could yield a whole sentence! The system will \"soak-up\" any words in the completion that have also been typed.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "THE NATURAL LANGUAGE INTERFACE DESIGN",
"sec_num": null
},
{
"text": "The spelling cot'rector and automatic phrase completion can interact in a disturbing manner. Any word that is outside the coverage will be treated ~s an error and an attempt will be made to correct it. If there [s a viable correction, it will be made. Should phrase completion then be possible, a portion of a sentence could be constructed that is quite different from the one intended by the user. Such behavior will probably be less evident in large gramman. Nevertheless, it may be necessary to have a \"cautious\" and \"trusting\" mode, as in Interlisp's DWIM (Xerox, 1983) , for users who resent the precocious impat/ence of the interface.",
"cite_spans": [
{
"start": 560,
"end": 573,
"text": "(Xerox, 1983)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "THE NATURAL LANGUAGE INTERFACE DESIGN",
"sec_num": null
},
{
"text": "The system does not support anaphora, and ellipsis is offe:ed indirectly. The interface has two modes: \"ENTRY\" and \"EDIT\" (Figure 5 ). These are selected by clicking the mouse while in the pane at the top right of the interface window. Rules are normally entered in the Enter mode. When in Edit mode, the window gives access to the SmalltaLk editor. This allows any text in the window to be modified to create a new statement. After editing, a menu command is used to pass the sentence to the paner as if it were being typed. Any errc;\" in the constructed sentence causes a remedial menu to be displayed and the tail of the edited sentence to be thrown away.",
"cite_spans": [],
"ref_spans": [
{
"start": 122,
"end": 131,
"text": "(Figure 5",
"ref_id": null
}
],
"eq_spans": [],
"section": "THE NATURAL LANGUAGE INTERFACE DESIGN",
"sec_num": null
},
{
"text": "The 1HGLISH interface alleviates the problem of linguistic coverage for designers and users of natural language interfaces. A natural language interface user composes his entries bearing in mind a model of the interface's capabilities. If his model is not accurate, his interactions will be error-prone. He may excerd the coverage of the system and have his entry rejected. If this happens frequently, use of the interface may be abandoned in frustration. On the other hand he may form an overly conservative model of the system and fail to ur~ize the full capabifities of the interface (Tennant, 1980) . An interface designer is confronted by many linguistic phenomena, e.g., noun groups, retative rlauses, ambiguity, reference, ellipsis, anaphora, and paraphrases. On account of performance requirements or on a lack of a theoretical understanding, many of these constructions will not be in the interface. INGLISH allows designers to rest more comfortably with the compromises they have made, knowing that users can systematically discover the coverage of the interface.",
"cite_spans": [
{
"start": 587,
"end": 602,
"text": "(Tennant, 1980)",
"ref_id": "BIBREF17"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "THE NATURAL LANGUAGE INTERFACE DESIGN",
"sec_num": null
},
{
"text": "INGLISH parses incrementally from left to right and performs all checking on each word as it is entered. The parser follows the Left-Corner Algorithm (Gr/ffiths & Petrick, 1965) , modified to a pseudo-parallel format so that it can follow all parses simultaneously (Phillips, 1984) . Th/s algorithm builds phrases bottom-up from the left-comer, i.e., rules are selected by the first symbol of their r/ght-hand-s/des. For example, given a phrase initial category e, a rule of the form X --e -will be chosen. The remaining rule segments of the right-hand s/de are predictions about the structure of the remainder of the phrase and are processed left-to-right. Subsequent inputs will directly match success/ve rule segments ff the latter are term/aal symbols of the grammar. When a non-terminal symbol is encountered, a subparse is initiated. The subparse is also constructed bottom-up from the left-corner, following the rule selection process just described. When an embedded rule is completed, the phrase formed may have the structure of the non-terminal category that or/ginated the subparse and so complete the subparse. If there is no match, it will become the left-corner of a phrase that will eventually match the originating category.",
"cite_spans": [
{
"start": 150,
"end": 177,
"text": "(Gr/ffiths & Petrick, 1965)",
"ref_id": null
},
{
"start": 265,
"end": 281,
"text": "(Phillips, 1984)",
"ref_id": "BIBREF16"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "THE IMPLEMENTATION OF INGLISH",
"sec_num": null
},
{
"text": "The parser includes a Re,whabiliry Mmriz (Griffiths & Petrick, 1965) to provide top-down filtering of rule selection. The mntrix indicates when a category A can have a category B as a left-most descendant in a passe tree. The matrix is static and can be derived from the grammar in advance of any pan. ing. It is computable as the transitive closure under multiplication of the boolean matrix of left daughters of non-terminal categories in the grammar. It is used as a further constraint on rule selection. For example, when the goal is to construct a sentence and the category of the lust word of input is e, then rule selection, giving X -c --, will also be constrained to have the property S * X --The filtering is applicable whenever a rule is selected: during subparses the constraint is to reach the category originating the subparse.",
"cite_spans": [
{
"start": 41,
"end": 68,
"text": "(Griffiths & Petrick, 1965)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "THE IMPLEMENTATION OF INGLISH",
"sec_num": null
},
{
"text": "A semantic grammar formalism is used in INGLISH, which make the grammar application dependent. As was mentioned earlier, this format was independently chosen as pan of the knowledge engineering methodology for describing the avplication domain. The rationale for the choice for INGLISH was that the simultaneous syntactic and semantic checking assists in achieving real-time processing. A fragment of the grammar is shown in Figure 1 .",
"cite_spans": [],
"ref_spans": [
{
"start": 425,
"end": 433,
"text": "Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "THE IMPLEMENTATION OF INGLISH",
"sec_num": null
},
{
"text": "Pre-processing on the grammar coasu'uc:s the terminal and non-terminal vocabularies of the grammar, the reachabllity matrix, and an inverse dictionary. The set of all possible initia/ words and phrases for sentences can also be precomputed.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "THE IMPLEMENTATION OF INGLISH",
"sec_num": null
},
{
"text": "The Smafltalk system contnin~ controllers that manage activity on a variety of input devices and from these a controller was readily constructed\" to coordinate mouse and key-",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "THE IMPLEMENTATION OF INGLISH",
"sec_num": null
},
{
"text": "\u2022 Smalltalk is an object-oriented language. Instead of creating a procedure that controls system operation, the user creates an object (usually a data structure), and a set of methods (operations that transform, and communicate with the object). Smalitalk programs create objects or send messages to other objects. Once received, messages result in the execution of a method.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "THE IMPLEMENTATION OF INGLISH",
"sec_num": null
},
{
"text": "Programmers do not create each object and its methods individually. Instead, classes of objects are de-board activity in INGLISH. Either form of entry increments an intermediate buffer which is inspected by the parser. When a complete word is found in the buffer it is parsed.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "THE IMPLEMENTATION OF INGLISH",
"sec_num": null
},
{
"text": "Every phra~ in an on-going analys/s is contained in a Smalltalk object. The final parse is a tree of objects. The intermediate state of a parse is represented by a set of objects containing partially instantiated phrases. After the first word has established an initial set of phrase objects, they are Dolled by the pa~er for their next segments. From these and the rever~; dictionary, a \"lookahead dictionary\" is estabfished that assoc/ates expected words with the phrasal objects that would accept them. Using this dictionary an incoming word will only be sent to those ob~'ts that will accept it. If the word in not in the set of expected words, the dict/onary keys sre used to attempt spelling correction and, iI correction fails, to make the menu to be displayed. If the dictionary contains only a single word, this indicates that automatic phrase completion should take place. A new lookahead dictionary is then formed from the updated phrase objects, and so On.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "THE IMPLEMENTATION OF INGLISH",
"sec_num": null
},
{
"text": "The internal form of a diagnostic role is a clause in Prolog. Sentences are translated using functional stigmata, as in lexicai-functioaal grammar. The functional schemata are attached to the phrase structure rules of GLIB ( Figure 2 ). Unlike lex/cal-functional grammar, the schemata do not set up constraint equations as the interface and the semant/c grammar ensure the well-formedne~ and unamhigu/ty of the sentence. As a result, propagation of functional structure is handled very quickly in a post-proce~ng step since the appficable grammatica/ rules have already been chosen by the parsing process. Further, by restricting the input to strictly prescribed sublanguage GLIB, not Engl~h in general, the Ur~n~Intioa process is s/mplified. fined. A clam definition describes an object and the methods that it understands. Classes are structured h/erarehically, and any class automaticaUy /nherits methods from its superclass.",
"cite_spans": [],
"ref_spans": [
{
"start": 225,
"end": 233,
"text": "Figure 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "KNOWLEDGE TRANSLATION",
"sec_num": null
},
{
"text": "As a result of this hierarchy and code inher/tance, applications may be wr/tten by adap~ng previously con-\u2022 strutted code to the ~k at hand. Much of the appUcat/on code can be inherited from prev/ously defined SmaIitalk code. The programmer need only redefine differences by overriding the inappropriate code with custom/zed code. (Alexander & Freiling, 1985) .",
"cite_spans": [
{
"start": 331,
"end": 359,
"text": "(Alexander & Freiling, 1985)",
"ref_id": "BIBREF0"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "KNOWLEDGE TRANSLATION",
"sec_num": null
},
{
"text": "The parser constzvcts a par~ tree with attached schemata, referred to as a constituent-structure, or c-structure. Translation proceeds by instantiatinS the meta-vatiablns of the schemata of the c-structm~ created by INGLISH to form functional equations which ate solved to produce a functional structure (f-~e).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "KNOWLEDGE TRANSLATION",
"sec_num": null
},
{
"text": "The final rule form is obtained from the fstructure of the sentence when its sub.structures are recursively trandormed according to the contents of each f-structure.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "KNOWLEDGE TRANSLATION",
"sec_num": null
},
{
"text": "As an example, given the lexical-functioaal form of the semantic grammar in Figure 2 and the following sentence: IF LED-2 IS ON THEN TRANSISTOR-17 HAS FAILED the' c-structure in Figure 3 would be produced. This shows that a rule has a condition part, COND, and a conclus/on part, CNCL, that should become a clausal-form ~Ule(COND, CNCL). ~ The meta-symbol t refers to the parent node and t to the node to which the schema is attached.",
"cite_spans": [],
"ref_spans": [
{
"start": 76,
"end": 84,
"text": "Figure 2",
"ref_id": null
},
{
"start": 178,
"end": 186,
"text": "Figure 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "KNOWLEDGE TRANSLATION",
"sec_num": null
},
{
"text": "The final phase of INKA interprets the f-structures to produce Pmlog clauses. All of the information required to produce the clauses is contained in the FORM property in this example. The FORM property is printed, with all variables instantiated, to produce the f'mal rule in the form of a Prolog clause. The f-strucntre of Figure 4 produces the Prolog clause rule(state(led-2, on), ~tatus(transistor-17, failed)",
"cite_spans": [],
"ref_spans": [
{
"start": 324,
"end": 332,
"text": "Figure 4",
"ref_id": "FIGREF2"
}
],
"eq_spans": [],
"section": "KNOWLEDGE TRANSLATION",
"sec_num": null
},
{
"text": "Translated rules are sent to a diagnostic engine that has been implemented ia Pmiog. The diagnosdc engine uses GLIB statements about the hierarchical structure of the device to build a strategy for successive localization of failures. Starting at the highest level ('the circuit\" in GLIB terminology), The functional specifications of the example may be solved by instantiating the recta-symbols with actual nodes and assigning properties and values to the nodes according to the specifications. In the example given, most specifications are of the form \"(t pmpert'y)=value\" where \"value\" is most often *. This form indicates that the node graphically indicated by t in \u2022 the c-structure is the specified property of the parent node (pointed to by *). Specifications are left-= _~:o\u00a2_ lative and have a functional semantic interpretation. A specification of (t COND FORM) refers to the FORM property of the parent node's COND property. The f-~mcture for the example is given in Figure 4 .",
"cite_spans": [],
"ref_spans": [
{
"start": 978,
"end": 986,
"text": "Figure 4",
"ref_id": "FIGREF2"
}
],
"eq_spans": [],
"section": "KNOWLEDGE USE",
"sec_num": null
},
{
"text": "in question. If no specific determination can be made, the sub-circuit is a.mumed to be functioning properly.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "KNOWLEDGE USE",
"sec_num": null
},
{
"text": "A sample session including acquisition of a rule and atoning of a test diagnosis is shown in Figure 5 . The circuit used in this example consists of an oscillator wh/ch drives a light emitting diode (LED-2 in the schematic) and a power supply (LED-1 indicates when the power supply is on). The schematic diagram of the circuit is in the upper pane of the \"Insu'ument Data\" window; the circuit board layout is in the lower pane. Rules for diagnosing problems in the circuit has_cemponent(block(circult), block(oscillator(1))). has_component(block(c/rcuit), block(powetlupply(1))).",
"cite_spans": [],
"ref_spans": [
{
"start": 93,
"end": 101,
"text": "Figure 5",
"ref_id": null
}
],
"eq_spans": [],
"section": "KNOWLEDGE USE",
"sec_num": null
},
{
"text": "| IND led-2 COND[ STATE on [ FORM <sta~(O IND FORM), (t STATE FORM))> CNCL [ DEV tr~i,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "KNOWLEDGE USE",
"sec_num": null
},
{
"text": "RESISTOR-1 IS PART OF OSCILLATOR-1. has.xomponent(block(o~-fllator(I)), component(resistor(l))).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "KNOWLEDGE USE",
"sec_num": null
},
{
"text": "IF LED-2 IS NOT FLASHING AND THE VOLTAGE OF NODE-2 IS EQUAL TO 15 VOLTS THEN OSCILLATOR-1 HAS FAILED. rule (and(not(state(led(2) ",
"cite_spans": [
{
"start": 107,
"end": 128,
"text": "(and(not(state(led(2)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "KNOWLEDGE USE",
"sec_num": null
},
{
"text": "Informal observations show that subjects generally need only a few minutes of instruction to start using INGLISH. Initially there is a preference to tt~ the mouse to explore the coverage and then to begin to incorporate some typing. We have not had any long-term use~ to observe their trends.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "DISCUSSION",
"sec_num": null
},
{
"text": "Use~ could react negatively to limited language systems; even when the coverage is well-engineered users will occasionally encounter the boundaries. Fortunately, Headier & Michaelis (1983) found that subjects were able to adapt to limited language systems.",
"cite_spans": [
{
"start": 162,
"end": 188,
"text": "Headier & Michaelis (1983)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "DISCUSSION",
"sec_num": null
},
{
"text": "INGLISH does not let the designer off the hookl A umr can still have a statement in mind and not easily f'md a way to expre~ it through the grammar. Diligent engineering is still needed to prepare a grammar that will allow a user to be guided to a paraphrase of his or/ginal thoughL Nevertheless, the grammar design problem is simplified: when guidance is provided fewer paraphrases need be incorporated.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "DISCUSSION",
"sec_num": null
},
{
"text": "The use of a semantic grammar to define the fragment of English to be processed does impose limitations on the complexity of acceptable input. In the INKA system as it is currently cen.mxtcted, however, them are two distinct ways in which the semantic correctness of an input can be enforced, tint in the parsing of the of the semantically ceRstralned grammar, and second in the tran.qat/on process, as the ftmcdonal structures are built.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "DISCUSSION",
"sec_num": null
},
{
"text": "In short, the our approach to building practical natural language inte~.-ees does not depend on a semantic grammar to \u00a2oastra/n input. In the future we intend to explore the u~ of a wider class of grammars that include a domain-independent kernel and a domain-specific component, like GLIB. In this approach we are in substantial agreement with Winograd (1984) who advocates a similar approach as an effective diroc. finn for further naturul language resea~h.",
"cite_spans": [
{
"start": 345,
"end": 360,
"text": "Winograd (1984)",
"ref_id": "BIBREF19"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "DISCUSSION",
"sec_num": null
}
],
"back_matter": [
{
"text": "Entry IF NODE 4 VOLTAGE IS EQUAL TO NODE 5 VOLTAGE THEN RESISTOR 2 HAS FAILED . \"PARSED rula(comp(aq.voltage(nods(4) ).voltags(nods(5 ))).status(componsnt(r ssistor(2))0 f ailed),-) IF lOWER SURLY 1.CURRENT ( ('troubleshooting\" rules) are added to the system in the window labeled \"INGLISH.\" The interface to the diagnnszi\u00a2 engine is in the \"Prolog\" window. The \"INGLISII\" window shows a recently added rule, with its Prolog translation immediately below it. It also shows a partially completed rule along with a menu of acceptable sentence continuations. The user may select one of the menu items (either a word or phrase) to be appendcd to the current sentence. The \"Pmlog\" window displays the results of a recent test diagnosis. This test was run after the first rule in the ~NGLISH\" window was added, but before the addition of the second rule was begun. The last question asked during the diagnosis corresponds to the first rule. Resistor 2, in both the schematic and board diagrams of the =Instrument Data\" window, is highlighted as a result of running the diagnos/s: whenever the diagnnstic engine selects a specific component for consideration that component is highlighted on the display. Some 20 statements and rules have been collected '.'or diagnosing the circuit; Figure 6 lists a portion of them with their Prolog translation.",
"cite_spans": [
{
"start": 80,
"end": 116,
"text": "\"PARSED rula(comp(aq.voltage(nods(4)",
"ref_id": null
}
],
"ref_spans": [
{
"start": 1277,
"end": 1285,
"text": "Figure 6",
"ref_id": null
}
],
"eq_spans": [],
"section": "GUll Knowledge Acquisition",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Building an Expert System in SmalRalk-80 (R)",
"authors": [
{
"first": "J",
"middle": [
"H"
],
"last": "Alexander",
"suffix": ""
},
{
"first": "M",
"middle": [
"J"
],
"last": "Freiling",
"suffix": ""
}
],
"year": 1985,
"venue": "Systems and Software",
"volume": "4",
"issue": "",
"pages": "111--118",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Alexander, J.H., & Freiling, MJ. Building an Expert System in SmalRalk-80 (R). Systems and Software, 1985, 4, 111-118,",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Efficient Expert System Development Through Domain-Specific Tools",
"authors": [
{
"first": "J",
"middle": [
"H"
],
"last": "Alexander",
"suffix": ""
},
{
"first": "M",
"middle": [
"J"
],
"last": "Freiling",
"suffix": ""
},
{
"first": "S",
"middle": [
"L"
],
"last": "Messick",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Reh/Uss",
"suffix": ""
}
],
"year": 1976,
"venue": "Semamic Grammar: los Eng~ncering Tecb, ni~ for Consmac:ing Natural lamgaage UnderstmTding System.v",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Alexander, J.H., Freiling, MJ., Messick, S.L., & Reh/uss, S. Efficient Expert System Development Through Domain- Specific Tools. Proceedings of the F~fth International WorkJhop on Expert Systems and their Applications, Avignon, France, Burton, R.R. Semamic Grammar: los Eng~ncering Tecb, ni~ for Consmac:ing Natural lamgaage UnderstmTding System.v (Techni. caJ Report No. 3453). Cambridge, MA: Bolt, Beranek, & Newman Inc., 1976.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Recovery Strate~es for Parsing Extragrammatical Language",
"authors": [
{
"first": "J",
"middle": [
"G"
],
"last": "Carbonell",
"suffix": ""
},
{
"first": "P",
"middle": [
"J"
],
"last": "Hayes",
"suffix": ""
}
],
"year": 1983,
"venue": "American Journal of Computational Linguimics",
"volume": "",
"issue": "",
"pages": "3--4",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Carbonell, J.G., & Hayes, PJ. Recovery Strate~es for Pars- ing Extragrammatical Language. American Journal of Computa- tional Linguimics, 1983, 3-4, 123.146.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Interactive Transfer of Expertise: Acquisition of New Inference Rules",
"authors": [
{
"first": "R",
"middle": [],
"last": "Davis",
"suffix": ""
}
],
"year": 1977,
"venue": "Proceedings of the Fifth International Joint Colrference on Art~iciai intelligence",
"volume": "",
"issue": "",
"pages": "321--328",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Davis, R. Interactive Transfer of Expertise: Acquisition of New Inference Rules. Proceedings of the Fifth International Joint Colrference on Art~iciai intelligence, Cambridge, MA, 1977, 321-328.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "TOPS-20 Reference MammL Maynard, MAt Digital Equipment Corporation",
"authors": [],
"year": 1971,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "TOPS-20 Reference MammL Maynard, MAt Digital Equipment Corporation, 1971.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Diagrams and Grammar: Tools for the Mass Production of Expert Systems",
"authors": [
{
"first": "M",
"middle": [
"J"
],
"last": "Freiling",
"suffix": ""
},
{
"first": "J",
"middle": [
"H"
],
"last": "Alexander",
"suffix": ""
}
],
"year": 1984,
"venue": "1EEE First Conference on Ar~ficial Intelligence Applications",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Freiling, MJ., & Alexander, J.H. Diagrams and Grammar: Tools for the Mass Production of Expert Systems. 1EEE First Conference on Ar~ficial Intelligence Applications. Denver, Colorado, 1984.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "GL/B -A LAnguage for gepreeentmg the Behavior of Electronic Devices",
"authors": [
{
"first": "M",
"middle": [],
"last": "Freiiing",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Alexander",
"suffix": ""
},
{
"first": "D",
"middle": [],
"last": "Feucht",
"suffix": ""
},
{
"first": "D",
"middle": [],
"last": "Stubbs",
"suffix": ""
}
],
"year": 1984,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Freiiing, M., Alexander, J., Feucht, D., & Stubbs, D. GL/B - A LAnguage for gepreeentmg the Behavior of Electronic Devices (Technical Report CR-&t-12). Beaverton, OR: Tektronix, Inc., 1984.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Warming up to Computers: A Study of Cognifive and Affective Interaction over Time",
"authors": [
{
"first": "D",
"middle": [
"M"
],
"last": "Gilfoil",
"suffix": ""
}
],
"year": 1982,
"venue": "Proceedings of the Haman Fncterx in Computer 5y~ema Conference",
"volume": "",
"issue": "",
"pages": "245--250",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Gilfoil, D.M. Warming up to Computers: A Study of Cogni- five and Affective Interaction over Time. Proceedings of the Haman Fncterx in Computer 5y~ema Conference, Gaithersburg, MD, 1982, 245-250.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Smalltaik 80: The l,a~guage and its lmpiemamtmiom",
"authors": [
{
"first": "A",
"middle": [],
"last": "Goldberg",
"suffix": ""
},
{
"first": "D",
"middle": [],
"last": "Robson",
"suffix": ""
}
],
"year": 1983,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Goldberg, A. & Robson, D. Smalltaik 80: The l,a~guage and its lmpiemamtmiom. Re-dlng, MA: Addison-Wesley, 1983.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "On the relative efficiency of coatext.free grammar recoe",
"authors": [
{
"first": "T",
"middle": [],
"last": "Griffiths",
"suffix": ""
},
{
"first": "$",
"middle": [
"R"
],
"last": "Petr/Ck",
"suffix": ""
}
],
"year": 1965,
"venue": "Comm. ACM",
"volume": "8",
"issue": "",
"pages": "289--300",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Griffiths, T., & Petr/ck, $.R. \"On the relative efficiency of coatext.free grammar recoe, niT~ru. \u00b0 Comm. ACM, 1965, 8, 289-300.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "The Effects of Limited Grammar on Interactive Natural Language",
"authors": [
{
"first": "J",
"middle": [
"A"
],
"last": "Headier",
"suffix": ""
},
{
"first": "P",
"middle": [
"R"
],
"last": "Michnefis",
"suffix": ""
}
],
"year": null,
"venue": "ProceEdings of tha Human Factors in Computer Systems Conference",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Headier, J.A., & Michnefis, P.R. The Effects of Limited Grammar on Interactive Natural Language. ProceEdings of tha Human Factors in Computer Systems Conference, Bo~a, MA, 1983, 190.192.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Lex/cal-Funct/onal Grammar:. A Formal System for Grammatical Representat/oa",
"authors": [
{
"first": "R",
"middle": [
"M"
],
"last": "Kaplan",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Bre",
"suffix": ""
},
{
"first": "J",
"middle": [
"W"
],
"last": "Mnn",
"suffix": ""
}
],
"year": null,
"venue": "T~ Ment~ Representation of Or~ Rein",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kaplan, R.M., & Bre, mnn, J.W. Lex/cal-Funct/onal Grammar:. A Formal System for Grammatical Representat/oa. In J. Brecmm (Ed.), T~ Ment~ Representation of Or~ Rein.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Natural Language for Expert Sy~ems: Cornpar/son with databa~ systems",
"authors": [
{
"first": "K",
"middle": [
"R"
],
"last": "Mckeowa",
"suffix": ""
}
],
"year": 1984,
"venue": "Proceedings of tha International Conference on Computational l, in~rics",
"volume": "",
"issue": "",
"pages": "190--193",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "McKeowa, K.R. Natural Language for Expert Sy~ems: Corn- par/son with databa~ systems. Proceedings of tha International Conference on Computational l, in~rics, Stanford, CA, 1984, 190-193.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Aa Ob~'t-or/ented Parser",
"authors": [
{
"first": "B",
"middle": [],
"last": "Phillips",
"suffix": ""
}
],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Phillips, B. Aa Ob~'t-or/ented Parser. la B.G. Barn & G.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Computational Models of Natara~ Langaage Pro. \u00a2Lu/nz",
"authors": [
{
"first": "",
"middle": [],
"last": "Gnida",
"suffix": ""
}
],
"year": 1984,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Gnida (Eds.), Computational Models of Natara~ Langaage Pro. \u00a2Lu/nz. Amsterdam: North-Holland, 1984.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "INGUSH: A Nanwal Language Inter. face (Techn/cal Report CR-84-27)",
"authors": [
{
"first": "B",
"middle": [],
"last": "Phillips",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Nichoh",
"suffix": ""
}
],
"year": 1984,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Phillips, B., & NichoH, S. INGUSH: A Nanwal Language Inter. face (Techn/cal Report CR-84-27). Beaverton, OR: Tek- tronix, Inc., 1984.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Evaluation of Natural Language Processors",
"authors": [
{
"first": "H",
"middle": [
"R"
],
"last": "Tennant",
"suffix": ""
}
],
"year": 1980,
"venue": "Coordinated S\u00a2/eace Laboratory",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Tennant, H.R. Evaluation of Natural Language Processors (Technical Report 1\"-103). Coordinated S\u00a2/eace Laboratory, University of Illinois, Urbana, IL, 1980.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Usable Natural Language Interfaces Through Menu-Based Namra/ Language Understanding",
"authors": [
{
"first": "H",
"middle": [
"R"
],
"last": "Tennaat",
"suffix": ""
},
{
"first": "K",
"middle": [
"M"
],
"last": "Ross",
"suffix": ""
},
{
"first": "C",
"middle": [
"W"
],
"last": "Thompson",
"suffix": ""
}
],
"year": 1983,
"venue": "Proceedings of the Human Factors in Computer ~, ystem.t Conference",
"volume": "",
"issue": "",
"pages": "190--192",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Tennaat, H.R., Ross, K.M., & Thompson, C.W. Usable Natural Language Interfaces Through Menu-Based Namra/ Language Understanding. Proceedings of the Human Factors in Computer ~, , ystem.t Conference, Boston, MA, 1983, 190-192.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Center for the Study of Language and laformat/an",
"authors": [
{
"first": "T",
"middle": [],
"last": "Winograd",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Mov",
"suffix": ""
}
],
"year": 1984,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Winograd, T. Mov/ng the Semans/\u00a2 Fu/o'um (Techn/cal Report 84-17). Center for the Study of Language and laformat/an, Stanford, CA, 1984.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"type_str": "figure",
"uris": null,
"text": "<conclus/on>--> <device> HAS FAILED Figure 2: GL/B rules with attached schemata",
"num": null
},
"FIGREF1": {
"type_str": "figure",
"uris": null,
"text": "named sub-cimults are examined in turn, and diagnostic rules retrieved to determine correctness or failure of the sub-",
"num": null
},
"FIGREF2": {
"type_str": "figure",
"uris": null,
"text": "\". F-structure THE CIRCUIT CONTAINS OSCILLATOR-1 AND POWERSUPPLY-1.",
"num": null
},
"FIGREF3": {
"type_str": "figure",
"uris": null,
"text": ", flashing))), comp(voltage(node(2)), If)), status(block(oscillator(I)), fa/led), []). IIF [..,ED-,1 IS DIM AND LED-2 IS OFF THEN ~ISTOR-1 HAS FAILED. rule(and(state(led(l), dim), state(led(2), off)), status(component(resistor(1)), failed), []).",
"num": null
},
"FIGREF4": {
"type_str": "figure",
"uris": null,
"text": "GLIB rules with Pmlog translations",
"num": null
}
}
}
} |