File size: 50,355 Bytes
6fa4bc9 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 | {
"paper_id": "P90-1014",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T09:39:01.137776Z"
},
"title": "Free Indexation: Combinatorial Analysis and",
"authors": [
{
"first": "A",
"middle": [
"Compositional"
],
"last": "Algorithm",
"suffix": "",
"affiliation": {
"laboratory": "Artificial Intelligence Laboratory",
"institution": "MIT",
"location": {
"postCode": "NE43-810, 02139",
"settlement": "Rm, Cambridge",
"region": "MA"
}
},
"email": "sandiway@ai.mit.edu"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "The principle known as 'free indexation' plays an important role in the determination of the referential properties of noun phrases in the principleand-parameters language framework. First, by investigating the combinatorics of free indexation, we show that the problem of enumerating all possible indexings requires exponential time. Secondly, we exhibit a provably optimal free indexation algorithm.",
"pdf_parse": {
"paper_id": "P90-1014",
"_pdf_hash": "",
"abstract": [
{
"text": "The principle known as 'free indexation' plays an important role in the determination of the referential properties of noun phrases in the principleand-parameters language framework. First, by investigating the combinatorics of free indexation, we show that the problem of enumerating all possible indexings requires exponential time. Secondly, we exhibit a provably optimal free indexation algorithm.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "In the principles-and-parameters model of language, the principle known as 'free indexation' plays an important part in the process of determining the referential properties of elements such as anaphors and pronominals. This paper addresses two issues. (1) We investigate the combinatorics of free indexation. By relating the problem to the n-set partitioning problem, we show that free indexation must produce an exponential number of referentially distinct phrase structures given a structure with n (independent) noun phrases. (2) We introduce an algorithm for free indexation that is defined compositionally on phrase structures. We show how the compositional nature of the algorithm makes it possible to incrementally interleave the computation of free indexation with phrase structure construction. Additionally, we prove the algorithm to be an 'optimal' procedure for free indexation. More precisely, by relating the compositional structure of the formulation to the combinatorial analysis, we show that the algorithm enumerates precisely all possible indexings, without duplicates.",
"cite_spans": [
{
"start": 253,
"end": 256,
"text": "(1)",
"ref_id": "BIBREF0"
},
{
"start": 530,
"end": 533,
"text": "(2)",
"ref_id": "BIBREF1"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Consider the ambiguous sentence:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Free Indexation",
"sec_num": "2"
},
{
"text": "(1) John believes Bill will identify him *The author would like to acknowledge Eric S. Ristad, whose interaction helped to motivate much of the analysis in this paper. Also, Robert C. Berwick, Michael B. Kashket, and Tanveer Syeda provided many useful comments on earlier drafts. This work is supported by an IBM Graduate Fellowship.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Free Indexation",
"sec_num": "2"
},
{
"text": "In (1) , the pronominal \"him\" can be interpreted as being coreferential with \"John\", or with some other person not named in (1), but not with \"Bill\". We can represent these various cases by assigning indices to all noun phrases in a sentence together with the interpretation that two noun phrases are coreferential if and only if they are coindexed, that is, if they have the same index. Hence the following indexings represent the three coreference options for pronominal \"him\" :1",
"cite_spans": [
{
"start": 3,
"end": 6,
"text": "(1)",
"ref_id": "BIBREF0"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Free Indexation",
"sec_num": "2"
},
{
"text": "(2) a. John1 believes Bill2 will identify him1 b. John1 believes Bill2 will identify him3 c. *John1 believes Bills will identify him2",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Free Indexation",
"sec_num": "2"
},
{
"text": "In the principles-and-parameters framework (Chomsky [3] ), once indices have been assigned, general principles that state constraints on the locality of reference of pronominals and names (e.g. \"John\" and \"Bill\") will conspire to rule out the impossible interpretation (2c) while, at the same time, allow the other two (valid) interpretations. The process of assigning indices to noun phrases is known as \"free indexation,\" which has the following general form:",
"cite_spans": [
{
"start": 52,
"end": 55,
"text": "[3]",
"ref_id": "BIBREF2"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Free Indexation",
"sec_num": "2"
},
{
"text": "(4) Assign indices freely to all noun phrases? In such theories, free indexation accounts for the fact that we have coreferential ambiguities in language. Other principles interact so as to limit the 1Note that the indexing mechanism used above is too simplistic a framework to handle binding examples involving inclusion of reference such as: (3) a. We1 think that I1 will win b. We1 think that Is will win c. *We1 like myself 1 d. John told Bill that they should leave Richer schemes that address some of these problems, for example, by representing indices as sets of numbers, have been proposed. See Lasnik [9] for a discussion on the limitations of, and alternatives to, simple indexation. Also, Higginbotham [7] has argued against coindexation (a symmetric relation), and in favour of directed links between elements (linking theory). In general, there will be twice as many possible 'linkings' as indexings for a given structure. However, note that the asymptotic results of Section 3 obtained for free indexation will also hold for linking theory. number of indexings generated by free indexation to those that are semantically well-formed.",
"cite_spans": [
{
"start": 611,
"end": 614,
"text": "[9]",
"ref_id": "BIBREF9"
},
{
"start": 714,
"end": 717,
"text": "[7]",
"ref_id": "BIBREF7"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Free Indexation",
"sec_num": "2"
},
{
"text": "In theory, since the indices are drawn from the set of natural numbers, there exists an infinite number of possible indexings for any sentence. However, we are only interested in those indexings that are distinct with respect to semantic interpretation. Since the interpretation of indices is concerned only with the equality (and inequality) of indices, there are only a finite number of semantically different indexings. 3 For example, \"John1 likes Mary2\" and \"John23 likes Mary4\" are considered to be equivalent indexings. Note that the definition in (4) implies that \"John believes Bill will identify him\" has two other indexings (in addition to those in (2)):",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Free Indexation",
"sec_num": "2"
},
{
"text": "(5) a. *John1 believes Bill1 will identify him1 b. *John1 believes Bill1 will identify him2 subsets. For example, a set of four elements {w, x, y, z} can be partitioned into two subsets in the following seven ways:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Free Indexation",
"sec_num": "2"
},
{
"text": "{w, z}{y} {w, y, y} y, z){w}",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Free Indexation",
"sec_num": "2"
},
{
"text": "The number of partitions obtained thus is usually represented using the notation {~} (Knuth [8] ). In general, the number of ways of partitioning n elements into m sets is given by the following formula. (See Purdom & Brown [10] for a discussion of (6).) In some versions of the theory, indices are only freely assigned to those noun phrases that have not been coindexed through a rule of movement (Move-a). (see Chomsky [3] (pg.331)). For example, in \"Who1 did John see [NPt] l?\", the rule of movement effectively stipulates that \"Who\" and its trace noun phrase must be coreferential. In particular, this implies that free indexation must not assign different indices to \"who\" and its trace element. For the purposes of free indexation, we can essentially 'collapse' these two noun phrases, and treat them as if they were only one. Hence, this structure contains only two independent noun phrases. 4",
"cite_spans": [
{
"start": 92,
"end": 95,
"text": "[8]",
"ref_id": "BIBREF8"
},
{
"start": 224,
"end": 228,
"text": "[10]",
"ref_id": "BIBREF10"
},
{
"start": 421,
"end": 424,
"text": "[3]",
"ref_id": "BIBREF2"
},
{
"start": 471,
"end": 476,
"text": "[NPt]",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Free Indexation",
"sec_num": "2"
},
{
"text": "The Combinatorics of Free Indexation",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "3",
"sec_num": null
},
{
"text": "........",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "3",
"sec_num": null
},
{
"text": "In this section, we show that free indexation generates an exponential number of indexings in the number of independent noun phrases in a phrase structure. We achieve this result by observing that the problem of free indexation can be expressed in terms of a well-known combinatorial partitioning problem.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "3",
"sec_num": null
},
{
"text": "Consider the general problem of partitioning a set of n elements into m non-empty (disjoint) 2The exact form of (4) varies according to different versions of the theory. For example, in Chomsky [4] (pg.59), free indexation is restricted to apply to Apositions at the level of S-structure, and to A-positions at the level of logical form.",
"cite_spans": [
{
"start": 194,
"end": 197,
"text": "[4]",
"ref_id": "BIBREF4"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "3",
"sec_num": null
},
{
"text": "ZIn other words, there are only a finite number of equivalence classes on the relation 'same core[erence relatlons hold.' This can easily be shown by induction on the number of indexed elements.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "3",
"sec_num": null
},
{
"text": "4TechnicaJly, \"who\" and its trace are said to form a chain. Hence, the structure in question contains two distinct chains. for n,m > 0",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "3",
"sec_num": null
},
{
"text": "The number of ways of partitioning n elements into zero sets, {o}, is defined to be zero for n > 0 and one when n = 0. Similarly, {,no}, the number of ways of partitioning zero elements into m sets is zero for m > 0 and one when m = 0.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "3",
"sec_num": null
},
{
"text": "We observe that the problem of free indexation may be expressed as the problem of assigning 1, 2,... ,n distinct indices to n noun phrases where n is the number of noun phrases in a sentence. Now, the general problem of assigning m distinct indices to n noun phrases is isomorphic to the problem of partitioning n elements into m non-empty disjoint subsets. The correspondence here is that each partitioned subset represents a set of noun phrases with the same index. Hence, the number of indexings for a sentence with n noun phrases is: (7) m=l (The quantity in (7) is commonly known as Bell's Exponential Number B.; see Berge [2] .)",
"cite_spans": [
{
"start": 538,
"end": 541,
"text": "(7)",
"ref_id": "BIBREF7"
},
{
"start": 628,
"end": 631,
"text": "[2]",
"ref_id": "BIBREF1"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "3",
"sec_num": null
},
{
"text": "The recurrence relation in (6) has the following solution (Abramowitz [1] ): (8) Using (8), we can obtain a finite summation form for the number of indexings: It can also be shown (Graham [6] ) that Bn is asymptotically equal to (10): (10) mrtn em~-n-~ where the quantity mn is given by:",
"cite_spans": [
{
"start": 70,
"end": 73,
"text": "[1]",
"ref_id": "BIBREF0"
},
{
"start": 77,
"end": 80,
"text": "(8)",
"ref_id": "BIBREF8"
},
{
"start": 188,
"end": 191,
"text": "[6]",
"ref_id": "BIBREF6"
},
{
"start": 235,
"end": 239,
"text": "(10)",
"ref_id": "BIBREF10"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "3",
"sec_num": null
},
{
"text": "(11) 1 mn In mn= n -- 2",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "3",
"sec_num": null
},
{
"text": "That is, (10) is both an upper and lower bound on the number of indexings. More concretely, to provide some idea of how fast the number of possible indexings increases with the number of noun phrases in a phrase structure, the following table exhibits the values of (9) for the first dozen values of n:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "3",
"sec_num": null
},
{
"text": "NPs ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "3",
"sec_num": null
},
{
"text": "In this section, we will define a compositional algorithm for freeindexation that provably enumerates all and only all the possible indexings predicted by the analysis of the previous section. The PO-PARSER is a parser based on a principles-and-parameters framework with a uniquely flexible architecture ( [5] ). In this parser, linguistic principles such as free indexation may be applied either incrementally as bottom-up phrase structure construction proceeds, or as a separate operation after the complete phrase structure for a sentence is recovered. The PO-PARSER was designed primarily as a tool for exploring how to organize linguistic principles for efficient processing. This freedom in principle application allows one to experiment with a wide variety of parser configurations.",
"cite_spans": [
{
"start": 306,
"end": 309,
"text": "[5]",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "A Compositional Algorithm",
"sec_num": "4"
},
{
"text": "Perhaps the most obvious algorithm for free indexation is, first, to simply collect all noun phrases occurring in a sentence into a list. Then, it is easy to obtain all the possible indexing combinations by taking each element in the list in turn, and optionally coindexing it with each element following it in the list. This simple scheme produces each possible indexing without any duplicates and works well in the case where free indexing applies after structure building has been completed.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A Compositional Algorithm",
"sec_num": "4"
},
{
"text": "The problem with the above scheme is that it is not flexible enough to deal with the case when free indexing is to be interleaved with phrase structure construction. Conceivably, one could repeatedly apply the algorithm to avoid missing possible indexings. However, this is very inefficient, that is, it involves much duplication of effort. Moreover, it may be necessary to introduce extra machinery to keep track of each assignment of indices in order to avoid the problem of producing duplicate indexings. Another alternative is to simply delay the operation until all noun phrases in the sentence have been parsed. (This is basically the same arrangement as in the non-interleaved case.) Unfortunately, this effectively blocks the interleaved application of other principles that are logically dependent on free indexation to assign indices. For example, this means that principles that deal with locality restrictions on the binding of anaphors and pronominals cannot be interleaved with structure building (despite the fact that these particular parser operations can be effectively interleaved).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A Compositional Algorithm",
"sec_num": "4"
},
{
"text": "An algorithm for free indexation that is defined compositionally on phrase structures can be effectively interleaved. That is, free indexing should be defined so that the indexings for a phrase is some function of the indexings of its sub-constituents. Then, coindexings can be computed incrementally for all individual phrases as they are built. Of course, a compositional algorithm can also be used in the non-interleaved case. Basically, the algorithm works by maintaining a set of indices at each sub-phrase of a parse tree. 5 Each index set for a phrase represents the range of indices present in that phrase. For example, \"Whoi did Johnj see tiT' has the phrase structure and index sets shown in Figure 1 .",
"cite_spans": [],
"ref_spans": [
{
"start": 702,
"end": 710,
"text": "Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "A Compositional Algorithm",
"sec_num": "4"
},
{
"text": "There are two separate tasks to be performed whenever two (or more) phrases combine to form a larger phrase, s First, we must account for the possibility that elements in one phrase could be coindexed (cross-indexed) with elements from the other phrase. This is accomplished by allowing indices from one set to be (optionally) merged with distinct indices from the other set. For example, the phrases \"[NpJohni]\" and \"[vP likes himj]\" have index sets {i} and {j}, respectively. Free indexation must allow for the possibilities that \"John\" and \"him\" could be coindexed or maintain distinct indices. Cross-indexing accounts for this by optionally merging indices i and j. Hence, we obtain: Secondly, we must find the index set of the aggregate phrase. This is just the set union of the index sets of its sub-phrases after cross-indexation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A Compositional Algorithm",
"sec_num": "4"
},
{
"text": "In the example, \"John likes him\", (12a) and (125) have index sets {i} and {i, j}.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A Compositional Algorithm",
"sec_num": "4"
},
{
"text": "More precisely, let Ip be the set of all indices associated with the Binding Theory-relevant elements in phrase P.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A Compositional Algorithm",
"sec_num": "4"
},
{
"text": "Assume, without loss of generality, that phrase structures are binary branching. 7 Consider a phrase P = Iv X Y] with immediate constituents X and Y. Then:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A Compositional Algorithm",
"sec_num": "4"
},
{
"text": "1. Cross Indexing: Let fx represent those elements of Ix which are not also members of Iv, that is, (Ix -Iv). Similarly, let iv be (Iv -Ix). s The nondeterminism in step (lc) of crossindexing will generate all and only all (i.e. without duplicates) the possible indexings. We will show this in two parts. First, we will argue that eSome rea\u00a3lers may realize that the algorithm must have an additional step in cases where the larger phrase itself may be indexed, for instance, as in [NPi[NP, John's ] mother]. In such cases, the third step is slCmply to merge the singleton set consisting of the index of the larger phrase with the result of crossindexing in the first step. (For the above example, the extra step is to just merge {i} with {j}.) For expository reasons, we will ignore such cases. Figure 2 Right-branching tree the above algorithm cannot generate duplicate indexings: That is, the algorithm only generates distinct indexings with respect to the interpretation of indices. As shown in the previous section, the combinatorics of free-indexlng indicates that there are only B, possible indexings. Next, we will demonstrate that the algorithm generates exactly that number of indexings. If the algorithm satisfies both of these conditions, then we have proved that it generates all the possible indexings exactly once.",
"cite_spans": [],
"ref_spans": [
{
"start": 796,
"end": 804,
"text": "Figure 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "A Compositional Algorithm",
"sec_num": "4"
},
{
"text": "1. Consider the definition of cross-indexing, ix represents those indices in X that do not appear in Y. (Similarly for iv.) Also, whenever two indices are merged in step (lb), they are 'removed' from ix and iv before the next iteration. Thus, in each iteration, z and y from step (lb) are 'new' indices that have not been merged with each other in a previous iteration. By induction on tree structures, it is easy to see that two distinct indices cannot be merged with each other more than once. Hence, the algorithm cannot generate duplicate indexings.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A Compositional Algorithm",
"sec_num": "4"
},
{
"text": "2. We now demonstrate why the algorithm generates exactly the correct number of indexings by means of a simple example. Without loss of generality, consider the right-branching phrase scheme shown in Figure 2 . Now consider the decision tree shown in Observe that this recurrence relation has the same form as equation (6) . Hence the algorithm generates exactly the same number of indexings as demanded by combinatorial analysis.",
"cite_spans": [
{
"start": 319,
"end": 322,
"text": "(6)",
"ref_id": "BIBREF6"
}
],
"ref_spans": [
{
"start": 200,
"end": 208,
"text": "Figure 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "A Compositional Algorithm",
"sec_num": "4"
},
{
"text": "This paper has shown that free indexation produces an exponential number of indexings per phrase structure. This implies that all algorithms that compute free indexation, that is, assign indices, must also take at least exponential time. In this section, we will discuss whether it is possible for a principle-based parser to avoid the combinatorial 'blow-up' predicted by analysis. First, let us consider the question whether the 'full power' of the free indexing mechanism is necessary for natural languages. Alternatively, would it be possible to 'shortcut' the enumeration procedure, that is, to get away with producing fewer than B, indexings? After all, it is not obvious that a sentence with a valid interpretation can be constructed for every possible indexing. However, it turns out (at least for small values of n; see Figures 5 and 6 below) that language makes use of every combination predicted by analysis. This implies, that all parsers must be capable of producing every indexing, or else miss valid interpretations for some sentences. There are B3 = 5 possible indexings for three noun phrases. Figure 5 contains example sentences for each possible indexing. 9 Similarly, there are fifteen possible indexings for four noun phrases. The corresponding examples are shown in Figure 6 .",
"cite_spans": [],
"ref_spans": [
{
"start": 1111,
"end": 1119,
"text": "Figure 5",
"ref_id": null
},
{
"start": 1288,
"end": 1296,
"text": "Figure 6",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Conclusions",
"sec_num": "5"
},
{
"text": "Although it may be the case that a parser must be capable of producing every possible indexing, it does not necessarily follow that a parser must enumerate every indexing when parsing a parlicular sentence. In fact, for many cases, it is possible to avoid exhaustively exploring the search space of possibilities predicted by combinatorial analysis. To do this, basically we must know, a priori, what classes of indexings are impossible for a given sentence. By factoring in knowledge about restrictions on the locality of reference of the items to be indexed (i.e. binding principles), it is possible to explore the space of indexings in a controlled fashion. For example, although free indexation implies that there are five indexings for \"John thought [s Tom forgave himself ] \", we can make use of the fact that \"himself\" must be coindexed with an element within the subordinate clause to avoid gen-STo make the boundary cases match, just define c(0, 0) to be 1, and let c(0, m) = 0 and c(n, 0) = 0 for m > 0 and n > 0, respectively. Figure 6 Example sentences for B4 crating indexings in which \"Tom\" and \"himself\" are not coindexed. 1\u00b0 Note that the early elimination of ill-formed indexings depends crucially on a parser's ability to interleave binding principles with structure building. But, as discussed in Section 4, the interleaving of binding principles logically depends on the ability to interleave free indexation with structure building. Hence the importance of an formulation of free indexation, such as the one introduced in Section 4, which can be effectively interleaved.",
"cite_spans": [],
"ref_spans": [
{
"start": 1038,
"end": 1046,
"text": "Figure 6",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Conclusions",
"sec_num": "5"
}
],
"back_matter": [],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Handbook of Mathematical Functions",
"authors": [
{
"first": "M",
"middle": [
"A"
],
"last": "Abramowitz ~ I",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Stegun",
"suffix": ""
}
],
"year": 1965,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "M. Abramowitz ~ I.A. Stegun, Handbook of Mathematical Functions. 1965. Dover.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Principles of Combinatorics",
"authors": [
{
"first": "C",
"middle": [],
"last": "Berge",
"suffix": ""
}
],
"year": 1971,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Berge, C., Principles of Combinatorics. 1971. Academic Press.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Lectures on Government and Binding: The Pisa Lectures. 1981. Foris Publications",
"authors": [
{
"first": "N",
"middle": [
"A"
],
"last": "Chornsky",
"suffix": ""
}
],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Chornsky, N.A., Lectures on Government and Binding: The Pisa Lectures. 1981. Foris Pub- lications.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": ") where \"John\" has a separate index. Similarly, if we make use of the fact that \"Tom\" cannot be coindexed with",
"authors": [],
"year": null,
"venue": "1\u00b0This leaves only two remaining indexings: (1) where \"John\" is coindexed with \"Tom\" and \"himself",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "1\u00b0This leaves only two remaining indexings: (1) where \"John\" is coindexed with \"Tom\" and \"himself\", and (2) where \"John\" has a separate index. Similarly, if we make use of the fact that \"Tom\" cannot be coin- dexed with \"John\", we can pare the list of indexings down to just one (the second case). ii0",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Some Concepts and Consequences of of the Theory of Government and Binding",
"authors": [
{
"first": "N",
"middle": [
"A"
],
"last": "Chomsky",
"suffix": ""
}
],
"year": 1982,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Chomsky, N.A., Some Concepts and Conse- quences of of the Theory of Government and Binding. 1982. MIT Press.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "The Computational Implementation of Principle-Based Parsers",
"authors": [
{
"first": "S",
"middle": [
"&: R C"
],
"last": "Fong",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Berwick",
"suffix": ""
}
],
"year": 1989,
"venue": "InternationM Workshop on Parsing Technologies",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Fong, S. &: R.C. Berwick, \"The Compu- tational Implementation of Principle-Based Parsers,\" InternationM Workshop on Pars- ing Technologies. Carnegie Mellon University. 1989.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Concrete Mathematics: A Foundation for Computer Science",
"authors": [
{
"first": "R",
"middle": [
"L"
],
"last": "Graham",
"suffix": ""
},
{
"first": "D",
"middle": [
"E"
],
"last": "Knuth",
"suffix": ""
},
{
"first": "&",
"middle": [
"O"
],
"last": "Patashnik",
"suffix": ""
}
],
"year": 1989,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Graham, R.L., D.E. Knuth, & O. Patash- nik, Concrete Mathematics: A Foundation for Computer Science. 1989. Addison-Wesley.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Logical Form, Binding, and Nominals",
"authors": [
{
"first": "J",
"middle": [],
"last": "Higginbotham",
"suffix": ""
}
],
"year": 1983,
"venue": "",
"volume": "14",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Higginbotham, J., \"Logical Form, Binding, and Nominals,\" Linguistic Inquiry. Summer 1983. Volume 14, Number 3.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "The Art of Computer Programming: Volume 1 / Fundamental Algorithms",
"authors": [
{
"first": "D",
"middle": [
"E"
],
"last": "Knuth",
"suffix": ""
}
],
"year": 1973,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Knuth, D.E., The Art of Computer Program- ming: Volume 1 / Fundamental Algorithms. 2nd Edition. 1973. Addison-Wesley.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "A Course in GB Syntax: Lectures on Binding and Empty Categories",
"authors": [
{
"first": "H",
"middle": [
"& J"
],
"last": "Lasnik",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Uriagereka",
"suffix": ""
}
],
"year": 1988,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Lasnik, H. & J. Uriagereka, A Course in GB Syntax: Lectures on Binding and Empty Cat- egories. 1988. M.I.T. Press.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "The Analysis of Algorithms",
"authors": [
{
"first": "P",
"middle": [
"W"
],
"last": "Purdom",
"suffix": ""
},
{
"first": "",
"middle": [
"~ C A"
],
"last": "Jr",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Brown",
"suffix": ""
}
],
"year": 1985,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Purdom, P.W., Jr. ~ C.A. Brown, The Anal- ysis of Algorithms. 1985. CBS Publishing.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"text": "{:++11} = {:} + (m + 1){m: 1 }",
"type_str": "figure",
"uris": null,
"num": null
},
"FIGREF2": {
"text": "12) a. Johnl likes him/, i merged with j 5For expository reasons, we consider only pure indices. The actual algorithm keeps track of additional information, such as agreement features like person, number and gender, associated with each index. For example, irrespective of configuration, \"Mary\" and \"him\" can never have the same index.",
"type_str": "figure",
"uris": null,
"num": null
},
"FIGREF3": {
"text": "(a) If either ix or fr are empty sets, then done. (b) Let x and y be members of ix and fy, respectively. (c) Eifher merge indices z and y or do nothing. (d) Repeat from step (la) with ix_ -{z} in place of ix. Replace Ir with Iv -{y} if and y have been merged. 2. Index Set Propagation: Ip = Ix O Iv.",
"type_str": "figure",
"uris": null,
"num": null
},
"FIGREF4": {
"text": "for computing the possible indexings of the right-branching tree in a bottom-up fashion. Each node in the tree represents the index set of the combined phrase depending on whether the noun phrase at the same level is cross-, B. b. B. b..",
"type_str": "figure",
"uris": null,
"num": null
},
"FIGREF5": {
"text": "Condensed decision tree indexed or not. For example, {i} and {i, j} on the level corresponding to NPj are the two possible index sets for the phrase Pij. The path from the root to an index set contains arcs indicating what choices (either to coindex or to leave free) must have been made in order to build that index set. Next, let us just consider the cardinality of the index sets in the decision tree, and expand the tree one more level (for NP~) as shown in Figure 4. Informally speaking, observe that each decision tree node of cardinality i 'generates' i child nodes of cardinality i plus one child node of cardinality i + 1. Thus, at any given level, if the number of nodes of cardinality m is cm, and the number of nodes of cardinality m-1 is c,,-1, then at the next level down, there will be mcm + c,n-1 nodes of cardinality m. Let c(n,m) denote the number of nodes at level n with cardinality m. Let the top level of the decision tree be level 1. Then: (13) c(n+l, re+l) = c(n, m)+(m+l)c(n, re+l)",
"type_str": "figure",
"uris": null,
"num": null
},
"FIGREF6": {
"text": "is an empty (non-overt) noun phrase element.",
"type_str": "figure",
"uris": null,
"num": null
},
"TABREF1": {
"html": null,
"text": "[cP [NP who/] [~-did [IP [NP Johnj] [vP see [NP tdl]]]",
"type_str": "table",
"content": "<table><tr><td/><td>{i,j} {i}</td><td>{/,j}</td><td>{i,j} {j}</td><td>{i}</td><td>{/}</td></tr><tr><td/><td colspan=\"5\">Figure 1 Index sets for \"Who did John see?\"</td></tr><tr><td>b. Johni likes himj,</td><td colspan=\"2\">i not merged with j</td><td/><td/></tr></table>",
"num": null
},
"TABREF2": {
"html": null,
"text": "Note that no loss of generality is implied since a structure of the form [NPI [NPj... ~.. -]... ~...] can be can always be handled as [P1 [NPi][P2[NPj... o\u00a2...].../~...]].",
"type_str": "table",
"content": "<table><tr><td>NPk/~</td><td/></tr><tr><td>N Pj</td><td>Y Pi</td></tr><tr><td>rThe algorithm generalizes to n-ary branching us-</td><td/></tr><tr><td>ing iteration. For example, a ternary branching struc-</td><td/></tr><tr><td>ture such as [p X Y Z] would be handled in the same</td><td/></tr><tr><td>way as [p X[p, Y Z]].</td><td/></tr></table>",
"num": null
},
"TABREF3": {
"html": null,
"text": "John1 wanted PRO1 to forgive himselfl John1 wanted PRO1 to forgive him2 Johnl wanted Mary 2 to forgive himl Johnl wanted Mary 2 to forgive herself2 John1 wanted Mary 2 to forgive him3Figure 5Example sentences for B3",
"type_str": "table",
"content": "<table><tr><td>(111)</td><td/><td/><td/></tr><tr><td>012)</td><td/><td/><td/></tr><tr><td>(121)</td><td/><td/><td/></tr><tr><td>(122)</td><td/><td/><td/></tr><tr><td>(123)</td><td/><td/><td/></tr><tr><td>(1111)</td><td>John1</td><td colspan=\"2\">persuaded himselfl that hel should give himselfl up</td></tr><tr><td>(1222)</td><td>John1</td><td colspan=\"2\">persuaded Mary 2 PRO2 to forgive herself2</td></tr><tr><td>(1112)</td><td>John1</td><td colspan=\"2\">persuaded himselfl PRO1 to forgive hers</td></tr><tr><td>(1221)</td><td>Johnl</td><td colspan=\"2\">persuaded Mary 2 PROs to forgive himl</td></tr><tr><td>(1223)</td><td>Johnl</td><td colspan=\"2\">persuaded Mary 2 PRO~ to forgive him3</td></tr><tr><td>(1233) (1122) (1211)</td><td>John1 Johnl John1</td><td colspan=\"2\">wanted Bill2 to ask Mary a PRO3 to leave wanted PRO1 to tell Mary 2 about herself2 wanted Mary 2 to tell him1 about himselfl</td></tr><tr><td>(1121) (1232)</td><td>JOhnl John1</td><td>wanted wanted</td><td>PRO1 to tell Mary 2 about himself1 Bill2 to tell Marya about himself2</td></tr><tr><td>0123) 0213)</td><td>John1 John1</td><td>wanted wanted</td><td>PRO1 to tell Mary 2 about Torna Mary 2 to tell him1 about Torn3</td></tr><tr><td>0e31) (1234)</td><td>John1 John1</td><td>wanted wanted</td><td>Mary 2 to tell Toma about himl Mary2 to tell Toma about Bill4</td></tr></table>",
"num": null
}
}
}
} |