File size: 18,617 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
{
    "paper_id": "P79-1012",
    "header": {
        "generated_with": "S2ORC 1.0.0",
        "date_generated": "2023-01-19T08:11:38.130189Z"
    },
    "title": "A SNAPSHOT OF KDS A KNOWLEDGE DF_,LIVERY SYSTEM",
    "authors": [
        {
            "first": "James",
            "middle": [
                "A"
            ],
            "last": "Moore",
            "suffix": "",
            "affiliation": {
                "laboratory": "",
                "institution": "USCIlnformaUon Sciences Institute Marina del Ray",
                "location": {
                    "postCode": "1979",
                    "settlement": "June",
                    "region": "CA"
                }
            },
            "email": ""
        },
        {
            "first": "William",
            "middle": [
                "C"
            ],
            "last": "Mann",
            "suffix": "",
            "affiliation": {
                "laboratory": "",
                "institution": "USCIlnformaUon Sciences Institute Marina del Ray",
                "location": {
                    "postCode": "1979",
                    "settlement": "June",
                    "region": "CA"
                }
            },
            "email": ""
        }
    ],
    "year": "",
    "venue": null,
    "identifiers": {},
    "abstract": "",
    "pdf_parse": {
        "paper_id": "P79-1012",
        "_pdf_hash": "",
        "abstract": [],
        "body_text": [
            {
                "text": "Is a computer program which creates multl-par~raph, Natural Language text from a computer representation of knowledge to be delivered. We have addressed a number of Issues not previously encountered In the generation of Natural Language st the multi-sentence level, vlz: ordering among sentences and the scope of each, quality comparisons between alternative 8~regations of sub-sententJal units, the coordination of communication with non-linguistic activities by \u2022 gcel-pursuin~ planner, end the use of dynamic models of speaker and hearer to shape the text to the task at hand.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "KDS",
                "sec_num": null
            },
            {
                "text": "The task of KDS is to generate English text under the following constraints:",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "STATEMENT OF THE PROBLEM",
                "sec_num": null
            },
            {
                "text": "1. The source of information Is a semantic net, having no a priori structuring to facilitate the outputtlng task.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "STATEMENT OF THE PROBLEM",
                "sec_num": null
            },
            {
                "text": "This represents the most elaborate performance of KDS to date.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "STATEMENT OF THE PROBLEM",
                "sec_num": null
            },
            {
                "text": "The KDS organization reflects our novel paradigm: FRAGMENT-AND-COMPOSE. KDS decomposes the original network into fragments then orders and 8~regatas these according to the dictates of the text-producing task, not according to the needs for which the internal representation was originally conceived. KDS has shown the feasibility of this approach.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "SYSTEM DESIGN",
                "sec_num": null
            },
            {
                "text": "The KDS organization Is a simple pipeline: FRAGMENT, PLAN, FILTER, HILL-CLIMB, and OUTPUT.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "SYSTEM DESIGN",
                "sec_num": null
            },
            {
                "text": "FRAGMENT transforms the selected portion of the semantic net into an unordered set of propositions which correspond, roughly, to minimal sentences.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "SYSTEM DESIGN",
                "sec_num": null
            },
            {
                "text": "2. The text is produced to satisfy an explicit goal held by the text generating system, which describes a desired cognitive state of the reader.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "SYSTEM DESIGN",
                "sec_num": null
            },
            {
                "text": "3. To achieve the desired state of the reader requires more than a single sentence.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "SYSTEM DESIGN",
                "sec_num": null
            },
            {
                "text": "This is not the forum for a extensive analysis of our results; for details, see Mann and Moore [ 1979] . However, to communicate the flavor of what ~ve have accomplished--from the motivating goal:",
                "cite_spans": [
                    {
                        "start": 80,
                        "end": 102,
                        "text": "Mann and Moore [ 1979]",
                        "ref_id": null
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "R ESULTS",
                "sec_num": null
            },
            {
                "text": "and about two pages of formal propositions describing the \"Fire-alarm scene', KDS generated the following: \"When conveying a scene in which the hearer is to identify himself with one of the actors, express ell propositions involving that actor AFTER those which do not, and separate these two partitions by a paragraph break'.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "(WANTS SPEAKER (KNOWS HEARER F ldlE-ALARM-SCENE))",
                "sec_num": null
            },
            {
                "text": "W Aeneeor",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "(WANTS SPEAKER (KNOWS HEARER F ldlE-ALARM-SCENE))",
                "sec_num": null
            },
            {
                "text": "FILTER, deletes from the set, ell propositions currently represented as known by the hearer.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "(WANTS SPEAKER (KNOWS HEARER F ldlE-ALARM-SCENE))",
                "sec_num": null
            },
            {
                "text": "coordinates two sub-activities: AGGREGATOR applies rules to combine two or three fragments into a single one. A typical aggregation rule is:",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "HILL-CLIMB",
                "sec_num": null
            },
            {
                "text": "\"The two fragments 'x does A' and 'x does B' can be combin~! into a single fragment: 'x does A and B'\". PREFERENCER evaluates each proposed new fragment, producing a numerical measure of its \"goodness\". A typical preference rule is:",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "HILL-CLIMB",
                "sec_num": null
            },
            {
                "text": "\"When instructing the hearer, lncremm the accumulating measure by 10 for each occurrence of the symbol 'YOU'\". HILL-CLIMB uses AGGREGATOR to generate new candidate sets of fregments, and PREFERENCER, to determine which new set presents the best one-step improvement over the current set.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "HILL-CLIMB",
                "sec_num": null
            },
            {
                "text": "The objective function of HILL-CLIMB has been enlarged to also take into ecceunt the COST OF FOREGONE OPPORTUNITIES. This has drastically improved the initial performance, since the topology abounds wtth local maxima.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "HILL-CLIMB",
                "sec_num": null
            },
            {
                "text": "KDS has used, at one time or another, on the order of 10 planning rules, 30 aggregation rules and 7 preference rules.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "HILL-CLIMB",
                "sec_num": null
            },
            {
                "text": "The aggregation and preference rules are directly analogoua to the capabilities of linguistic eempotence and performance, respectively.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "HILL-CLIMB",
                "sec_num": null
            },
            {
                "text": "OUTPUT lsa simple (two pages of LISP) text generator driven by a context free grammar.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "HILL-CLIMB",
                "sec_num": null
            }
        ],
        "back_matter": [
            {
                "text": "The work reported here was supported by NSF Grant MCS-76-07332.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "ACKNOWLEDGMENTS",
                "sec_num": null
            }
        ],
        "bib_entries": {
            "BIBREF0": {
                "ref_id": "b0",
                "title": "Process models of reference in context, I$I/RR-78o72",
                "authors": [
                    {
                        "first": "J",
                        "middle": [
                            "A"
                        ],
                        "last": "Levin",
                        "suffix": ""
                    },
                    {
                        "first": "N",
                        "middle": [
                            "M"
                        ],
                        "last": "Goldman",
                        "suffix": ""
                    }
                ],
                "year": 1978,
                "venue": "Information Sciences Institute",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Levin, J. A., and Goldman, N. M., Process models of reference in context, I$I/RR-78o72, Information Sciences Institute, Marina del Re),, CA, 1978.",
                "links": null
            },
            "BIBREF1": {
                "ref_id": "b1",
                "title": "Dialogue Gamest metecommunication structures for natural bnguqe interaction",
                "authors": [
                    {
                        "first": "J",
                        "middle": [
                            "A"
                        ],
                        "last": "Levin",
                        "suffix": ""
                    },
                    {
                        "first": "J",
                        "middle": [
                            "A"
                        ],
                        "last": "Moore",
                        "suffix": ""
                    }
                ],
                "year": 1978,
                "venue": "Co~ltive Science",
                "volume": "1",
                "issue": "4",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Levin, J.A., and Moore, J.A., Dialogue Gamest mete- communication structures for natural bnguqe interaction, Co~ltive Science, 1,4, 1978.",
                "links": null
            },
            "BIBREF2": {
                "ref_id": "b2",
                "title": "A comprehension model for human dialogue",
                "authors": [
                    {
                        "first": "W",
                        "middle": [
                            "C"
                        ],
                        "last": "Mann",
                        "suffix": ""
                    },
                    {
                        "first": "J",
                        "middle": [
                            "A"
                        ],
                        "last": "Moore",
                        "suffix": ""
                    },
                    {
                        "first": "J",
                        "middle": [
                            "A"
                        ],
                        "last": "Levin",
                        "suffix": ""
                    }
                ],
                "year": 1977,
                "venue": "Proo. IJCAI-V",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Mann, W. C., Moore, J. A., and Levin, J. A., A comprehension model for human dialogue, in Proo. IJCAI-V, Cambridge, MA, 1977.",
                "links": null
            },
            "BIBREF3": {
                "ref_id": "b3",
                "title": "Computer generation of multl-paraq~raph English text",
                "authors": [
                    {
                        "first": "W",
                        "middle": [
                            "C"
                        ],
                        "last": "Mann",
                        "suffix": ""
                    },
                    {
                        "first": "J",
                        "middle": [
                            "A"
                        ],
                        "last": "Moore",
                        "suffix": ""
                    }
                ],
                "year": null,
                "venue": "",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Mann, W.C., and Moore, J.A., Computer generation of multl-paraq~raph English text, in preparation.",
                "links": null
            },
            "BIBREF4": {
                "ref_id": "b4",
                "title": "A Gool-orianted model of human dialogue",
                "authors": [
                    {
                        "first": "J",
                        "middle": [
                            "A"
                        ],
                        "last": "Moore",
                        "suffix": ""
                    },
                    {
                        "first": "J",
                        "middle": [
                            "A"
                        ],
                        "last": "Levin",
                        "suffix": ""
                    },
                    {
                        "first": "W",
                        "middle": [
                            "C"
                        ],
                        "last": "Mann",
                        "suffix": ""
                    }
                ],
                "year": 1977,
                "venue": "AJCL microfiche",
                "volume": "67",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Moore, J. A., Levin, J. A., and Mann, W. C., A Gool-orianted model of human dialogue, AJCL microfiche 67, 1977.",
                "links": null
            },
            "BIBREF5": {
                "ref_id": "b5",
                "title": "Communication as a problem-solviq activity",
                "authors": [
                    {
                        "first": "J",
                        "middle": [
                            "A"
                        ],
                        "last": "Moore",
                        "suffix": ""
                    }
                ],
                "year": null,
                "venue": "",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Moore, J.A., Communication as a problem-solviq activity, in preparation.",
                "links": null
            }
        },
        "ref_entries": {
            "TABREF0": {
                "content": "<table><tr><td>W t)en ~ou kear tkt o/arm bill or ~ou smell smoke, stop</td></tr><tr><td>\u00a2utr~tMng. determine mheth,r there Is a firs and decide to</td></tr><tr><td>permit the alarm J~stem or to cancel it. When ),ou dttermine</td></tr><tr><td>mketker there Is a [ire. l[ t~ere iS, permit t~t alarm S~sttm;</td></tr><tr><td>otherwise cancel it..</td></tr></table>",
                "num": null,
                "html": null,
                "text": "there is a ]'ire, the ~arm s~jttm is started whic~ Jounds the a/arm bell and starts the timer. W~n it b ninety seconds a[tor t~t timer L~ started, unless tAe o/arm J~$tem is cancelled it co~IS Wells Farfo. Wht~ Wells Far~ is called, ff CO~Is tat Fire Dept.. W~en ~ou permit the alarm syst~, c~! the Fire Dept. if possible and [oilo~ tkt w~uatlon procedure. When ~ carroll tke elate s~)sttet, l[ it iS mote t~an n~ner~ seconds since the timer is started, tke alarm s.Tsttm e~ls Wells Fargo: ockormlse continue tmrrytldng. PLAN uses goal-sensitive rules to impose an ordering on this set of fragments. A typical planning rule is:",
                "type_str": "table"
            }
        }
    }
}