File size: 25,567 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 | {
"paper_id": "P80-1012",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T08:43:06.918750Z"
},
"title": "PHRASE STRUCTURE TREES BEAR MORE FRUIT THAN YOU WOULD HAVE THOUGHT*",
"authors": [
{
"first": "Aravind",
"middle": [
"K"
],
"last": "Joshi",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Permsylvania Philadelphia",
"location": {
"postCode": "07981, PA 1910B",
"region": "NJ"
}
},
"email": ""
},
{
"first": "Leon",
"middle": [
"\" S \""
],
"last": "Levy",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Permsylvania Philadelphia",
"location": {
"postCode": "07981, PA 1910B",
"region": "NJ"
}
},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "",
"pdf_parse": {
"paper_id": "P80-1012",
"_pdf_hash": "",
"abstract": [],
"body_text": [
{
"text": "There is renewed interest in examining the descriptive as well as generative power of phrase s~-~uctur~ grammars.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "The primary motivation has come from the recent investigations in alternatives to t-~ansfor~ational gremmmrs [e.g., i, 2, 3, 4] .",
"cite_spans": [
{
"start": 122,
"end": 124,
"text": "3,",
"ref_id": "BIBREF0"
},
{
"start": 125,
"end": 127,
"text": "4]",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "We will present several results and ideas related to phrase structure trees which have significant relevance to computational linguistics.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "We %~_nT to accomplish several objectives in this paper.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "I. We will give a hrief survey of some recent results and approaches by various investigators including, of course, our own work~ indicating their interr~laticnships.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Here we will review the work related to the notion of node admissibility starring with Chomsky) followed by the work by McCawley, Peters and Ritchie, Joshi and Levy, a~d more recent work of Gazdar.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "We will also discuss other amendments to context-free grammars which increase the descriptive power but not the generative power.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "In particular, we will discuss the notion of categories with holes as recently introduced by Gazdam [3] . There is an interesting history behind this notion.",
"cite_spans": [
{
"start": 100,
"end": 103,
"text": "[3]",
"ref_id": "BIBREF0"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Sage~'s parser explieitly exploits such a convention and, in fact, uses it to do some coordinate st-ructnK-a computation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "We suspect that some other parsers have this feature also, perhaps ~plicitly.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "We will discuss this matter, which obviously is of great interes~ to computational linguists.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "2. Our work on local constraints on st-r~/cin/ral descriptions, [5, 6] , which is ccmputationally relevant both to linguistics and programming language theory, has art-~'acted some attention recently; however, the demonsrration of these results has re~.ained somewhat inaccessible to many due to the technicalities of the tree automata theory.",
"cite_spans": [
{
"start": 64,
"end": 67,
"text": "[5,",
"ref_id": "BIBREF2"
},
{
"start": 68,
"end": 70,
"text": "6]",
"ref_id": "BIBREF3"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Recently, we have found a way of providing an intuitive explanation of these results in terms of intel\"acting finite state machines (of the , usual kind).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Besides providing an intuitive and a more transparent explanation of our results, this approach is computationally more interesting and allows us to formulate an interesting question: How large a variable set (i.e., the set of nonterminals) is required for a phrase slx~cture grammar or how much information does a nontermdmal encode?",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "We will present this new approach.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "3. We will present some new results which extend the \"po~er\" of local constraints without affecting the chax~ acter of earlier results.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "In particular, we will show That local constraints can include, besides the pmope~ analysis (PA) predicates and domination (~) pmadicates, * This work was partially supported by NSF grant MCS79-08401. ** Full paper will be available at the time of the meeting. mor~ complex predicates of the following form.",
"cite_spans": [
{
"start": 123,
"end": 126,
"text": "(~)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "(",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "1) (PRED N 1 N 2 ... Nn)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "where N I, N2, ... N n are nonterminals mentioned in the PA and/or ~ constraint of the rule in which (i) appears and PR~ is a predicate which, r~ughly speaking, checks fo~ certain domination or left-of (or right-of) rela-Tionships among its arguments.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Two examples of inTer~ est are as follows.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "(2) (CCOFMAND A B C)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "CC0~LND holds if B immediately dominates A and B dominates C, not necessarily ~iately.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Usually the B node is an S node.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "LEFTMOSTSISTER holds if A is the leftmost sister of B.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "(3) (LEFTMOSTSISTER A B)",
"sec_num": null
},
{
"text": "We will show that introduction of predicates of the type (I) do not change the character of our result on local cons~-raints.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "(3) (LEFTMOSTSISTER A B)",
"sec_num": null
},
{
"text": "This extension of our earlier work has relevance to the forTm~ation of some long distance rules without %-mansformations (as well as without the use of The categories with holes as suggested by Gazdar). We will discuss some of the processing as well as linguistic relevance of these results.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "(3) (LEFTMOSTSISTER A B)",
"sec_num": null
},
{
"text": "4. We will tr~y to compare (at least along two dimensions) the local const-raint approach to that of Gazdar's (specifically his use of categories with holes) and to that of Peters' use of linked nodes (as presented orally at Stanford recently).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "(3) (LEFTMOSTSISTER A B)",
"sec_num": null
},
{
"text": "The dimensions for cc~ison would be (a) economy of representation, (b) proliferation of categories, by and large semantically vacuous, and (c) computational relevance of (a) and (b) above.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "(3) (LEFTMOSTSISTER A B)",
"sec_num": null
},
{
"text": "is usually context-free, i.e., if nodes B and C are immediate descendants of node A, then the semantics of A is a composition (defined appropriately) of the semantics of B and semantics of C.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Co~positional semantics [8]",
"sec_num": "5."
},
{
"text": "Semantics of A depends only on nodes B and C and not on any other part of the st-ruerural description in which A may appear.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Co~positional semantics [8]",
"sec_num": "5."
},
{
"text": "Our method of local constraints (and to sQme extent Peters' use of linked nodes) opens the possibility of defining the semantics of A not only in terms of the semantics of B and C, but also in terms of sc~e parts of the sZ~-uc~ description in which A appears.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Co~positional semantics [8]",
"sec_num": "5."
},
{
"text": "In this sense, the semantics will be contex-tsensitive.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Co~positional semantics [8]",
"sec_num": "5."
},
{
"text": "We have achieved some success with This aFpLuaeh to the semantics of progr~g languages. We will discuss some of ou~ preliminary ideas for extending this approach to natural language, in particular, in specifying scopes for variable binding. 6 . While developing our theory of local constrains and some other related work, we have discovered that it is possible to characterize structural descriptions (for phrase sl-r~crure gz%m~mars) entirely in terms of trees without any labels, i.e., trees which capture the grouping structure wi~hou~ the syntactic categories (which is the same as the constitn/ent st-r~cture without the node labels [7] . This is a surprising result. This result provides a way of deter~ how much \"~\" ~zerm/nels (syntactic cazeEories) encode and therefore clearly, it has ca~aticnal si~icance. Moreover, ~o The extent That The cla/m ~ha~ natural languages ere conzex~-bree is valid, this result has significant z~levancs to leamabili~y ~]~eories, because our result suEges~s that it might be possible to \"infer\" a phrase s~ruc'~r,e ~ L,-,, jus~ the grouping s~ruc~ure of ~he input (i.e., j us~ phrase boundaries).",
"cite_spans": [
{
"start": 241,
"end": 242,
"text": "6",
"ref_id": "BIBREF3"
},
{
"start": 638,
"end": 641,
"text": "[7]",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Co~positional semantics [8]",
"sec_num": "5."
},
{
"text": "Pur~her, the set of descrip~iuns wit.bout labels are directly rela~ed to the ~ descz'ip~ic~s of a context-free Eramn~z-; hence, we may be able to specify '~aTural\" syntactic categories.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Co~positional semantics [8]",
"sec_num": "5."
},
{
"text": "In summery, we will prese~1: a selectian of mathematical resul:s which have sisnifj~lnt z~l.evancs to m=~y aspec~ of con~tional lin~is~ics.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Co~positional semantics [8]",
"sec_num": "5."
},
{
"text": "[I] Bresnan, J.W., '~vidence for an unbounded T/leory of ~z~nsformations,\" ki~ic Analysis, Vol. 2, 1976.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SELECTED R~2~",
"sec_num": null
},
{
"text": "[2] Gezdar, .G.J.M., \"Phrase s-~,%~-%n0z~ grammar,\" to appear zn The Nal-ure of S},nr.actic Representation, (eds. P. Jacobscn and G.K. Pu/_Itm~), 1979.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SELECTED R~2~",
"sec_num": null
}
],
"back_matter": [],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "I~ as a eont~cee language",
"authors": [
{
"first": "G",
"middle": [
"J M"
],
"last": "Sazdar",
"suffix": ""
}
],
"year": 1978,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sazdar, G.J.M., \"I~ as a eont~cee language,\" unpublished ms., 1978.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Unbounded dependencies and c'oordinate s~I-ocrure",
"authors": [
{
"first": "G",
"middle": [
"J M"
],
"last": "Gazdar",
"suffix": ""
}
],
"year": 1979,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Gazdar, G.J.M., \"Unbounded dependencies and c'o- ordinate s~I-ocrure,\" unpublished ms. 1979.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Local ~,~msforma-1:ions",
"authors": [
{
"first": "A",
"middle": [
"K"
],
"last": "Joshi",
"suffix": ""
},
{
"first": "L",
"middle": [
"S"
],
"last": "Levy",
"suffix": ""
}
],
"year": 1977,
"venue": "SIAM Journal of Com~inK",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Joshi, A.K. and Levy, L.S., \"Local ~,~msforma- 1:ions,\" SIAM Journal of Com~inK, 1977.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Local ~ts in uhe syntax and semantics of ~ing ~",
"authors": [
{
"first": "A",
"middle": [
"K"
],
"last": "Joshi",
"suffix": ""
},
{
"first": "L",
"middle": [
"S"
],
"last": "Levy",
"suffix": ""
},
{
"first": "Yueh",
"middle": [],
"last": "",
"suffix": ""
},
{
"first": "K",
"middle": [],
"last": "",
"suffix": ""
}
],
"year": 1980,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Joshi, A.K., Levy, L.S., and Yueh, K., \"Local ~ts in uhe syntax and semantics of ~ing ~,\" to appear in Journal of Theoretical Cc~er Science, 1980.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Skeletal descriptions",
"authors": [
{
"first": "~]",
"middle": [],
"last": "Levy",
"suffix": ""
},
{
"first": "L",
"middle": [
"S"
],
"last": "Joshi",
"suffix": ""
},
{
"first": "A",
"middle": [
"K"
],
"last": "",
"suffix": ""
}
],
"year": null,
"venue": "Information and Control",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "~] Levy, L.S. and Joshi, A.K., \"Skeletal descriptions,\" Information and Control, Nov. ig78.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Semantics of context-free ~",
"authors": [
{
"first": "D",
"middle": [
"E"
],
"last": "~] Knuth",
"suffix": ""
}
],
"year": 1968,
"venue": "Mar.hem~%-ica.l Systems Theory",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "~] Knuth, D.E., \"Semantics of context-free ~,\" Mar.hem~%-ica.l Systems Theory, 1968.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "$ynr.ac~ic analysis of narura.l lan-&,~a~es",
"authors": [
{
"first": "N",
"middle": [],
"last": "Sager",
"suffix": ""
}
],
"year": 1967,
"venue": "Advances in Cc, mpuzers (eds. M. AI~ and M. Rub~ff)~ ~l",
"volume": "8",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sager, N., \"$ynr.ac~ic analysis of narura.l lan- &,~a~es,\" in Advances in Cc, mpuzers (eds. M. AI~ and M. Rub~ff)~ ~l. 8, Academic Press, New York, 1967.",
"links": null
}
},
"ref_entries": {}
}
} |