File size: 89,206 Bytes
6fa4bc9 |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 |
{
"paper_id": "A92-1002",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T02:03:48.014946Z"
},
"title": "A Dialog Control Algorithm and Its Performance",
"authors": [
{
"first": "Ronnie",
"middle": [
"W"
],
"last": "Smith",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "D",
"middle": [
"Richard"
],
"last": "Hipp",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Alan",
"middle": [
"W"
],
"last": "Biermann",
"suffix": "",
"affiliation": {},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "A pragmatic architecture for voice dialog machines aimed at the equipment repair problem has been implemented which exhibits a number of behaviors required for efficient humanmachine dialog.",
"pdf_parse": {
"paper_id": "A92-1002",
"_pdf_hash": "",
"abstract": [
{
"text": "A pragmatic architecture for voice dialog machines aimed at the equipment repair problem has been implemented which exhibits a number of behaviors required for efficient humanmachine dialog.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "(1) problem solving to achieve a target goal, (2) the ability to carry out subdialogs to achieve appropriate subgoals and to pass control arbitrarily from one subdialog to another, (3) the use of a user model to enable useful verbal exchanges and to inhibit unnecessary ones, (4) the ability to change initiative from strongly computer controlled to strongly user controlled or somewhere in between, and (5) the ability to use context dependent expectations to correct speech recognition and track user movement to new subdialogs.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "A description of the implemented dialog control algorithm is given; an example shows the fundamental mechanisms for achieving the listed behaviors. The system implementation is described, and results from its performance in 141 problem solving sessions are given.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "A limited vocabulary voice dialog system designed to aid a user in the repair of electronic circuits has been constructed in our laboratory. The system contains a model of the device to be repaired, debugging and repair procedures, voice recognition and sentence processing mechanisms, a user model, language generation capabilities, and a dialog control system which orchestrates the behaviors of the various parts. This paper describes the *This research was supported by National Science Foundation Grant Number NSF-IRI-88-03802 and by Duke University.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A Voice-Interactive Dialog Machine",
"sec_num": "1"
},
{
"text": "dialog control algorithm and the performance of the total system in aiding a series of subjects in the repair of an electronic circuit.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A Voice-Interactive Dialog Machine",
"sec_num": "1"
},
{
"text": "The purpose of the dialog control algorithm is to direct the activities of the many parts of the system to obtain efficient human-machine dialog. Specifically, it is aimed at achieving the following behaviors.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Target Behaviors",
"sec_num": "2"
},
{
"text": "Convergence to a goal. Efficient dialog requires that each participant understand the purpose of the interaction and have the necessary prerequisites to cooperate in its achievement. This is the intentional structure of [Grosz and Sidner, 1986] , the goal-oriented mechanism that gives direction to the interaction. The primary required facilities are a problem solver that can deduce the necessary action sequences and a set of subsystems capable of carrying out those sequences.",
"cite_spans": [
{
"start": 220,
"end": 244,
"text": "[Grosz and Sidner, 1986]",
"ref_id": "BIBREF10"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Target Behaviors",
"sec_num": "2"
},
{
"text": "Subdialogs and effective movement between them. Efficient human dialog is usually segmented into utterance sequences, subdialogs, that are individually aimed at achieving relevant subgoals ([Grosz, 1978] , [Linde and Goguen, 1978] , [Polanyi and Scha, 1983] , and [Reichman, 1985] ). These are called \"segments\" by [Grosz and Sidner, 1986J and constitute the linguistic structure defined in their paper. The global goal is approached by a series of attempts at subgoals each of which involves a set of interactions, the subdialogs.",
"cite_spans": [
{
"start": 189,
"end": 203,
"text": "([Grosz, 1978]",
"ref_id": "BIBREF10"
},
{
"start": 206,
"end": 230,
"text": "[Linde and Goguen, 1978]",
"ref_id": "BIBREF15"
},
{
"start": 233,
"end": 257,
"text": "[Polanyi and Scha, 1983]",
"ref_id": null
},
{
"start": 264,
"end": 280,
"text": "[Reichman, 1985]",
"ref_id": "BIBREF20"
},
{
"start": 315,
"end": 339,
"text": "[Grosz and Sidner, 1986J",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Target Behaviors",
"sec_num": "2"
},
{
"text": "An aggressive strategy for global success is to choose the most likely subgoals needed for success and carry out their associated subdialogs. As the system proceeds on a given subdialog, it should always be ready to abruptly drop it if some other subdialog suddenly seems more appropriate. This leads to the fragmented style that so commonly appears in efficient human communication. A subdialog is opened which leads to another, then another, then a jump to a previously opened subdialog, and so forth, in an unpredictable order until the necessary subgoals have been solved for an overall success.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Target Behaviors",
"sec_num": "2"
},
{
"text": "Accounting for user knowledge and abilities. Cooperative problem solving involves maintaining a dynamic profile of user knowledge, termed a user model. This concept is described for example in [Kobsa and Wahlster, 1988] and [Kobsa and Wahlster, 1989] , [Chin, 1989] , [Cohen and Jones, 1989] , [Finin, 1989] , [Lehman and Carbonell, 1989 ], [Morik, 1989] , and [Paris, 1988] . The user model specifies information needed for efficient interaction with the conversational partner. Its purpose is to indicate what needs to be said to the user to enable the user to function effectively. It also indicates what should be omitted because of existing user knowledge.",
"cite_spans": [
{
"start": 193,
"end": 219,
"text": "[Kobsa and Wahlster, 1988]",
"ref_id": null
},
{
"start": 224,
"end": 250,
"text": "[Kobsa and Wahlster, 1989]",
"ref_id": "BIBREF14"
},
{
"start": 253,
"end": 265,
"text": "[Chin, 1989]",
"ref_id": "BIBREF3"
},
{
"start": 268,
"end": 291,
"text": "[Cohen and Jones, 1989]",
"ref_id": "BIBREF5"
},
{
"start": 294,
"end": 307,
"text": "[Finin, 1989]",
"ref_id": "BIBREF9"
},
{
"start": 310,
"end": 337,
"text": "[Lehman and Carbonell, 1989",
"ref_id": "BIBREF15"
},
{
"start": 341,
"end": 354,
"text": "[Morik, 1989]",
"ref_id": "BIBREF17"
},
{
"start": 361,
"end": 374,
"text": "[Paris, 1988]",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Target Behaviors",
"sec_num": "2"
},
{
"text": "Because considerable information is exchanged during the dialog, the user model changes continuously. Mentioned facts are stored in the model as known to the user and are not repeated. Previously unmentioned information may be assumed to be unknown and may be explained as needed. Questions from the user may indicate lack of knowledge and result in the removal of items from the user model.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Target Behaviors",
"sec_num": "2"
},
{
"text": "Change of initiative. A real possibility in a cooperative interaction is that the user's problem solving ability, either on a given subgoal or on the global task, may exceed that of the machine. When this occurs, an efficient interaction requires that the machine yield control so that the more competent partner can lead the way to the fastest possible solution. Thus, the machine must be able to carry out its own problem solving process and direct the actions to task completion or yield to the user's control and respond cooperatively to his or her requests. This is a mixed-initiative dialog as studied by [Kitano and Van Ess-Dykema, 1991] , [Novick, 1988] , [Whittaker and Stenton, 1988] , and [Walker and Whittaker, 1990] . As a pragmatic issue, we have found that at least four initiative modes are useful:",
"cite_spans": [
{
"start": 611,
"end": 644,
"text": "[Kitano and Van Ess-Dykema, 1991]",
"ref_id": "BIBREF13"
},
{
"start": 647,
"end": 661,
"text": "[Novick, 1988]",
"ref_id": null
},
{
"start": 664,
"end": 693,
"text": "[Whittaker and Stenton, 1988]",
"ref_id": "BIBREF20"
},
{
"start": 700,
"end": 728,
"text": "[Walker and Whittaker, 1990]",
"ref_id": "BIBREF20"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Target Behaviors",
"sec_num": "2"
},
{
"text": "(1) directive -The computer has complete dialog control. It recommends a subgoal for completion and will use whatever dialog is necessary to obtain the needed item of knowledge related to the subgoal.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Target Behaviors",
"sec_num": "2"
},
{
"text": "(2) suggestive -The computer still has dialog control, but not as strongly. The computer will make suggestions about the subgoal to perform next, but it is also willing to change the direction of the dialog according to stated user preferences. (3) declarative -The user has dialog control, but the computer is free to mention relevant, though not required, facts as a response to the user's statements. (4) passive -The user has complete dialog control.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Target Behaviors",
"sec_num": "2"
},
{
"text": "The computer responds directly to user questions and passively acknowledges user statements without recommending a subgoal as the next course of action.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Target Behaviors",
"sec_num": "2"
},
{
"text": "Expectation of user input. Since all interactions occur in the context of a current subdialog, the user's input is far more predictable than would be indicated by a general grammar for English. In fact, the current subdialog specifies the focus of the interaction, the set of all objects and actions that are locally appropriate. This is the attentional structure described by [Grosz and Sidner, 1986] and its most important function in our system is to predict the meaning structures the user is likely to communicate in a response. For illustration, the opening of a chassis cover plate will often evoke comments about the objects behind the cover; the measurement of a voltage is likely to include references to a voltmeter, leads, voltage range, and the locations of measurement points.",
"cite_spans": [
{
"start": 377,
"end": 401,
"text": "[Grosz and Sidner, 1986]",
"ref_id": "BIBREF10"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Target Behaviors",
"sec_num": "2"
},
{
"text": "The subdialog structure thus provides a set of expected utterances at each point in the conversation and these have two important roles:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Target Behaviors",
"sec_num": "2"
},
{
"text": "(1) The expected utterances provide strong guidance for the speech recognition system so that error correction can be maximized. Where ambiguity arises, recognition can be biased in the direction of meaningful statements in the current context. Earlier researchers who have investigated this insight are [Erman et al., 1980] , [Walker, 1978] , [Fink and Biermann, 1986] , [Mudler and Paulus, 1988] , [Carbonell and Pierrel, 1988] , [Young et al., 1989] , and [Young and Proctor, 1989 ]. (2) The expected utterances from subdialogs other than the current one can be used to indicate that one of those others is being invoked. Thus, expectations are one of the primary mechanisms needed for tracking the conversation as it jumps from subdialog to subdialog. This is known elsewhere as the plan recognition problem and it has received much attention in recent years. See, for example, [Allen, 1983] , [Litman and Allen, 1987] , [Pollack, 1986] , and [Carberry, 1990 ].",
"cite_spans": [
{
"start": 304,
"end": 324,
"text": "[Erman et al., 1980]",
"ref_id": "BIBREF8"
},
{
"start": 327,
"end": 341,
"text": "[Walker, 1978]",
"ref_id": "BIBREF20"
},
{
"start": 344,
"end": 369,
"text": "[Fink and Biermann, 1986]",
"ref_id": "BIBREF10"
},
{
"start": 372,
"end": 397,
"text": "[Mudler and Paulus, 1988]",
"ref_id": "BIBREF17"
},
{
"start": 400,
"end": 429,
"text": "[Carbonell and Pierrel, 1988]",
"ref_id": "BIBREF3"
},
{
"start": 432,
"end": 452,
"text": "[Young et al., 1989]",
"ref_id": "BIBREF20"
},
{
"start": 459,
"end": 483,
"text": "[Young and Proctor, 1989",
"ref_id": null
},
{
"start": 882,
"end": 895,
"text": "[Allen, 1983]",
"ref_id": "BIBREF2"
},
{
"start": 898,
"end": 922,
"text": "[Litman and Allen, 1987]",
"ref_id": "BIBREF15"
},
{
"start": 925,
"end": 940,
"text": "[Pollack, 1986]",
"ref_id": "BIBREF20"
},
{
"start": 947,
"end": 962,
"text": "[Carberry, 1990",
"ref_id": "BIBREF3"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Target Behaviors",
"sec_num": "2"
},
{
"text": "Systems capable of all of the above behaviors are rare as has been observed by : \"no one knows how to fit all of the pieces together.\" One of the contributions of the current work is to present an architecture that can provide them all in the limited domair of electric circuit repair. describe their own architecture which concentrates on representations for subdialog mechanisms and their interactiom, with sentence level processing. Our work differs fro~ theirs on many dimensions including our emphasis oR achieving mixed-initiative, real time, voice interactiv~ dialog which utilizes a user model.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Target Behaviors",
"sec_num": "2"
},
{
"text": "The Zero Level Model",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "3",
"sec_num": null
},
{
"text": "The system implemented in our laboratory (described in great detail in ) achieves the above b\u00a2~ haviors sufficiently to enable efficient human-machine di. alogs in the electric circuit repair environment. The com. plexity of the system prevents its complete descriptior here. However, a zero level model has been devised fol pedagogical purposes which illustrates its principles o: operation. This model mimicks the mechanism of th~ dialog machine while omitting the huge array of detail., necessary to make a real system work. A later sectiot in this paper describes the actual implementation an\u00a2 some of its major modules. The zero level model is the recursive subroutine Zmod Subdialog shown in figure 1. This routine is entered witl a single argument, a goal to be proven, and its actiont are to carry out a Prolog-style proof of the goal. A sid~ effect of the proof may be a resort to voice interaction~ with the user to supply necessary missing axioms, h",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "3",
"sec_num": null
},
{
"text": "Recursive suh~ialog routine (enter with a goal to prove) fact, the only voice interactions the system undertakes are those called for by the theorem proving machinery. The ZmodSubdialog routine has a unique capability needed for proper modeling of subdialog behaviors. Specifically, its actions may be suspended at any time so that control may be passed to another subdialog, another instantiation of ZmodSubdialog that is aimed at achieving another goal. However, control may at a later time return to the current instantiation to continue its execution. In fact, a typical computation involves a set of ZmodSubdialog instantiations all advanced to some point in the proofs of their respective goals; control passes back and forth between them looking for the most likely chances of success until, finally, enough goals are proven to complete the global proof.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "3",
"sec_num": null
},
{
"text": "The algorithm becomes understandable if an example is followed through in full detail. Assume that the following database of Prolog-like rules are contained in the system knowledge base. Further assume that ZmodSubdialog is entered with argument Goal = set(knob,10). Then in Prolog fashion, the routine grabs the rule R: set(knob,Y) ~--find(knob),adjust(knob,Y), and attempts to prove set(knob,10). The algorithm offers three choices depending on whether R is trivial (a single predicate which is not vocalize(X)), tt is vocalize(X), or R is a rule with antecedents as is the case here. Thus, in this case the third alternative is followed, and the two antecedents are queued for sequential execution (find(knob) and adjust(knob,10)). Then the first antecedent is selected and ZmodSubdialog is entered with argument Goal = find(knob).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "3",
"sec_num": null
},
{
"text": "The new subdialog to achieve find(knob) is short, however, since the user model indicates the user already knows how to find the knob because find(knob) exists as an available rule. In fact, ZmodSubdialog finds find(knob) in the rule base, enters the first choice (trivial) and returns with success. If find(knob) had not been found in the user model, the system might have engaged in dialog to achieve this goal. The subdialog control mechanism is not obligated to pass control back to the calling routine, but in this example we will assume that it does. Satisfactory proof of find(knob) means that the next antecedent at this level, adjust(knob,10), can be attempted, and ZmodSubdialog is entered with this goal. Here, our model selects R = Y ~--usercan(Y), vocalize(Y), unifying Y with adjust(knob,lO). Then a deeper call to ZmodSubdialog finds usercan(adjust(knob,X)) in the user model which means control passes to the antecedent vocalize(adjust(knob,10)). This yields another entry to ZmodSubdialog and a selection of the second branch. Here the system executes a voice output to satisfy vocalize(adjust(knob,10)): \"Set the knob to one zero.\"",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "3",
"sec_num": null
},
{
"text": "The handling of the goal find(knob) illustrates how the user model can act to satisfy the theorem proving process and prevent the enunciation of unneeded information. As the theorem proving process proceeds, the fact that a user knows something is represented in the knowledge base as an achieved goal. Theorem proving will encounter this and proceed without voice interaction. In the example, the model already indicates that the user knows how to find the knob so no voice interaction is needed for this goal.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "3",
"sec_num": null
},
{
"text": "The handling of the goal adjust(knob,10) illustrates how the user model supports the theorem proving process by enabling voice dialog when it is needed. This goal could not be proven by application of rules available in the database and the proof was blocked from further progress. In our terminology, there was a \"missing axiom\" for the proof. So the system must either give up on this proof or try to fill in the missing axiom by resorting to voice dialog. In the current case, voice dialog was enabled by the user model fact usercan(adjust(knob,X)). This fact opens the way for a query to the user. If the query is positively answered, then the missing axiom is made available.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "3",
"sec_num": null
},
{
"text": "The role of the user model is thus to supply or fail to supply axioms at the bottom of the proof tree. It both inhibits extraneous verbalism and enables interactions necessary to prove the theorem.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "3",
"sec_num": null
},
{
"text": "Returning to the example computation of ZmodSubdialog, a voice output has just been given, and the system then records, for this output, the set of expected resp oases:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "3",
"sec_num": null
},
{
"text": "user (adjust (knob, I0) ) assertion(knob,position, I0) trivialrssponse (affirmation) trivialresponse (negat ire) query(location(knob) ) query (color (knob)) Expected responses are compiled from the domain knowledge base and from the dialog controller knowledge base.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "3",
"sec_num": null
},
{
"text": "The user's response is then matched (unified) against the expected meanings and subsequent actions depend on which meaning fits best. Four different types of actions may occur at this point.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "3",
"sec_num": null
},
{
"text": "(1) The user might respond with some paraphrase of \"I set the knob to one zero,\" or \"Okay\", which would be interpreted as successful responses. The routine ZmodSubdialog would return with success. (2) The user might also answer \"No\" yielding a failure and another cycle around the theorem proving loop looking for an applicable rule. (3) The user might respond with \"What color is the knob?\" indicating, there may be a chance for a success here if there is further dialog. In fact, our system handles such a need for clarification by dynamically modifying the rule and reexecuting with a newly required clarification subdialog. Here the rule set(knob,10) find(knob), adjust(knob,10) becomes modified to set(knob,10) ~--find(knob), vocalize(knob,white), adjust(knob,10). Reexecution will then yield an explanation of the knob color followed by the previous request reenunciated: \"Set the knob to one zero.\"",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "3",
"sec_num": null
},
{
"text": "(4) The user might respond with an utterance that matches no local expectation. Here the system examines expectations of other subdialogs and searches for an acceptable match. If one is found, control will pass to that subdialog. For example, if the response is, \"The LED is flashing seven,\" and if this is an appropriate response in some other subdialog, control will pass to it.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "3",
"sec_num": null
},
{
"text": "The control of initiative in ZmodSubdialog is handled by special processing at the steps marked \"mode.\" Thus, in strongly directive mode, verbal outputs will be very positively stated, responses will be expected to be obedient, and interrupts to other subdialogs will be restricted. In less demanding modes, outputs will be weaker or merely suggestive, a wider range of responses will be allowed, and transitions to other subdialogs will be more freely permitted. In the most passive mode, there are few outputs except answers to questions, and an interrupt to any subdialog is acceptable.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "3",
"sec_num": null
},
{
"text": "A very important part of the dialog system is the domain processor, the application dependent portion of the system. It receives all information related to the current problem and suggests debugging steps to carry the process further. We model calls to this processor with the rule: debug(X) ~--(debuggingstep(X))*. This rule is called upon to debug device X with the predicate debug(X) and its effect is to specify a sequence ot debugging steps which will be specified dynamically as the problem unfolds and which will lead to repair of the device.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "3",
"sec_num": null
},
{
"text": "The Implementation",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "4",
"sec_num": null
},
{
"text": "The implemented system is based on a computational model for dialog processing presented in . The model is applicable to the general class of taskoriented dialogs, dialogs where the computer is assistin~ the user in completing a task as the dialog ensues. The derived implementation consists of the following modules:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "An Integrated Architecture",
"sec_num": "4.1"
},
{
"text": "dialog controller -This is the supervisor of the dialog processing system. It provides the subdialog processing highlighted in the zero level model. In addition, it provides the complex algorithm required to properly handle arbitrary clarification subdialogs and interrupts as well as provide the dialog expectations needed to assist with input interpretation. It also maintains all dialog information shared by the other modules and controls their activation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "An Integrated Architecture",
"sec_num": "4.1"
},
{
"text": "domain processor-As previously mentioned, it provides suggestions about debugging steps to pursue. In our system the domain processor assists users in circuit repair. It receives user-supplied domain information from the dialog controller and returns suggested debugging subgoals to the controller for consideration. The subgoal selection process weighs the level of expected usefulness of a subgoal with the number of times the subgoal has been previously selected. Consequently, the module may recommend challenging previously reported information if no noticeable progress in the task is being made. In this manner, the module and system can recover from erroneous inputs. If the dialog system is to be used to repair other devices, this is the module that needs to be replaced.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "An Integrated Architecture",
"sec_num": "4.1"
},
{
"text": "knowledge This is the repository of information about task-oriented dialogs including: (1) rules for proving completion of goals;",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "An Integrated Architecture",
"sec_num": "4.1"
},
{
"text": "(2) user model information including a set of rules for inferring user model information from user input; (3) rules for determining when a clarification subdialog should be initiated; and (4) rules for defining the expectations for the user's response as a function of the type of goal being attempted. Note that the predefined information of this module is easily modified without requiring changes to the dialog controller. theorem prover -This provides the general reasoning capability of the system. In order to allow the dialog controller to control the potentially arbitrary movement among subdialogs, the theorem prover has been made interruptible and put under the supervision of the dialog controller. Consequently, the theorem prover can maintain a set of partially completed proofs, and can activate different proofs as instructed by the dialog controller. It can also dynamically modify the proof structure, a key feature for handling clarification subdialogs. Foremost, the theorem prover is able to suspend itself when it encounters a missing axiom, permitting natural language interaction to assist in axiom acquisition. This contrasts with traditional theorem proving approaches (e.g. Prolog) which simply engage in backtracking when a missing axiom is encountered.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "An Integrated Architecture",
"sec_num": "4.1"
},
{
"text": "linguistic interface -This consists of the generation and recognition modules. They use information on context and expectation as provided by the dialog controller. The linguistic generator was developed by Robin Gambill. It uses a rule-driven approach that takes as input an utterance specification which encapsulates the desired meaning and produces as output an English string that is sent to a text-to-speech converter for enunciation. Various approaches to generation have been described in [Danlos, 1987] , [Hovy, 1988] , [Jacobs, 1987] , [McKeown, 1985] , and [Patten, 1988] . The recognition module was designed to be able to recover from ungrammatical inputs. It will be described in greater detail below.",
"cite_spans": [
{
"start": 496,
"end": 510,
"text": "[Danlos, 1987]",
"ref_id": "BIBREF6"
},
{
"start": 513,
"end": 525,
"text": "[Hovy, 1988]",
"ref_id": "BIBREF12"
},
{
"start": 528,
"end": 542,
"text": "[Jacobs, 1987]",
"ref_id": "BIBREF12"
},
{
"start": 545,
"end": 560,
"text": "[McKeown, 1985]",
"ref_id": null
},
{
"start": 567,
"end": 581,
"text": "[Patten, 1988]",
"ref_id": "BIBREF18"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "An Integrated Architecture",
"sec_num": "4.1"
},
{
"text": "A challenging design problem in any natural language system is the development of a parser which will translate the lattice of words output by the speech recognizer into a phrase of some synthetic language (Prolog in our instance) which encapsulates the meaning of what was originally spoken. The design difficulty is exacerbated by the fact that due to speech recognition errors, the word lattice output by the speech recognizer is probably different from what the user spoke, and the fact that users will sometimes speak with a word order or sentence construction which the designers of the parser's grammar did not forsee. (These, and other problems associated with robust parsing of speech are further described in [Eastman and McLean, 1981] , [Hayes et aL, 1986], and [Young et al., 1989] .) In our system, parsing is accomplished using a minimum-distance parsing algorithm, similar to algorithms described in [Aho and Peterson, 1972] , [Lyon, 1974] , and [Levinson, 1985] , but extended to accept a lattice as input, instead of a simple word list, and also extended to simultaneously perform syntax-directed translation [Aho and Ullman, 1969] into the target language. Minimum-distance parsing finds strings in a given context-free language which can be converted to a string of the input lattice with a minimum number of weighted insertions and deletions. When two or more strings are equidistant from the input, dialog expectation is used to break the tie. The minimumdistance parsing algorithm is very robust -it always finds at least one parse -but it is also computationally expensive. Our algorithm is faster than previously reported parsing algorithms of the same generality, but it still required careful hand-crafting and optimization on a fast machine in order to provide real-time response. It should also be noted that our recognition system is capable of selective verification of meaning. This is highlighted in the following sample dialogs.",
"cite_spans": [
{
"start": 719,
"end": 745,
"text": "[Eastman and McLean, 1981]",
"ref_id": "BIBREF7"
},
{
"start": 748,
"end": 772,
"text": "[Hayes et aL, 1986], and",
"ref_id": "BIBREF10"
},
{
"start": 773,
"end": 793,
"text": "[Young et al., 1989]",
"ref_id": "BIBREF20"
},
{
"start": 915,
"end": 939,
"text": "[Aho and Peterson, 1972]",
"ref_id": "BIBREF0"
},
{
"start": 942,
"end": 954,
"text": "[Lyon, 1974]",
"ref_id": "BIBREF16"
},
{
"start": 961,
"end": 977,
"text": "[Levinson, 1985]",
"ref_id": "BIBREF15"
},
{
"start": 1126,
"end": 1148,
"text": "[Aho and Ullman, 1969]",
"ref_id": "BIBREF1"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Minimum distance parsing",
"sec_num": "4.2"
},
{
"text": "Sample Dialogs Figure 2 shows two dialogs obtained from actual usage of the system. These dialogs can be seen in [Hipp and Smith, 1991] that is part of the video presentation of the conference. The words in parentheses found beside certain user statements are the words actually provided by the speech recognizer. Where the discrepancy between the output of the speech recognizer and the words produced by the user is insignificant, they have been omitted. The first dialog is an entire dialog conducted in declarative mode. Particular points to notice from this usercontrolled dialog are: This is the circuit fix it shop. Hoe may I help you? I want to fix this rs111. I am familiar with that circuit.",
"cite_spans": [
{
"start": 113,
"end": 135,
"text": "[Hipp and Smith, 1991]",
"ref_id": "BIBREF11"
}
],
"ref_spans": [
{
"start": 15,
"end": 23,
"text": "Figure 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "5",
"sec_num": null
},
{
"text": "The LED is supposed to be displaying alternately flashing one and seven. The LED is displaying an alternately flashing one and the top corner of a seven. There is supposed to be a wire between connector nine nine and connector one zero zero. U: It is there. C: There is supposed to be a wire between connector nine nine and connector one zero two. U: There is no wire on connector one zero four. (R: stays know wire i connector one zero for) C: There is supposed to be a wire between connector one zero four and connector one zero two.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "5",
"sec_num": null
},
{
"text": "[User adds wire and verifies the circuit is repaired, a three step process.]",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "5",
"sec_num": null
},
{
"text": "The circuit is working. The LED is displaying nothing. What is the switch at when the LED is off? The switch is down. Put the switch up. Done. Put the knob to one zero. Which knob7 Near the top boundary and in the center is a green region. right of this green region is the control knob. The knob is at one zero. What is the LED displaying? The LED is displaying a one and seven at the same time. Put the knob to zero. Done. What is the LED displaying? The same thing.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "5",
"sec_num": null
},
{
"text": "(R: the same same) Did you mean to say the LED is displaying the same thing? Now, in the middle 24. U: Yes.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "5",
"sec_num": null
},
{
"text": "[Eventually, a missing wire is detected and added, and the computer explicitly guides the user through the verification process. The entire dialog lasts 51 utterances.] The second dialog is an excerpt from a dialog conducted in directive mode (strongly computer-controlled dialog). The total dialog lasted 51 utterances in contrast to the 11 utterance declarative mode dialog. Particular points to notice from this excerpt include:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "5",
"sec_num": null
},
{
"text": "(1) Computer responses which are more directed and forceful in content than in dialog 1.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "5",
"sec_num": null
},
{
"text": "(2) Successful handling of a clarification subdialog (utterances 13-16). (3) Successful verification of the implicit meaning of a user utterance in the presence of speech recognition errors in utterance 22. In contrast with utterance 8 of diMog 1, the system decided an explicit verification subdialog was required to ascertain the meaning of the user's utterante.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "5",
"sec_num": null
},
{
"text": "The system has been implemented on a Sun 4 workstation with the majority of the code written in Quintus Prolog 1, and the parser in C. Speech recognition is performed by a Verbex 6000 running on an IBM PC and speech production is performed by a DECtalk 2 DTCO1 text-to-speech converter. The users are restricted to a 125 word vocabulary in the connected speech system.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Results",
"sec_num": null
},
{
"text": "1Quintus Prolog is a trademark of Quintus Computer Systems, Incorporated 2DECtalk is a trademark of Digital Equipment Corporation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Results",
"sec_num": null
},
{
"text": "The implemented domain processor has been loaded with a model for a particular experimental circuit assembled on a Radio Shack 160-in-One Electronic Project Kit.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Results",
"sec_num": null
},
{
"text": "After testing system prototypes with a few volunteers, eight subjects used the system during the formal experimental phase. After a warmup session where the subject trained on the speech recognizer and practiced using the system, each subject participated in two sessions where up to ten problems were attempted. The system ran in declarative mode (user-controlled dialogs) during one session and in directive mode (strongly computercontrolled dialog) in the other session. Subjects attempted a total of 141 dialogs of which 118 or 84% were completed successfully. 3 Subjects spoke a total of 2840 user utterances, with 81.5% correctly interpreted by the system although only 50.0% were correctly recognized word for word by the speech recognizer. The average speech rate was 2.8 sentences per minute, and the average task completion times for successful dialogs were 4.5 and 8.5 minutes, respectively, for declarative and directive modes. The average number of user utterances per successful dialog was 10.7 in declarative mode and 27.6 in directive mode. A detailed description of the experiment and results is given in . The substantially shorter completion times for users in declarative mode can be attributed to the fact that the subjects learned many of the debugging procedures during the experiment and did not need the detailed descriptions given in the directive mode.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Results",
"sec_num": null
},
{
"text": "A voice interactive dialog architecture has been developed which achieves simultaneously a variety of behaviors believed to be necessary for efficient human-machine dialog. Goal oriented behavior is supplied by the theorem proving paradigm. Subdialogs and movement between them is implemented with an interruptible theorem prover that maintains a set of partially completed proofs and can work on the most appropriate one at any given time. A user model is provided by a continuously changing set of rules that are referenced in the theorem proving process either to enable or inhibit voice dialog. Mixed initiative is made possible by variable types of processing by the output and input routines and by restricting or releasing the ability to interrupt to a new subdialog. Expectation is associated with individual subdialogs, is compiled from domain and dialog information related to each specific output, and is used to improve voice recognition and enable movement between subdialogs.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Summary",
"sec_num": "7"
},
{
"text": "~Of the 23 dialogs which were not completed, 22 were terminated prematurely due to excessive time being spent on the dialog. Misunderstandings due to misrecognition were the cause in 13 of these failures. Misunderstandings due to inadequate grammar coverage occurred in 3 of the failures. In 4 of the failures the subject misconnected a wire. In one failure there was confusion by the subject about when the circuit was working, and in another failure there were problems with the system software. A hardware failure caused termination of the final dialog.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Summary",
"sec_num": "7"
}
],
"back_matter": [],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "A minimum distance error-correcting parser for context-free languages",
"authors": [
{
"first": "V",
"middle": [],
"last": "Peterson ; Alfred",
"suffix": ""
},
{
"first": "Thomas",
"middle": [
"G"
],
"last": "Aho",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Peterson",
"suffix": ""
}
],
"year": 1972,
"venue": "SIAM Journal on Computation",
"volume": "1",
"issue": "4",
"pages": "305--312",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "and Peterson, 1972] Alfred V. Aho and Thomas G. Peterson. A minimum distance error-correcting parser for context-free languages. SIAM Journal on Compu- tation, 1(4):305-312, 1972.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Properties of syntax directed translations",
"authors": [
{
"first": ";",
"middle": [
"A V"
],
"last": "Ullman",
"suffix": ""
},
{
"first": "J",
"middle": [
"D"
],
"last": "Aho",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Ullman ; Allen",
"suffix": ""
}
],
"year": 1969,
"venue": "Journal of Computer and System Sciences",
"volume": "3",
"issue": "3",
"pages": "319--334",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "and Ullman, 1969] A. V. Aho and J. D. Ullman. Properties of syntax directed translations. Journal of Computer and System Sciences, 3(3):319-334, 1969. [Allen et al., 1989] J. Allen, S. Guez, L. Hoebel, E. Hinkelman, K. Jackson, A. Kyburg, and D. Traum. The discourse system project. Technical Report 317, University of Rochester, November 1989.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Recognizing intentions from natural language utterances",
"authors": [
{
"first": ";",
"middle": [
"J F"
],
"last": "Allen",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Allen",
"suffix": ""
}
],
"year": 1983,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Allen, 1983] J.F. Allen. Recognizing intentions from natural language utterances. In M. Brady and R.C.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Task-oriented dialogue processing in humancomputer voice communication",
"authors": [
{
"first": ";",
"middle": [
"S"
],
"last": "Berwick",
"suffix": ""
},
{
"first": "; N",
"middle": [],
"last": "Carberry",
"suffix": ""
},
{
"first": "J",
"middle": [
"M"
],
"last": "Carbonell",
"suffix": ""
},
{
"first": "",
"middle": [
"N"
],
"last": "Pierrel ; D",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Chin",
"suffix": ""
}
],
"year": 1983,
"venue": "Recent Advances in Speech Understanding and Dialog Systems",
"volume": "",
"issue": "",
"pages": "74--107",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Berwick, editors, Computational Models of Discourse, pages 107-166. MIT Press, Cambridge, Mass., 1983. [Carberry, 1990] S. Carberry. Plan Recognition in Natu- ral Language Dialogue. MIT Press, Cambridge, Mass., 1990. [Carbonell and Pierrel, 1988] N. Carbonell and J.M. Pierrel. Task-oriented dialogue processing in human- computer voice communication. In H. Niemann, M. Lang, and G. Sagerer, editors, Recent Advances in Speech Understanding and Dialog Systems, pages 491-496. Springer-Verlag, New York, 1988. [Chin, 1989] D.N. Chin. KNOME: Modeling what the user knows in UC. In A. Kobsa and W. Wahlster, editors, User Models in Dialog Systems, pages 74-107.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Incorporating user models into expert systems for educational diagnosis",
"authors": [
{
"first": "Jones ; R",
"middle": [],
"last": "Cohen",
"suffix": ""
},
{
"first": "M",
"middle": [],
"last": "Cohen",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Jones",
"suffix": ""
}
],
"year": 1989,
"venue": "User Models in Dialog Systems",
"volume": "",
"issue": "",
"pages": "313--333",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "[Cohen and Jones, 1989] R. Cohen and M. Jones. In- corporating user models into expert systems for ed- ucational diagnosis. In A. Kobsa and W. Wahlster, editors, User Models in Dialog Systems, pages 313- 333. Springer-Verlag, New York, 1989.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "The Linguistic Basis of Text Generation",
"authors": [
{
"first": ";",
"middle": [
"L"
],
"last": "Danlos",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Danlos",
"suffix": ""
}
],
"year": 1987,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Danlos, 1987] L. Danlos. The Linguistic Basis of Text Generation. Cambridge University Press, New York, 1987.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "On the need for parsing ill-formed input",
"authors": [
{
"first": "Mclean ; C",
"middle": [
"M"
],
"last": "Eastman",
"suffix": ""
},
{
"first": "D",
"middle": [
"S"
],
"last": "Eastman",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Mclean",
"suffix": ""
}
],
"year": 1981,
"venue": "American Journal of Computational Linguistics",
"volume": "7",
"issue": "4",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "[Eastman and McLean, 1981] C. M. Eastman and D. S. McLean. On the need for parsing ill-formed in- put. American Journal of Computational Linguistics, 7(4):257, 1981.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "The Hearsay-II speechunderstanding system: Integrating knowledge to resolve uncertainty",
"authors": [
{
"first": "[",
"middle": [],
"last": "Erman",
"suffix": ""
}
],
"year": 1980,
"venue": "ACM Computing Surveys",
"volume": "",
"issue": "",
"pages": "213--253",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "[Erman et al., 1980] L.D. Erman, F. Hayes-Roth, V.R. Lesser, and D.R. Reddy. The Hearsay-II speech- understanding system: Integrating knowledge to re- solve uncertainty. ACM Computing Surveys, pages 213-253, June 1980.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "GUMS: A general user modeling shell",
"authors": [
{
"first": "T",
"middle": [
"W"
],
"last": "Finin",
"suffix": ""
}
],
"year": 1989,
"venue": "User Models in Dialog Systems",
"volume": "",
"issue": "",
"pages": "411--430",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "[Finin, 1989] T.W. Finin. GUMS: A general user model- ing shell. In A. Kobsa and W. Wahlster, editors, User Models in Dialog Systems, pages 411-430. Springer- Verlag, New York, 1989.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "The correction of ill-formed input using history-based expectation with applications to speech understanding",
"authors": [
{
"first": "; P",
"middle": [
"E"
],
"last": "Biermann",
"suffix": ""
},
{
"first": "A",
"middle": [
"W"
],
"last": "Fink",
"suffix": ""
},
{
"first": "",
"middle": [
"J"
],
"last": "Biermann ; B",
"suffix": ""
},
{
"first": "C",
"middle": [
"L"
],
"last": "Grosz",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Sidner",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Philip",
"suffix": ""
},
{
"first": "Alexander",
"middle": [
"G"
],
"last": "Hayes",
"suffix": ""
},
{
"first": "Jaime",
"middle": [
"G"
],
"last": "Hauptmann",
"suffix": ""
},
{
"first": "Masaru",
"middle": [],
"last": "Carbonell",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Tomita",
"suffix": ""
}
],
"year": 1978,
"venue": "COLING-86: Proceedings of the llth International Conference on Computational Linguistics",
"volume": "12",
"issue": "",
"pages": "587--592",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "and Biermann, 1986] P.E. Fink and A.W. Bier- mann. The correction of ill-formed input using history-based expectation with applications to speech understanding. Computational Linguistics, 12(1):13- 36, 1986. [Grosz and Sidner, 1986] B.J. Grosz and C.L. Sidner. Attentions, intentions, and the structure of discourse. Computational Linguistics, 12(3):175-204, 1986. [Grosz, 1978] B.J. Grosz. Discourse analysis. In D.E. Walker, editor, Understanding Spoken Language, pages 235-268. North-Holland, New York, 1978. [Hayes et ai., 1986] Philip J. Hayes, Alexander G Hauptmann, Jaime G. Carbonell, and Masaru Tomita. Parsing spoken language: A semantic caseframe ap- proach. In COLING-86: Proceedings of the llth In- ternational Conference on Computational Linguistics, pages 587-592, Bonn, August 1986.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "A demonstration of the \"circuit fix-it shoppe'. A 12 minute videotape available from the authors at Duke University",
"authors": [
{
"first": "Smith ; D",
"middle": [
"R"
],
"last": "Hipp",
"suffix": ""
},
{
"first": "R",
"middle": [
"W"
],
"last": "Hipp",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Smith",
"suffix": ""
}
],
"year": 1991,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "[Hipp and Smith, 1991] D. R. Hipp and R. W. Smith. A demonstration of the \"circuit fix-it shoppe'. A 12 minute videotape available from the authors at Duke University, Durham, NC 27706, August 1991.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Generating Natural Language under Pragmatic Constraints. Lawrence Erlbaum Associates",
"authors": [
{
"first": "E",
"middle": [
"H S"
],
"last": "Hovy ; P",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Jacobs",
"suffix": ""
}
],
"year": 1987,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "[Hovy, 1988] E.H. Hovy. Generating Natural Language under Pragmatic Constraints. Lawrence Erlbaum As- sociates, Hillsdale, N J, 1988. [Jacobs, 1987] P.S. Jacobs. KING: a knowledge- intensive natural language generator. In Gerard Kem- pen, editor, Natural Language Generation, pages 219-",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Toward a plan-based understanding model for mixed-initiative dialogues",
"authors": [
{
"first": "Van",
"middle": [],
"last": "Kitano",
"suffix": ""
},
{
"first": ";",
"middle": [
"H"
],
"last": "Ess-Dykema",
"suffix": ""
},
{
"first": "C",
"middle": [],
"last": "Kitano",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Van Ess-Dykema",
"suffix": ""
}
],
"year": 1987,
"venue": "Proceedings of the 29th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "25--32",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Martinus Nijhoff Publishers, Boston, 1987. [Kitano and Van Ess-Dykema, 1991] H. Kitano and C. Van Ess-Dykema. Toward a plan-based under- standing model for mixed-initiative dialogues. In Pro- ceedings of the 29th Annual Meeting of the Association for Computational Linguistics, pages 25-32, 1991. [Kobsa and Wahlster, 1988] A. Kobsa and W. Wahlster, editors. Special Issue on User Modeling. MIT Press, Cambridge, Mass., September 1988. A special issue of Computational Lingusitics.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "User Models in Dialog Systems",
"authors": [
{
"first": "Wahlster",
"middle": [],
"last": "Kobsa",
"suffix": ""
}
],
"year": 1989,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "[Kobsa and Wahlster, 1989] A. Kobsa and W. Wahlster, editors. User Models in Dialog Systems. Springer- Verlag, New York, 1989.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Learning the user's language: A step towards automated creation of user models",
"authors": [
{
"first": "Carbonell ; J",
"middle": [
"F"
],
"last": "Lehman",
"suffix": ""
},
{
"first": "J",
"middle": [
"G"
],
"last": "Lehman",
"suffix": ""
},
{
"first": "E",
"middle": [],
"last": "Carbonell ; Stephen",
"suffix": ""
},
{
"first": "; C",
"middle": [],
"last": "Levinson",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Linde",
"suffix": ""
},
{
"first": "",
"middle": [
"J"
],
"last": "Goguen ; D",
"suffix": ""
},
{
"first": "J",
"middle": [
"F"
],
"last": "Litman",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Allen",
"suffix": ""
}
],
"year": 1978,
"venue": "User Models in Dialog Systems",
"volume": "73",
"issue": "",
"pages": "163--200",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "[Lehman and Carbonell, 1989] J.F. Lehman and J.G. Carbonell. Learning the user's language: A step to- wards automated creation of user models. In A. Kobsa and W. Wahlster, editors, User Models in Dialog Systems, pages 163-194. Springer-Verlag, New York, 1989. [Levinson, 1985] Stephen E. Levinson. Structural meth- ods in automatic speech recognition. Proceeding of the IEEE, 73(11):1625-1650, 1985. [Linde and Goguen, 1978] C. Linde and J. Goguen. Structure of planning discourse. J. Social Biol. Struct., 1:219-251, 1978. [Litman and Allen, 1987] D.J. Litman and J.F. Allen. A plan recognition model for subdialogues in conversa- tions. Cognitive Science, 11(2):163-200, 1987.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Syntax-directed least errors analysis for context-free languages",
"authors": [
{
"first": "",
"middle": [],
"last": "Lyon ; Gordon Lyon",
"suffix": ""
}
],
"year": 1974,
"venue": "Communcations of the ACM",
"volume": "17",
"issue": "1",
"pages": "3--14",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Lyon, 1974] Gordon Lyon. Syntax-directed least errors analysis for context-free languages. Communcations of the ACM, 17(1):3-14, 1974. [McKeown, 1985] K.R. MeKeown. Text Generation.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "User models and conversationa ~ settings: Modeling the user's wants",
"authors": [
{
"first": "K",
"middle": [],
"last": "Morik",
"suffix": ""
},
{
"first": "; J",
"middle": [],
"last": "Mudler",
"suffix": ""
},
{
"first": "E",
"middle": [],
"last": "Paulus",
"suffix": ""
}
],
"year": 1985,
"venue": "Control of Mixed-Initiatiw Discourse Through Meta-Locutionary Acts: A Corn putational Model",
"volume": "14",
"issue": "",
"pages": "64--78",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Cambridge University Press, New York, 1985. [Morik, 1989] K. Morik. User models and conversationa ~ settings: Modeling the user's wants. In A. Kobsa and W. Wahlster, editors, User Models in Dialog Systems pages 364-385. Springer-Verlag, New York, 1989. [Mudler and Paulus, 1988] J. Mudler and E. Paulus Expectation-based speech recognition. In H. Niemann M. Lang, and G. Sagerer, editors, Recent Advances i~ Speech Understanding and Dialog Systems, pages 473- 477. Springer-Verlag, New York, 1988. [Novick, 1988] D.G. Novick. Control of Mixed-Initiatiw Discourse Through Meta-Locutionary Acts: A Corn putational Model. PhD thesis, University of Oregon 1988. [Paris, 1988] C.L. Paris. Tailoring object descriptions t\u00a2 a user's level of expertise. Computational Linguistic~ 14(3):64-78, 1988.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Systemic Text Generation a Problem Solving",
"authors": [
{
"first": ";",
"middle": [
"T"
],
"last": "Patten",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Patten",
"suffix": ""
}
],
"year": 1988,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Patten, 1988] T. Patten. Systemic Text Generation a Problem Solving. Cambridge University Press, Nev York, 1988.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Polanyi and It. Scha. O] the recursive structure of discourse",
"authors": [],
"year": 1983,
"venue": "Connectedness in Sentence Discourse and Text",
"volume": "",
"issue": "",
"pages": "141--178",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "and Scha, 1983] L. Polanyi and It. Scha. O] the recursive structure of discourse. In K. Ehlich am H. van Riemsdijk, editors, Connectedness in Sentence Discourse and Text, pages 141-178. Tilburg Univer sity, 1983.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Pro~ tor. The design and implementation of dialogue coi trol in voice operated database inquiry systems",
"authors": [
{
"first": ";",
"middle": [
"M E"
],
"last": "Pollack",
"suffix": ""
},
{
"first": "",
"middle": [
"W"
],
"last": "Pollack ; R. Reichman ; R",
"suffix": ""
},
{
"first": ";",
"middle": [
"M"
],
"last": "Smith",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Walker",
"suffix": ""
},
{
"first": ";",
"middle": [
"S"
],
"last": "Whit",
"suffix": ""
},
{
"first": "P",
"middle": [],
"last": "Whittaker",
"suffix": ""
},
{
"first": "",
"middle": [
"R"
],
"last": "Stenton ; S",
"suffix": ""
},
{
"first": "A",
"middle": [
"G"
],
"last": "Young",
"suffix": ""
},
{
"first": "",
"middle": [
"H"
],
"last": "Hauptman] W",
"suffix": ""
},
{
"first": "E",
"middle": [
"T"
],
"last": "Ward",
"suffix": ""
},
{
"first": "P",
"middle": [],
"last": "Smith",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Werner",
"suffix": ""
}
],
"year": 1978,
"venue": "Proceedings of the 24th Annual Mee1 ing of the Association for Computational Linguistic",
"volume": "3",
"issue": "",
"pages": "183--202",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Pollack, 1986] M.E. Pollack. A model of plan inferenc, that distinguishes between the beliefs of actors an, observers. In Proceedings of the 24th Annual Mee1 ing of the Association for Computational Linguistic,. pages 207-214, 1986. [Reichman, 1985] R. Reichman. Getting Computers t Talk Like You and Me. MIT Press, Cambridge, Mass 1985. [Smith, 1991] R.W. Smith. A Computational Model c Expectation-Driven Mixed-Initiative Dialog Proces, ing. PhD thesis, Duke University, 1991. [Walker and Whittaker, 1990] M. Walker and S. Whit taker. Mixed initiative in dialogue: An investigatio into discourse segmentation. In Proceedings of the 28t Annual Meeting of the Association for Computation4 Linguistics, pages 70-78, 1990. [Walker, 1978] D.E. Walker, editor. Understanding Sp~ ken Language. North-Holland, New York, 1978. [Whittaker and Stenton, 1988] S. Whittaker and P. Stenton. Cues and control in expert-client dis logues. In Proceedings of the 26th Annual Meeting t the Association for Computational Linguistics, pag~ 123-130, 1988. [Young and Proctor, 1989] S.J. Young and C.E. Pro~ tor. The design and implementation of dialogue coi trol in voice operated database inquiry systems. Con purer Speech and Language, 3:329-353, 1989. [Young et al., 1989] S.R. Young, A.G. Hauptman] W.H. Ward, E.T. Smith, and P. Werner. High lev, knowledge sources in usable speech recognition sy~ tems. Communications of the ACM, pages 183-19, August 1989.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"text": "Zero Level Model",
"type_str": "figure",
"uris": null,
"num": null
},
"FIGREF1": {
"text": ",Y) <--find(knob), adjust(knob,Y) General Dialog Rules Y <--usercan(Y), vocalize(Y) vocalize(X) User Model Rules find(knob) usercan(adjust (knob,X))",
"type_str": "figure",
"uris": null,
"num": null
},
"FIGREF2": {
"text": "Declarative Mode (C denotes the computer, U the user, and R the recognizer)",
"type_str": "figure",
"uris": null,
"num": null
},
"FIGREF3": {
"text": "Successful shifts to user-initiated subdialogs at utterances 8 and 10.(3) Successful recovery from speech recognition errors at utterance 8.",
"type_str": "figure",
"uris": null,
"num": null
},
"TABREF0": {
"text": "",
"content": "<table><tr><td>ZmodSubdialog(Goal)</td><td/></tr><tr><td colspan=\"2\">Execute verbal output X</td><td>(mode)</td></tr><tr><td>Record expectation</td><td/></tr><tr><td>Receive response</td><td/><td>(mode)</td></tr><tr><td>Confused response:</td><td colspan=\"2\">Modify rule for clarification; prioritize rule for execution</td></tr><tr><td colspan=\"3\">Interrupt: Match response to expected response of another subdialog;</td></tr><tr><td colspan=\"3\">go to that subdialog</td></tr></table>",
"html": null,
"num": null,
"type_str": "table"
}
}
}
} |