File size: 87,900 Bytes
6fa4bc9 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 | {
"paper_id": "P86-1005",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T09:13:01.180430Z"
},
"title": "Semantic Acquisition In TELI: A Transportable, User-Customized Natural Language Processor",
"authors": [
{
"first": "Bruce",
"middle": [
"W"
],
"last": "Ballard",
"suffix": "",
"affiliation": {
"laboratory": "AT&T Bell Laboratories",
"institution": "",
"location": {
"addrLine": "600 Mountain Avenue Murray Hill",
"postCode": "07974",
"region": "NJ"
}
},
"email": ""
},
{
"first": "Douglas",
"middle": [
"E"
],
"last": "Stumberger",
"suffix": "",
"affiliation": {
"laboratory": "AT&T Bell Laboratories",
"institution": "",
"location": {
"addrLine": "600 Mountain Avenue Murray Hill",
"postCode": "07974",
"region": "NJ"
}
},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "We discuss ways of allowing the users of a natural language processor to define, examine, and modify the definitions of any domain-specific words or phrases known to the system. An implementation of this work forms a critical portion of the knowledge acquisition component of our Transportable English-Language Interface (TELl), which answers English questions about tabular (first normal-form) data files and runs on a Symbolics Lisp Machine. However, our techniques enable the design of customization modules that are largely independent of the syntactic and retrieval components of the specific system they supply information to. In addition to its obvious practical value, this area of research is important because it requires careful attention to the formalisms used by a natural language system and to the interactions among the modules based on those formalisms.",
"pdf_parse": {
"paper_id": "P86-1005",
"_pdf_hash": "",
"abstract": [
{
"text": "We discuss ways of allowing the users of a natural language processor to define, examine, and modify the definitions of any domain-specific words or phrases known to the system. An implementation of this work forms a critical portion of the knowledge acquisition component of our Transportable English-Language Interface (TELl), which answers English questions about tabular (first normal-form) data files and runs on a Symbolics Lisp Machine. However, our techniques enable the design of customization modules that are largely independent of the syntactic and retrieval components of the specific system they supply information to. In addition to its obvious practical value, this area of research is important because it requires careful attention to the formalisms used by a natural language system and to the interactions among the modules based on those formalisms.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "In constructing the Transportable English-Language Interface system (TELI). we have sought to respond to problems of both an applied and a scientific nature. Concerning the applied side of computational linguistics, we seek to redress the fact that many natural language prototypes, despite their sophistication and even their robustness, have fallen into disuse because of failures (1) to make known to users exactly what inputs are allowed (e.g. what words and phrases are defined) and (2) to provide capabilities that meet the precise needs of a given user or group of users (e.g. appropriate vocabulary, syntax. and semantics). Since experience has shown that neither users nor svstem designers can predict in advance all the words, phrases, and associated meanings that will arise in accessing a given database (cf. Tennant. 1979) . we have sought to make TELl \"transportable\" in an extreme sense, where customizations may be performed (1) by end users, as opposed to the system designers, and (2) at any time during the processing of English sentences, rather than requiring a complete customization before English processing may occur.",
"cite_spans": [
{
"start": 821,
"end": 835,
"text": "Tennant. 1979)",
"ref_id": "BIBREF17"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1."
},
{
"text": "In addition to the potential practical benefits of a user-customized interface, we feel that wellconceived transportability projects can make useful scientific contributions to computational linguistics since single-domain systems and, to a lesser extent, systems adapted over weeks or months by their designers, afford opportunities to circumvent, rather than squarely address, important issues concerning (a) the precise nature of the formalisms the system is designed around, and (b) the interactions among system modules. Although customization efforts offer no guarantee against ad-hoc design or sloppy implementation, problems of the type mentioned above are less likely to go unnoticed when dealing with a system whose domain-specific information is supplied at run-time, especially when that information is being provided by the actual users of the system. By way of overview, we note that the TELI system derives from previous work on the LDC project, as documented in Ballard (1982) , Ballard (1984) , Ballard, Lusth and Tinkham (1984) . and . The initial prototype of TELI. which runs on a Symbolics Lisp Machine, is designed to answer English questions about information stored in one or more tables, (i.e. firstnormal-form relational database). A sample view of the display screen during a session with TELl. which may give the flavor of how the system operates, is shown in Figure L Information on some aspects of knowledge acquisition not discussed in this paper. particularly with regard to syntactic case frames, can be found in Ballard (1986) .",
"cite_spans": [
{
"start": 978,
"end": 992,
"text": "Ballard (1982)",
"ref_id": "BIBREF1"
},
{
"start": 995,
"end": 1009,
"text": "Ballard (1984)",
"ref_id": "BIBREF2"
},
{
"start": 1012,
"end": 1045,
"text": "Ballard, Lusth and Tinkham (1984)",
"ref_id": "BIBREF4"
},
{
"start": 1546,
"end": 1560,
"text": "Ballard (1986)",
"ref_id": "BIBREF3"
}
],
"ref_spans": [
{
"start": 1388,
"end": 1396,
"text": "Figure L",
"ref_id": null
}
],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1."
},
{
"text": "The syntactic and semantic models adopted for TEL1 are intended to provide a unified treatment of a broad and extendible class of word and phrase types. By providing for an \"extendible\" class of constructs, we make the knowledge acquisition module of TELl independent of the natural language portion of the system, whose earlier version has been described in and Ballard. Lusth. and Tinkham (1984) , In the remainder of this paper, the reader should bear in mind that the acquisition modules of TEL1, including the menus they generate, are driven by extensible data structures that convey the linguistic coverage of the underlying natural language processor (NLP) for which information is being acquired. For example, incorporating adjective phrases into the system involved adding 12 lines of Lisp-like data specifications. This brevity is largely due to the use of case frames that embody dynamically alterable selectional restrictions (Ballard, 1986) .",
"cite_spans": [
{
"start": 363,
"end": 397,
"text": "Ballard. Lusth. and Tinkham (1984)",
"ref_id": "BIBREF4"
},
{
"start": 938,
"end": 953,
"text": "(Ballard, 1986)",
"ref_id": "BIBREF3"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Types of Modifiers Available in TELI",
"sec_num": "2."
},
{
"text": "As an initial feeling for the coverage of the NLP for which information is currently acquired, TEL1 provides semantics for the word categories In addition to these user-defined modifier types, the system currently provides for negation, comparative and superlative forms of adjectives, possessives, and ordinals. Among the grammatical features supported are passives for verbs, reduced relatives for prepositional and adjective phrases, fronting of verb phrase complements, and other minor features. One important area for expansion involves quantifiers. both logical (e.g. \"all\") and numerical (e.g. \"at least 3\").",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Types of Modifiers Available in TELI",
"sec_num": "2."
},
{
"text": "As noted above, our goal is to devise techniques that enable end users of a natural language processor to furnish all domain-specific information to by the system. This information includes (1) the vocabulary needed for the data at hand; (2) various types of selectional restrictions that define acceptable phrase attachments; and most critically (3) the definitions of words and phrases. With this in mind, the primary criteria which the semantic acquisition component of TELI has been designed around are as follows.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Principles Behind Semantic Acquisition",
"sec_num": "3."
},
{
"text": "To allow users to define, examine or modify domainspecific il(ormation at any time. This derives from our beliefs that the needs of a user or group of users cannot all be predicted in advance, and will probably change once the system has begun operation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Principles Behind Semantic Acquisition",
"sec_num": "3."
},
{
"text": "To enable users to impart new concepts to the system. We provide more than just synonym and paraphrase capabilities and, in fact. definitions may be arbitrarily complex, by being defined either (a) in terms of other definitions, which may be defined upon other definitions, or (b) as the conjuction of an arbitrary number of constraints.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Principles Behind Semantic Acquisition",
"sec_num": "3."
},
{
"text": ".hich trails that aren't long lead to a mountain on \u00a3ranconia ridge To provide definition capabilities independent of modifier type. In our system, adjectives, nouns, prepositional phrases, verb phrases, and so forth are all defined in precisely the same way. This is achieved in part by treating all modifiers as n-place predicates.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "English Input:",
"sec_num": null
},
{
"text": "To allow definitions to be given at various conceptual levels. Users are able to specify meanings (a) in English; (b) in terms of the meanings of previously defined words or phrases; (c) by reference to \"conceptual\" relationships, which have been abstracted to a level above that of the physical data files; or (d) in terms of database columns. We strive to minimize the need for low-level database references, since this helps (1) to avoid tedious and redundant references, and (2) to assure that most of our techniques will be applicable beyond the current conventional database setting.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "English Input:",
"sec_num": null
},
{
"text": "To provide alternate modalities of specification. For example, the menu scheme described in Section 7.2 offers the user more assistance in making definitions. but is less powerful, than the alternative English and English-like methods described in Section 7.3. We prefer to let users decide when each modality is appropriate, rather than force a compromise among simplicity, reliability, and power.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "English Input:",
"sec_num": null
},
{
"text": "To enable the system to proride help or guidance to the customizer. When defining a modifier, users may view all current modifiers of. or functions associated with, the object type(s) in question. Many other opportunities exist for co-operation on the part of the system. To avoid unnecessary limitations, however, users are generally able to override any hints made by the system.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "English Input:",
"sec_num": null
},
{
"text": "The semantic model developed for TELI, in which definitions are acquired from users, assumes that (1) modifier meanings will be purely extensional, and can thus be treated as n-place predicates, and (2) semantic analysis will be almost entirely compositional. Concerning the latter assumption, we note that (a) some important disambiguations, including problems of word sense, will have been made during parsing by reference to selectional restrictions , and (b) minimal re-ordering does occur in converting parse trees into internal representations.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Semantic Processing in TELI",
"sec_num": "4."
},
{
"text": "All user-defined semantics, however acquired, are stored in a global Lisp structure indexed by the word or phrase being defined. Single-word modifiers are indexed by the word being defined, its part of speech, and the entity it modifies; phrasal modifiers are indexed by the phrase type and the associated case frame. For example, the internal references (new adj room) (prep-ph (restaurant in county)) respectively index the definitions of \"new\", when used as an adjective modifier of rooms, and \"in\", as it relates restaurants to counties. As suggested by this indexing scheme, word meanings arise only in the context of their occurrence, never in isolation. Thus, \"new room\" and \"restaurant in county\" receive definitions, not \"new\" or \"in\". This decision lends generality to the definitional scheme, and any additional effort thereby needed to make multiple definitions is minimized by the provisions for borrowed meanings, as described in Section 7.4.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Types of Semantics",
"sec_num": "4.1"
},
{
"text": "Although our representation strategies allow for definitions that involve relatively elaborate traversals of the physical data files. TELI does not presently provide for arithmetic computations. Thus, the input \"Which restaurants are within 3 blocks of China Gardens?\" requires a 2-place \"distance\" function and, unless the underlying data files provide distances between restaurants (there are N-squared such distances to account for). the necessary semantics cannot be supplied.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Types of Semantics",
"sec_num": "4.1"
},
{
"text": "As an example of the \"internal representation\" (IR) of an input, which results from a recursive traversal of a completed parse tree, and which illustrates preparations for compositional analysis, the (artificially complex) input ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Internal Representations",
"sec_num": "4.2"
},
{
"text": "= lunch)))))",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Internal Representations",
"sec_num": "4.2"
},
{
"text": "This top-level interpretation of the input instructs the system to find all restaurants that satisfy (a) the negation of the 1-place predicate associated with \"expensive\", and (b) the three 2-place predicates associated with the noun-noun, prepositional, and adjective phrases. Note that modifiers associated with phrasal modifiers are referenced by their case frame, e.g. \"restaurant in city\". Within the scope of these references, case labels (e.g. \"subj\" and \"arg\") indicate which slots have been instantiated and which slot has been relativized, the latter denoted by \"?\". The list of slot names associated with each phrase type is stored globally. In most instances, the argument of a case slot can be an arbitrary IR structure, in keeping with the recursive nature of the English inputs being recognized.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Internal Representations",
"sec_num": "4.2"
},
{
"text": "Since IR structures are built around the word and phrase types of the English being dealt with, and since the meanings of words and phrases are stored globally, IR structures should not be regarded as a \"knowledge representation\" in the sense of KL-ONE, logical form. and so forth. Systems similar in goals to TELI but which revolve around logical form include TEAM (Grosz, 1983; Grosz, Appelt. Martin, and Pereira 1985) , IRUS (Bates and Bobrow, 1983; Bates, Moser, and Stallard 1984) , and TQA (Plath, 1976; Damerau, 1985 (Hafner and Godden. 1985) .",
"cite_spans": [
{
"start": 366,
"end": 379,
"text": "(Grosz, 1983;",
"ref_id": "BIBREF10"
},
{
"start": 380,
"end": 420,
"text": "Grosz, Appelt. Martin, and Pereira 1985)",
"ref_id": null
},
{
"start": 428,
"end": 452,
"text": "(Bates and Bobrow, 1983;",
"ref_id": "BIBREF6"
},
{
"start": 453,
"end": 485,
"text": "Bates, Moser, and Stallard 1984)",
"ref_id": "BIBREF7"
},
{
"start": 496,
"end": 509,
"text": "(Plath, 1976;",
"ref_id": null
},
{
"start": 510,
"end": 523,
"text": "Damerau, 1985",
"ref_id": "BIBREF9"
},
{
"start": 524,
"end": 549,
"text": "(Hafner and Godden. 1985)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Internal Representations",
"sec_num": "4.2"
},
{
"text": "When a user asks TEL1 to begin learning about a new domain, the system spends from five to thirty minutes, depending on the complexity of the application, obtaining basic information about each table in the the database (see Figure 2 ). Users are first asked to give the key column of the table. This information is used primarily to guide the system in inferring the semantics of certain noun-noun and \"of\"based patterns. Next, users are asked which columns contain entity values as opposed to property values. Typical properties are \"size\", \"color\", and \"length\", which differ from entities in that (a) their values do not appear as an argument to arbitrary verbs and prepositions (e.g. other than \"have\", \"with\", etc.) and (b) they will not themselves have properties associated with them. Finally, users are asked to specify the type of value each column contains. This information allows subsequent references to concepts (e.g. \"color\") rather than physical column names. It also aids the system in forming subsequent suggestions to the user (e.g. defaults that can be overridden).",
"cite_spans": [],
"ref_spans": [
{
"start": 225,
"end": 233,
"text": "Figure 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "The Initial Phase of Customization",
"sec_num": "5."
},
{
"text": "Having obtained the information above, the system constructs definitions simple questions to be answered, such as indicated that allow \"What is Sally's social security number?\" \"What is the age of John\" Along with information freely volunteered by the user, these definitions can be subsequently examined or changed at the user's request. Based upon the ans~crs to the questions described above, a small number of follow-up questions, mostly unrelated to the subject of this paper, will be asked. For example, the system will propose its best guess as to the morphological variants of nouns, verbs, and other words for the user to confirm or correct.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Initial Phase of Customization",
"sec_num": "5."
},
{
"text": "Having learned about each physical relation. TELI asks for information which, though not needed immediately, is either (a) more simply obtained at the outset, in a context relevant to its semantics, than at a later, arbitrary point, or (b) acquirable collectivelv. thus preventing several subequent acquisitions. Unlike the initial acquisitions described in Section 5, intermediate customizations could be excised from the system without any loss in processing ability. We now summarize three forms of intermediate customizations, the last of which may be requested by the user at any time. Allowing users to ask for the other forms as well would be a simple matter. First, the system will ask which columns contain values that either correspond to or are themselves English modifiers. In Figure 2 -a, the values 'T' through \"G\" in the \"class\" column might correspond (respectively) to \"freshman\" through \"graduate student\", in which case acquisitions might continue as suggested in Figure 3 . From this information, the system constructs a definition for each user-defined modifier; for example the internal definition of \"sophomore\" will be ((sophomore noun student) ((class p-noun) = 2))",
"cite_spans": [],
"ref_spans": [
{
"start": 789,
"end": 797,
"text": "Figure 2",
"ref_id": null
},
{
"start": 983,
"end": 991,
"text": "Figure 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Intermediate Customizations",
"sec_num": "6."
},
{
"text": "A second intermediate acquisition, carried out subject to user confirmation, involves the acceptability of hypothesized syntax and semantics for (a) phrases based on \"of\", (b) phrases built around \"have\", \"with\". and \"in\", and (c) noun-noun phrases. In deciding what case frames to propose. TELI considers the information it has already acquired about simple functional (\"of\") relationships.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Intermediate Customizations",
"sec_num": "6."
},
{
"text": "A third form of intermediate acquisition involves the system's invitation for the user to give lexical and syntactic information for one or more user-defined categories, namely titles, adjectives. common nouns, noun modifiers, prepositions, and verbs. For example, the user might specify six adjectives and the entities they modify, followed by four or five verbs and their associated case frames. and so forth.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Intermediate Customizations",
"sec_num": "6."
},
{
"text": "In general, definitions are supplied to TELl whenever (a) an undefined modifier is encountered during the processing of an English input, or (b) the user asks to supply or modify a definition. In each case, the same methods are available for making definitions, and are independent of the modifier type being defined.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "On-Line Customization",
"sec_num": "7."
},
{
"text": "When creating or modifying a meaning, users are presented with information as shown in Figure 4 -a; upon asking to \"add a constraint\", they are given the menu shown in Figure 4 -b. Multiple \"constraints\" appearring in a semantic specification are presently presumed to be conjoined. ",
"cite_spans": [],
"ref_spans": [
{
"start": 87,
"end": 95,
"text": "Figure 4",
"ref_id": null
},
{
"start": 168,
"end": 176,
"text": "Figure 4",
"ref_id": null
}
],
"eq_spans": [],
"section": "On-Line Customization",
"sec_num": "7."
},
{
"text": "As suggested in Figure 4 -a and below, definitions are made in terms of sample values, which the system treats as formal parameters. In this way we avoid the problem of defining a phrase two or more of whose case slots may be filled by the same type of entity (cf. \"a student is a classmate of a student if ...\"). To assure that any domain value may appear as a constant, the user is able to alter the system's choice of sample names at any time.",
"cite_spans": [],
"ref_spans": [
{
"start": 16,
"end": 24,
"text": "Figure 4",
"ref_id": null
}
],
"eq_spans": [],
"section": "Figure 4: Top-Level Semantics Menus",
"sec_num": null
},
{
"text": "As noted in Section 3, semantic specifications at the database level are primitive but useful. As shown in Figure 5 , a database level specification comprises (a) a relation, possibly arrived at via a user-defined join, and (b) references to columns that correspond to the parameters of the phrase whose semantics is being defined. In many cases, the system can utilize its column type information, acquired as described in Section 5, to predict both the relation to be used (or pair of relations for joining) and the appropriate columns to join over, in which case the menu(s) that are presented will contain boldface selections for the user to confirm or alter.",
"cite_spans": [],
"ref_spans": [
{
"start": 107,
"end": 115,
"text": "Figure 5",
"ref_id": "FIGREF5"
}
],
"eq_spans": [],
"section": "Specification at the Database Level",
"sec_num": "7.1"
},
{
"text": "In our previous experience with LDC, we found that a large variety of meanings could be defined by a predicate in which the result of some function is compared using some relational operator to a specified benchmark value.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Specification by Menu",
"sec_num": "7.2"
},
{
"text": "TELl. we provide an enhancement to this scheme where definitions (a) may involve more than one argument. (b) may contain more than one function reference, and (c) are acquired in menu form.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "In",
"sec_num": null
},
{
"text": "The current internal representation of a menu specification is a triple of the form suggested by Figure 6 . When a semantics menu first appears, its \"Function\" field contains a list of all functions known to apply to at least one of the entities that the definition relates to. This reduces the number of keystrokes required from the user and. more importantly, helps guard against an inadvertent proliferation of concept names.",
"cite_spans": [],
"ref_spans": [
{
"start": 97,
"end": 105,
"text": "Figure 6",
"ref_id": null
}
],
"eq_spans": [],
"section": "In",
"sec_num": null
},
{
"text": "In addition, to the database and menu schemes just described, users may supply definitions in terms of English already known to the system. Some advantages to this are that (1) definitions may be arbitrarily complex, limited only by the coverage of the underlying syntactic component, and (2) users will implicitly be learning to supply semantics at the same time they learn to use the NLP itself. Some disadvantages are (1) a user might want to define something that cannot be paraphrased within the bounds of the grammatical coverage of the system, and (2) unless optimizations are carried out, references to user-defined concepts may entail inefficient processing.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "English and English-Like Specifications",
"sec_num": "7.3"
},
{
"text": "An alternative to English specification, which functions similarly from the user's standpoint, is to provide for \"English-like\" specifications in which an expression supplied by the user is translated by some pattern-matching algorithm different from. and probably less sophisticated than. the process involved in actual English parsing. The primary advantage of English-like specification, over English specification, is that translations into internal form can be more efficient, since definitions or parts of definitions will be handled on a case by case basis. One probable disadvantage is that the scheme will be less general, in terms of definable concetps, and perhaps \"spotty\" in terms of what it makes available.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "English and English-Like Specifications",
"sec_num": "7.3"
},
{
"text": "In TELI, both English and English-like specification are done in terms of sample domain values, which are treated as formal parameters. An example appears in Figure 7 .",
"cite_spans": [],
"ref_spans": [
{
"start": 158,
"end": 166,
"text": "Figure 7",
"ref_id": null
}
],
"eq_spans": [],
"section": "English and English-Like Specifications",
"sec_num": "7.3"
},
{
"text": "In the current implementation, English-like specifications include (a) any definition definable by menu, and (b) definitions that involve (possibly negated) adjective or noun references.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "English and English-Like Specifications",
"sec_num": "7.3"
},
{
"text": "As of this writing, only English specifications that involve no nested parameter references can be processed.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "English and English-Like Specifications",
"sec_num": "7.3"
},
{
"text": "In addition to whatever mechanisms an NL system specifically provides for semantic acquisitions, it is reasonable to allow users to define one meaning directly in terms of another (in addition to indirect dependence, as in the case of English specification). In TELI, users may ask to \"borrow\" from an existing meaning at any time. As shown in Figure 8 , the system responds by finding all current items defined in terms of all or some of the parameters (i.e. entities) of the item for which the borrowing is being done. This assures that the entire borrowed meaning can be modified to apply to the item being defined. After being copied, a borrowed meaning may be edited just as though it had been entered from scratch. STUDENT is a FRESHH,qN STUDENT is a 6R,qDU,qTE STUDENT is a C,R,@UATE STUDENT STUDENT is a JUNIOR STUDENT i:s a SENIOR STUDENT is a SOPHOPIORE STUDENT is an UNDERC, Rf~DU,qTE ",
"cite_spans": [],
"ref_spans": [
{
"start": 344,
"end": 352,
"text": "Figure 8",
"ref_id": "FIGREF8"
}
],
"eq_spans": [],
"section": "Specification by Borrowing",
"sec_num": "7.4"
},
{
"text": "[ return] ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "CLflSS of STUDENT",
"sec_num": null
},
{
"text": "At the most abstract level, our approach to transportability is unusual in that we have begun by building a moderately sophisticated NLP'which, from the outset, fundamentally includes replete customization facilities. This contrasts with other efforts which have first built, perhaps over a period of several years, a highly sophisticated system, then sought to incorporate some customization features.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Relation to Similarly Motivated Systems",
"sec_num": "8."
},
{
"text": "Our work is also distinctive, though perhaps less so. in seeking to allow for customization by end users, as opposed to (say) a database administrator (cf. Thompson and Thompson, 1975 , 1983 Johnson, 1985) .",
"cite_spans": [
{
"start": 156,
"end": 183,
"text": "Thompson and Thompson, 1975",
"ref_id": "BIBREF18"
},
{
"start": 184,
"end": 190,
"text": ", 1983",
"ref_id": "BIBREF10"
},
{
"start": 191,
"end": 205,
"text": "Johnson, 1985)",
"ref_id": "BIBREF14"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Relation to Similarly Motivated Systems",
"sec_num": "8."
},
{
"text": "Some of the systems which, like TEL1, seek to provide for user customization within the context of database query are ASK Thompson 1983, 1985) . formerly REL (Thompson and Thompson, 1975) . from Caltech; INTELLECT, formerly Robot (Harris, 1977) , marketed by Artificial Intelligence Corporation; IRUS (Bates and Bobrow, 1983; Bates. Moser, and Stallard 1984) , from BBN Laboratories; TQA (Damerau, 1985) . formerly REQUEST (Plath, 1976) , from IBM Yorktown Heights; TEAM (Grosz. 1983; Grosz et al, 1985) . from SRI International; and USL (Lehmann, 1978) , from IBM Heidleberg. Other high-quality domain-independent systems include DATALOG (Hafner and Godden. 1985) . from General Motors Research Labs; HAM-ANS (Wahlster. 1984) , from the University of Hamburg; and PHLIQA (Bronnenberg et al, 1978 (Bronnenberg et al, -1979 . from Philips Research.",
"cite_spans": [
{
"start": 122,
"end": 142,
"text": "Thompson 1983, 1985)",
"ref_id": null
},
{
"start": 158,
"end": 187,
"text": "(Thompson and Thompson, 1975)",
"ref_id": "BIBREF18"
},
{
"start": 230,
"end": 244,
"text": "(Harris, 1977)",
"ref_id": "BIBREF13"
},
{
"start": 301,
"end": 325,
"text": "(Bates and Bobrow, 1983;",
"ref_id": "BIBREF6"
},
{
"start": 326,
"end": 358,
"text": "Bates. Moser, and Stallard 1984)",
"ref_id": "BIBREF7"
},
{
"start": 388,
"end": 403,
"text": "(Damerau, 1985)",
"ref_id": "BIBREF9"
},
{
"start": 415,
"end": 436,
"text": "REQUEST (Plath, 1976)",
"ref_id": null
},
{
"start": 471,
"end": 484,
"text": "(Grosz. 1983;",
"ref_id": "BIBREF10"
},
{
"start": 485,
"end": 503,
"text": "Grosz et al, 1985)",
"ref_id": null
},
{
"start": 538,
"end": 553,
"text": "(Lehmann, 1978)",
"ref_id": "BIBREF15"
},
{
"start": 639,
"end": 664,
"text": "(Hafner and Godden. 1985)",
"ref_id": "BIBREF12"
},
{
"start": 710,
"end": 726,
"text": "(Wahlster. 1984)",
"ref_id": "BIBREF21"
},
{
"start": 772,
"end": 796,
"text": "(Bronnenberg et al, 1978",
"ref_id": null
},
{
"start": 797,
"end": 822,
"text": "(Bronnenberg et al, -1979",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Relation to Similarly Motivated Systems",
"sec_num": "8."
},
{
"text": "We now provide a comparison of TELI's customization strategies with those of the TEAM, IRUS, TQA, and ASK systems (other comparisons would also have been instructive, time and space permitting). Although we have recently spoken with at least one designer of each of these systems (see the Acknowledgements), it is possible that, in addition to intended simplifications, we may have overlooked or misunderstood certain significant, perhaps undocumented, features, in which case we apologize to the reader. Also, we note that our remarks are principally concerned with the goals and the approaches of various projects, and should not be viewed as commenting on the accomplishments or overall quality of TELl or any other system.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Relation to Similarly Motivated Systems",
"sec_num": "8."
},
{
"text": "Both TEAM and TELI represent Englishlanguage interfaces that have been applied to several moderately complex relational database domains. Each system provides for a variety of customizations by non-natural language experts, though neither system has claimed success with actual users in either customization or English processing mode. In terms of method, each system obtains (among other things) information about each column of each relation (table) of the database. We proceed to point out some of the more significant differences between the projects, as suggested by Grosz et al (1985) and indicated by Martin (1986) .",
"cite_spans": [
{
"start": 572,
"end": 590,
"text": "Grosz et al (1985)",
"ref_id": null
},
{
"start": 608,
"end": 621,
"text": "Martin (1986)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "A Comparison with TEAM",
"sec_num": "8.1"
},
{
"text": "To begin with, TEAM incorporates a more powerful natural language processor than does TELl, with provisions for quantifiers, simple pronouns, elaborate comparative forms, limited forms of conjunction, and numerous smaller features. Its \"sort hierarchy\" provides a taxonomy more general than that of TELI. It also incorporates disambiguation heuristics which seek to obviate the need for users to provide definitions for some phrase types (e.g. prepositional phrases based on \"on\", \"from\", \"with\", and \"in\"), and its preparations to deal with time and place references are without counterpart in TELI.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A Comparison with TEAM",
"sec_num": "8.1"
},
{
"text": "On the other hand, the customization features of TELl appear to offer greater sophistication, and sometimes more power, than the respective customization features of TEAM.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A Comparison with TEAM",
"sec_num": "8.1"
},
{
"text": "In terms of sophistication, TELI always offers multiple ways of acquiring information, provides the ability to examine and borrow existing definitions, and is able to invoke the appropriate knowledge acquisition module when missing lexical, syntactic, or semantic information is required.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A Comparison with TEAM",
"sec_num": "8.1"
},
{
"text": "Copncerning definitional power, TELl generally provides for more complex definitions of words and phrases than does TEAM, as described in Sections 5-7. For example, whereas the SRI system typically requires a verb to map into some explicit or virtual relation (e.g. a join of explicit relations), TELl also allows an arbitrary number of properties of objects to be used in definitions (e.g. an old employee is one hired before I980. or an employee admires a manager that works more hours than she does).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A Comparison with TEAM",
"sec_num": "8.1"
},
{
"text": "In TEAM, \"acquisition is centered around the relations and fields in the database\". In contrast, TELI provides several customization modes, as described in Section 3, and discourages low-level database specifications.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A Comparison with TEAM",
"sec_num": "8.1"
},
{
"text": "In contrast to the principles we espoused for TELI in Section 3, TEAM couples its methods of acquisition with the type of modifier being defined. For example, when seeing a \"feature field\", which contains exactly two distinct values, the system asks for \"positive adjectives\" and \"negative adjectives\" associated with these values (e.g. \"volcanic\" is a positive adjective associated with the database value \"Y\"). In TEL1, these relationships arise as a special case of the acquisitions shown in Figures 3.6, and 7b.",
"cite_spans": [],
"ref_spans": [
{
"start": 495,
"end": 511,
"text": "Figures 3.6, and",
"ref_id": null
}
],
"eq_spans": [],
"section": "A Comparison with TEAM",
"sec_num": "8.1"
},
{
"text": "An interesting similarity between TEAM and TELI is that each provides for English(like) definitions. For example. TEAM might be told that \"a volcano erupts\", from which it infers that a mountain erupts just in case it is a volcano.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A Comparison with TEAM",
"sec_num": "8.1"
},
{
"text": "Another recently developed facilitiy to allow user customizations of a database front-end is represented by the IRACQ component of the IRUS system (Ayuso and Weischedel, 1986) . In addition to its practical value, IRACQ is intended as a vehicle that permits experimental work with sophisticated knowledge representation formalisms.",
"cite_spans": [
{
"start": 147,
"end": 175,
"text": "(Ayuso and Weischedel, 1986)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "A Comparison with IRUS",
"sec_num": "8.2"
},
{
"text": "IRACQ is similar to TELI in shielding the user from the layout of the underlying data files. Another similarity is that each system accepts case frame specifications in English-like form. but IRACQ allows proper nouns as well as common nouns to be used. Thus. a user might suggest the case frame of the verb \"write\" by saying \"Jones wrote some articles\". Since IRUS provides for quite general taxonomic relationships among defined concepts (e.g. nouns), IRACQ proceeds to ascertain which of the possibly several classes that \"Jones\" belongs to is the most general one that can act as the subject of \"write\".",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A Comparison with IRUS",
"sec_num": "8.2"
},
{
"text": "One important difference between TELI and IRACQ is that IRUS distinguishes conceptual information, which resides within its KR framework, from the linguistic information that characterizes the English to be used. Thus, while IRACQ supports definitions in terms of an arbitrary number of predicates, as does TELl, it assumes that any concepts needed to define a new language item have already been specified. These representations, acquired by a separate module called KREME, involve the KL-ONE notions of \"concept\" and \"relation\", which are similar to, but more sophisticated than, the 1-and 2-place predicates that come into existence during a session with TELI.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A Comparison with IRUS",
"sec_num": "8.2"
},
{
"text": "At present, IRACQ allows users to define case frame information for verb phrases, prepositional phrases, and noun phrases involving \"of\". Its treatment of prepositional phrases is very much like that of TELI in that the head noun being modified is considered part of the the noun-preposition-noun triple for which a definition is beine acquired (cf. Section 4,1). Definitions for individual words (e.g. nouns and adjectives) are not supported but are being considered for future versions of the system, as are facilities that enable the system to inform the user of existing predicates that might be useful in defining a new language item. This facility will be similar in spirit to TELI's provisions for \"borrowing\" definitions. as described in Section 7.4.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A Comparison with IRUS",
"sec_num": "8.2"
},
{
"text": "Unlike most efforts at transportability, TQA has been designed as a working prototype, capable of being customizated for complex database applications by actual users. The primary responsibility of the customization module is to acquire information that relates language concepts, e.g. subject of a given verb, to the columns of the database at hand.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A Comparison with TQA",
"sec_num": "8.3"
},
{
"text": "Like TELI, TQA avoids having to copy all database values into the lexicon by constructing \"shape\" information to recognize numbers and similar patterns. For example, the system might deduce that all database values referring to a department are of the form \"letter followed by two digits\", which allows for valuable disambiguations during parsing. Thus, in a database where employees manage projects and supervisors manage departments, the question \"Who manages K34?\" can be understood to be asking about supervisors without having to find \"K34\" in either the lexicon or the database.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A Comparison with TQA",
"sec_num": "8.3"
},
{
"text": "A related problem, which TQA addresses more squarely than most systems (including TELI), concerns the appearance and possible equivalence of database values. For example. \"vac lnd\" might indicate \"vacant land\", \"grn\" and \"green\" might be used interchangeable, and so forth. Many practical applications require that these sorts of issues be addressed in order for a user to obtain reliable information.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A Comparison with TQA",
"sec_num": "8.3"
},
{
"text": "Another useful feature concerns the acquisition of information that enables non-trivial output formatting. In simple cases, a database administrator might want nine-digit values appearing in columns associated with social security numbers to be printed with dashes at the appropriate points (e.g. 123456789 becomes 123-45-6789), In more complicated situations, values might actually need to be decoded, so that 0910 becomes \"vacant land\". This provision for decoding is similar to to the form of intermediate acquisition shown in Figure 3 , though here it is being used for opposite effect.",
"cite_spans": [],
"ref_spans": [
{
"start": 530,
"end": 538,
"text": "Figure 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "A Comparison with TQA",
"sec_num": "8.3"
},
{
"text": "The current ASK prototypes, which run on Sun, Vax, and HP desktop systems, are derived from earlier work on the REL system, which itself derives from work on the DEACON project, which stems from the early 1960's. Unlike most recent efforts, which have sought to incorporate customization features into an existing more-or-less single-domain system, the work with REL, the \"Rapidly Extensible Language\", fundamentally included definitional capabilities as early as 1969.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A Comparison with ASK",
"sec_num": "8.4"
},
{
"text": "To begin with, ASK provides quite general customization facilities, allowing English definitions at least as sophisiticated as those outlined in Section 7.3. An example is \"ships 'carry' coal to Oslo if there is a shipment whose carrier is ships, type is coal and destination is Oslo\". Arithmetic facilities are also provided, e.g. \"area equals length times beam\".",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A Comparison with ASK",
"sec_num": "8.4"
},
{
"text": "The most distinguishing features of ASK, however, derive from the designers' desire to incorporate natural language technology into an intergrated information management system, rather than provide simple sentence-by-sentence database retrieval. One feature allows ASK to be connected to several external database systems, drawing information from each of them in the context of answering a user's question. A second feature allows a user to provide bulk data input. This begins with the interactive specification of a record type, followed by information used to populate the newly created relation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A Comparison with ASK",
"sec_num": "8.4"
}
],
"back_matter": [
{
"text": "The current TELI system derives from work on the LDC project, which was carried out at Duke University by John Lusth and Nancy Tinkham. In converting the NL portions of LDC to operate in our present context, we have engaged in frequent discussions with several persons, including Joan Bachenko, Alan Biermann, Marcia Derr, George Heidorn, Mark Jones. and Mitch Marcus. We also wish to thank Paul Martin of SRI, Damaris Ayuso and Ralph Weischedel of BBN, Fred Damerau of IBM Yorktown Heights, and Fred Thompson of Caltech, for their willingness to answer a number of questions that helped us to formulate the comparisons given in Section 8. Finally, we wish to thank Marcia Derr for many useful comments on a draft of our paper.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgements",
"sec_num": null
}
],
"bib_entries": {
"BIBREF1": {
"ref_id": "b1",
"title": "A 'Domain Class' ApprOach to Transportable Natural Language Processing",
"authors": [
{
"first": "B",
"middle": [],
"last": "Ballard",
"suffix": ""
}
],
"year": 1982,
"venue": "Cognition and Brain Theory",
"volume": "5",
"issue": "",
"pages": "269--287",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ballard, B. \"A 'Domain Class' ApprOach to Transportable Natural Language Processing\", Cognition and Brain Theory 5, 3 (1982), 269-287.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "The Syntax and Semantics of User-Defined Modifiers in a Transportable Natural Language Processor",
"authors": [
{
"first": "B",
"middle": [],
"last": "Ballard",
"suffix": ""
}
],
"year": 1984,
"venue": "Proc. Coling-84",
"volume": "",
"issue": "",
"pages": "52--56",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ballard, B. \"The Syntax and Semantics of User- Defined Modifiers in a Transportable Natural Language Processor\", Proc. Coling-84, Stanford University, July 1984, 52-56.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "User Specification of Syntactic Case Frames in TELI, A Transportable, User-Customized Natural Language Processor",
"authors": [
{
"first": "B",
"middle": [],
"last": "Ballard",
"suffix": ""
}
],
"year": 1986,
"venue": "Proc. Coling-86",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ballard, B. \"User Specification of Syntactic Case Frames in TELI, A Transportable, User-Customized Natural Language Processor\", Proc. Coling-86, Bonn, West Germany, August, 1986.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "LDC-I: A Transportable Natural Language Processor for Office Environments",
"authors": [
{
"first": "B",
"middle": [],
"last": "Ballard",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Lusth",
"suffix": ""
},
{
"first": "N",
"middle": [],
"last": "Tinkham",
"suffix": ""
}
],
"year": 1984,
"venue": "ACM Transactions on Office Information Systems",
"volume": "2",
"issue": "",
"pages": "1--23",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ballard, B., Lusth, J., and Tinkham, N. \"LDC-I: A Transportable Natural Language Processor for Office Environments\", ACM Transactions on Office Information Systems 2, 1 (1984), 1-23.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "A Phrase-Structured Grammatical Framework for Transportable Natural Language Processing",
"authors": [
{
"first": "B",
"middle": [],
"last": "Ballard",
"suffix": ""
},
{
"first": "N",
"middle": [],
"last": "Tinkham",
"suffix": ""
}
],
"year": 1984,
"venue": "Computational Linguistics",
"volume": "10",
"issue": "",
"pages": "81--96",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ballard, B. and Tinkham, N. \"A Phrase-Structured Grammatical Framework for Transportable Natural Language Processing\", Computational Linguistics 10, 2 (1984), 81-96.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "A Transportable Natural Language Interface for Information Retrieval",
"authors": [
{
"first": "M",
"middle": [],
"last": "Bates",
"suffix": ""
},
{
"first": "R",
"middle": [],
"last": "Bobrow",
"suffix": ""
}
],
"year": 1983,
"venue": "Proc. 6th Int. ACM SIGIR Conference",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Bates, M. and Bobrow, R. \"A Transportable Natural Language Interface for Information Retrieval\", Proc. 6th Int. ACM SIGIR Conference, Washington, D.C., June 1983.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "The IRUS Transportable Natural Language Interface",
"authors": [
{
"first": "M",
"middle": [],
"last": "Bates",
"suffix": ""
},
{
"first": "M",
"middle": [],
"last": "Moser",
"suffix": ""
},
{
"first": "D",
"middle": [],
"last": "Stallard",
"suffix": ""
}
],
"year": 1984,
"venue": "Proc. First Int. Workshop on Expert Database Systems",
"volume": "",
"issue": "",
"pages": "258--274",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Bates, M., Moser, M. and Stallard, D. \"The IRUS Transportable Natural Language Interface\", Proc. First Int. Workshop on Expert Database Systems, Kiawah Island, October 1984, 258-274.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "PHLIQA-1, a Question-Answering System for Data-Base Consultation in Natural English",
"authors": [
{
"first": "W",
"middle": [],
"last": "Bronnenberg",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Landsbergen",
"suffix": ""
},
{
"first": "R",
"middle": [],
"last": "Scha",
"suffix": ""
},
{
"first": "W",
"middle": [],
"last": "Schoenmakers",
"suffix": ""
},
{
"first": "E",
"middle": [],
"last": "Van Utteren",
"suffix": ""
}
],
"year": 1978,
"venue": "Philips tech. Rev",
"volume": "38",
"issue": "",
"pages": "229--239",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Bronnenberg, W., Landsbergen, S., Scha, R., Schoenmakers, W. and van Utteren, E. \"PHLIQA-1, a Question-Answering System for Data-Base Consultation in Natural English\", Philips tech. Rev. 38 (1978-79), 229-239 and 269-284.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Problems and Some Solutions in Customization of Natural Language Database Front Ends",
"authors": [
{
"first": "-F",
"middle": [],
"last": "Damerau",
"suffix": ""
}
],
"year": 1985,
"venue": "ACM Transactions on Office Information Systems",
"volume": "3",
"issue": "",
"pages": "165--184",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Damerau,-F. \"Problems and Some Solutions in Customization of Natural Language Database Front Ends\", ACM Transactions on Office Information Systems 3, 2 (1985), 165-184.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "TEAM: A Transportable Natural Language Interface System",
"authors": [
{
"first": "B",
"middle": [],
"last": "Grosz",
"suffix": ""
}
],
"year": 1983,
"venue": "Conf. on Applied Natural Language Processing",
"volume": "",
"issue": "",
"pages": "39--45",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Grosz, B. \"TEAM: A Transportable Natural Language Interface System\", Conf. on Applied Natural Language Processing, Santa Monica, 1983, 39-45.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "TEAM: An Experiment In The Design Of Transportable Natural-Langauge Interfaces",
"authors": [
{
"first": "B",
"middle": [],
"last": "Grosz",
"suffix": ""
},
{
"first": "D",
"middle": [],
"last": "Appelt",
"suffix": ""
},
{
"first": "P",
"middle": [],
"last": "Martin",
"suffix": ""
},
{
"first": "F",
"middle": [],
"last": "Pereira",
"suffix": ""
}
],
"year": null,
"venue": "Artificial Intelligence",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Grosz, B., Appelt, D., Martin, P. and Pereira, F. \"TEAM: An Experiment In The Design Of Transportable Natural-Langauge Interfaces\", Artificial Intelligence, in press.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Portability of Syntax and Semantics in Datalog",
"authors": [
{
"first": "C",
"middle": [],
"last": "Hafner",
"suffix": ""
},
{
"first": "C",
"middle": [],
"last": "Godden",
"suffix": ""
}
],
"year": 1985,
"venue": "ACM Transactions on Office Information Systems",
"volume": "3",
"issue": "",
"pages": "141--164",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Hafner, C. and Godden, C. \"Portability of Syntax and Semantics in Datalog\". ACM Transactions on Office Information Systems 3.2 (1985), 141-164.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "User-Oriented Database Query with the ROBOT Natural Language System",
"authors": [
{
"first": "L",
"middle": [],
"last": "Harris",
"suffix": ""
}
],
"year": 1977,
"venue": "Int. Journal of Man-Machine Studies",
"volume": "9",
"issue": "",
"pages": "697--713",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Harris, L. \"User-Oriented Database Query with the ROBOT Natural Language System\", Int. Journal of Man-Machine Studies 9 (1977), 697-713.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Natural Language Computing: The Commercial Applications. Ovum Ltd",
"authors": [
{
"first": "T",
"middle": [],
"last": "Johnson",
"suffix": ""
}
],
"year": 1985,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Johnson, T. Natural Language Computing: The Commercial Applications. Ovum Ltd, London. 1985.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Interpretation of natural language in an information system",
"authors": [
{
"first": "",
"middle": [],
"last": "Lehmann",
"suffix": ""
}
],
"year": 1978,
"venue": "IBM J. Res. Dev",
"volume": "22",
"issue": "",
"pages": "560--571",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Lehmann. H. \"Interpretation of natural language in an information system\", IBM J. Res. Dev. 22, 5 (1978), pp. 560-571.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Experience With the Evaluation of Natural Language Question Answerers",
"authors": [
{
"first": "H",
"middle": [],
"last": "Tennant",
"suffix": ""
}
],
"year": 1979,
"venue": "Int. J. Conf. on Artificial Intelligence",
"volume": "",
"issue": "",
"pages": "275--281",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Tennant, H. \"Experience With the Evaluation of Natural Language Question Answerers\", Int. J. Conf. on Artificial Intelligence, 1979, pp. 275-281.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Practical Natural Language Processing: The REL System as Prototype",
"authors": [
{
"first": "F",
"middle": [],
"last": "Thompson",
"suffix": ""
},
{
"first": "B",
"middle": [],
"last": "Thompson",
"suffix": ""
}
],
"year": 1975,
"venue": "Advances in Computers",
"volume": "3",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Thompson, F. and Thompson, B. \"Practical Natural Language Processing: The REL System as Prototype\", In Advances in Computers, Vol. 3, M. Rubinoff and M. Yovits, Eds., Academic Press, 1975.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Introducing ASK: A Simple Knowledgeable System",
"authors": [
{
"first": "B",
"middle": [],
"last": "Thompson",
"suffix": ""
},
{
"first": "F",
"middle": [],
"last": "Thompson",
"suffix": ""
}
],
"year": 1983,
"venue": "Conf. on Applied Natural Language Processing",
"volume": "",
"issue": "",
"pages": "17--24",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Thompson, B. and Thompson, F. \"Introducing ASK: A Simple Knowledgeable System\", Conf. on Applied Natural Language Processing, Santa Monica, 1983. 17- 24.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "ASK Is Transportable in Half a Dozen Ways",
"authors": [
{
"first": "B",
"middle": [],
"last": "Thompson",
"suffix": ""
},
{
"first": "",
"middle": [
"F"
],
"last": "Thompson",
"suffix": ""
}
],
"year": 1985,
"venue": "ACM Trans. on Office Information Systems",
"volume": "3",
"issue": "",
"pages": "185--203",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Thompson, B. and Thompson. F. \"ASK Is Transportable in Half a Dozen Ways\", ACM Trans. on Office Information Systems 3, 2 (1985), 185-203.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "User Models in Dialog Systems",
"authors": [
{
"first": "W",
"middle": [],
"last": "Wahlster",
"suffix": ""
}
],
"year": 1984,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Wahlster, W. \"User Models in Dialog Systems\", Invited talk at Coling-84, Stanford University, July 1984.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"text": "Adjective e.g. an expensive restaurant Noun Modifier e.g. a graduate student Noun e.g. a pub and the phrase types Adjective Phrase e.g. employees responsible for the planning projects Noun-Modifier Phrase e.g. the speech researchers Prepositional Phrase e.g. the trails on the Franconia-Region map Verb Phrase e.g. employees that report to Brachman Functional Noun Phrase e.g. the size of department 11387, the colleagues of Litman",
"num": null,
"uris": null,
"type_str": "figure"
},
"FIGREF2": {
"text": "Sample Display Screen; Top-Level Menu of TEL1",
"num": null,
"uris": null,
"type_str": "figure"
},
"FIGREF3": {
"text": "Entity Type for STUDEHT (BILL. DOUG .... ) I ~tuder, t I I Entity Type for BDUIS (BRCHE,KO, BBLLBRD .... )1 instructorl I",
"num": null,
"uris": null,
"type_str": "figure"
},
"FIGREF4": {
"text": ": N,ql,iE, ELEL,,',qTION, PIAP-\"~-~ C,qI,1PSITES: SITE, C,qP,qCITY, TYPE .................................... [Join TI.~'O Relations] ==================================== [ ret, urn ] To find the HEIGHT of a MOUHTRIM: + Which ,:olumr~ 9ires MOUMTFIIH: NAME ELEVATION MAP Which column 9i'v'e:5 HEIGHT: NAME ELEVATION MAP MOUHTAIMS",
"num": null,
"uris": null,
"type_str": "figure"
},
"FIGREF5": {
"text": "Database Specification <spec> --> <term> <relop> <term> <term> --> <atom> ] <func> ( <atom> ) <atom> --> <constant> I <parameter> <relop> --> = I<[< = I>1>--I-= An example of how menu semantics operates is given in",
"num": null,
"uris": null,
"type_str": "figure"
},
"FIGREF6": {
"text": "Adjective: FILE is LFIRGE [ Sample Usage: Sage is LFIRGE ] Function: CREATION-DATE LEN6TH OWNER (none)",
"num": null,
"uris": null,
"type_str": "figure"
},
"FIGREF7": {
"text": "Menu Specification tk, e height of adams is 9rearer thar, 4B001 Adjective: MOUNTAIN is TALL [ SaBple Usage: Rdans is IRLL ] Iype an English(like) Reference English-like Specification Is tile meaning of STUDENT is ADVANCED related to one of the followin.q?",
"num": null,
"uris": null,
"type_str": "figure"
},
"FIGREF8": {
"text": "Borrowing a Meaning",
"num": null,
"uris": null,
"type_str": "figure"
},
"TABREF0": {
"html": null,
"type_str": "table",
"text": "",
"num": null,
"content": "<table><tr><td colspan=\"2\">(NOT (RDJ LONG)))</td></tr><tr><td>Algebra Querg: (SELECT trails(trail</td><td>length-Km)</td></tr><tr><td colspan=\"2\">(and (< length-km 67</td></tr></table>"
},
"TABREF4": {
"html": null,
"type_str": "table",
"text": "[IOIJI5 .... ) --~ ......... ~\"1~_,-4J-b,.',_.,9 ..... )",
"num": null,
"content": "<table><tr><td/><td/><td colspan=\"2\">STUDENT-INFO</td></tr><tr><td colspan=\"2\">-STUDENT -</td><td>SSN</td><td colspan=\"2\">CLASS ADVIS</td></tr><tr><td>BILL</td><td/><td>123-45-67891</td><td>I</td><td>BBLLRRD</td></tr><tr><td>DOUG</td><td/><td>111-22-3333</td><td>3</td><td>LITMAN</td></tr><tr><td>FRED</td><td/><td>321-54-9876</td><td>3</td><td>MARCUS</td></tr><tr><td>JOHN SALLY SUE</td><td/><td>555-33-1234 314-15-9265 987-65-4321</td><td>2 4 3</td><td>JONES BRACH~RN BRCHENKO</td></tr><tr><td colspan=\"2\">TERESA</td><td>333-22-4444</td><td>G</td><td>BORGIDR</td></tr><tr><td colspan=\"5\">Which is the \"key\" column of STUDENT-INFO?</td></tr><tr><td colspan=\"5\">5TLIDENT (BILL, SSN (111-~-~:,_,D, .:.o .~ -~e-</td></tr><tr><td>CLASS</td><td colspan=\"2\">(1, 2, ..,</td><td/></tr><tr><td>~DUI5</td><td colspan=\"4\">(BACHENKO, B,~LL,~RD ...)</td></tr><tr><td colspan=\"3\">Columns of STUDEHT-IHFO STUDENT (BILL .... ) SSH (111-22-3333 .... ) CLASS (1 .... )</td><td colspan=\"2\">Entity PrToperty 1~ [] [] [] []</td></tr><tr><td colspan=\"3\">ADUIS (BBCHENKO .... )</td><td>[]</td><td>[]</td></tr><tr><td>Return []</td><td/><td/><td/></tr></table>"
},
"TABREF5": {
"html": null,
"type_str": "table",
"text": "Nh, ich, columns contain (er, coded) Engli:mh ~,3r,ds? SIUDEMT (BILL, DOUG, ...) = LARGE [ Sample Usa.qe: Sa.qe is LARGE ] the LENGTH of Sage ::--380 ..................................",
"num": null,
"content": "<table><tr><td>[] [] [] [] Figure 3: [(~dd a constraint) (iii-22-3333, 12:3-4J-6789, ...) CLASS SSM (i, 2 .... ) RDVIS (BACHEMK0, BALLARD, ...) Abort [] Return [] l Uords associated with the CLASS value 1: fre~hmar, I Uords associated with the CLASS value G: 9raduatel Modif'iers in CLASS Ad,iectlve Mounmod Houn FRESHMRH (i) [] [] [] SOPHOMORE (2) [] [] [] JUMIOR (3) [] [] [] SEMIOR (4) 0 [] [] GRADUATE (g) [] [] [] Return [] ================================== [ retur'n ] Define tile semantics Verb Phrase: TRAIL LEADS TO MOUNTAIIq of by ... Henu Selection En91istn(lik:e) Re:fercnce: Database Refet'ences gorr0vAng from an E\u00d7istin9 l'leardrbg ======================================= [ ret.urn ]</td></tr></table>"
}
}
}
} |