File size: 67,149 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 | {
"paper_id": "P01-1015",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T09:30:12.818991Z"
},
"title": "From RAGS to RICHES: exploiting the potential of a flexible generation architecture",
"authors": [
{
"first": "Lynne",
"middle": [],
"last": "Cahill",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Brighton Brighton",
"location": {
"postCode": "BN2 4GJ",
"country": "UK"
}
},
"email": ""
},
{
"first": "John",
"middle": [],
"last": "Carroll\u00a2",
"suffix": "",
"affiliation": {},
"email": "johnca@cogs.susx.ac.uk"
},
{
"first": "Roger",
"middle": [],
"last": "Evans",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Brighton Brighton",
"location": {
"postCode": "BN2 4GJ",
"country": "UK"
}
},
"email": ""
},
{
"first": "Daniel",
"middle": [],
"last": "Paiva",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Brighton Brighton",
"location": {
"postCode": "BN2 4GJ",
"country": "UK"
}
},
"email": ""
},
{
"first": "Richard",
"middle": [],
"last": "Power",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Brighton Brighton",
"location": {
"postCode": "BN2 4GJ",
"country": "UK"
}
},
"email": ""
},
{
"first": "Donia",
"middle": [],
"last": "Scott",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Brighton Brighton",
"location": {
"postCode": "BN2 4GJ",
"country": "UK"
}
},
"email": ""
},
{
"first": "Kees",
"middle": [],
"last": "Van Deemter",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Brighton Brighton",
"location": {
"postCode": "BN2 4GJ",
"country": "UK"
}
},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "The RAGS proposals for generic specification of NLG systems includes a detailed account of data representation, but only an outline view of processing aspects. In this paper we introduce a modular processing architecture with a concrete implementation which aims to meet the RAGS goals of transparency and reusability. We illustrate the model with the RICHES system-a generation system built from simple linguisticallymotivated modules. 1 More details about the RAGS project, the RICHES implementation and the OASYS subsystem can be found at the RAGS project web site: http://www.itri.bton.ac.uk/projects/rags.",
"pdf_parse": {
"paper_id": "P01-1015",
"_pdf_hash": "",
"abstract": [
{
"text": "The RAGS proposals for generic specification of NLG systems includes a detailed account of data representation, but only an outline view of processing aspects. In this paper we introduce a modular processing architecture with a concrete implementation which aims to meet the RAGS goals of transparency and reusability. We illustrate the model with the RICHES system-a generation system built from simple linguisticallymotivated modules. 1 More details about the RAGS project, the RICHES implementation and the OASYS subsystem can be found at the RAGS project web site: http://www.itri.bton.ac.uk/projects/rags.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "As part of the RAGS (Reference Architecture for Generation Systems) project, introduces a framework for the representation of data in NLG systems, the RAGS 'data model'. This model offers a formally well-defined declarative representation language, which supports the complex and dynamic data requirements of generation systems, e.g. different levels of representation (conceptual to syntax), mixed representations that cut across levels, partial and shared structures and 'canned' representations. However",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "We would like to acknowledge the financial support of the EPSRC (RAGS -Reference Architecture for Generation Systems: grant GR/L77102 to Donia Scott), as well as the intellectual contribution of our partners at Edinburgh (Chris Mellish and Mike Reape: grant GR/L77041 to Mellish) and other colleagues at the ITRI, especially Nedjet Bouayad-Agha. We would also like to acknowledge the contribution of colleagues who worked on the RICHES system previously: Neil Tipper and Rodger Kibble. We are grateful to our anonymous referees for their helpful comments.",
"cite_spans": [
{
"start": 271,
"end": 279,
"text": "Mellish)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a3",
"sec_num": null
},
{
"text": "RAGS, as described in that paper, says very little about the functional structure of an NLG system, or the issues arising from more complex processing regimes (see for example Robin (1994) , Inuie et al., (1992) for further discussion).",
"cite_spans": [
{
"start": 176,
"end": 188,
"text": "Robin (1994)",
"ref_id": "BIBREF12"
},
{
"start": 191,
"end": 211,
"text": "Inuie et al., (1992)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a3",
"sec_num": null
},
{
"text": "NLG systems, especially end-to-end, applied NLG systems, have many functionalities in common. Reiter (1994) proposed an analysis of such systems in terms of a simple three stage pipeline. More recently Cahill et al (1999) attempted to repeat the analysis, but found that while most systems did implement a pipeline, they did not implement the same pipeline -different functionalities occurred in different ways and different orders in different systems. But this survey did identify a number of core functionalities which seem to occur during the execution of most systems. In order to accommodate this result, a 'process model' was sketched which aimed to support both pipelines and more complex control regimes in a flexible but structured way (see (Cahill et al., 1999) , (RAGS, 2000) ). In this paper, we describe our attempts to test these ideas in a simple NLG application that is based on a concrete realisation of such an architecture 1 . The RAGS data model aims to promote comparability and re-usability in the NLG research community, as well as insight into the organisation and processing of linguistic data in NLG. The present work has similar goals for the processing aspects: to propose a general approach to organising whole NLG systems in a way which promotes the same ideals. In addition, we aim to test the claims that the RAGS data model approach supports the flexible processing of information in an NLG setting.",
"cite_spans": [
{
"start": 94,
"end": 107,
"text": "Reiter (1994)",
"ref_id": "BIBREF11"
},
{
"start": 202,
"end": 221,
"text": "Cahill et al (1999)",
"ref_id": "BIBREF0"
},
{
"start": 751,
"end": 772,
"text": "(Cahill et al., 1999)",
"ref_id": "BIBREF0"
},
{
"start": 775,
"end": 787,
"text": "(RAGS, 2000)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a3",
"sec_num": null
},
{
"text": "The starting point for our work here is the RAGS data model as presented in . This model distinguishes the following five levels of data representation that underpin the generation process:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The RAGS data model",
"sec_num": "2"
},
{
"text": "Rhetorical representations (RhetReps) define how propositions within a text are related. For example, the sentence \"Blow your nose, so that it is clear\" can be considered to consist of two propositions: BLOW YOUR NOSE and YOUR NOSE IS CLEAR, connected by a relation like MOTIVATION. Document representations (DocReps) encode information about the physical layout of a document, such as textual level (paragraph, orthographic sentence, etc.), layout (indentation, bullet lists etc.) The representations aim to cover the core common requirements of NLG systems, while avoiding over-commitment on less clearly agreed issues relating to conceptual representation on the one hand and concrete syntax and document rendering on the other. When one considers processing aspects, however, the picture tends to be a lot less tidy: typical modules in real NLG systems often manipulate data at several levels at once, building structures incrementally, and often working with 'mixed' structures, which include information from more than one level. Furthermore this characteristic remains even when one considers more purely functionally-motivated 'abstract' NLG modules. For example, Referring Expression Generation, commonly viewed as a single task, needs to have access to at least rhetorical and document information as well as referencing and adding to the syntactic information.",
"cite_spans": [
{
"start": 400,
"end": 481,
"text": "(paragraph, orthographic sentence, etc.), layout (indentation, bullet lists etc.)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "The RAGS data model",
"sec_num": "2"
},
{
"text": "To accommodate this, the RAGS data model includes a more concrete representational proposal, called the 'whiteboard' (Calder et al., 1999) , in which all the data levels can be represented in a common framework consisting of networks of typed 'objects' connected by typed 'arrows'. This lingua franca allows NLG modules to manipulate data flexibly and consistently. It also facilitates modular design of NLG systems, and reusability of modules and data sets. However, it does not in itself say anything about how modules in such a system might interact.",
"cite_spans": [
{
"start": 117,
"end": 138,
"text": "(Calder et al., 1999)",
"ref_id": "BIBREF2"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "The RAGS data model",
"sec_num": "2"
},
{
"text": "This paper describes a concrete realisation of the RAGS object and arrows model, OASYS, as applied to a simple but flexible NLG system called RICHES. This is not the first such realisation: describes a partial re-implementation of the 'Caption Generation System' (Mittal et al., 1999) which includes an objects and arrows 'whiteboard'. The OASYS system includes more specific proposals for processing and inter-module communication, and RICHES demonstrates how this can be used to support a modular architecture based on small scale functionally-motivated units.",
"cite_spans": [
{
"start": 263,
"end": 284,
"text": "(Mittal et al., 1999)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "The RAGS data model",
"sec_num": "2"
},
{
"text": "OASYS (Objects and Arrows SYStem) is a software library which provides: an implementation of the RAGS Object and Arrows (O/A) data representation, support for representing the five-layer RAGS data model in O/A terms, an event-driven active database server for O/A representations.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "OASYS",
"sec_num": "3"
},
{
"text": "Together these components provide a central core for RAGS-style NLG applications, allowing separate parts of NLG functionality to be specified in independent modules, which communicate exclusively via the OASYS server.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "OASYS",
"sec_num": "3"
},
{
"text": "The O/A data representation is a simple typed network representation language. An O/A database consists of a collection of objects, each of which has a unique identifier and a type, and arrows, each of which has a unique identifier, a type, and source and target objects. Such a database can be viewed as a (possibly disconnected) directed network representation: the figures in section 5 give examples of such networks.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "OASYS",
"sec_num": "3"
},
{
"text": "OASYS pre-defines object and arrow types required to support the RAGS data model. Two arrow types, el (element) and el(<integer>), are used to build up basic network structuresel identifies its target as a member of the set represented by its source, el 3, identifies its target as the third element of the tuple represented by its source. Arrow type realised by relates structures at different levels of representation. for example, indicating that this SemRep object is realised by this SynRep object. Arrow type revised to provides for support for nondestructive modification of a structure, mapping from an object to another of the same type that can be viewed as a revision of it. Arrow type refers to allows an object at one level to indirectly refer to an object at a different level. Object types correspond to the types of the RAGS data model, and are either atomic, tuples, sets or sequences. For example, document structures are built out of DocRep (a 2-tuple), DocAttr (a set of DocFeatAtoms -feature-value pairs), DocRe-pSeq (a sequence of DocReps or DocLeafs) and DocLeafs.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "OASYS",
"sec_num": "3"
},
{
"text": "The active database server supports multiple independent O/A databases. Individual modules of an application publish and retrieve objects and arrows on databases, incrementally building the 'higher level', data structures. Modules communicate by accessing a shared database. Flow of control in the application is event-based: the OASYS module has the central thread of execution, calls to OASYS generate 'events', and modules are implemented as event handlers. A module registers interest in particular kinds of events, and when those events occur, the module's hander is called to deal with them, which typically will involve inspecting the database and adding more structure (which generates further events).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "OASYS",
"sec_num": "3"
},
{
"text": "OASYS supports three kinds of events: publish events occur whenever an object or arrow is published in a database, module lifecycle events occur whenever a new module starts up or terminates, and synthetic events -arbitrary messages passed between the modules, but not interpreted by OASYS itself -may be generated by modules at any time. An application starts up by initialising all its modules. This generates initialise events, which at least one module must respond to, generating further events which other modules may respond to, and so on, until no new events are generated, at which point OASYS generates finalise events for all the modules and terminates them.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "OASYS",
"sec_num": "3"
},
{
"text": "This framework supports a wide range of architectural possibilities. Publish events can be used to make a module wake up whenever data of a particular sort becomes available for processing. Lifecycle events provide, among other things, an easy way to do pipelining: the second module in a pipeline waits for the finalise event of the first and then starts processing, the third waits similarly for the second to finalise etc. Synthetic events allow modules to tell each other more explicitly that some data is ready for processing, in situation where simple publication of an object is not enough.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "OASYS",
"sec_num": "3"
},
{
"text": "RICHES includes examples of all three regimes: the first three modules are pipelined using lifecycle events; LC and RE, FLO and REND interact using synthetic events; while SF watches the database specifically for publication events.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "OASYS",
"sec_num": "3"
},
{
"text": "The RICHES system is a simple generation system that takes as input rhetorical plans and produces patient advice texts. The texts are intended to resemble those found at the PharmWeb site (http://www.pharmweb.net). These are simple instructional texts telling patients how to use certain types of medicines, such as nosedrops, eye drops, suppositories etc.. An example text from PharmWeb is shown in figure 1, alongside the corresponding text produced by RICHES.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "RICHES",
"sec_num": "4"
},
{
"text": "The main aim of RICHES is to demonstrate the feasibility of a system based on both the RAGS data model and the OASYS server model. The modules collectively construct and access the data representations in a shared blackboard space and this allows the modules to be defined in terms of their functional role, rather than say, the kind of data they manipulate or their position in a processing pipeline. Each of the modules in the sys- Keep your head tilted back for two to three minutes so that the drops run to the back.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "RICHES",
"sec_num": "4"
},
{
"text": "Replace the top on the bottle Generated by RICHES version 1.0 (9/5/2001) on 9/5/2001 \u00a92001, ITRI, University of Brighton Figure 1 : An example text from PharmWeb, together with the corresponding text generated by RICHES tem is in itself very simple -our primary interest here is in the way they interact. Figure 2 shows the structure of the system 2 . The functionality of the individual modules is briefly described below.",
"cite_spans": [],
"ref_spans": [
{
"start": 121,
"end": 129,
"text": "Figure 1",
"ref_id": null
},
{
"start": 305,
"end": 313,
"text": "Figure 2",
"ref_id": "FIGREF1"
}
],
"eq_spans": [],
"section": "RICHES",
"sec_num": "4"
},
{
"text": "The input to the system is a RhetRep of the document to be generated: a tree with internal nodes labelled with (RST-style) rhetorical relations and RhetLeaves referring to semantic proposition representations (SemReps). RO simply accesses such a representation from a data file and initialises the OASYS database. tures, annotated with their SemReps, are part of the picture library, and Media Selection builds small pieces of DocRep referencing the pictures. Document Planner (DP) The Document Planner, based on the ICONOCLAST text planner (Power, 2000) takes the input RhetRep and produces a document structure (DocRep). This specifies aspects such as the text-level (e.g., paragraph, sentence) and the relative ordering of propositions in the DocRep. Its leaves refer to SynReps corresponding to syntactic phrases. This module is pipelined after MS, to make sure that it takes account of any pictures that have been included in the document.",
"cite_spans": [
{
"start": 541,
"end": 554,
"text": "(Power, 2000)",
"ref_id": "BIBREF10"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Rhetorical Oracle (RO)",
"sec_num": null
},
{
"text": "Lexical Choice (LC) Lexical choice happens in two stages. In the first stage, LC chooses the lexical items for the predicate of each SynRep. This fixes the basic syntactic structure of the proposition, and the valency mapping between semantic and syntactic arguments. At this point the basic document structure is complete, and the LC advises REND and SF that they can start processing. LC then goes into a second phase, in- terleaved with RE and FLO: for each sentence, RE determines the referring expressions for each noun phrase, LC then lexicalises them, and when the sentence is complete FLO invokes LinGO to realise them.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Media Selection (MS",
"sec_num": null
},
{
"text": "Expression module adapts the SynReps to add information about the form of a noun phrase. It decides whether it should be a pronoun, a definite noun phrase or an indefinite noun phrase.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Referring Expressions (RE) The Referring",
"sec_num": null
},
{
"text": "The Sentence Finaliser carries out high level sentential organisation. LC and RE together build individual syntactic phrases, but do not combine them into whole sentences. SF uses rhetorical and document structure information to decide how to complete the syntactic representations, for example, combining main and subordinate clauses. In addition, SF decides whether a sentence should be imperative, depending on who the reader of the document is (an input parameter to the system).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Sentence Finaliser (SF)",
"sec_num": null
},
{
"text": "Finalise Lexical Output (FLO) RICHES uses an external sentence realiser component with its own non-RAGS input specification. FLO provides the interface to this realiser, extracting (mostly syntactic) information from OASYS and converting it to the appropriate form for the realiser. Currently, FLO supports the LinGO realiser (Carroll et al., 1999 ), but we are also looking at FLO modules for RealPro (Lavoie and Rambow, 1997) and FUF/SURGE (Elhadad et al., 1997) .",
"cite_spans": [
{
"start": 326,
"end": 347,
"text": "(Carroll et al., 1999",
"ref_id": "BIBREF3"
},
{
"start": 402,
"end": 427,
"text": "(Lavoie and Rambow, 1997)",
"ref_id": "BIBREF7"
},
{
"start": 442,
"end": 464,
"text": "(Elhadad et al., 1997)",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Sentence Finaliser (SF)",
"sec_num": null
},
{
"text": "The Renderer is the module that puts the concrete document together. Guided by the document structure, it produces HTML formatting for the text and positions and references the pictures. Individual sentences are produced for it by LinGO, via the FLO interface. FLO actually processes sentences independently of REND, so when REND makes a request, either the sentence is there already, or the request is queued, and serviced when it becomes available.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Renderer (REND)",
"sec_num": null
},
{
"text": "LinGO The LinGO realiser uses a widecoverage grammar of English in the LKB HPSG framework, (Copestake and Flickinger, 2000) . The tactical generation component accepts input in the Minimal Recursion Semantics formalism and produces the target text using a chartdriven algorithm with an optimised treatment of modification (Carroll et al., 1999) . No domainspecific tuning of the grammar was required for the RICHES system, only a few additions to the lexicon were necessary.",
"cite_spans": [
{
"start": 91,
"end": 123,
"text": "(Copestake and Flickinger, 2000)",
"ref_id": "BIBREF4"
},
{
"start": 322,
"end": 344,
"text": "(Carroll et al., 1999)",
"ref_id": "BIBREF3"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Renderer (REND)",
"sec_num": null
},
{
"text": "In this section we show how RICHES generates the first sentence of the example text, Blow your nose so that it is clear and the picture that accompanies the text.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "An example: generation in RICHES",
"sec_num": "5"
},
{
"text": "The system starts with a rhetorical representation (RhetRep) provided by the RO (see Figure 3) 3 . The first active module to run is MS which traverses the RhetRep looking at the semantic propositions labelling the RhetRep leaves, to see if any can be illustrated by pictures in the picture library. Each picture in the library is encoded with a semantic representation. Matching between propositions and pictures is based on the algorithm presented in Van Deemter (1999) which selects the most informative picture whose representation contains nothing that is not contained in the proposition. For each picture that will be included, a leaf node of document representation is created and a realised by arrow is added to it from the semantic proposition object (see Figure 4) .",
"cite_spans": [],
"ref_spans": [
{
"start": 85,
"end": 94,
"text": "Figure 3)",
"ref_id": null
},
{
"start": 766,
"end": 776,
"text": "Figure 4)",
"ref_id": "FIGREF2"
}
],
"eq_spans": [],
"section": "An example: generation in RICHES",
"sec_num": "5"
},
{
"text": "\u00a2 \u00a1 \u00a4 \u00a3 \u00a6 \u00a5 \u00a7 \u00a2 \u00a3 \u00a9 el(1) el(2) \u00a1 \u00a3 \u00a6 \u00a5 \u00a7 \u00a2 \u00a3 \u00a9 \u00a9 (motivation) \u00a2 \u00a1 \u00a4 \u00a3 \u00a6 \u00a5 \u00a7 \u00a2 \u00a3 \u00a9 \" ! # \u00a3 % $ ' & el(1) el(2) \u00a2 \u00a1 \u00a4 \u00a3 \u00a6 \u00a5 ) ( 0 \u00a3 % 1 3 2 % 4 refers to \u00a1 \u00a3 \u00a6 \u00a5 ) ( 5 \u00a3 % 1 6 2 6 & 7 4 8 refers to ! # \u00a3 \u00a6 9 @ \u00a3 \u00a9 B A C C C C D E F F F F F F G el(1) el(2) el(3) ! # \u00a3 \u00a6 9 @ \u00a3 \u00a9 B & 7 A",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "An example: generation in RICHES",
"sec_num": "5"
},
{
"text": "\"patient's nose is clear\" ing how the content will be split into sentences, paragraphs, item lists, etc., and what order the elements will appear in. It also inserts markers that will be translated to cue phrases to express some rhetorical relations explicitly. Initially the planner creates a skeleton document representation that is a one-to-one mapping of the rhetorical representation, but taking account of any nodes already introduced by the MS module, and assigns finite-domain constraint variables to the features labelling each node. It then applies constraint satisfaction techniques to identify a consistent set of assignments to these variables, and publishes the resulting document structure for other modules to process.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "An example: generation in RICHES",
"sec_num": "5"
},
{
"text": "H P I Q S R 5 T V U 0 W 6 X Y \u00e0 b ! # \u00a3 \u00a6 9 d c ' e # f \u00a3 0 g C C C C D el ! # \u00a3 \u00a9 9 d h B \u00a5 7 \u00a5 7 i p F F F F F F G el el ! q \u00a3 \u00a9 9 d r i \u00a7 \u00a3 % R B s (blow) ! q \u00a3 \u00a9 9 @ \u00a2 t u v \u00a3 \u00a9 \u00a2 \u00a3 \u00a9 4g el(1) el(2) ! # \u00a3 \u00a9 9 @ \u00a2 t u v \u00a3 \u00a9 \u00a2 \u00a3 \u00a9 x w \"patient's nose\" ! q \u00a3 \u00a9 9 @ t y v \u00a3 4p (actor) ! # \u00a3 \u00a9 9 @ \u00a2 \u00a3 \u00a9 A \"patient\"",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "An example: generation in RICHES",
"sec_num": "5"
},
{
"text": "In our example, the planner decided that the whole document will be expressed as a paragraph (that in this case consists of a single text sentence) and that the document leaves will represent text-phrases. It also decides that these two textphrases will be linked by a 'subordinator' marker (which will eventually be realised as \"so that\"), that \"patient blows patient's nose\" will be realised before \"patient's nose is clear\". At this stage, the representation looks like Figure 5 .",
"cite_spans": [],
"ref_spans": [
{
"start": 473,
"end": 481,
"text": "Figure 5",
"ref_id": null
}
],
"eq_spans": [],
"section": "An example: generation in RICHES",
"sec_num": "5"
},
{
"text": "The first stage of LC starts after DP has finished and chooses the lexical items for the main predicates (in this case \"blow\" and \"clear\"). These are created as SynReps, linked to the leaves of the DocRep tree. In addition the initial SynReps for the syntactic arguments are created, and linked to the corresponding arguments of the semantic proposition (for example, syntactic SUBJECT is linked to semantic ACTOR). The database at this stage (showing only the representation pertinent to the first sentence) looks like Figure 6 .",
"cite_spans": [],
"ref_spans": [
{
"start": 520,
"end": 528,
"text": "Figure 6",
"ref_id": "FIGREF3"
}
],
"eq_spans": [],
"section": "An example: generation in RICHES",
"sec_num": "5"
},
{
"text": "Until this point the flow of control has been a straight pipeline. Referring Expression Generation (RE) and the second stage of Lexical Choice (LC) operate in an interleaved fashion. RE collects the propositions in the order specified in the document representation and, for each of them, it inspects the semantic entities it contains (e.g., for our first sentence, those entities are 'patient' and 'nose') to decide whether they will be realised as a definite description or a pronoun. For our example, the final structure for the first argument in the first sentence can be seen in Figure 7 (although note that it will not be realised explicitly because the sentence is an imperative one). SF waits for the syntactic structure of indvidual clauses to be complete, and then inspects the syntactic, rhetorical and document structure to decide how to combine clauses. In the example, it decides to represent the rhetorical 'motivation' relation within a single text sentence by using the subordinator 'so that'. It also makes the main clause an imperative, and the subordinate clause indicative.",
"cite_spans": [],
"ref_spans": [
{
"start": 584,
"end": 592,
"text": "Figure 7",
"ref_id": "FIGREF4"
}
],
"eq_spans": [],
"section": "An example: generation in RICHES",
"sec_num": "5"
},
{
"text": "v w S p ! q e \u00a6 \" h x i A`E el h R A \u00a7 ! q e \u00a6 \u00a9 \u00a4 U \u00a6 \u00a3 \u00a9 g 7 g \u00a4 \u00a4 8 el(1) el(2) ! q e \u00a6 ! \u00a9 U \u00a6 a p \u00a6 (subject) ! q e \u00a6 \u00a4 \u00a2 \u00a3 \u00a9 a p&",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "An example: generation in RICHES",
"sec_num": "5"
},
{
"text": "As soon as SF completes a whole syntactic sentence, FLO notices, and extracts the information required to interface to LinGO with an MRS structure. The string of words returned by LinGO, is stored internally by FLO until REND requests it.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "An example: generation in RICHES",
"sec_num": "5"
},
{
"text": "Finally, REND draws together all the information from the document and syntactic structures, and the realiser outputs provided by FLO, and produces HTML. The entire resultant text can be seen on the right hand side of figure 1. ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "An example: generation in RICHES",
"sec_num": "5"
},
{
"text": "\u00a6 ! \u00a9 U \u00a6 \u00a4 \u00a2 \u00a3 \u00a9 g 7 g el(1) el(2) ! # \u00a3 \u00a9 9 @ \u00a2 \u00a3 \u00a9 A realised by ! q e \u00a6 ! \u00a9 \u00a4 U \u00a7 \u00a6 a p \u00a6 (subject) ! q e \u00a6 \u00a4 \u00a2 \u00a3 \u00a9 a p& E el(1) \u00a9 # 9 a p \u00a7 w form: pron root: patient person: 2nd",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "! q e",
"sec_num": null
},
{
"text": "In this paper, we have described a small NLG system implemented using an event-driven, objectand-arrow based processing architecture. The system makes use of the data representation ideas proposed in the RAGS project, but adds a concrete proposal relating to application organisation and process control. Our main aims were to develop this 'process model' as a complement to the RAGS 'data model,' show that it could be implemented and used effectively, and test whether the RAGS ideas about data organisation and development can actually be deployed in such a system. Although the RICHES generator is quite simple, it demonstrates that it is possible to construct a RAGS-style generation system using these ideas, and that the OASYS processing model has the flexibility to support the kind of modularised NLG architecture that the RAGS initiative presupposes. Some of the complexity in the RICHES system is there to demonstrate the potential for different types of control strategies. Specifically, we do not make use of the possibilities offered by the interleaving of the RE and LC, as the examples we cover are too simple. However, this setup enables RE, in principle, to make use of information about precisely how a previous reference to an entity has been realised. Thus, if the first mention of an entity is as \"the man\", RE may decide that a pronoun, \"he\" is acceptable in a subsequent reference. If, however, the first reference was realised as \"the person\", it may decide to say \"the man\" next time around.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Summary",
"sec_num": "6"
},
{
"text": "At the beginning of this paper we mentioned systems that do not implement a standard pipeline. The RICHES system demonstrates that the RAGS model is sufficiently flexible to permit modules to work concurrently (as the REND and LC do in RICHES), alternately, passing control backwards and forwards (as the RE and LC modules do in RICHES) or pipelined (as the Document Planner and LC do in RICHES).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Summary",
"sec_num": "6"
},
{
"text": "The different types of events allow for a wide range of possible control models. In the case of a simple pipeline, each module only needs to know that its predecessor has finished. Depending on the precise nature of the work each module is doing, this may be best achievable through publish events (e.g. when a DocRep has been published, the DP may be deemed to have finished its work) or through lifecycle events (e.g. the DP effectively states that it has finished). A revision based architecture might require synthetic events to \"wake up\" a module to do some more work, after it has finished its first pass.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Summary",
"sec_num": "6"
},
{
"text": "In the figures, labels indicate object types and the subscript numbers are identifiers provided by OASYS for each",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "In search of a reference architecture for NLG systems",
"authors": [
{
"first": "Lynne",
"middle": [],
"last": "Cahill",
"suffix": ""
},
{
"first": "Christine",
"middle": [],
"last": "Doran",
"suffix": ""
},
{
"first": "Roger",
"middle": [],
"last": "Evans",
"suffix": ""
},
{
"first": "Chris",
"middle": [],
"last": "Mellish",
"suffix": ""
},
{
"first": "Daniel",
"middle": [],
"last": "Paiva",
"suffix": ""
},
{
"first": "Mike",
"middle": [],
"last": "Reape",
"suffix": ""
},
{
"first": "Donia",
"middle": [],
"last": "Scott",
"suffix": ""
},
{
"first": "Neil",
"middle": [],
"last": "Tipper",
"suffix": ""
}
],
"year": 1999,
"venue": "Proceedings of the Seventh European Natural Language Generation Workshop",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Lynne Cahill, Christine Doran, Roger Evans, Chris Mellish, Daniel Paiva, Mike Reape, Donia Scott, and Neil Tipper. 1999. In search of a reference architecture for NLG sys- tems. In Proceedings of the Seventh European Natural Language Generation Workshop, Toulouse, France.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Reinterpretation of an existing NLG system in a Generic Generation Architecture",
"authors": [
{
"first": "Lynne",
"middle": [],
"last": "Cahill",
"suffix": ""
},
{
"first": "Christine",
"middle": [],
"last": "Doran",
"suffix": ""
},
{
"first": "Roger",
"middle": [],
"last": "Evans",
"suffix": ""
},
{
"first": "Chris",
"middle": [],
"last": "Mellish",
"suffix": ""
},
{
"first": "Daniel",
"middle": [],
"last": "Paiva",
"suffix": ""
}
],
"year": 2000,
"venue": "Proceedings of the First International Natural Language Generation Conference",
"volume": "",
"issue": "",
"pages": "69--76",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Lynne Cahill, Christine Doran, Roger Evans, Chris Mellish, Daniel Paiva, Mike Reape, Donia Scott, and Neil Tip- per. 2000. Reinterpretation of an existing NLG system in a Generic Generation Architecture. In Proceedings of the First International Natural Language Generation Conference, pages 69-76, Mitzpe Ramon, Israel.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "May I speak freely?\" Between templates and free choice in natural language generation",
"authors": [
{
"first": "Jo",
"middle": [],
"last": "Calder",
"suffix": ""
},
{
"first": "Roger",
"middle": [],
"last": "Evans",
"suffix": ""
},
{
"first": "Chris",
"middle": [],
"last": "Mellish",
"suffix": ""
},
{
"first": "Mike",
"middle": [],
"last": "Reape",
"suffix": ""
}
],
"year": 1999,
"venue": "",
"volume": "",
"issue": "",
"pages": "19--24",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jo Calder, Roger Evans, Chris Mellish, and Mike Reape. 1999. \"Free choice\" and templates: how to get both at the same time. In \"May I speak freely?\" Between templates and free choice in natural language generation, number D-99-01, pages 19-24. Saarbr\u00fccken.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "An efficient chart generator for (semi-)lexicalist grammars",
"authors": [
{
"first": "John",
"middle": [],
"last": "Carroll",
"suffix": ""
},
{
"first": "Ann",
"middle": [],
"last": "Copestake",
"suffix": ""
},
{
"first": "Dan",
"middle": [],
"last": "Flickinger",
"suffix": ""
},
{
"first": "Victor",
"middle": [],
"last": "Poznanski",
"suffix": ""
}
],
"year": 1999,
"venue": "Proceedings of the 7th European Workshop on Natural Language Generation (EWNLG'99)",
"volume": "",
"issue": "",
"pages": "86--95",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "John Carroll, Ann Copestake, Dan Flickinger, and Vic- tor Poznanski. 1999. An efficient chart generator for (semi-)lexicalist grammars. In Proceedings of the 7th European Workshop on Natural Language Generation (EWNLG'99), pages 86-95, Toulouse, France.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "An open source grammar development environment and broad-coverage English grammar using HPSG",
"authors": [
{
"first": "Ann",
"middle": [],
"last": "Copestake",
"suffix": ""
},
{
"first": "Dan",
"middle": [],
"last": "Flickinger",
"suffix": ""
}
],
"year": 2000,
"venue": "Proceedings of the 2nd International Conference on Language Resources and Evaluation",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ann Copestake and Dan Flickinger. 2000. An open source grammar development environment and broad-coverage English grammar using HPSG. In Proceedings of the 2nd International Conference on Language Resources and Evaluation, Athens, Greece.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Floating constraints in lexical choice",
"authors": [
{
"first": "Michael",
"middle": [],
"last": "Elhadad",
"suffix": ""
},
{
"first": "Kathleen",
"middle": [],
"last": "Mckeown",
"suffix": ""
},
{
"first": "Jacques",
"middle": [],
"last": "Robin",
"suffix": ""
}
],
"year": 1997,
"venue": "Computational Linguistics",
"volume": "23",
"issue": "2",
"pages": "195--240",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Michael Elhadad, Kathleen McKeown, and Jacques Robin. 1997. Floating constraints in lexical choice. Computa- tional Linguistics, 23(2):195-240.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Text revision: A model and its implementation",
"authors": [
{
"first": "K",
"middle": [],
"last": "Inui",
"suffix": ""
},
{
"first": "T",
"middle": [],
"last": "Tokunaga",
"suffix": ""
},
{
"first": "H",
"middle": [],
"last": "Tanaka",
"suffix": ""
}
],
"year": 1992,
"venue": "Aspects of Automated Natural Language Generation, number LNAI-587",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "K. Inui, T. Tokunaga, and H. Tanaka. 1992. Text re- vision: A model and its implementation. In R. Dale, E. Hovy, D. Rosner, and O. Stock, editors, Aspects of Au- tomated Natural Language Generation, number LNAI- 587. Springer-Verlag.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "A fast and portable realizer for text generation systems",
"authors": [
{
"first": "B",
"middle": [],
"last": "Lavoie",
"suffix": ""
},
{
"first": "O",
"middle": [],
"last": "Rambow",
"suffix": ""
}
],
"year": 1997,
"venue": "Proceedings of the Fifth Conference on Applied Natural Language Processing",
"volume": "",
"issue": "",
"pages": "265--68",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "B. Lavoie and O. Rambow. 1997. A fast and portable re- alizer for text generation systems. In Proceedings of the Fifth Conference on Applied Natural Language Process- ing, pages 265-68, Washington, DC.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "A representation for complex and evolving data dependencies in generation",
"authors": [
{
"first": "Chris",
"middle": [],
"last": "Mellish",
"suffix": ""
},
{
"first": "Roger",
"middle": [],
"last": "Evans",
"suffix": ""
},
{
"first": "Lynne",
"middle": [],
"last": "Cahill",
"suffix": ""
},
{
"first": "Christy",
"middle": [],
"last": "Doran",
"suffix": ""
},
{
"first": "Daniel",
"middle": [],
"last": "Paiva",
"suffix": ""
},
{
"first": "Mike",
"middle": [],
"last": "Reape",
"suffix": ""
},
{
"first": "Donia",
"middle": [],
"last": "Scott",
"suffix": ""
},
{
"first": "Neil",
"middle": [],
"last": "Tipper",
"suffix": ""
}
],
"year": 2000,
"venue": "Language Technology Joint Conference, ANLP-NAACL2000",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Chris Mellish, Roger Evans, Lynne Cahill, Christy Doran, Daniel Paiva, Mike Reape, Donia Scott, and Neil Tipper. 2000. A representation for complex and evolving data de- pendencies in generation. In Language Technology Joint Conference, ANLP-NAACL2000, Seattle.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Describing complex charts in natural language: A caption generation system",
"authors": [
{
"first": "V",
"middle": [
"O"
],
"last": "Mittal",
"suffix": ""
},
{
"first": "J",
"middle": [
"D"
],
"last": "Moore",
"suffix": ""
},
{
"first": "G",
"middle": [],
"last": "Carenini",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Roth",
"suffix": ""
}
],
"year": 1999,
"venue": "Computation Linguistics",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "V. O. Mittal, J. D. Moore, G. Carenini, and S. Roth. 1999. Describing complex charts in natural language: A caption generation system. Computation Linguistics.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Towards a Reference Architecture for Natural Language Generation Systems",
"authors": [
{
"first": "Richard",
"middle": [],
"last": "Power",
"suffix": ""
}
],
"year": 2000,
"venue": "Proceedings of the 18th International Conference on Computational Linguistics (COLING-2000)",
"volume": "",
"issue": "",
"pages": "642--648",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Richard Power. 2000. Planning texts by constraint satis- faction. In Proceedings of the 18th International Con- ference on Computational Linguistics (COLING-2000), pages 642-648, Saarbr\u00fccken, Germany. RAGS. 2000. Towards a Reference Architecture for Natural Language Generation Systems. Tech- nical report, Information Technology Research Insti- tute (ITRI), University of Brighton. Available at http://www.itri.brighton.ac.uk/projects/rags .",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Has a consensus NL generation architecture appeared and is it psycholinguistically plausible?",
"authors": [
{
"first": "Ehud",
"middle": [],
"last": "Reiter",
"suffix": ""
}
],
"year": 1994,
"venue": "Proceedings of the Seventh International Workshop on Natural Language Generation",
"volume": "",
"issue": "",
"pages": "163--170",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ehud Reiter. 1994. Has a consensus NL generation archi- tecture appeared and is it psycholinguistically plausible? In Proceedings of the Seventh International Workshop on Natural Language Generation, pages 163-170, Kenneb- unkport, Maine.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Revision-Based Generation of Natural Language Summaries Providing Historical Background:Corpus-Based Analysis, Design, Implementation and Evaluation",
"authors": [
{
"first": "J",
"middle": [],
"last": "Robin",
"suffix": ""
}
],
"year": 1994,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "J. Robin. 1994. Revision-Based Generation of Natural Language Summaries Providing Historical Background:Corpus-Based Analysis, Design, Implemen- tation and Evaluation. Technical Report CUCS-034-94, Columbia University.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Document generation and picture retrieval",
"authors": [
{
"first": "K",
"middle": [],
"last": "Van Deemter",
"suffix": ""
}
],
"year": 1999,
"venue": "Procs. of Third Int. Conf. on Visual Information Systems (VISUAL-99)",
"volume": "",
"issue": "",
"pages": "632--640",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "K. van Deemter. 1999. Document generation and picture retrieval. In Procs. of Third Int. Conf. on Visual Infor- mation Systems (VISUAL-99), Springer Lecture Notes in Computer Science no. 1614, pages 632-640, Amsterdan, Netherlands.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"text": "RICHES produces documents that may include pictures as well as text. As soon as the RhetRep becomes available, this module examines it and decides what can be illustrated and what picture should illustrate it. Pic-2 The dashed lines indicate flow of information, solid arrows indicate approximately flow of control between modules, double boxes indicate a completely reused module (from another system), while a double box with a dashed outer indicates a module partially reused. Ellipses indicate information sources, as opposed to processing modules.",
"type_str": "figure",
"num": null,
"uris": null
},
"FIGREF1": {
"text": "The structure of the RICHES system",
"type_str": "figure",
"num": null,
"uris": null
},
"FIGREF2": {
"text": "Inclusion of a picture by MSThe DP is an adaptation of the ICONOCLAST constraint-based planner and takes the RhetRep as its input. The DP maps the rhetorical representation into a document representation, decidobject. Those parts inside boxes are simplifications to the actual representation used in order not to clutter the figures.",
"type_str": "figure",
"num": null,
"uris": null
},
"FIGREF3": {
"text": "First stage of Lexical Choice -part of sentence 1",
"type_str": "figure",
"num": null,
"uris": null
},
"FIGREF4": {
"text": "Second stage of Lexical Choice -entity 1 of sentence 1",
"type_str": "figure",
"num": null,
"uris": null
},
"TABREF1": {
"text": ". Blow your nose gently, so that it is clear.2. Wash your hands.3. Unscrew the top of the bottle and draw some liquid into the dropper. 4. Tilt your head back.5. Hold the dropper just above your nose and put the correct number of drops into your nostril.6. DO NOT let the dropper touch the inside of your nose. 7. Keep your head tilted back for two to three minutes to help the drops run to the back of your nose.8. Replace the top on the bottle.KEEP ALL MEDICINES OUT OF THE REACH OF CHILDRENBlow your nose so that it is clear.Wash your handsUnscrew the top. Then draw the liquid into the dropper.Tilt your head backHold the dropper above your nose. Then put the drops into your nostril.The dropper must not touch the inside.",
"html": null,
"content": "<table><tr><td>PharmWeb -Copyright\u00a91994-2001. All rights reserved</td></tr></table>",
"num": null,
"type_str": "table"
}
}
}
} |