File size: 83,425 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 | {
"paper_id": "P92-1007",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T08:11:54.075770Z"
},
"title": "A Functional Approach to Generation with TAG 1",
"authors": [
{
"first": "Kathleen",
"middle": [
"F"
],
"last": "Mccoy",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Delaware Newark",
"location": {
"postCode": "19716",
"settlement": "Delaware",
"country": "USA"
}
},
"email": "mccoy@udel.edu"
},
{
"first": "K",
"middle": [],
"last": "Vijay-Shanker",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Delaware Newark",
"location": {
"postCode": "19716",
"settlement": "Delaware",
"country": "USA"
}
},
"email": ""
},
{
"first": "Gijoo",
"middle": [],
"last": "Yang",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Delaware Newark",
"location": {
"postCode": "19716",
"settlement": "Delaware",
"country": "USA"
}
},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "It has been hypothesized that Tree Adjoining Grammar (TAG) is particularly well suited for sentence generation. It is unclear, however, how a sentence generation system based on TAG should choose among the syntactic possibilities made available in the grammar. In this paper we consider the question of what needs to be done to generate with TAGs and explain a generation system that provides the necessary features. This approach is compared with other TAG-based generation systems. Particular attention is given to Mumble-86 which, like our system, makes syntactic choice on sophisticated functional grounds.",
"pdf_parse": {
"paper_id": "P92-1007",
"_pdf_hash": "",
"abstract": [
{
"text": "It has been hypothesized that Tree Adjoining Grammar (TAG) is particularly well suited for sentence generation. It is unclear, however, how a sentence generation system based on TAG should choose among the syntactic possibilities made available in the grammar. In this paper we consider the question of what needs to be done to generate with TAGs and explain a generation system that provides the necessary features. This approach is compared with other TAG-based generation systems. Particular attention is given to Mumble-86 which, like our system, makes syntactic choice on sophisticated functional grounds.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "described the relevance of Tree Adjoining Grammar (TAG) (Joshi, 1985 ; Schabes, Abeille &5 Joshi, 1988) to Natural Language Generation. In particular, he pointed out how the unique factoring of recursion and dependencies provided by TAG made it particularly appropriate to derive sentence structures from an input provided by a text planning component. Of particular importance is the fact that (all) syntactic dependencies and function argument structure are localizest in TAG trees. Shieber and Schabes (1991) discuss using Synchronous TAG for generation. Synchronous TAG provides a formal foundation to make explicit the relationship between elementary syntactic structures and their corresponding semantic counterparts, both expressed as elementary TAG trees. This relationship is made explicit by pairing the elementary trees in the syntactic and logical form languages, and associating the corresponding nodes. Shieber and Schabes (1990) describe a generation algorithm which \"parses\" an input logical form string recording the adjoining and substitution operations necessary to build the string from its elementary components. The corresponding syntactic structure is then generated by doing 1 This work is supported ill part by Grant #H133E80015 from the National hlstitute on Disability and Rehabilitation Research. Support was also provided by the Nemours Fotmdation. We would like to thank John Hughes for Iris many conunents and discussions concerning this work. the same. set of operations (in reverse. ) on the corresponding elementary structures m the grammar describing the natural language.",
"cite_spans": [
{
"start": 56,
"end": 68,
"text": "(Joshi, 1985",
"ref_id": "BIBREF7"
},
{
"start": 88,
"end": 103,
"text": "&5 Joshi, 1988)",
"ref_id": null
},
{
"start": 485,
"end": 511,
"text": "Shieber and Schabes (1991)",
"ref_id": "BIBREF21"
},
{
"start": 917,
"end": 943,
"text": "Shieber and Schabes (1990)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Note that the generation methodology proposed for synchronous TAG (and the hypothetical generator alluded to in (Joshi, 1987) ) takes as input the logical form semantic representation and produces a syntactic representation of a natural language sentence which captures that logical form. While the correspondence between logical form and the natural language syntactic form is certainly an important and necessary component of any sentence generation system, it is unclear how finer distinctions can be made in this framework. That is, synchronous TAG does not address the question of which syntactic rendition of a particular logical form is most appropriate in a given circumstance. This aspect is particularly crucial from the point of view of generation. A full-blown generation system based on TAG must choose between various renditions of a given logical form on well-motivated grounds. Mumble-86 (McDonald & Pustejovsky, 1985; Meteer et al., 1987 ) is a sentence generator based on TAG that is able to take more than just the logical form representation into account. Mumble-86 is one of the foremost sentence generation systems and it (or its predecessors) has been used as the sentence generation components of a number of natural language generation projects (e.g., (McDonald, 1983; McCoy, 1989; Conklin & McDonald, 1982; Woolf& McDonald, 1984; Rubinoff, 1986) ). After briefly describing the methodology in Mumble-86, we will point out some problematic aspects of its design. We will then describe our architecture which is based on interfacing TAG with a rich functional theory provided by functional systemic grammar (Halliday, 1970; Halliday, 1985; Fawcett, 1980; Hudson, 1981) . 2 We pay particular attention to those aspects which distinguish our generator from Mumble-86.",
"cite_spans": [
{
"start": 112,
"end": 125,
"text": "(Joshi, 1987)",
"ref_id": "BIBREF8"
},
{
"start": 894,
"end": 934,
"text": "Mumble-86 (McDonald & Pustejovsky, 1985;",
"ref_id": null
},
{
"start": 935,
"end": 954,
"text": "Meteer et al., 1987",
"ref_id": "BIBREF17"
},
{
"start": 1277,
"end": 1293,
"text": "(McDonald, 1983;",
"ref_id": "BIBREF12"
},
{
"start": 1294,
"end": 1306,
"text": "McCoy, 1989;",
"ref_id": "BIBREF10"
},
{
"start": 1307,
"end": 1332,
"text": "Conklin & McDonald, 1982;",
"ref_id": "BIBREF0"
},
{
"start": 1333,
"end": 1355,
"text": "Woolf& McDonald, 1984;",
"ref_id": "BIBREF23"
},
{
"start": 1356,
"end": 1371,
"text": "Rubinoff, 1986)",
"ref_id": "BIBREF19"
},
{
"start": 1631,
"end": 1647,
"text": "(Halliday, 1970;",
"ref_id": "BIBREF4"
},
{
"start": 1648,
"end": 1663,
"text": "Halliday, 1985;",
"ref_id": "BIBREF5"
},
{
"start": 1664,
"end": 1678,
"text": "Fawcett, 1980;",
"ref_id": "BIBREF2"
},
{
"start": 1679,
"end": 1692,
"text": "Hudson, 1981)",
"ref_id": "BIBREF6"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Mumble-86 generates from a specification of what is to be said in the form of an \"L-Spec\" 2The particular suitability of TAG as a grammatical forrealism to be used in conjtmction with a systemic granunar is discussed in (McCoy, Vijay-Shalrker & Yang, 1990 ).",
"cite_spans": [
{
"start": 220,
"end": 255,
"text": "(McCoy, Vijay-Shalrker & Yang, 1990",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Mumble-86",
"sec_num": "2"
},
{
"text": "(Linguistic Specification). An L-Spec captures the content of what is to be generated along with the goals and rhetorical force to be achieved. While the form of the L-Spec is dependent on the particular application, for the purposes of this discussion we can think of it as a set of logical form expressions that describe the content to be expressed. Mumble-86 uses a dictionary-like mechanism to transform a piece of the L-Spec into an elementary TAG tree which realizes that piece. The translation process itself (performed in the dictionary) may be influenced by contextual factors (including pragmatic factors which are recorded as a side-effect of grammar routines), and by the goals recorded in the L-Spec itself. It is in this way that the system can make fine-grained decisions concerning one realization over another.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Mumble-86",
"sec_num": "2"
},
{
"text": "Once a TAG tree is chosen to realize the initial subpiece, that structure is traversed in a left to right fashion. Grammar routines are run during this traversal to ensure grammaticality (e.g., subject-verb agreement) and to record contextual information to be used in the translation of the remaining pieces of the L-Spec. In addition to the grammar routines, as the initial tree is traversed at each place where new information could be added into the evolving surface structure (called attachment points), the remaining L-Spec is consulted to see if it contains an item whose realization could be adjoined or substituted at that position.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Mumble-86",
"sec_num": "2"
},
{
"text": "In order for this methodology to work, (McDonald & Pustejovsky, 1985) point out that they have to make some strong assumptions about the logical form input to their generator. Notice that the methodology described always starts generating from an initial tree and other auxiliary or initial trees are adjoined or substituted into that initial structure. 3 As a result, in generating an embedded sentence, the generator must start with the innermost clause in order to ensure that the first tree chosen is an initial (and not an auxiliary) tree. Consider, for example, the generation of the sentence \"Who did you think hit John\". Mumble-86 must start generating from the clause \"Who hit John\" which is (roughly) captured in the tree shown in Figure 4 . This surface structure would then be traversed. At the point labeled fr-node (an attachment point) the auxiliary tree representing \"you think\" in Figure 2 would be adjoined in.",
"cite_spans": [
{
"start": 39,
"end": 69,
"text": "(McDonald & Pustejovsky, 1985)",
"ref_id": "BIBREF13"
}
],
"ref_spans": [
{
"start": 741,
"end": 749,
"text": "Figure 4",
"ref_id": "FIGREF3"
},
{
"start": 898,
"end": 906,
"text": "Figure 2",
"ref_id": "FIGREF1"
}
],
"eq_spans": [],
"section": "Mumble-86",
"sec_num": "2"
},
{
"text": "Notice, however, that if Mumble-86 must work from the inner-most clause out, then the initial L-Spec must be in a particular form which is not consistent with the \"logician's usual represen-3An initial tree is a minimal non-recursive structure in TAG, wlfile an auxiliary tree is a minimal recursive structure. Thus, an auxiliary tree is characterized as having a leaf node (wlfich is termed the foot node) which has the same label as the root node. The tree in Figure 2 is an auxiliary tree. The adjoining operation essentially inserts an auxiliary tree into another tree. For instance, the tree in Figure 5 is the result of adjoining the auxiliary tree shown in Figure 2 into the ilfitial tree shown in Figure 4 at the node labeled It-node. tation of sentential complement verbs as higher operators\" (McDonald & Pustejovsky, 1985) [p. 101] (also noted by (Shieber & Schabes, 1991) ). Instead Mumble-86 requires an alternative logical form representation which amounts to breaking the more traditional logical form into smaller pieces which reference each other. Mumble-86 must be told which of these pieces is the embedded piece that the processing should start with. 4",
"cite_spans": [
{
"start": 802,
"end": 832,
"text": "(McDonald & Pustejovsky, 1985)",
"ref_id": "BIBREF13"
},
{
"start": 833,
"end": 841,
"text": "[p. 101]",
"ref_id": null
},
{
"start": 857,
"end": 882,
"text": "(Shieber & Schabes, 1991)",
"ref_id": "BIBREF21"
}
],
"ref_spans": [
{
"start": 462,
"end": 470,
"text": "Figure 2",
"ref_id": "FIGREF1"
},
{
"start": 600,
"end": 608,
"text": "Figure 5",
"ref_id": "FIGREF4"
},
{
"start": 664,
"end": 672,
"text": "Figure 2",
"ref_id": "FIGREF1"
},
{
"start": 705,
"end": 713,
"text": "Figure 4",
"ref_id": "FIGREF3"
}
],
"eq_spans": [],
"section": "Mumble-86",
"sec_num": "2"
},
{
"text": "Notice that this architecture is particularly problematic for certain kinds of verbs that take indirect questions. For instance, it would preclude the proper generation of sentences involving \"wonder\" (as in \"I wonder who hit John\"). Verbs which require the question to remain embedded are problematic for Mumble-86 since the main verb (wonder) would not be available when its inclusion in the surface structure needs to be determined. ~ An additional requirement on the logical form input to the generator is that the lambda expression (representing a wh-question) and the expression containing the matrix trace be present in a single layer of specification. This, they claim, is necessary to generate an appropriate sentence form without the necessity of looking arbitrarily deep into the representation. This would mean that for sentences such as \"Who do you think hit John\", the lambda expression would have to come with the \"hit John\" part of the input. We will show that our system does not place either of these restrictions on the logical form input and yet is able to generate the appropriate sentence without looking arbitrarily deep into the input specification.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Mumble-86",
"sec_num": "2"
},
{
"text": "One can notice a few features of the system just described. First, because the dictionary translation process is context sensitive, the generation methodology is able to take more than just logical form into account. Note, however, that it is unclear what the theory is behind the realizations made. In addition, these decisions are encoded procedurally thus the theory is rather difficult to abstract.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Mumble-86",
"sec_num": "2"
},
{
"text": "It is also the case that Mumble-86 makes no distinction between decisions that are made for functional reasons and those that are made for syntactic reasons. Both kinds of information must be recorded (procedurally) in grammar routines so that they can be taken into account during subsequent translations. While the fact that the grammar is procedurally encoded and that functional and syntactic decisions are mixed does not affect the power of the generator, we argue that it does make development and maintenance of the system rather difficult. Functional decisions (e.g., that a particular item should be made prominent) and syntactic decisions (e.g., number agreement) rely on two different bodies of work which should be able to evolve independently of each other. There is no separation of these two different influences in Mumble-86.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Mumble-86",
"sec_num": "2"
},
{
"text": "The generation process in Mumble-86 is syntax driven. From the input L-Spec an initial elementary) TAG tree is chosen. This structure s then traversed and grammar routines are initiated. At each possible attachment point during the traversal, the semantic structure (L-Spec) is consulted to see if it contains an item whose realization could be adjoined or substituted at that position. Thus the syntactic surface structure drives the processing.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Mumble-86",
"sec_num": "2"
},
{
"text": "As a side effect of the above processing strategy, Mumble-86 creates a strictly left-to-right realization of surface structure. While this sideeffect is deliberate for reasons of psychological validity, this can be problematic for generating some connectives (as is pointed out in (MeKeown & E1hadad, 1991) ). This is because Mumble-86 does not have access to the content of the items being conjoined at the time the connective is generated.",
"cite_spans": [
{
"start": 281,
"end": 306,
"text": "(MeKeown & E1hadad, 1991)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Mumble-86",
"sec_num": "2"
},
{
"text": "In the remainder of this paper we describe a sentence generation system which we have developed. In some ways it is similar to Mumble-86, but there are several major differences:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Mumble-86",
"sec_num": "2"
},
{
"text": "\u2022 The realization of the input in our system is based on systemic functional linguistics (Halliday, 1970; Halliday, 1985; Fawcett, 1980; Hudson, 1981) . This is a linguistic theory which states that a generated sentence is obtained as a result of a series of functional choices which are made in a parallel fashion along several different functional domains. The choices are represented as a series of networks with traversal of the networks dependent on the given input along with several knowledge sources which encode information about how various concepts can be linguistically realized. The bulk of the work in systemic linguistics has been devoted to describing what/how functional choice affects surface form. We adopt this work from systemic linguistics, but unlike other implementations, we use a formal syntactic framework (TAG) to express the syntactic constraints.",
"cite_spans": [
{
"start": 89,
"end": 105,
"text": "(Halliday, 1970;",
"ref_id": "BIBREF4"
},
{
"start": 106,
"end": 121,
"text": "Halliday, 1985;",
"ref_id": "BIBREF5"
},
{
"start": 122,
"end": 136,
"text": "Fawcett, 1980;",
"ref_id": "BIBREF2"
},
{
"start": 137,
"end": 150,
"text": "Hudson, 1981)",
"ref_id": "BIBREF6"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Mumble-86",
"sec_num": "2"
},
{
"text": "\u2022 Our method is not syntax directed, but follows a functional decomposition called for by the systemic grammar.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Mumble-86",
"sec_num": "2"
},
{
"text": "\u2022 There is a clear separation between the functional and the syntactic aspects of sentence generation which actually allows these two aspects of generation to be developed independently.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Mumble-86",
"sec_num": "2"
},
{
"text": "\u2022 We do not place any constraints on the logical form input. Our methodology calls for nothing different from what is required for a standard systemic grammar (whose input is based on a typical logical form representation).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Mumble-86",
"sec_num": "2"
},
{
"text": "\u2022 The methodology which we describe allows sentence generation to proceed in a semantic head-driven fashion (Shieber, Van Noord, Pereira ~ Moore, 1990) . This is the case even for the embedded sentences discussed earlier which had to be worked \"inside out\" in Mumble-86.",
"cite_spans": [
{
"start": 108,
"end": 151,
"text": "(Shieber, Van Noord, Pereira ~ Moore, 1990)",
"ref_id": "BIBREF22"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Mumble-86",
"sec_num": "2"
},
{
"text": "3 Generator Architecture",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Mumble-86",
"sec_num": "2"
},
{
"text": "There are many different ways of implementing a TAG-based generator. We consider the principles that we take to be common to any TAG generator and indicate how these principles have influenced our architecture. We present various aspects of our architecture and contrast them with choices that have been made in Mumble-86 and Synchronous TAG. Our approach is motivated by arguments presented in (McCoy, Vijay-Shanker Yang, i990), but the details of the processing presented there have changed significantly. Our basic processing strategy is detailed in (Yang, McCoy & Vijay-Shanker, 1991) ; the work presented here is an extension of that strategy.",
"cite_spans": [
{
"start": 553,
"end": 588,
"text": "(Yang, McCoy & Vijay-Shanker, 1991)",
"ref_id": "BIBREF25"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Mumble-86",
"sec_num": "2"
},
{
"text": "In order for a TAG generator to be robust, it must have a methodology for deciphering the input and associating various pieces of the input with TAG trees. In Mumble-86 this is accomplished through dictionary look-up along with querying the input at various points during the surface structure traversal. In contrast, we use a systemic grammar traversal for this purpose. In a TAG, each elementary tree lexicalizes a predicate and contains unexpanded nodes for the required arguments. Thus any TAG based generation system should incorporate the notions of semantic head-driven generation. Our approach, based on systemic grammars, does this because the functional decomposition that results from traversal of a systemic grammar at a single rank identifies the head and establishes necessary argumentsl Thus it perfectly matches the information captured in an elementary TAG tree.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Mumble-86",
"sec_num": "2"
},
{
"text": "Once the input has been deciphered, a TAG generator must use this to select a tree. Given that a systemic grammar is being used in our case, we must have a method for associating TAG trees with the network traversal. The traversal of a systemic grammar at a single rank establishes a set of functional choices that can be used to select a TAG tree. The selection process in any TAG-based generator can be considered as providing a classification of TAG trees on functional grounds. We make this explicit by providing a network (called the TAG network) 6 which is traversed to select a TAG tree. The network itself can be thought of as 6 hi fact we view a systemic network in a similar fashion So far we have identified how the head can be lexicalized and placed in an appropriate tree with respect to its arguments. This is accomplished by a traversal of a systemic network at one rank followed by a TAG network traversal based on the functional choices made. Of course, the arguments themselves must also be realized. This is accomplished by a recursive network (systemic followed by TAG) traversal (focused on the piece of input associated with the particular argument being realized). The recursive network traversals will also result in the realization of a TAG tree. We record information collected during a single (rank) network traversal in a data structure called a region. Thus, an initial region will be created and will record all features necessary for the selection of a tree realizing the head and argument placement. The selected tree (and other structures discussed below) will be recorded in the region. Each argument will itself be realized in a subregion which will be associated with the recursire network traversal spawned by the piece of input associated with that argument. Thus we have separate regions for each independent piece of input. This is in contrast to Mumble-86's use of the evolving surface structure in which all grammatical information is recorded.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Mumble-86",
"sec_num": "2"
},
{
"text": "Once all arguments have been realized as elementary trees in the individual regions, the trees selected in the individual regions must be combined with the tree in the initial region. For this we use the standard TAG operations of adjoining and substitution.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Mumble-86",
"sec_num": "2"
},
{
"text": "Essentially, our generation methodology consists of two phases:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Mumble-86",
"sec_num": "2"
},
{
"text": "1. The descent process -where a systemic network traversal is used to collect a set of features which are used to select a TAG tree that realizes the head and into which the arguments can be fit. The traversal is also respon- 2. The ascent process -where the trees created in the individual subregions are combined with the tree in the mother region resuiting in the final realization of the whole.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Mumble-86",
"sec_num": "2"
},
{
"text": "In our system the systemic network traversal basically replaces the dictionary look-up phase found in Mumble-867 which translates the input L-Spec into surface structure. In addition, our system does not walk a surface structure (i.e., the actual tree chosen). In Mumble-86 the surface structure walk spawned grammar routines and caused additional pieces of the L-Spec to be translated into surface structure. Our methodology relies on the systemic network traversal to spawn realizations of the decomposed subpieces. The syntactic aspects of the grammar routines are now incorporated into our TAG network and grammar. Thus our methodology keeps a clearer separation between functional and syntactic aspects of the generation process.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Mumble-86",
"sec_num": "2"
},
{
"text": "The processing in our system will be explained with an example. Consider the simplified input given in Figure 1 . s See (Yang, McCoy & Vijay-Shanker, 1991) for a more detailed description of the processing.",
"cite_spans": [
{
"start": 120,
"end": 155,
"text": "(Yang, McCoy & Vijay-Shanker, 1991)",
"ref_id": "BIBREF25"
}
],
"ref_spans": [
{
"start": 103,
"end": 111,
"text": "Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Mumble-86",
"sec_num": "2"
},
{
"text": ";'The systenxic grammar also replaces the grammar routines of Mmnble-86 responsible for recording contextual information for subsequent translations. In addition, the part of the dictionary look-up concerned with syntactic realization (i.e., the actual tree chosen) is handled by our TAG component.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Mumble-86",
"sec_num": "2"
},
{
"text": "STiffs input is simplified in that it is basically a standard logical form input with lexicM items specified. In general the input is a set of features wlffch drive the traversal of the ftmctional systemic networks. The input given (along with other knowledge sources traditionally associated with a systemic network) will be used to drive the traversal of a functional systemic network. The purpose of this traversal is two fold: (1) to identify the head/argument structure of the sentence to be realized, and (2) to identify a set of functional features which can be used to choose a tree which appropriately realizes the head/argument structure.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Mumble-86",
"sec_num": "2"
},
{
"text": "Traditionally a systemic network consists of a number of networks of functional choices which are traversed in parallel. Each network considers choices along one functional domain. One such network is the mood network which is responsible for, among other things, determining what kind of speech act should be generated for the top-level element. This network must notice, for example, that the speech-act specified is wh-questioning, but that the item being questioned is not one of the arguments to the top level process. Thus a standard declarative form should be chosen for the realization of this top level element.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Mumble-86",
"sec_num": "2"
},
{
"text": "Standard implementations of systemic grammar (Davey, 1978; Mann & Matthiessen, 1985; Patten, 1988; Fawcett, 1990) , upon traversal of the mood network to this point, would evaluate a set of realization operations which manipulate an eventual surface string. For instance, upon identifying that a declarative form is needed, the subject would be ordered before the finite. We argue in (McCoy, Vijay-Shanker & Yang, 1990 ) that it is more practical to replace the use of such realization operators with a more formal grammatical system (and that the use of such a system is perfectly consistent with the tenets of systemic linguistics). Thus during the network traversal, our system simply collects the chosen features and these are used to drive the traversal of a TAG network whose traversal results in the selection of a tree.",
"cite_spans": [
{
"start": 45,
"end": 58,
"text": "(Davey, 1978;",
"ref_id": "BIBREF1"
},
{
"start": 59,
"end": 84,
"text": "Mann & Matthiessen, 1985;",
"ref_id": "BIBREF9"
},
{
"start": 85,
"end": 98,
"text": "Patten, 1988;",
"ref_id": "BIBREF18"
},
{
"start": 99,
"end": 113,
"text": "Fawcett, 1990)",
"ref_id": "BIBREF3"
},
{
"start": 384,
"end": 418,
"text": "(McCoy, Vijay-Shanker & Yang, 1990",
"ref_id": "BIBREF11"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Mumble-86",
"sec_num": "2"
},
{
"text": "At the same time the mood network is traversed, so would be other networks. The transitivity network is concerned with identifying the head argument structure of the item being realized. In this case, it would consider the fact that the item to be realized has a \"process\" which is mental. This identification results in the expectation of two arguments -an actor (doing the mental process) and a phenomenon (that thing the process is about). Each of these identified arguments must be realized individually. This is accomplished via the pveselect operation2 This operation causes a recursive network traversal (whose results are recorded in a subregion) to be done focused on the input for the identified sub-element.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Mumble-86",
"sec_num": "2"
},
{
"text": "The features collected during the functional systemic network traversal are used to drive the traversal of the TAG network which results in the selection of a tree realizing the indicated features. Features such as that the process is mental and that the speech act is declarative would cause the selection of a tree for the mother region such as the tree in Figure 2 .",
"cite_spans": [],
"ref_spans": [
{
"start": 359,
"end": 367,
"text": "Figure 2",
"ref_id": "FIGREF1"
}
],
"eq_spans": [],
"section": "Mumble-86",
"sec_num": "2"
},
{
"text": "Similar processing would then take place in the two subregions, each eventually resulting in the trees such as those shown in Figures 3 and 4 .",
"cite_spans": [],
"ref_spans": [
{
"start": 126,
"end": 141,
"text": "Figures 3 and 4",
"ref_id": "FIGREF3"
}
],
"eq_spans": [],
"section": "Mumble-86",
"sec_num": "2"
},
{
"text": "In a TAG generator, after the input has been decomposed and elementary trees associated with each subpiece of the input, the chosen trees must be put together. Therefore, every TAG generator must provide a means to determine where the substitution or adjunction must take place. In order to do this, with each tree there must be a mapping of grammatical functions to nodes in the tree. In our case, we associate a mapping table with each tree. For instance, the mapping table associated with the tree shown in Figure 2 would indicate that the phenomenon (which would have been conflated with complement) is associated with the node labeled nl in the tree. In the simplest case the tree which realizes the phenomenon would be substituted at the node labeled nl in the tree in the mother region. A data structure similar to a mapping table is used by the other TAG generators as well. In synchronous TAG the mapping table corresponds to the explicit node for node mapping between elementary logical form and syntactic trees. The mapping table in Mumble-86 is implicit in the schemas which create the surface structure tree (during the dictionary look-up phase) since they place L-spec elements in the appropriate place in the surface structure they create.",
"cite_spans": [],
"ref_spans": [
{
"start": 510,
"end": 518,
"text": "Figure 2",
"ref_id": "FIGREF1"
}
],
"eq_spans": [],
"section": "The Ascent Process",
"sec_num": "3.2"
},
{
"text": "A more complex case arises when an argument node is a footnode of an auxiliary tree. Suppose an auxiliary tree, fl, was chosen in a region and a tree, 7, was chosen in a subregion to realize the argument specified by the footnode of ft. Rather than substituting 7 in/3, fl is adjoined into a node in 7-This node is the node in 7 that heads the subtree realizing the function specified for the subregion. For this reason, each tree in a region also has associated with it a pointer we call an frnode which points to the node heading this subtree (functional root). In Regions rl and r2 the functional root is also the root of the tree. Notice in Region r3 that the functional root is the embedded S node. This fr-node is chosen because the tree chosen in the region is a wh-question tree due to the fact that (according to the input) the phenomenon is being questioned. There is nothing in the phenomenon itself, however, that specifies that its speech-act should be wh-questioning. Thus the portion of the tree under the embedded S node captures the predicate argument structure which realizes the phenomenon as is specified in the input. If it were the case that the phenomenon was specified to be a wh-question (as in \"Mary wondered who hit John\") then the root node would be chosen as the fr-node. The fr-node comes into play when the trees in the individual regions are combined via adjunction during the ascent process. Other TAG generators have analogues to our fr-node. In synchronous TAG it is implicit in the mapping between the nodes in the two kinds of trees. In Mumble-86, it is the attachment points on surface structure. The point is that if trees might be adjoined into, any TAG generator must specify where adjoining might take place and this specification depends (at least in part) on the functional content that the tree is intended to capture.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Ascent Process",
"sec_num": "3.2"
},
{
"text": "Going back to our example, in combining trees in the subregions with the tree chosen in the initial region rl, the agent tree would be combined with the tree in region rl using straight substitution. The location of the substitution would be determined by the address given for the agent in the mapping table for the tree in region rl.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Ascent Process",
"sec_num": "3.2"
},
{
"text": "The mapping table also indicates that the phenomenon should be placed at nl in the tree in Figure 2 . Notice, however, that nl is the foot node. This is an indication to the processor that the final tree in region rl should result from adjoining the tree in rl into the tree in the subregion r3 (Figure 4) . The place of adjoining is specified by the fr-node in the phenomenon tree in region r3. The result of this adjoining is shown in So far we have established that any TAGbased generator, once an elementary tree has been chosen, would need to realize the arguments of the predicate by recursively calling the same procedure. The resulting trees chosen would be combined with the original elementary tree at the appropriate place by substitution and adjunction. In this recursive process, we have indicated the need for only functional information to be passed down from the mother region to the subregions (at the very least, in the form of the functional input associated with the piece being realized in the region). We now consider an example where syntactic information must be passed down as well.",
"cite_spans": [],
"ref_spans": [
{
"start": 91,
"end": 99,
"text": "Figure 2",
"ref_id": "FIGREF1"
},
{
"start": 295,
"end": 305,
"text": "(Figure 4)",
"ref_id": "FIGREF3"
}
],
"eq_spans": [],
"section": "The Ascent Process",
"sec_num": "3.2"
},
{
"text": "Consider the generation of a sentence such as \"John tried to win\". The standard structure for this sentence is given in Figure 6 . The problem is that in TAG this tree must be derived from the combination of two separate sentential trees: one headed by the verb \"tried\" and the other by the verb \"win\". However we must capture the constraint that the subject of the \"win\" tree is John (which is the same as the subject of the \"tried\" (Yang, 1991) . It is inserted in the region rl as a result of a feature disparity on the nodes of the tree resulting from the adjoining operation just described. The same disparity would not occur in indirect questions (e.g., \"I wonder who kit Jolm\" ). tree) but that it is realized only as a (null) pro. Note that this constraint cannot be localized in TAG but cuts across two elementary trees.",
"cite_spans": [
{
"start": 434,
"end": 446,
"text": "(Yang, 1991)",
"ref_id": "BIBREF24"
}
],
"ref_spans": [
{
"start": 120,
"end": 128,
"text": "Figure 6",
"ref_id": "FIGREF5"
}
],
"eq_spans": [],
"section": "The Ascent Process",
"sec_num": "3.2"
},
{
"text": "While generating this sentence, when we choose the \"tried\" tree in the mother region, we must pass down the information that among the trees associated with win, the one with \"pro\" in the subject position must be chosen. Notice that this is a purely syntactic constraint based on the choice of the verb \"try\". The choosing of this tree has ramifications on both the functional network traversal (since the agent of \"win\" should not be expanded) and the TAG network traversal.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Ascent Process",
"sec_num": "3.2"
},
{
"text": "In addition, any syntactic constraint that is placed on the arguments (perhaps by the choice of the head) must be passed down to the subregion to influence the realization of the arguments. In general, the passed down features may influence either the functional or the TAG network traversal (see Figure 7) . Such passing of syntactic and functional features must occur in any TAG generator where the realization of the head is done prior to the realization of its arguments.",
"cite_spans": [],
"ref_spans": [
{
"start": 297,
"end": 306,
"text": "Figure 7)",
"ref_id": null
}
],
"eq_spans": [],
"section": "The Ascent Process",
"sec_num": "3.2"
},
{
"text": "In this paper we started with considering the principles underlying the design of any TAGbased generator. We have shown how these principles have been incorporated in our generation system and have compared it with other TAG-based generators.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusions",
"sec_num": "5"
},
{
"text": "The architecture of our generation system incorporates both functional aspects of generation and syntactic aspects. Each of these aspects is handled separately, by two different formalisms which are uniquely combined in our architecture. The result is a sentence generation system which has the advantage of incorporating two bodies of knowledge into one system. Our system has several advantages over Mumble-86. In addition to the use of systemic grammar as a theory for realization and a function (rather than syntactic) directed generation process, we have shown that our methodology does not place any special requirements on the input logical form. Our methodology can proceed in a head-driven manner using notions such as the mapping table and the functional root to decide how trees should be combined. These notions allow fine distinctions in form which are not possible in Mumble-86. In addition, our system separates functional from syntactic decisions thus allowing these two bodies to be expanded independently.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusions",
"sec_num": "5"
},
{
"text": "A prototype of our system has been implemented in Lucid Common Lisp on a Sun Workstation. Details of the implementation can be found in (Yang, 1991) .",
"cite_spans": [
{
"start": 136,
"end": 148,
"text": "(Yang, 1991)",
"ref_id": "BIBREF24"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusions",
"sec_num": "5"
},
{
"text": "The task of ordering the elements of logical fonn is considered by Mumble-86 to be part of a component wlfich is also responsible for ensuring that what is given to mmnble is actually expressible in the language (e.g., English). Tiffs component is described in(Meteer, 1991).~Tlfis is because the logical form for an embedded question and a non-embedded question camlot be distinguished in the kind of input required by Mmnble-86 mid the main verb (wonder) is not able to pass a~ly information down to the embedded clause since it is realized after the embedded clause.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "From the realization operations used in systemic grmnmars (particularly Nigel), we need only the preselect and the conflate operations because all structure building operations are incorporated into TAG. The conflation operation is used to map functional features (e.g., agent, phenomenon) into granunatical functions (e.g., subject, complement). Note that in the networks from systemic grammars, we take ouly the functional part and thus avoid having choice points that exist for purely syntactic reasons.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Salience: The key to the selection problem in natural language generation",
"authors": [
{
"first": "E",
"middle": [],
"last": "Conklin",
"suffix": ""
},
{
"first": "D",
"middle": [],
"last": "Mcdonald",
"suffix": ""
}
],
"year": 1982,
"venue": "Proceedings of the 20th Annual Meeting",
"volume": "",
"issue": "",
"pages": "129--135",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Conklin, E. & McDonald, D. (1982). Salience: The key to the selection problem in natu- ral language generation. In Proceedings of the 20th Annual Meeting, (pp. 129-135)., Toronto, Canada. Association for Computa- tional Linguistics.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Discourse Production",
"authors": [
{
"first": "A",
"middle": [],
"last": "Davey",
"suffix": ""
}
],
"year": 1978,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Davey, A. (1978). Discourse Production. Edin- burgh: Edinburgh University Press.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Cognitive linguistics and social interaction",
"authors": [
{
"first": "R",
"middle": [],
"last": "Fawcett",
"suffix": ""
}
],
"year": 1980,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Fawcett, R. (1980). Cognitive linguistics and social interaction. Heidelberg: Julius Groos Verlag Heidelberg and Exeter University.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "The communal project: two years old and going well",
"authors": [
{
"first": "R",
"middle": [
"P"
],
"last": "Fawcett",
"suffix": ""
}
],
"year": 1990,
"venue": "Network",
"volume": "",
"issue": "13",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Fawcett, R. P. (1990). The communal project: two years old and going well. Network, (13).",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Language structure and language function",
"authors": [
{
"first": "M",
"middle": [
"A K"
],
"last": "Halliday",
"suffix": ""
}
],
"year": 1970,
"venue": "New Horizons in Linguistics. Harmondsworth",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Halliday, M. A. K. (1970). Language struc- ture and language function. In J. Lyons (Ed.), New Horizons in Linguistics. Har- mondsworth, England: Penguins Books.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "An introduction to functional grammar",
"authors": [
{
"first": "M",
"middle": [
"A K"
],
"last": "Halliday",
"suffix": ""
}
],
"year": 1985,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Halliday, M. A. K. (1985). An introduction to functional grammar. London England: Ed- ward Arnold.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Systemic generative grammar",
"authors": [
{
"first": "R",
"middle": [
"A"
],
"last": "Hudson",
"suffix": ""
}
],
"year": 1981,
"venue": "Readings in Systemic Linguistics",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Hudson, R. A. (1981). Systemic generative gram- mar. In M. A. K. Halliday & J. R. Mar- tin (Eds.), Readings in Systemic Linguistics. North Pomfret, Vermont: Batsford.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "How much context-sensitivity is necessary for characterizing structural descriptions : Tree adjoining grammar",
"authors": [
{
"first": "A",
"middle": [
"K"
],
"last": "Joshi",
"suffix": ""
}
],
"year": 1985,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Joshi, A. K. (1985). How much context-sensitivity is necessary for characterizing structural de- scriptions : Tree adjoining grammar. In D. Dowty, L. Karttunen, & A. Zwicky (Eds.), Natural Language Processing : Theoreti- cal, Computational and Psychological Per- spectives. New York: Cambridge University Press.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "The relevance of tree adjoining grammar to generation",
"authors": [
{
"first": "A",
"middle": [
"K"
],
"last": "Joshi",
"suffix": ""
}
],
"year": 1987,
"venue": "Natural Language Generation: New Results in Artificial Intelligence, Psychology, and Linguistics",
"volume": "",
"issue": "",
"pages": "233--252",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Joshi, A. K. (1987). The relevance of tree ad- joining grammar to generation. In G. Kem- pen (Ed.), Natural Language Generation: New Results in Artificial Intelligence, Psy- chology, and Linguistics (pp. 233-252). Dor- drecht/Boston: Martinus Nijhoff Publishers (Kluwer Academic Publishers).",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Nigel: A systemic grammar for text generation",
"authors": [
{
"first": "W",
"middle": [],
"last": "Mann",
"suffix": ""
},
{
"first": "C",
"middle": [],
"last": "Matthiessen",
"suffix": ""
}
],
"year": 1985,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Mann, W. & Matthiessen, C. (1985). Nigel: A systemic grammar for text generation. In O. Freedle (Ed.), Systemic Perspectives on Discourse. N J: Norwood.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Generating context sensitive responses to object-related misconceptions",
"authors": [
{
"first": "K",
"middle": [
"F"
],
"last": "Mccoy",
"suffix": ""
}
],
"year": 1989,
"venue": "Artificial Intelligence",
"volume": "41",
"issue": "",
"pages": "157--195",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "McCoy, K. F. (1989). Generating context sen- sitive responses to object-related misconcep- tions. Artificial Intelligence, 41, 157-195.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Using tree adjoining grammars in the systemic framework",
"authors": [
{
"first": "K",
"middle": [
"F"
],
"last": "Mccoy",
"suffix": ""
},
{
"first": "K",
"middle": [],
"last": "Vijay-Shanker",
"suffix": ""
},
{
"first": "G",
"middle": [],
"last": "Yang",
"suffix": ""
}
],
"year": 1990,
"venue": "Proceedings of 5 th International Workshop on Natural Language Generation",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "McCoy, K. F., Vijay-Shanker, K., & Yang, G. (1990). Using tree adjoining grammars in the systemic framework. In Proceedings of 5 th International Workshop on Natural Language Generation., Dawson, PA.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Dependency directed control: Its implications for natural language generation",
"authors": [
{
"first": "D",
"middle": [],
"last": "Mcdonald",
"suffix": ""
}
],
"year": 1983,
"venue": "Computational Linguistics",
"volume": "",
"issue": "",
"pages": "111--130",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "McDonald, D. (1983). Dependency directed con- trol: Its implications for natural language generation. In N. Cercone (Ed.), Computa- tional Linguistics (pp. 111-130). Pergamon Press.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Association for Computational Linguistics",
"authors": [
{
"first": "D",
"middle": [],
"last": "Mcdonald",
"suffix": ""
},
{
"first": "J",
"middle": [
"D"
],
"last": "Pustejovsky",
"suffix": ""
}
],
"year": 1985,
"venue": "Proceedings of the 23rd Annual Meeting",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "McDonald, D. & Pustejovsky, J. D. (1985). Tags as a formalism for generation. In Proceedings of the 23rd Annual Meeting, Chicago, IL. As- sociation for Computational Linguistics.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "A contrastive evaluation of functional unification grammar for surface language generation: A case study in choice of connectives",
"authors": [
{
"first": "K",
"middle": [
"R"
],
"last": "Mckeown",
"suffix": ""
},
{
"first": "M",
"middle": [],
"last": "Elhadad",
"suffix": ""
}
],
"year": 1991,
"venue": "Natural Language Generation in Artificial Intelligence and Linguistics",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "McKeown, K. R. & Elhadad, M. (1991). A contrastive evaluation of functional unifica- tion grammar for surface language gener- ation: A case study in choice of connec- tives. In C. Paris, W. Swartout, ~c W. Mann (Eds.), Natural Language Generation in Ar- tificial Intelligence and Linguistics (pp. 351-",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Bridging the 'generation gap",
"authors": [
{
"first": "M",
"middle": [],
"last": "Meteer",
"suffix": ""
}
],
"year": 1991,
"venue": "Computational Intelligence",
"volume": "7",
"issue": "4",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Meteer, M. (1991). Bridging the 'generation gap'. Computational Intelligence, 7(4).",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Mumble-86: Design and implementation",
"authors": [
{
"first": "",
"middle": [],
"last": "Meteer",
"suffix": ""
}
],
"year": 1987,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Meteer et al., M. (1987). Mumble-86: Design and implementation. COINS Tech Report 87-87a, University of Massachusetts.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Systemic Text Generation as Problem Solving",
"authors": [
{
"first": "T",
"middle": [],
"last": "Patten",
"suffix": ""
}
],
"year": 1988,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Patten, T. (1988). Systemic Text Generation as Problem Solving. Cambridge: Cambridge University Press.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Adapting mumble: Experience with natural language generation",
"authors": [
{
"first": "R",
"middle": [],
"last": "Rubinoff",
"suffix": ""
}
],
"year": 1986,
"venue": "Proceedings of the 1986 National Conference on Artificial Intelligence",
"volume": "",
"issue": "",
"pages": "1063--1068",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Rubinoff, R. (1986). Adapting mumble: Expe- rience with natural language generation. In Proceedings of the 1986 National Conference on Artificial Intelligence, (pp. 1063-1068)., Philadelphia, Pa. AAAI.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Parsing strategies with 'lexicalized' grammars: Application to tree adjoining grammars",
"authors": [
{
"first": "Y",
"middle": [],
"last": "Schabes",
"suffix": ""
},
{
"first": "A",
"middle": [],
"last": "Abeille",
"suffix": ""
},
{
"first": "A",
"middle": [],
"last": "Joshi",
"suffix": ""
}
],
"year": 1988,
"venue": "Proceedings of COLING' 88",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Schabes, Y., Abeille, A., & Joshi, A. (1988). Pars- ing strategies with 'lexicalized' grammars: Application to tree adjoining grammars. In Proceedings of COLING' 88, Budapest, Hun- gary.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Generation and synchronous tree-adjoining grammars",
"authors": [
{
"first": "S",
"middle": [
"M"
],
"last": "Shieber",
"suffix": ""
},
{
"first": "Y",
"middle": [],
"last": "Schabes",
"suffix": ""
}
],
"year": 1991,
"venue": "Computational Intelligence",
"volume": "7",
"issue": "4",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Shieber, S. M. & Schabes, Y. (1991). Gener- ation and synchronous tree-adjoining gram- mars. Computational Intelligence, 7(4).",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Semantic-headdriven generation",
"authors": [
{
"first": "S",
"middle": [
"M"
],
"last": "Shieber",
"suffix": ""
},
{
"first": "G",
"middle": [],
"last": "Van Noord",
"suffix": ""
},
{
"first": "F",
"middle": [],
"last": "Pereira",
"suffix": ""
},
{
"first": "R",
"middle": [
"C"
],
"last": "Moore",
"suffix": ""
}
],
"year": 1990,
"venue": "Computational Linguistics",
"volume": "16",
"issue": "1",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Shieber, S. M., Van Noord, G., Pereira, F., & Moore, R. C. (1990). Semantic-head- driven generation. Computational Linguis- tics, 16(1).",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "Contextdependent transitions in tutoring discourse",
"authors": [
{
"first": "B",
"middle": [],
"last": "Woolf",
"suffix": ""
},
{
"first": "D",
"middle": [],
"last": "Mcdonald",
"suffix": ""
}
],
"year": 1984,
"venue": "Proceedings of the 1984 National Conference on Artificial Intelligence",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Woolf, B. & McDonald, D. (1984). Context- dependent transitions in tutoring discourse. In Proceedings of the 1984 National Confer- ence on Artificial Intelligence, Washington, D.C. AAAI.",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "An Integrated Approach to Generation Using Systemic Grammars and Tree Adjoining Grammars",
"authors": [
{
"first": "G",
"middle": [],
"last": "Yang",
"suffix": ""
}
],
"year": 1991,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yang, G. (1991). An Integrated Approach to Gen- eration Using Systemic Grammars and Tree Adjoining Grammars. PhD thesis, University of Delaware.",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "From functional specification to syntactic structures: Systemic grammar and tree adjoining grammar",
"authors": [
{
"first": "G",
"middle": [],
"last": "Yang",
"suffix": ""
},
{
"first": "K",
"middle": [
"F"
],
"last": "Mccoy",
"suffix": ""
},
{
"first": "K",
"middle": [],
"last": "Vijay-Shanker",
"suffix": ""
}
],
"year": 1991,
"venue": "Computational Intelligence",
"volume": "7",
"issue": "4",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yang, G., McCoy, K. F., & Vijay-Shanker, K. (1991). From functional specification to syn- tactic structures: Systemic grammar and tree adjoining grammar. Computational Intelli- gence, 7(4).",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"uris": null,
"type_str": "figure",
"num": null,
"text": "as a classification of all fmlctional choices expressible in a language."
},
"FIGREF1": {
"uris": null,
"type_str": "figure",
"num": null,
"text": "Initial tree selected in region rl sible for spawning the creation of subregions in which the arguments (and modifiers) are realized."
},
"FIGREF2": {
"uris": null,
"type_str": "figure",
"num": null,
"text": "Figure 3. Tree selected in Actor region r2"
},
"FIGREF3": {
"uris": null,
"type_str": "figure",
"num": null,
"text": "Tree selected in Phenomenon region r3"
},
"FIGREF4": {
"uris": null,
"type_str": "figure",
"num": null,
"text": "Final tree: Who did you think hit John?"
},
"FIGREF5": {
"uris": null,
"type_str": "figure",
"num": null,
"text": "Standard tree for \"John tried to win\""
},
"FIGREF6": {
"uris": null,
"type_str": "figure",
"num": null,
"text": "1\u00b0The details of how the AUX is inserted can be found in"
},
"FIGREF7": {
"uris": null,
"type_str": "figure",
"num": null,
"text": "Figure 7: Flow of Information in Processing Model"
}
}
}
} |