File size: 36,369 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 | {
"paper_id": "P96-1027",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T09:02:58.871668Z"
},
"title": "Chart Generation",
"authors": [
{
"first": "Martin",
"middle": [],
"last": "Kay",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Stanford Universi~ and Xerox Palo Alto Research Center",
"location": {}
},
"email": "kay@pare@eom"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "Charts constitute a natural uniform architecture for parsing and generation provided string position is replaced by a notion more appropriate to logical forms and that measures are taken to curtail generation paths containing semantically incomplete phrases.",
"pdf_parse": {
"paper_id": "P96-1027",
"_pdf_hash": "",
"abstract": [
{
"text": "Charts constitute a natural uniform architecture for parsing and generation provided string position is replaced by a notion more appropriate to logical forms and that measures are taken to curtail generation paths containing semantically incomplete phrases.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "showed that parsing charts can be also used in generation and raised the question, which we take up again here, of whether they constitute a natural uniform architecture for parsing and generation. In particular, we will be interested in the extent to which they bring to the generation process advantages comparable to those that make them attractive in parsing.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Charts",
"sec_num": "1"
},
{
"text": "Chart parsing is not a well defined notion. The usual conception of it involves at least four related ideas:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Charts",
"sec_num": "1"
},
{
"text": "Inactive edges. In context-free grammar, all phrases of a given category that cover a given part of the string are equivalent for the purposes of constructing larger phrases. Efficiency comes from collecting equivalent sets of phrases into (inactive) edges and constructing edges from edges rather than phrases from phrases.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Charts",
"sec_num": "1"
},
{
"text": "Active edges. New phrases of whatever size can be built by considering existing edges pair-wise if provision is made for partial phrases. Partial phrases are collected into edges that are said to be active because they can be thought of as actively seeking material to complete them.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Charts",
"sec_num": "1"
},
{
"text": "The algorithm schema. Newly created edges are placed on an agenda. Edges are moved from the agenda to the chart one by one until none remains to be moved.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Charts",
"sec_num": "1"
},
{
"text": "When an edge is moved, all interactions between it and edges already in the chart are considered and any new edges that they give rise to are added to the agenda.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Charts",
"sec_num": "1"
},
{
"text": "Indexing. The positions in the string at which phrases begin and end can be used to index edges so that the algorithm schema need consider interactions only between adjacent pairs.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Charts",
"sec_num": "1"
},
{
"text": "Chart parsing is attractive for the analysis of natural languages, as opposed to programming languages, for the way in which it treats ambiguity. Regardless of the number of alternative structures for a particular string that a given phrase participates in, it will be constructed once and only once. Although the number of structures of a string can grow exponentially with the length of the string, the number of edges that needs to be constructed grows only with the square of the string length and the whole parsing process can be accomplished in cubic time. Innumerable variants of the basic chart parsing scheme are possible. For example, if there were languages with truly free word order, we might attempt to characterize them by rules like those of context-free grammar, but with a somewhat different interpretation. Instead of replacing nonterminal symbols in a derivation with strings from the righthand side of corresponding rules, we would remove the nonterminal symbol and insert the symbols from the righthand side of the rule at arbitrary places in the string.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Charts",
"sec_num": "1"
},
{
"text": "A chart parser for languages with free word order would be a minor variant of the standard one. An edge would take the form X~,, where v is a vector with a bit for every word in the string and showing which of those words the edge covers. There is no longer any notion of adjacency so that there would be no indexing by string position. Interesting interactions occur between pairs of edges whose bit vectors have empty intersections, indicating that they cover disjoint sets of words. There can now be as many edges as bit-vectors and, not surprisingly, the computational complexity of the parsing process increases accordingly.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Charts",
"sec_num": "1"
},
{
"text": "A parser is a transducer from strings to structures or logical forms. A generator, for our purposes, is the inverse. One way to think of it, therefore, is as a parser of structures or logical forms that delivers analyses in the form of strings. This view has the apparent disadvantage of putting insignificant differences in the syntax of a logical forms, such as the relative order of the arguments to symmetric operators, on the same footing as more significant facts about them. We know that it will not generally be possible to reduce logical expressions to a canonical form but this does not mean that we should expect our generator to be compromised, or even greatly delayed, by trivial distinctions. Considerations of this kind were, in part, responsible for the recent resurgence of interest in \"flat\" representations of logical form (Copestake et a/.,1996) and for the representations used for transfer in Shake-and-Bake translation (Whitelock, 1992) . They have made semantic formalisms like those now usually associated with Davison (Davidson, 1980 , Parsons, 1990 attractive in artificial intelligence for many years (Hobbs 1985 , Kay, 1970 . Operationally, the attraction is that the notations can be analyzed largely as free word-order languages in the manner outlined above. Consider the expression 1(1) r: run(r), past(r), fast(r), argl (r,j), name(j, John) which we will take as a representation of the logical form of the sentences John ran fast and John ran quickly. It consists of a distinguished index (r) and a list of predicates whose relative order is immaterial. The distinguished index identifies this as a sentence that makes a claim about a running event. \"John\" is the name of the entity that stands in the 'argl' relation to the running which took place in the past and which was fast. Nothing turns on these details which will differ with differing ontologies, logics, and views of semantic structure. What concerns us here is a procedure for generating a sentence from a structure of this general kind.",
"cite_spans": [
{
"start": 842,
"end": 865,
"text": "(Copestake et a/.,1996)",
"ref_id": "BIBREF0"
},
{
"start": 942,
"end": 959,
"text": "(Whitelock, 1992)",
"ref_id": null
},
{
"start": 1044,
"end": 1059,
"text": "(Davidson, 1980",
"ref_id": "BIBREF1"
},
{
"start": 1060,
"end": 1075,
"text": ", Parsons, 1990",
"ref_id": null
},
{
"start": 1129,
"end": 1140,
"text": "(Hobbs 1985",
"ref_id": "BIBREF2"
},
{
"start": 1141,
"end": 1152,
"text": ", Kay, 1970",
"ref_id": "BIBREF3"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Generation",
"sec_num": "2"
},
{
"text": "Assume that the lexicon contains entries like those in (2) in which the italicized arguments to the semantic predicates are variables.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Generation",
"sec_num": "2"
},
{
"text": "(2)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Generation",
"sec_num": "2"
},
{
"text": "Cat Semantics",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Words",
"sec_num": null
},
{
"text": "John np(x) x: name(x, John) ran vp(x, y) x: run(x), argl (x, y), past(x) fast adv(x) x: fast(x) quickly adv(x) x: fast(x)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Words",
"sec_num": null
},
{
"text": "A prima facie argument for the utility of these particular words for expressing (I) can be made simply by noting that, modulo appropriate instantiation of the variables, the semantics of each of these words subsumes (1).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Words",
"sec_num": null
},
{
"text": "The entries in (2), with their variables suitably instantiated, become the initial entries of an agenda and we begin to move them to the chart in accordance with the algorithm schema, say in the order given. The variables in the 'Cat' and 'Semantics' columns of (2) provide the essential link between syntax and semantics. The predicates that represent the semantics of a phrase will simply be the union of those representing the constituents. The rules that sanction a phrase (e.g. (3) below) show which variables from the two parts are to be identified.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Algorithm Schema",
"sec_num": "3"
},
{
"text": "When the entry for John is moved, no interactions are possible because the chart is empty. When run is moved, the sequence John ran is considered as a possible phrase on the basis of rule (3).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Algorithm Schema",
"sec_num": "3"
},
{
"text": "(3) s(x) ~ rip(y), vp(x, 3'). With appropriate replacements for variables, this maps onto the subset (4) of the original semantic specification in (1). (4) r: run(r), past(r), argl(r,j), name(j, John) Furthermore it is a complete sentence. However, it does not count as an output to the generation process as a whole because it subsumes some but not all of (1). It therefore simply becomes a new edge on the agenda.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Algorithm Schema",
"sec_num": "3"
},
{
"text": "The string ran fast constitutes a verb phrase by virtue of rule (5) giving the semantics (6), and the phrase ran quickly with the same semantics is put on the agenda when the quickly edge is move to the chart. Assuming that adverbs modify verb phrases and not sentences, there will be no interactions when the John ran edge is moved to the chart. When the edge for ran .fast is moved, the possibility arises of creating the phrase tan fast quickly as well as ran fast fast. Both are rejected, however, on the grounds that they would involve using a predicate from the original semantic specification more than once. This would be similar to allowing a given word to be covered by overlapping phrases in free word-order parsing. We proposed eliminating this by means of a bit vector and the same technique applies here. The fruitful interactions that occur here are between ran .fast and ran quickly on the one hand, and John on the other. Both give sentences whose semantics subsumes the entire input.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Algorithm Schema",
"sec_num": "3"
},
{
"text": "Several things are noteworthy about the process just outlined. !. Nothing turns on the fact that it uses a primitive version of event semantics. A scheme in which the indices were handles referring to subexpressions in any variety of fiat semantics could have been treated in the same way. Indeed, more conventional formalisms with richly recursive syntax could be converted to this form on the fly. 2. Because all our rules are binary, we make no use of active edges. 3. While it fits the conception of chart parsing given at the beginning of this paper, our generator does not involve string positions centrally in the chart representation. In this respect, it differs from the proposal of Shieber (1988) which starts with all word edges leaving and entering a single vertex. But there is essentially no information in such a representation. Neither the chart nor any other special data structure is required to capture the fact that a new phrase may be constructible out of any given pair, and in either order, if they meet certain syntactic and semantic criteria. 4. Interactions must be considered explicitly between new edges and all edges currently in the chart, because no indexing is used to identify the existing edges that could interact with a given new one. 5. The process is exponential in the worst case because, if a sentence contains a word with k modifiers, then a version it will be generated with each of the 2 k subsets of those modifiers, all but one of them being rejected when it is finally discovered that their semantics does not subsume the entire input. If the relative orders of the modifiers are unconstrained, matters only get worse. Points 4 and 5 are serious flaws in our scheme for which we shall describe remedies. Point 2 will have some importance for us because it will turn out that the indexing scheme we propose will require the use of distinct active and inactive edges, even when the rules are all binary. We take up the complexity issue first, and then turn to bow the efficiency of the generation chart might be enhanced through indexing.",
"cite_spans": [
{
"start": 692,
"end": 706,
"text": "Shieber (1988)",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "The Algorithm Schema",
"sec_num": "3"
},
{
"text": "The exponential factor in the computational complexity of our generation algorithm is apparent in an example like (8). (8) Newspaper reports said the tall young Polish athlete ran fast The same set of predicates that generate this sentence clearly also generate the same sentence with deletion of all subsets of the words tall, young, and Polish for a total of 8 strings. Each is generated in its entirety, though finally rejected because it fails to account for all of the semantic material. The words newspaper and fast can also be deleted independently giving a grand total of 32 strings.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Internal and External Indices",
"sec_num": "4"
},
{
"text": "We concentrate on the phrase tall young Polish athlete which we assumed would be combined with the verb phrase ran fast by the rule (3). The distinguished index of the noun phrase, call it p, is identified with the variable y in the rule, but this variable is not associated with the syntactic category, s, on the left-hand side of the rule. The grammar has access to indices only through the variables that annotate grammatical categories in its rules, so that rules that incorporate this sentence into larger phrases can have no further access to the index p. We therefore say that p is internal to the sentence the tall young Polish athlete ran fast.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Internal and External Indices",
"sec_num": "4"
},
{
"text": "The index p would, of course, also be internal to the sentences the young Polish athlete ran fast, the tall Polish athlete ran fast, etc. However, in these cases, the semantic material remaining to be expressed contains predicates that refer to this internal index, say 'tall(p)', and 'young(p)'. While the lexicon may have words to express these predicates, the grammar has no way of associating their referents with the above noun phrases because the variables corresponding to those referents are internal. We conclude that, as a matter of principle, no edge should be constructed if the result of doing so would be to make internal an index occurring in part of the input semantics that the new phrase does not subsume. In other words, the semantics of a phrase must contain all predicates from the input specification that refer to any indices internal to it. This strategy does not prevent the generation of an exponential number of variants of phrases containing modifiers. It limits proliferation of the ill effects, however, by allowing only the maximal one to be incorporated in larger phrases. In other words, if the final result has phrases with m and n modifiers respectively, then 2 n versions of the first and 2 m of the second will be created, but only one of each set will be incorporated into larger phrases and no factor of 2 (n+m) will be introduced into the cost of the process.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Internal and External Indices",
"sec_num": "4"
},
{
"text": "String positions provide a natural way to index the strings input to the parsing process for the simple reason that there are as many of them as there are words but, for there to be any possibility of interaction between a pair of edges, they must come together at just one index. These are the natural points of articulation in the domain of strings. They cannot fill this role in generation because they are not natural properties of the semantic expressions that are the input to the process. The corresponding natural points of articulation in flat semantic structures are the entities that we have already been referring to as indices.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Indexing",
"sec_num": "5"
},
{
"text": "In the modified version of the procedure, whenever a new inactive edge is created with label B(b ...), then for all rules of the form in (9), an active edge is also created with label A(...)/C(c ...). (9) A(...) ~ B(b ...) C(c ...) This represents a phrase of category A that requires a phrase of category C on the right for its completion. In these labels, b and c are (variables representing) the first, or distinguished indices associated with B and C. By analogy with parsing charts, an inactive edge labeled B(b ...) can be thought of as incident from vertex b, which means simply that it is efficiently accessible through the index b. An active edge A(...)/C(c ...) should be thought of as incident from, or accessible through, the index c. The key property of this scheme is that active and inactive edges interact by virtue of indices that they share and, by letting vertices correspond to indices, we collect together sets of edges that could interact.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Indexing",
"sec_num": "5"
},
{
"text": "We illustrate the modified procedure with the sentence (10) whose semantics we will take to be (11), the grammar rules (12)-(14), and the lexical entries in (15). (10) The dog saw the cat.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Indexing",
"sec_num": "5"
},
{
"text": "(11 ) dog(d), def(d), saw(s), past(s), cat(c), def(c), argl (s, d), arg2(s, c). (l 2) s(x) ~ np(y) vp(x, y) (13) vp(x,y) --* v(x,y, z) np(z) (14) rip(x) ~ det(x) n(x) (15) Words cat saw dog the Cat Semantics n(x) x: cat(x) v(x, y, z) x: see(x), past(x), argl (x, y), arg2(xcz) n(x) x: dog(x) det(x) x: def(x)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Indexing",
"sec_num": "5"
},
{
"text": "The procedure will be reminiscent of left-corner parsing.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Indexing",
"sec_num": "5"
},
{
"text": "Arguments have been made in favor of a head-driven strategy which would, however, have been marginally more complex (e.g. in Kay (1989 ), Shieber, et el. (1989 ) and the differences are, in any case, not germane to our current concerns. The initial agenda, including active edges, and collecting edges by the vertices that they are incident from, is given in (16).",
"cite_spans": [
{
"start": 125,
"end": 134,
"text": "Kay (1989",
"ref_id": "BIBREF4"
},
{
"start": 135,
"end": 159,
"text": "), Shieber, et el. (1989",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Indexing",
"sec_num": "5"
},
{
"text": "The grammar is consulted only for the purpose of creating active edges and all interactions in the chart are between active and inactive pairs of edges incident from the same vertex. Among the edges in (16), there are two interactions, one at vertices c and d. They cause the first and third edges in (17) to be added to the agenda. The first interacts with the active edge originally introduced by the verb \"saw\" producing the fourth entry in (17). The label on this edge matches the first item on the right-hand side of rule (12) and the active edge that we show in the second entry is also introduced. The final interaction is between the first and second edges in (17) which give rise to the edge in (18).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Indexing",
"sec_num": "5"
},
{
"text": "This procedure confirms perfectly to the standard algorithm schema for chart parsing, especially in the version that makes predictions immediately following the recognition of the first constituent of a phrase, that is, in the version that is essentially a caching left-comer parser.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Indexing",
"sec_num": "5"
}
],
"back_matter": [
{
"text": "Vert s",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "(18)",
"sec_num": null
},
{
"text": "Cat SemanticsThe dog saw the cat s(s)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Words",
"sec_num": null
},
{
"text": "Whatever there may be of value in this paper owes much to the interest, encouragement, and tolerance of my colleagues Marc Dymetman, Ronald Kaplan, John Maxwell, and Hadar Shem Toy. I am also indebted to the anonymous reviewers of this paper.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgments",
"sec_num": "6"
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Translation Using Minimal Recursion Semantics",
"authors": [
{
"first": "A",
"middle": [],
"last": "Copestake",
"suffix": ""
},
{
"first": "Dan",
"middle": [],
"last": "Flickinger",
"suffix": ""
},
{
"first": "Robert",
"middle": [],
"last": "Malouf",
"suffix": ""
},
{
"first": "Susanne",
"middle": [],
"last": "Riehemann",
"suffix": ""
},
{
"first": "Ivan",
"middle": [],
"last": "Sag",
"suffix": ""
}
],
"year": 1996,
"venue": "Proceedings of The Sixth International Conference on Theoretical and Methodological Issues in Machine Translation",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Copestake, A., Dan Flickinger, Robert Malouf, and Susanne Riehemann, and Ivan Sag (1996). Translation Using Minimal Recursion Semantics. Proceedings of The Sixth International Conference on Theoretical and Method- ological Issues in Machine Translation, Leuven (in press).",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Essays on Actions and Events",
"authors": [
{
"first": "D",
"middle": [],
"last": "Davidson",
"suffix": ""
}
],
"year": 1980,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Davidson, D. (1980). Essays on Actions and Events. Oxford: The Clarendon Press.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Ontological Promiscuity. 23rd",
"authors": [
{
"first": "J",
"middle": [
"R"
],
"last": "Hobbs",
"suffix": ""
}
],
"year": 1985,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Hobbs, J. R. (1985). Ontological Promiscuity. 23rd",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "From Semantics to Syntax",
"authors": [
{
"first": "Acl",
"middle": [],
"last": "Chicago",
"suffix": ""
},
{
"first": "M",
"middle": [],
"last": "Kay",
"suffix": ""
}
],
"year": 1970,
"venue": "Progress in Linguistics. Bierwisch Manfred, and K. E. Heidolf. The Hague",
"volume": "",
"issue": "",
"pages": "14--126",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Annual Meeting of the Association for Computational Lin- guistics, Chicago, ACL. Kay, M. (1970). From Semantics to Syntax. Progress in Linguistics. Bierwisch Manfred, and K. E. Heidolf. The Hague, Mouton: ! 14-126.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Events in the Semantics of English",
"authors": [
{
"first": "M",
"middle": [],
"last": "Kay",
"suffix": ""
}
],
"year": 1989,
"venue": "Proceedings of Workshop on Parsing Technologies",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kay, M. (1989). Head-driven Parsing. Proceedings of Workshop on Parsing Technologies, Pittsburgh, PA. Parsons, T. (1990). Events in the Semantics of English. Cambridge, Mass.: MIT Press.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "A Uniform Architecture for Parsing and Generation",
"authors": [
{
"first": "S",
"middle": [],
"last": "Shieber",
"suffix": ""
}
],
"year": 1988,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Shieber, S. (1988). A Uniform Architecture for Parsing and Generation. COLING-88, Budapest, John yon Neu- mann Society for Computing Sciences.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "A Semantic-Head-Driven Generation Algorithm for Unification Based Formalisms",
"authors": [
{
"first": "S",
"middle": [
"M"
],
"last": "Shieber",
"suffix": ""
}
],
"year": 1989,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Shieber, S. M. et al. (1989). A Semantic-Head-Driven Generation Algorithm for Unification Based Formalisms.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Annual Meeting of the Association for Computational Linguistics",
"authors": [],
"year": 1992,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Annual Meeting of the Association for Computational Linguistics, Vancouver. B.C. Whitelock, P. (1992). Shake and-Bake Translation. COLING-92, Nantes.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"type_str": "figure",
"uris": null,
"text": "(5) vp(x) ~ vp(x) adv(x) (6) r: run(r), past(r), fast(r), arg 1 (r, y)The agenda now contains the entries in (7). (r), past(r), fast(r), argl(r,j) ran quickly vp(r, j) r: run(r), past(r), fast(r), argl(r,j)",
"num": null
},
"FIGREF1": {
"type_str": "figure",
"uris": null,
"text": "(s), past(s), argl (s, d), arg2(s, c), cat(c), def(c)",
"num": null
}
}
}
} |