File size: 38,451 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 | {
"paper_id": "P84-1007",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T08:20:34.713132Z"
},
"title": "THE REPRESENTATION OF CONSTITUENT STRUCTURES FOR FINITE-STATE PARSING",
"authors": [
{
"first": "D",
"middle": [
"Terence"
],
"last": "Langendoen",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Brooklyn College of the City University of New York",
"location": {
"postCode": "11210",
"settlement": "Brooklyn",
"region": "New York",
"country": "U.S.A"
}
},
"email": ""
},
{
"first": "Yedldyah",
"middle": [],
"last": "Langsam",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Brooklyn College of the City University of New York",
"location": {
"postCode": "11210",
"settlement": "Brooklyn",
"region": "New York",
"country": "U.S.A"
}
},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "",
"pdf_parse": {
"paper_id": "P84-1007",
"_pdf_hash": "",
"abstract": [],
"body_text": [
{
"text": "A mixed prefix-postfix notation for representations of the constituent structures of the expressions of natural languages is proposed, which are of limited degree of center embedding if the original expressions are noncenter-embedding. The method of constructing these representations is applicable to expressions with center embedding, and results in representations which seem to reflect the ways in which people actually parse those expressions.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "ABSTBACT",
"sec_num": null
},
{
"text": "Both the representations and their interpretations can be computed from the expressions from left to right by finite-state devices.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "ABSTBACT",
"sec_num": null
},
{
"text": "The class of acceptable expressions of a natural language L all manifest no more than a small, fixeR, finite degree n of center embedding. From this observation, it fo~lows that the ability of human beings to parse the expressions of L can be modeled by a finite transducer that associates with the acceptable expressions of L representations of the structural descriptions of those expressions.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "ABSTBACT",
"sec_num": null
},
{
"text": "This paper considers some initial steps in the construction of such a model. The first step is to determine a method of representing the class of constituent structures of the expressions of L without center embedding in such a way that the members of that class themselves have no more than a small fixed finite degree of center embedding.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "ABSTBACT",
"sec_num": null
},
{
"text": "Given a grammar that directly generates that class of constituent structures, it is not difficult to construct a deterministic finite-state transducer (parser) that assigns the appropriate members of that class to the noncenter-embedded expressions of L from left to right. The second step is to extend the method so that it is capable of representing the class of constituent structures of expressions of L with no more than degree n of center embedding in a manner which appears to accord with the way in which human beings actually parse those sentences. Given certain reasonable assumptions about the character of the rules of grammar of natural languages, we show how this step can also be taken. *This work was partly supported by a gran t from the PSC-CUNY Faculty Research Award Program.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "ABSTBACT",
"sec_num": null
},
{
"text": "Let G be a context-free phrase-structure grammar (CFPSG).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "ABSTBACT",
"sec_num": null
},
{
"text": "First, suppose that the category A in G is right-recursive; i.e., that there are subderivations with respect to G such that A ==~ X A, where X is a nonnull string of symbols (terminal, nonterminal, or mixed) .",
"cite_spans": [
{
"start": 174,
"end": 207,
"text": "(terminal, nonterminal, or mixed)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "ABSTBACT",
"sec_num": null
},
{
"text": "We seek a new CFPSG G*, derived from G, that contains the category A* (corresponding to A), such that there are subderivations with respect to G* of the form A* ==8 X* A*, where X* represents the constituent structure of X with respect to G. Next, suppose that the category B in G is left-recursive; i.e., that there are subderivations with respect to G such that B ==~ B Y, where Y is nonnull.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "ABSTBACT",
"sec_num": null
},
{
"text": "We seek a new CFPSG G*, derived from G, that contains the category B* (corresponding to B), such that there are subderivations with respect to G* of the form B* ==~ B* Y*, where Y* represents the constituent structure of Y with respect to G. In other words, given a grammar G, we seek a grammar G* that directly generates strings that represent the constituent structures of the noncenter-embedded expressions generated by G, that is right-recursive wherever G is right-recursive and is left-recursive wherever G is left-recursive.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "ABSTBACT",
"sec_num": null
},
{
"text": "In order to find such a G*, we must first determine what kinds of strings are available that can represent constituent structures and at the same time can be directly generated by noncenterembedding grammars.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "ABSTBACT",
"sec_num": null
},
{
"text": "Full bracketing diagrams are not suitable, since grammars that generate them are center embedding whenever the original grammars are left-or right-recursive (Langendoen 1975) .",
"cite_spans": [
{
"start": 157,
"end": 174,
"text": "(Langendoen 1975)",
"ref_id": "BIBREF2"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "ABSTBACT",
"sec_num": null
},
{
"text": "Suppose, however, that we leave off right brackets in right-recursive structures and left brackets in left-recursive structures.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "ABSTBACT",
"sec_num": null
},
{
"text": "In rightrecursive structures, the positions of the left brackets that remain indicate where each constituent begins; the position where each constituent ends can be determined by a simple counting procedure provided that the number of daughters of that constituent is known (e.g., when the original grammar is in Chomsky-normal-form).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "ABSTBACT",
"sec_num": null
},
{
"text": "Similarly, in left-recursive structures, the positions of the right brackets that remain indicate where each constituent ends, and the position where each constituent begins can also be determined simply by counting.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "ABSTBACT",
"sec_num": null
},
{
"text": "Moreover, since brackets no longer occur in matched pairs, the brackets themselves can be omitted, leaving only the category labels.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "ABSTBACT",
"sec_num": null
},
{
"text": "In left-recursive structures, these category symbols occur as postfixes; in right-recursive structures, they occur as prefixes.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "ABSTBACT",
"sec_num": null
},
{
"text": "Let us call any symbol which occurs as a prefix or a postfix in a string that represents the constituent structure of an expression an affix; the strings themselves affixed strings; and the grammars that generate those strings affix gra1~ars.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "ABSTBACT",
"sec_num": null
},
{
"text": "To see how affix grammars may be constructed, consider the noncenter-embedding CFPSG GI, which generates the artificial language L1 = a(b*a)*b*a.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "ABSTBACT",
"sec_num": null
},
{
"text": "(G1) a. S \u2022 S A b. A \u2022 B A c. A ~ a d. B * b e. S ) a",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "ABSTBACT",
"sec_num": null
},
{
"text": "A noncenter-embedding affix grammar that generates the affixed strings that represent the constituent structures of the expressions of L1 with respect to G1 is given in GI*.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "ABSTBACT",
"sec_num": null
},
{
"text": "(GI*) a. S ~ ~ S* A* S b. A* \u2022 A B* A* c. A* > A a d. B* \u2022 B b e. S ~ ~ S a",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "ABSTBACT",
"sec_num": null
},
{
"text": "Among the expressions generated by GI is El; the affixed string generated by GI* that represents its structural description is El*.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "ABSTBACT",
"sec_num": null
},
{
"text": "(El) abbaba (El*) SaABbABbAaSABbAaS",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "ABSTBACT",
"sec_num": null
},
{
"text": "Let us say that an affix covers elements in an affixed string which correspond to its constituents (not necessarily immediate).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "ABSTBACT",
"sec_num": null
},
{
"text": "Then El* may be interpreted as a structural description of E1 with respect to GI according to the rules in R, in which J, K, and L are affixes; k is a word; x and y are substrings of affixed strings; and G is a CFPSG (in this case, GI).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "ABSTBACT",
"sec_num": null
},
{
"text": "(R) a. If K ~ k is a rule of G, then in the configuration ... K k ..., K is a prefix which covers k.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "ABSTBACT",
"sec_num": null
},
{
"text": "b. If J ~ K L is a rule of G, then in the configuration ... J K x L ..., in which x does not contain L, J is a prefix which covers K L.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "ABSTBACT",
"sec_num": null
},
{
"text": "c\u00b0 If J d K L is a rule of G, then in the configuration ... K x L y J ..., in which x does not contain L and y does not contain K, J is a postfix which covers K L.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "ABSTBACT",
"sec_num": null
},
{
"text": "Coverage of constituents by the rules in R may be thought to be assigned dynamically from left to right.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "ABSTBACT",
"sec_num": null
},
{
"text": "A postfix is used in rule Gl*a because the category S is left-recursive in GI, whereas a prefix is used in rule Gl*b because the category A is right-recursive in GI.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "ABSTBACT",
"sec_num": null
},
{
"text": "The use of prefixes in rules Gl*c-e, on the other hand, is unmotivated if the only criteria for choosing an affix type have to do with direction of recursion.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "ABSTBACT",
"sec_num": null
},
{
"text": "For affix grammars of natural languages, however, one can motivate the decision to use a particular type of affix by principles other than those having to do with direction of recursion.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "ABSTBACT",
"sec_num": null
},
{
"text": "The use of a prefix can be interpreted as indicating a decision (or guess) on the part of the language user as to the identity of a particular constituent on the basis of the identity of the first constituent in it.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "ABSTBACT",
"sec_num": null
},
{
"text": "Since lexical items are assigned to lexical categories essentially as soon as they are recognized (Forster 1976) , we may suppose first that prefixes are used for rules such as those in Gl*c-e that assign lexical items to lexical categories.",
"cite_spans": [
{
"start": 98,
"end": 112,
"text": "(Forster 1976)",
"ref_id": "BIBREF0"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "ABSTBACT",
"sec_num": null
},
{
"text": "Second, if, as seems reasonable, a decision about the identity of constituents is always made as soon as possible, then we may suppose that prefixes are used for all rules in which the leftmost daughter of a particular constituent provides sufficient evidence for the identification of that constituent; e.g., if the leftmost daughter is either the specifier or the head of that constituent in the sense of Jackendoff (1977) .",
"cite_spans": [
{
"start": 407,
"end": 424,
"text": "Jackendoff (1977)",
"ref_id": "BIBREF1"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "ABSTBACT",
"sec_num": null
},
{
"text": "Third, we may suppose that even if the leftmost daughter of a particular constituent does not provide sufficient evidence for the identification of that constituent, a prefix may still be used if that constituent is the left sister of a constituent that provides sufficient evidence for its identification.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "ABSTBACT",
"sec_num": null
},
{
"text": "Fourth, we may suppose that postfixes are used in all other cases.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "ABSTBACT",
"sec_num": null
},
{
"text": "To illustrate the use of these four principles, consider the noncenter-embedding partial grammar G2 that generates a fragment of English that we call L2. ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "ABSTBACT",
"sec_num": null
},
{
"text": "Among the expressions of L2 are those with both right-recursion and left-recursion, such as E2.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u2022 o s",
"sec_num": null
},
{
"text": "(E2) the boss knew that the teacher's sister's neighbor's friend believed that the student saw the child",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u2022 o s",
"sec_num": null
},
{
"text": "We now give an affix grammar G2* that directly generates affixed strings that represent the structural descriptions of the expressions of L2 with respect to G2, and that has been constructed in accordance with the four principles described above.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u2022 o s",
"sec_num": null
},
{
"text": "(G2*) a. i. S* Rules G2Wh-I conform to the first principle, according to which lexical categories generally appear as prefixes.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u2022 o s",
"sec_num": null
},
{
"text": "Rules G2*b,e-g conform to the second principle, according to which a category appears as a prefix if Its leftmost daughter in the corresponding rule of G2 is its head or specifier.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u2022 o s",
"sec_num": null
},
{
"text": "Rule G2*ai conforms to the third principle, according to which a category appears as a prefix if its presence can be predicted from its right sister in G2. Finally, rules G2*aii,c,d conform to the fourth principle, according to which a category appears as a postfix if it cannot appear as a prefix according co the preceding three principles.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u2022 o s",
"sec_num": null
},
{
"text": "The affixed string that G2* generates as the representation of the structural description of E2 with respect to G2 is given in E2*.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u2022 o s",
"sec_num": null
},
{
"text": "(E2*) NP D the N N boss VP V knew C C that S NP D the N N teacher G's G N N sister NP G's G N N neighbor NP G's G N N friend NP VP V believed C C that S NP D the N N student VP V saw NP D the N N child S",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u2022 o s",
"sec_num": null
},
{
"text": "E2* can be interpreted as the structural description of E2 with respect to G2 by the rules in R, with the addition of a rule to handle unary nonlexical branching (as in G2e), and a modification of Rc to prevent a postfix from simply covering a sequence of affixes already covered by a prefix. (This restriction is needed to prevent the postfix S in E2* from simply covering any of the subordinate clauses in that expression.) It is worth noting how the application of those rules dynamically enlarges the NP that is covered by the S prefix that follows the words knew that. First the teacher is covered; then the teacher's sister; then the teacher's sister's neighbor; and finally the teacher's sister's neighbor's friend.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u2022 o s",
"sec_num": null
},
{
"text": "The derivation of E2* manifests first-degree center embedding of the category S*, as a result of the treatment of S as both a prefix and a suffix in G2*.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u2022 o s",
"sec_num": null
},
{
"text": "However, no derivation of an affixed string generated by G2* manifests any greater degree of center embedding; hence, the affixed strings associated with the expressions of L2 can still be assigned to them by a finite-state parser. The added complexity involved in interpreting E2* results from the fact that all but the first of the NP-VP sequences in E2* are covered by prefix Ss, so that the constituents covered by the postfix S in E2* according to rule Rc are considerably far away from it.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u2022 o s",
"sec_num": null
},
{
"text": "It will be noted that we have provided two logically independent sets of principles by which affixed grammars may be constructed from a given CFPSG.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u2022 o s",
"sec_num": null
},
{
"text": "The first set is explicitly designed to preserve the property of noncenter-embedding.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u2022 o s",
"sec_num": null
},
{
"text": "The second is designed to maximize the use of prefixes on the basis of being able to predict the identity of a constituent by the time its leftmost descendent has been identified.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u2022 o s",
"sec_num": null
},
{
"text": "There is no reason to believe a priori that affixed grammars constructed according to the second set of principles should preserve noncenter-embedding, and indeed as we have just seen, they don't.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u2022 o s",
"sec_num": null
},
{
"text": "However, we conjecture chat natural languages are designed so that representations of the structural descriptions of acceptable expressions of those languages can be assigned to them by finite-state parsers that operate by identifying constituents as quickly as possible.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u2022 o s",
"sec_num": null
},
{
"text": "We call this the Efficient Finite-State Parser Hypothesis.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u2022 o s",
"sec_num": null
},
{
"text": "The four principles for determining whether to use a prefix or a postfix to mark the presence of a particular constituent apply to grammars that are center embedding as well as to those that are not.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u2022 o s",
"sec_num": null
},
{
"text": "Suppose we extend the grammar G2 by replacing rules G2e and f by rules G2e' and f' respectively, and adding rules G2m-s as follows: Among the expressions generated by the extended grammar G2 are those in E3.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u2022 o s",
"sec_num": null
},
{
"text": "(E3) a. the boss knew that the teacher saw the child yesterday b. the friend of the teacher's sister",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u2022 o s",
"sec_num": null
},
{
"text": "Although each of the expressions in E3 is ambiguous with respect to G2, each has a strongly preferred interpretation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u2022 o s",
"sec_num": null
},
{
"text": "Moreover, under each interpretation, each of these sentences manifests first-degree center embedding.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u2022 o s",
"sec_num": null
},
{
"text": "In E3, the included VP saw the child is wholly contained in the including VP knew that the teacher saw the child yesterday; and in E3b, the included NP the teacher is wholly contained in the including NP the friend of the teacher's sister.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u2022 o s",
"sec_num": null
},
{
"text": "Curiously enough, the extension of the affix grammar that our principles derive from the extension of the grammar G2 just given associates only one affixed string with each of the expressions in E3. That grammar is obtained by replacing rules G2*e and F with G2*e' and f' respectively, and adding the rules G2*m-s as follows. We contend that the fact that the expressions in E3 have a single strongly preferred interpretation results from the fact that those expressions have a single affixed string associated with them. Consider first E3a and its associated affixed string E3*a. According to rule Rc, the affix VP following yesterday is a postfix which covers the affixes VP and A. Now, there is only one occurrence of A in E3*a, namely the one that immediately precedes yesterday; hence that must be the occurrence which is covered by the postfix VP.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u2022 o s",
"sec_num": null
},
{
"text": "On the other hand, there are two occurrences of prefix VP in E3*a that can legitimately be covered by the postfix, the one before saw and the one before knew.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u2022 o s",
"sec_num": null
},
{
"text": "Suppose in such circumstances, rule Rc picks out the nearer prefix.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u2022 o s",
"sec_num": null
},
{
"text": "Then automatically the complex VP, saw the child yesterday, is covered by the subordinate S prefix, in accordance with the natural interpretation of the expression as a whole.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u2022 o s",
"sec_num": null
},
{
"text": "Next, consider E3b and its associated affixed string E3*b.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u2022 o s",
"sec_num": null
},
{
"text": "According to rule Rc, the G is a postfix that covers the affixes NP and G. Two occurrences of the prefix NP are available to be covered; again, we may suppose that rule Rc picks out the nearer one.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u2022 o s",
"sec_num": null
},
{
"text": "If so, then automatically the complex NP, the teacher's sister, is covered by PPI, again in accordance with the natural interpretation of the expression as a whole.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u2022 o s",
"sec_num": null
},
{
"text": "This completes our demonstration of the ability of affixed strings to represent the structural descriptions of the acceptable sentences of a natural language in a manner which enables them to be parsed by a finite-state device, and which also predicts the way in which (at least) certain expressions with center embedding are actually interpreted.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u2022 o s",
"sec_num": null
},
{
"text": "Much more could be said about the system of representation we propose, but time and space limitations preclude further discussion here. We leave as exercises to the reader the demonstration that the expression E4a has a single affixed string associated with it by G2*, and that the left-branching (stacked) interpretation of E4b is predicted to be preferred over the rightbranching interpretation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u2022 o s",
"sec_num": null
},
{
"text": "(E4) a. the student saw the teacher in the house b. the house in the woods near the stream",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u2022 o s",
"sec_num": null
}
],
"back_matter": [
{
"text": "We thank Maria Edelstein for her invaluable help in developing the work presented here.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "ACKNOWLEDGMENT",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Accessing the mental lexicon",
"authors": [
{
"first": "Kenneth",
"middle": [
"I"
],
"last": "Forster",
"suffix": ""
}
],
"year": 1976,
"venue": "New Approaches to Language Mechanisms",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Forster, Kenneth I. (1976) Accessing the mental lexicon. In R.J. Wales and E.T. Walker, eds., New Approaches to Language Mechanisms. Amsterdam: North-Holland.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "X-Bar Syntax",
"authors": [
{
"first": "Ray",
"middle": [
"S"
],
"last": "Jackendoff",
"suffix": ""
}
],
"year": 1977,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jackendoff, Ray S. (1977) X-Bar Syntax. Cam- bridge, Mass.: MIT Press.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Finite-state parsing of phrase-structure languages and the status of readjustment rules in grammar",
"authors": [
{
"first": "D",
"middle": [],
"last": "Langendoen",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Terence",
"suffix": ""
}
],
"year": 1975,
"venue": "Linguistic Inquiry",
"volume": "6",
"issue": "",
"pages": "533--54",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Langendoen, D. Terence (1975) Finite-state par- sing of phrase-structure languages and the status of readjustment rules in grammar. Linguistic Inquiry 6.533-54.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"num": null,
"type_str": "figure",
"uris": null,
"text": ""
},
"FIGREF1": {
"num": null,
"type_str": "figure",
"uris": null,
"text": ".new, saw, ---i"
},
"FIGREF2": {
"num": null,
"type_str": "figure",
"uris": null,
"text": ""
},
"FIGREF3": {
"num": null,
"type_str": "figure",
"uris": null,
"text": "The affix strings that the extended affix grammar G2* associates with the expressions in E3 are given in E3*.(E3 ~) a. NP D the N N boss VP V knew C C that S NP D the N N teacher VP V saw NP D the N N child A yesterday VP S b. NP D the N N friend PP1 P1 of NP D the N N teacher G's G N N sister NP"
}
}
}
} |