File size: 57,334 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 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 | {
"paper_id": "P85-1005",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T09:39:35.883464Z"
},
"title": "",
"authors": [],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "This paper presents ',,n iml~lcmcntcd thct~ry fnr quanlifying noun phr:.i.,.;cs in clausc.s ctmt:mting ct)pulnr verbs (e.g.. \"he\" ~md \"bcCOIllC'). Ih(~ccctling fr()nl Icccnt thcorcticnl work I)y Jackcn(Ioll[ I')X31. this c(,uputati(,tal theory recognizes the dependence ol\" the quantification dccisit)n tm the dcl~nitcness, in(lclhfitcncss, or cla'~nncs.s hi\" I)olh the subject and ()hjcct of c(apulnr verbs irt Fnglish. J~lckcndofl's intuition al')out Ihc qtmntil]c:~tional interdependence of suhject :tnd ohjcct Itz~s hccn imported fn,n his broader cognitive thc()ry and rel'ormulated ~,tltin a ct)nstraint propagation iizmtcwt)rk, I-'xtcnsit,ts reported here includt: the additi,m of mort: :,ctive determiners, the expansion of determiner categories, and the tre~ttmcnt of dispktccd objects. A further linding is th::t qu:Httilicational constraints may prop~g:~tc across soine clausM boundaries. The algorithm is used by the I~.EI.AI'US Natural I.:mguage Understanding System (h,ring a phase of analysis that posts constraints to produce zt 'constraint tree.' This phase comes ~fter crcz~lit)n of synt~tctic deep structure zntd bcfure ~cntcntktl rcl'Clcltcc ill a semantic-network ntodcl. Incorp(~,'ation ()f the qtmntific~tion algorithm in a larger system that parses ~cntcnccs z,nd builds semantic models from thcnt makes RE/.A'FUS ~hle to acquire taxonomic and identity inlormatit)n from text.",
"pdf_parse": {
"paper_id": "P85-1005",
"_pdf_hash": "",
"abstract": [
{
"text": "This paper presents ',,n iml~lcmcntcd thct~ry fnr quanlifying noun phr:.i.,.;cs in clausc.s ctmt:mting ct)pulnr verbs (e.g.. \"he\" ~md \"bcCOIllC'). Ih(~ccctling fr()nl Icccnt thcorcticnl work I)y Jackcn(Ioll[ I')X31. this c(,uputati(,tal theory recognizes the dependence ol\" the quantification dccisit)n tm the dcl~nitcness, in(lclhfitcncss, or cla'~nncs.s hi\" I)olh the subject and ()hjcct of c(apulnr verbs irt Fnglish. J~lckcndofl's intuition al')out Ihc qtmntil]c:~tional interdependence of suhject :tnd ohjcct Itz~s hccn imported fn,n his broader cognitive thc()ry and rel'ormulated ~,tltin a ct)nstraint propagation iizmtcwt)rk, I-'xtcnsit,ts reported here includt: the additi,m of mort: :,ctive determiners, the expansion of determiner categories, and the tre~ttmcnt of dispktccd objects. A further linding is th::t qu:Httilicational constraints may prop~g:~tc across soine clausM boundaries. The algorithm is used by the I~.EI.AI'US Natural I.:mguage Understanding System (h,ring a phase of analysis that posts constraints to produce zt 'constraint tree.' This phase comes ~fter crcz~lit)n of synt~tctic deep structure zntd bcfure ~cntcntktl rcl'Clcltcc ill a semantic-network ntodcl. Incorp(~,'ation ()f the qtmntific~tion algorithm in a larger system that parses ~cntcnccs z,nd builds semantic models from thcnt makes RE/.A'FUS ~hle to acquire taxonomic and identity inlormatit)n from text.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "the qtmntilicz, tion of noun phrases. determining their tmiversulity or individuality, ix critical It~r the ~,utomatic acquisition of taxonomic and ~dcntity intbrm:ttion from natural language sentences. Automatic :~cquisition can convert ordinary texts into sources of tzL,~onomic and identity information lior use by learning and reasoning programs in artificial intelligence. Such information can also find use in efforts to develop setectiun restrictions from Icxical sources. Of course, proper qu~mtific:~tion of noun phrases also plays a key role in computer programs that cnde~wor to understand natural language.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": null
},
{
"text": "The theory for computing the qtmntilicational status ()1\" noun phr:~scs fi)r tile czt.',e ,fl\" copular verbs (e.g.. \"he' and \"become') wzus inspired hy recent tho)rcticzd w~rk ,fl' . I;~ckt'nthflT [1~) X31 .",
"cite_spans": [
{
"start": 183,
"end": 201,
"text": "I;~ckt'nthflT [1~)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": null
},
{
"text": ".l~mkcn(ltdl' n,~lcd that qtl;llltiliC:.lliOn ,d\" n~ itlll i/tlr:l~t:s li)r cl)ptll:lr ,,orbs dcpcn(.I.'.; jointly on Ih\u00a2 dole0 ~mnct~, ,fl' I-~tlt Ihc ~tfl~jut:t \"NI ~ ,utd the ()hjcct NI' [1')83, ')(1-~)1. %].1 Ills intuiti, m h:.~s hr.:on rcli~rmulntcd. :~ttgtt~Cnlt:d, ~md implcntcr~tcd in the RFI.A'I'US N~lUlztl I.:ulgtt:tgc Undcr~t:u~tling S~tem. 2 lllc implemented qu~mlilicztti,m thc,)ry is used by RFI.ATUS us it incrcmcntMly builds :t scmzmtic m\u00a2)tlel.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": null
},
{
"text": "lhts method recovers clztn~ ~md identity inlbrmution from ~)rdinary English sentences. Alth()ugh the '~ctll~.mtic rll~dt:l tllUSt hE ,)CCZl~,i(mz,ll~ queried to re.'st)lve qtmntil]cutitmzd :tmt)igttitic~. the tnt. tht~0 is primz~rily syntactic :rod does n~t rcqtfire rues, ruing. The c()mpttt~di(mM simplicity and hn>zzd co~ct~lge oI\" the thc,)ry zdh)w suct.'u.,,~,l'tH tltmntilqu:~tion ,d rl,~tlll phrz|st.:b ira most c()l)td;~r el;ruses. W,)tk b, in prt~grcs~ to c~tcnd tile an~d)'xis to p~rtitivcs zmd thcrchy yicltl zl c(~rnprehcn~,i~\u00a2 analysis. While Ihi'~ ~lppr()at:h tl~cs not trc~,t ~u~.h difficult issues such z~s belief c()ntcxt'~ ~,,ttl mctz~l~ho,ic:fl u.'qlgcs, it tines :~tttlress mt,~.t lilct'nl cas,:x. Since the qu:mtific:ltion I. I will use \"object NP\" to refer to what ix I'ruquently called a \"'predicate objecL\" 2. [he experimental RELA'I US Naturai",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": null
},
{
"text": "Understanding System represents the con,bincd efforts of Gav:m I)t*ffy and the tmthor. Gavzm I)ttffy ix responsible for the parser, the calegt)rial disaml') igu;itor [[)ully. 1985b] . the lexicon and lexicon t, tilities. The author is respunsible lbr the representation system, the reference system, the component that nmps deep structure to semantics, the qtmntification system, the inversio, system, and the question-answering co,nponent.",
"cite_spans": [
{
"start": 157,
"end": 181,
"text": "igu;itor [[)ully. 1985b]",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "I.anguage",
"sec_num": null
},
{
"text": "theory is deployed in a natural hmguage system that narscs sentences and bttilds a :~cmantic model from them, REIATUS bccotncs, among other things, a system Ibr acquiring class structure inlbrmation fi'om ordinary English texts. ClC']tc~ a cott.slratt;t tree that ct)rrcsponds to n)ughly what t~m,d'~,m,~li, mal Clamm:aians call h~gica! Jbrm. !1~,e c,)~iStlmnt Irct' is tl.'St2tl to pcrl~.)lnt intcrscntcntial ~cfuruncc (merging succcs:,ive sentences into a single scmanlic-n,=twt~rk :n::dcl) [Mallory, 19851 . The input to c()nNtl'ailtt-i)osling phase is b~xh surf;.Icc struetttrc :.lnd dccl\" StlUCltlrc cantlniczdizcd hy a It'an.,,Ibrmatit)nut pal:ser [I)uffy, 19:Gal. In a dcplh-first, h~ttont tip walk of the dccp structure, omstrainus describing grammatical r,;latio.:, arc posted on otto-terminal paise-graph n(~d~. 3 When verbs in major clauses (Le.. clat;scs ()thcr than relative cl:m.',cs or clau:;al a(ljuncts) arc reached, they ,~upcrvise the quantilication of noun phrases they ctlmmand. If these verbs arc copular vcrhs, the copular interct)nsu'ainl algt)tith.,n is applied.",
"cite_spans": [
{
"start": 493,
"end": 508,
"text": "[Mallory, 19851",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "I.anguage",
"sec_num": null
},
{
"text": "In other cases, a,t)ther experimental algorithm pcrli)rms qttantification by drawing on logical rclatitms I'mm surface structure. The result of this process in the sentcntial constraint tree. It is a hierarchical description ~1\" gramnmticz, I and logical rclati(ms that is suitable input lbr the reference s~stcm. By sequentially referencing the sentences o1\" a text, a semantic mo(lcl of the text in incrementally constructed.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I.anguage",
"sec_num": null
},
{
"text": "Within a constrainl-p~sting framework, the basic task of NP qtmntilicatitm is to) decide whether to post a conslraint marking the NI.' as an individual or a universal. Y, incc the ta.nk ill','~d',\u00a2N kn~wing the spccilic subject and ,)bjcct o1\" a l~pular vcTh. it is delegated to a higher ctmstitucnt, the vcrh. 4 lhis dclcgatmn is motiwlted h), tile prin ('ip/e ,lhwtzl ~h'('ision-,:m(ing which holds that dct:isions shtmld I)c located where all required inlilrnlali(m is htllh avadahlc and i~r~xHnalc. In Ilti~ case. only Ihc VCl'h kll()WX Ihc ~tlcntllicn ~1\" hlflh Illfllll phrases duc it)the hic~archr\u00a2al ',tructtt0'c ~dgrammat~cal Iclalions. \"l'htm, whcll ;.I VClh iX~nlS its own iut'~lCllli;ll Ct)li511';lilllS, it also tlirccts the tttmntilicati(m o1 NPs that it d~,ninates (e.g., ils subject and ~lhject).",
"cite_spans": [
{
"start": 355,
"end": 394,
"text": "('ip/e ,lhwtzl ~h'('ision-,:m(ing which",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "The ('opular Inlerconstraint ,klgorithm",
"sec_num": null
},
{
"text": "This pmccthtrc ~,,~,s rcl~rntuiatcd m a \u00a2~mstraint prtqmgat:t,n [Waltz. 19751 I'ramcv .ta k ht:cut+sc I'caturcs t)f a single ctlnslilucnt cannt)l he tlcturmincd JntlcpcntlctHly o1 t~thcr tC~llSllltlCltlS ill the r,cnlcntial dcfivatitm. Since tlUantilicati~)ll:.ll c~ m~,traint pr~ ~pagatc.,, in t~ ~th di rccti< ms. this i)llX.cNs is Zl t',pe ill C'~#t.~lillH'#ll \"tllt'r~'t~/lSlrttittl. I-oltunalcl~, lhc p~ssihl\u00a2 slates ~fl\" \"qlN arc ,rely lt)rctx tlclinilc, intlclinitc. :rod class. I~cuatmc Ih\u00a2 mlrnhcr of I':t~nsihl\u00a2 NP statc~ is small (3) :rod the nuiHhcr of variahh:s is also ymall (2), a simple tahlc-lo~)kup alg,)r~thm \"c(m)pdcs' s,bjcct and ohjcct qtmniil~caLions for al! p~)ssihle conliguration.s of NP dclinitcnc.ss. 5",
"cite_spans": [
{
"start": 64,
"end": 85,
"text": "[Waltz. 19751 I'ramcv",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "The ('opular Inlerconstraint ,klgorithm",
"sec_num": null
},
{
"text": "3. At present, the REI.AIUS system builds scntcntial ccmstraints using the cammical grammatical relations ()1\" the sentence, tile quantilicz~titm status of n~xm phr;LseS, and the truth valuc.'s of verbs. Work is in pn~grc.ss to incorporate |empnr:d constraints on verbs, temporal adjectives, and various types of context markers. 4. The RELATUS parser u~.'s non-standard parse graphs. A (1) The dcfiniteness of the noun phr,'kses is ,ascertained by examining the determiners and several othcr parameters.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The ('opular Inlerconstraint ,klgorithm",
"sec_num": null
},
{
"text": "The algorithm is summarized by figure 2. Another algorithm dcscrihed by Iigure 3 is used Ibr determinerless plural NPs.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The ('opular Inlerconstraint ,klgorithm",
"sec_num": null
},
{
"text": "(2) The quantificational slatus of the subject and object is (Ictermined by I(~)king each case tip in the table depicted hy Iigt, re 4. Putentially ambiguous cases (marked with an ~tstcrisk) may require referencing the noun phrase in the semantic model to rcs~lve the ambiguity. Example scntences li)r Ihc ca.~:es in figure 4 are I'Oulld in Iigure 5.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The ('opular Inlerconstraint ,klgorithm",
"sec_num": null
},
{
"text": "(3) The vcrb-phra.sc node informs each NP of its quantilicatit)n (the results of stcp 2), and they in 5. The conversion of constnunt propagation into a table loq~kup approach is po~.sible in this special ~,,asc because there are only two variables, the suhjcct and the objccL In the general ~:a:~e, the sb, e of toe added classm,ss It) his scheme m order tt) cope with such determiners as \"all', \"any' and \"every'. While Jackendol'fs examples use only the determiners 'a'. \"an', and 'the', I have Ibund intcrpretati~ms Ihr additional determiners which are summarized in figure 2. JackcndtflT considers proper nouns to be definite and the same is done here, except in certain cases t)l\" phnal proper nouns which are interpreted a.s the plural indefinite (scc $21 in figure 5 ). The addition of the cla~s cate~urization calls lbr the'class determiners in the bottom of Iigure 2.",
"cite_spans": [],
"ref_spans": [
{
"start": 765,
"end": 773,
"text": "figure 5",
"ref_id": null
}
],
"eq_spans": [],
"section": "The ('opular Inlerconstraint ,klgorithm",
"sec_num": null
},
{
"text": "The determiner. \"no', is trevtcd as the negation of 'all.' Thus, the NP is quantified as a ckL~s and the copula negated. While SI0 and S18 in I]gure 5 are valid, S19 is not. There are restrictions on where \"no\" can appear. It cannot modify b~)lh the subject ~md object. Nor can it modify the t~hjcct when the subject is indefinite (S19) ~r a universal ($2()). but it can when the suhj~:ct is tlcl]nite (,%1~). lhc~c rcstricti~ms ~ccm generally valid Ibr literal cases cvcn lhough some idiomatic and mct,lphorical ctmsUttctions nlay vi(}late them. P:ntitJve determiners may engender two readings. Ihe Nl's they modify can be read as either collc~:tt~ms o1' individuals or universals. Some partitive determiners sttch tin 's()llle,' 'each,' 'nu~st', \"few'. or \"many' are tt.'.,cd It) make statements abemt subsets hi\" a coil,cotton.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The ('opular Inlerconstraint ,klgorithm",
"sec_num": null
},
{
"text": "With the exception of \"some,' thc~,c are missing from\" figure 2 pending research about how to determine their quantificatitm. 'Some' is interpreted just as an indefinite because o1\" its high frequency. I hc detclmincrs 'all,' \"any,\" and \"every,' wcrc included because they refer to the entirety of a collection.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "37'",
"sec_num": null
},
{
"text": "None of the partitive determiners, cvcn the ~mes currently used to determine dassncss, will be adeqtmtcly handled until completiun of continuing work ,m the syntactic parse graphs and the interactitm characteristics of partitives.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "37'",
"sec_num": null
},
{
"text": "S{~metimcs copular verbs take adjectives in the object position, leaving no apparent object. Some of these adjectives have a displaced ohjec/ as in $2, SI I, Sl3, .\";15 and ~16 in ligure 5. Wcrc there actually no-bject, the qtmntil]cation or the subject w~tlhl bc determined in is~i'.'tiun (u.',ing a different algorithm).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "37'",
"sec_num": null
},
{
"text": "When the adjective has an ~bjcct. that object is u:;cd to perfimn the NP intcreonstraint with the subject. (Ja.,,cs C6 and C8 are imp~,,.,,ible ($22 and $24) unlcss the sentences have displact:d uhjccts (SI 1 and S13). tlowcvcr, this is not the cast: liar (26 where a copular verb is modal and has a partiuvc tletcrminer on its object. This suggests that pa~lilive readings of class determiners may make tht~e cases acceptable and that displaced objects simply make such a reading easier.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "37'",
"sec_num": null
},
{
"text": "Di.,pbwcd .~.hic\u00a2'ts appear as the NPs to which \"relative prememns'\" brad in rula[l',c clatlSCS or app~.',i'..ivcs. 515 prc~idcs an example of intcrc(mstraint acn~ss u relative clausc. There, \"a phih,,~q~hcr' is the displaced ,~alhjcct <~1' the diN~laccd ~hjcct, \":m hmian StOiC.' Interestingly. \"a iqfih~:,~fdlcr ' i,~ al~,,~ a dihptaced object v, ith rc'q~cct tu \"Mary.' Recall Ihaf. COl~,Stl'.~lint pusdnL: pr()ccc(ls Ih~m the bl)l.t()lll t)l' the ptllhC gr.:lph up lira hierarchy ~ffgrammattcal rcfaltt)ns with quanlllic:ltJon lidhw, ing al(mg and being g~vcrncd b~, major verbs. In SI5. qtlanttlicatl~m intcrctmS!.lamt is lirst ~;pplJcd to a philusolfller' and 'an hmian sit,it\" by the c\u00a2~ptnla t,l\" the relative clause, then, rt is applied to 'Mary' and 'a phih~sopl~cr' hy the major copula. Since the fits! NP interc~'nstramt li,~cs \"a phih~snphcr' as a universal, that rcsttll is then carri,.'d over int{~ the mtcrc~mstraint with 'Mary.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "37'",
"sec_num": null
},
{
"text": "In hoth S15 and St6. the qtmntilicati, mal constraint pr(~pa[,atcs across ck, usal boundaries becm~se both clause share the ~me NP as an ohject and a subject. Ca.,,cs such as these should not lead to incemsistent quamil]c:~titms. Instead. fl~e.~ slmuld aLzrcc. ,ttte:~tmg to the ~,,mndnc.,,s el\" the algorithm. Jackcndc, IT [I')83:971 a,gues that cases C4 and C5 in figure 4 are semantically ambiguous. This amhi~uity s~urns only to hold liar the determiner \"the\" and is i'es(,Ived b~-a simple rclcrence of the NP in the semantic representation. 6 If the ambiguous NP has no referent in the current discourse Ibcus [Grosz, 1977] , then the NP must be a universal. If there is a referent, it is either a universal or an individual, and the same Fig. 5 . Sentences Exhil)iling C'apul:lr Interconstraiut",
"cite_spans": [
{
"start": 615,
"end": 628,
"text": "[Grosz, 1977]",
"ref_id": null
}
],
"ref_spans": [
{
"start": 744,
"end": 750,
"text": "Fig. 5",
"ref_id": null
}
],
"eq_spans": [],
"section": "37'",
"sec_num": null
},
{
"text": "i \"C i-~c (S 1)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "37'",
"sec_num": null
},
{
"text": "A dog is not a reptile. (Ge,eric categoriz, lion [Jackcndoff, 1983: 95 (SII) {;eorge was similar to every prcffe.~sor in the school.",
"cite_spans": [
{
"start": 24,
"end": 70,
"text": "(Ge,eric categoriz, lion [Jackcndoff, 1983: 95",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "37'",
"sec_num": null
},
{
"text": "]) i-) c i-,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "37'",
"sec_num": null
},
{
"text": "(S12) All syeoph'.mts ere the heart-throb of vanity.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "C~'C d~C",
"sec_num": null
},
{
"text": "C'\"C C ~C (S13) l,'very man is similar to any 5iped.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "C~'C d~C",
"sec_num": null
},
{
"text": "\u00a2 ~ C i-\" C (S14) All men are Fallible creatures. d ,i i.c i\u00f7c (S 15)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "C~'C d~C",
"sec_num": null
},
{
"text": "Mary is similar to a philosopher who is close to an Ionian stoic.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "C~'C d~C",
"sec_num": null
},
{
"text": "d-,i d-,i i,c",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "C~'C d~C",
"sec_num": null
},
{
"text": "(S 16) M:iry is .similar to the pifilosopher who is close to an Ionian stoic. quantification should be cht)sen.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "C~'C d~C",
"sec_num": null
},
{
"text": "Where both appear in the discourse lbcus, the individual reading is preferred. This is partictdarly important lbr C4 because the status of the subject is needed to predict that of object. In either case, both rnust have the same quantificational status.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "C~'C d~C",
"sec_num": null
},
{
"text": "The analysis of NP qtmntification in COl+ular clauses is signilicantly smtplilicd by the Ihct that there is no nccd to analyze qt,antilicr scoping. \"l'his li.)lk>ws fi'om the absence of ~, passive interpret:[[ion rt>r copt, lar verbs. rhcy are specialized in ctmvcying classificational inlinmation rather than exprcxsing active changes of ~,tutc..\";into there is nu agent ,rod no t)hjcct which is acted uptm. passive c(m:;tructJ(ms can have no meaningful intc!prct:~tion. Interchanging the suhjcct and the object either has no cl'l~:cI t)n itlcntlly stattcmcnts t)l\" inverts the classil]catum t,:la,thmship in t)tltcl\" G.iscs. 'l'hus. the scln;.intJc spccialilutitm t)l\" ct)ptllar ,.clhs Jn ctmvcying links t)f class hicr:trchic.', simplilics aspects of their s} nt.ictic analysis. Since I(FI.ATIjS increment:ally constructs a sonuntic m(Klcl o1' the sentences it analyzes, the CUl)ular intcrcnnstruint algorithnl allo,s a class structure it) be aut(mmtically ucqtnirctl.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "C~'C d~C",
"sec_num": null
},
{
"text": "\"Ihe way in which this inl0rmation is represented in R|-I.AI'US explt>its the encoding scheme underlying English usage of Ct>l)ular '.,'rbs. Ihis unc\u00a2~(ling mctht>d ulh)ws Ibur lypcs (;f linking ruluu(ms t() he cn'.:(~dcd iising a singtu It)ken. (i.e.. \"be'). Ibis cnct~ding us stiunnlari/cd ili ligurc 6. Since the types can he dil'l~:rcntiatcd acc+~rding to the qtmntification of the nodes linked, the unique rcprc:;cnt;,titm of each link type docs not rcttuirc the introduction t)f ad hoc tokens. Orthnary and generic classilication arc used to construct the taxonomy. When two individtmls arc linked by a 'be'",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "C~'C d~C",
"sec_num": null
},
{
"text": "6. Such a strategy h,'m bcen ff)llowed For other types of ambiguous preposition and clause bindings tHirst. 1981 . 1984 Duffy, 1985bl. relattt)n, idcnthy between them is represented, rdcntity between two universals is represented with two generic classificatio,ts indicating that each universal is a subset of the uther. For predicate adjectives, a spccml token (e.g., 'HQ,\" 'HAS-QUAlITY') is used as the relation and the adjective as the object in order to represent a tree-place property [Winston 1980, t982] . This avoids confusion when a ~,Vt)l'd token has rises Both as an adjective and a noun.",
"cite_spans": [
{
"start": 108,
"end": 112,
"text": "1981",
"ref_id": "BIBREF7"
},
{
"start": 113,
"end": 119,
"text": ". 1984",
"ref_id": null
},
{
"start": 120,
"end": 134,
"text": "Duffy, 1985bl.",
"ref_id": "BIBREF3"
},
{
"start": 490,
"end": 510,
"text": "[Winston 1980, t982]",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "C~'C d~C",
"sec_num": null
},
{
"text": "Because REI.ATUS incorporates a theory of #Herprelive semantics, where syntactic cant)nicalization is perlbrmed on input and semantic equivalence is dcterminetl 4)nly tim)ugh reastming twcr a s)ntactically canonical rt:prescntation, this cnct;tling system is p:,rticularly appropriate, gecat,se no p(~st-proccs.,,ing is ncctlctt tt) \",uhstittHc tlistinct tokens fi~r the different types of linking rclalitms, this cnct)tling :lls() .umplil]cs quanltl]t.alitm t)r C()l'mlar el:roses, :.llld thcrel't)rc, the ctmsttamt p()sting p!<)ccns in gcnc!ul. The cnct)ding rtlcth()(l t)011+,,' l~tltlilCS .3 '-,mall c(Hl'-,tctrtl, jnLIL':~:',c i[I time li>r walking the t.rcatctl clas.,, struc'tttrc, lhtls, the pq)tcntial gain in cllit.Jcr+cy hy ur, ing a mare uxplictt cnct)tling technique ts hint gin:if+ :mtl might hc ~)l'l~,ct by t)l hc! I,~ctors.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "C~'C d~C",
"sec_num": null
},
{
"text": "Conclusions lhc ~opula, huurcon,~tra,nt algoriflun prc,xCflLcd ill tills paper flus hccn ~llll)lL,,,ill~L,, rtd3tlS, t m l;.ll~C L.d.\\L applicatltms ovcr th,: pa:,t +vuai. ()nee the research on r~;+irt+tJvu.s iis c\u00a2)nli'Jlctcd, the :+Ll+t)l :thm will ut)~ur :at+ even lalger i+l(+p(+rti(+n (~l C~+l+tll~tl-vulb ca~cs. Wt!llk 11:.15 hccn dollc 011 c()ptllnr qt~c~tit)ns hut Ls too c,,mplcx Ibr disctts,;Rm hurt:, largely due t(+ pragrnuttc inturacu++ns. Conjum.titms havc he,.:n treated ju.,,t like t~rdimtry NPs, ,gxo.'pt that crr,)r checking on,arc:+ that .ill ?;Ps ill conjutlctJt)vts agree in dcl]nitcncss. Ihc idu:t urc()n~,traint prt~pagalitm has been ~:xtcndcd cxpcrhncnt:,lly to n~m-copular verbs using a dil'fcrcnt ptopugat:on alg<+rtthln. llae approach has hcen succcssl'ul thus rtr. Ht)wcvcr, nlt)ae research is required to analyze intcr:!cti~ms between '.andros qu:mtificatitm alg~>rithms and ':) .~l.',,cClt.~lJn lhc prt+f+ag'~tit,n characteristics or dil'furcnt verbs, accordint,, t(> their senses and rncanings. Oti.'.mtlllcr sc~ping. :dgtJrlthm intu'ractkm, and diflicrential pr()p:tgatit)n are some t~l\" characteristics ()r general ctmstitucnt interconstraint that make it more dil'licult. In gencf:tl, propagation ,ff q,,antificational constraints, seems a promisin~ approach =o previously rccalciu'ant problems. Even sO, strong psychological claims rot,st await further research and exhaustive atmlyses acros~ languages.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "C~'C d~C",
"sec_num": null
},
{
"text": "Recent interest in developing lexicons to support computer understanding of natural language [Walker and Amsler, 1985] suggests die need for cfreetive methods of attgmcnting our Icxicographical knowledge using large corpora and unrestricted text. Selection restrictions are an important type of information to accumulate because they are needed not only to distinguish different senses of words but also to recognize metaphorical uses. Since accumuhttion of selection rcstrictio,s rctluires it, acquisition or taxonomic ialb.'mation is a priority. The coptflar intcrconstnlint algorithm introduced in this paper provides a basis lbr acquiring large taxonomics from unrestricted texts. A filter can be used to quickly pmnc all non-copt.lar sentences :t~ well as (lilfictflt copular sentences involving hclicl: and perhaps, time contexts. The remaining scntc))ccs can be parsed, quantified and represented in a large semantic model. This research would not only advance our knowledge of natur'd laxonomics and selection rc.~tricti~)ns h,t it woultl also generate empirical data tt:)clitl I~)r ttlose studying \"dcfault logics' and stereotype hierarchies [Minsky, 1975; Keil, 1979 : Rotter, 1980 l-',rachrnan, 1982; Etherington and Rotter, 1983] . One dil'l]ct.ity with this research program is that an uncertainty principle is at work: The taxonomy used to determine selection restrictions itself depends on recognition of nlctaphors fllrottgh selection restrictions. Success in this lexicographical task will require the careful development of effective research strategies.",
"cite_spans": [
{
"start": 93,
"end": 118,
"text": "[Walker and Amsler, 1985]",
"ref_id": null
},
{
"start": 1151,
"end": 1165,
"text": "[Minsky, 1975;",
"ref_id": null
},
{
"start": 1166,
"end": 1176,
"text": "Keil, 1979",
"ref_id": "BIBREF10"
},
{
"start": 1177,
"end": 1191,
"text": ": Rotter, 1980",
"ref_id": null
},
{
"start": 1192,
"end": 1211,
"text": "l-',rachrnan, 1982;",
"ref_id": null
},
{
"start": 1212,
"end": 1241,
"text": "Etherington and Rotter, 1983]",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "C~'C d~C",
"sec_num": null
},
{
"text": "'kern\" corresponds to a clause while a \"verbal\" is something like a verb phrase except that the kern tells it what its subject. object, and m(~lificrs are at constraint-posting time. For further \"details. seeDu fl'y [1985a1.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [
{
"text": "This paper was improved by comments rrom Jonathan Connetl, Gavan Daffy. M:lrgarct Fleck, Robert Ingria, David McAIIcster, Rick Lathrop, and David Waltz. This i'ese:lrch was encouraged mid supported in various ways by Hayward Alker, Mike Rrndy, Berthold Horn, Tom Knight, Marvin Minsky, Gerald Sussman, and Patrick Winston. Gavan Duffy's parse graphs made this research possible.The REI.AFUS system was dc:,igncd and implemented by the author and Gavan I)uffy.This research ~,as done at the Artificial Intelligence I,abonttory of the Massachttsctts Institute of Technology. Support for the l,aboratory's artificial intelligence research is pn)vidcd in part by the Advanced Research Projects Agency or the Department of Defense under Office of Naval Research contract number N00014-80-C-0505. Responsibility for the content, of course, remains with the author.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgments",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "What 'lsa' Is And Isn't",
"authors": [
{
"first": "Ronald",
"middle": [
"!"
],
"last": "I~",
"suffix": ""
}
],
"year": null,
"venue": "",
"volume": "11982",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "I~,rachman, Ronald .!., 11982], \"What 'lsa' Is And Isn't,\"",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "the b'ourth Bienaial Conference of The Canadian Society for Computational Studies of Intelligence",
"authors": [
{
"first": "I",
"middle": [],
"last": "",
"suffix": ""
}
],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "212--214",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "I'roceedings ~\" the b'ourth Bienaial Conference of The Canadian Society for Computational Studies of Intelligence, pp. 212-2t",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Bootstrapping Performance fi'om Competence: The Development Strategy of the R EI",
"authors": [
{
"first": "(",
"middle": [],
"last": "Daffy",
"suffix": ""
}
],
"year": 1985,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Daffy, (;avan, [1985a], \"Bootstrapping Performance fi'om Competence: The Development Strategy of the R EI.,A'['US Parser,\" Ibrthcoming.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Catego*'ial Disamhiguation",
"authors": [
{
"first": "(",
"middle": [],
"last": "Duffy",
"suffix": ""
}
],
"year": 1985,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Duffy, (;avan, [1985bl, \"Catego*'ial Disamhiguation,\" Ibrthcoming.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Referential Determinism and Computational Efllcicncy: Posting Constraints from Dccp Structure",
"authors": [
{
"first": "(",
"middle": [],
"last": "Iohn",
"suffix": ""
},
{
"first": "'",
"middle": [],
"last": "Mallory",
"suffix": ""
}
],
"year": null,
"venue": "Proceedings of the /lmerican Ass,)chttiott for Artificial Intelligence",
"volume": "",
"issue": "",
"pages": "101--105",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "l)uffy, Gay:m, and .Iohn (,'. Mallory, 119841, \"'Referential Determinism and Computational Efllcicncy: Posting Constraints from Dccp Structure\" Proceedings of the /lmerican Ass,)chttiott for Artificial Intelligence, pp. 101-105.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "On Inh._'ritance I-liclarchics With Exceptions, \"' I'roceedings oJ'the Amcricat) Association fi~r Artificial Intelligence",
"authors": [
{
"first": ",",
"middle": [],
"last": "Etheringto",
"suffix": ""
},
{
"first": "K",
"middle": [],
"last": "Anti R;Lymond Relier",
"suffix": ""
}
],
"year": 1983,
"venue": "",
"volume": "",
"issue": "",
"pages": "104--108",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Etheringto,, I)avid K., anti R;lymond Relier, [19831, \"On Inh._'ritance I-liclarchics With Exceptions, \"' I'roceedings oJ'the Amcricat) Association fi~r Artificial Intelligence, pp. 104-108.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "The Representation and U~e (~ Focus m Dialogue Understanding. Menh) Park: SRI International",
"authors": [],
"year": 1977,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "rosz. Barbara .1, [1977]. The Representation and U~e (~ Focus m Dialogue Understanding. Menh) Park: SRI International, Technical Note 151.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Anaphora in Natural Language Understanding: A Survey",
"authors": [],
"year": 1981,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "llirst, (;raeme, [1981[, Anaphora in Natural Language Understanding: A Survey, Berlin: Springer-Verlag.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Procecdb~gs of the American Association for Artificial httel/igence",
"authors": [
{
"first": "Graeme",
"middle": [],
"last": "Lirst",
"suffix": ""
}
],
"year": 2011,
"venue": "",
"volume": "",
"issue": "",
"pages": "148--152",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "l lirst, Graeme, [198,11. \"'A Semantic Process for Syntactic Disambiguation,'\" Procecdb~gs of the American Association for Artificial httel/igence, pp. 148-152.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Semantics tznd Cognition",
"authors": [
{
"first": "J",
"middle": [],
"last": "Ray",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "",
"suffix": ""
}
],
"year": 1983,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "J,'tckendoff, Ray S., [1983], Semantics tznd Cognition, Cambridge, Mass: M rr Press.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Semantic and Conceptual Structure: ,In Ontological Perspective",
"authors": [
{
"first": "Frank",
"middle": [
"C"
],
"last": "Keil",
"suffix": ""
}
],
"year": 1979,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Keil, Frank C., [1979[, Semantic and Conceptual Structure: ,,In Ontological Perspective, Cambridge, Mass.: Harvard University Press.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "M rr Artificial Intelligence I.aboratory, AI Memo Nt~. ,q27",
"authors": [
{
"first": "John",
"middle": [
"C"
],
"last": "Mallory",
"suffix": ""
}
],
"year": 1985,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Mallory, John C., 11985], \"Constraint-lntcrprcting Rcrcrcnce,'\" Cambridge, Mass.: M rr Artificial Intelligence I.aboratory, AI Memo Nt~. ,q27, May. 1985.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "A Framework fi)r Representing Knowledge",
"authors": [
{
"first": "",
"middle": [],
"last": "Mi",
"suffix": ""
},
{
"first": "Marvin",
"middle": [],
"last": "Sky",
"suffix": ""
}
],
"year": 1975,
"venue": "",
"volume": "",
"issue": "",
"pages": "211--277",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Mi.sky, Marvin. [1975]. \"'A Framework fi)r Representing Knowledge,\" in [Winston, 1975]. pp. 211-277.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "A Logic for Default Reasoning",
"authors": [
{
"first": "Raymond",
"middle": [],
"last": "Reiter",
"suffix": ""
}
],
"year": 1980,
"venue": "Artificial Intelligence",
"volume": "",
"issue": "",
"pages": "81--132",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "reiter, Raymond, [19801, \"A Logic for Default Reasoning,'\" Artificial Intelligence. pp. 81-132.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Un(Icrst.*,Iding l.ine Drawings of Scenes with Shadows",
"authors": [
{
"first": "",
"middle": [],
"last": "Waltz",
"suffix": ""
},
{
"first": "I",
"middle": [],
"last": "David",
"suffix": ""
},
{
"first": ".",
"middle": [],
"last": "",
"suffix": ""
}
],
"year": 1975,
"venue": "Wit:stun",
"volume": "",
"issue": "",
"pages": "19--91",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Waltz. David I,.. [1975J, \"'Un(Icrst.*,,Iding l.ine Drawings of Scenes with Shadows,\" in Wit:stun [1975, 19-91].",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "The U'~c oI\" M~,chin\u00a2-I~,cadahle I)ictionarit:s in Sublanguage A~lalysis",
"authors": [
{
"first": "E",
"middle": [],
"last": "Walker",
"suffix": ""
},
{
"first": "Rohrrt",
"middle": [
"A"
],
"last": "Ainsler",
"suffix": ""
}
],
"year": 1985,
"venue": "A'ubhm~uage: De.v'ription and Processing t.awrence Erlbaum Associates",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Walker, l)onald E., and Rohrrt A. Ainsler, [1985l, \"The U'~c oI\" M~,chin\u00a2-I~,cadahle I)ictionarit:s in Sublanguage A~lalysis,'\" in Ralph Grishman and Richard Kittredge, editors. A'ubhm~uage: De.v'ription and Processing t.awrence Erlbaum Associates, 1985.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "1 earning New Principles From Precedents And Exercises",
"authors": [
{
"first": "Patrkk",
"middle": [
"I1"
],
"last": "Winston",
"suffix": ""
}
],
"year": 1982,
"venue": "Artificial Intelligence",
"volume": "19",
"issue": "3",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Winston, Patrkk I1., [1982]. \"'1 earning New Principles From Precedents And Exercises,'\" Artificial Intelligence, 19(3).",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"num": null,
"uris": null,
"text": "quantificati~m algorithm is embedded in a scntcntial const:aint-posting process [l)ufl'y ;,,d Mallery, 1%41 shown in ligure 1. Scntential ctmstraint-posting",
"type_str": "figure"
},
"FIGREF1": {
"num": null,
"uris": null,
"text": "Fig. 2. Determiner Categories",
"type_str": "figure"
},
"FIGREF2": {
"num": null,
"uris": null,
"text": "Vari()us casc:~ of dcturnlincr-lcss NPs are handled hy lhc alg,)rithm dial determines NP dcliniteness. Those t:ascs arc listed in figure 3. The indclhlllC category may hc incompletely handled hccause lhe thco,'y tlous not yet encompass partitives --imlcfinite NPs dlat ix,rtitkm collcctiuns of individuals or universals. Thus, determiner-less NPs with plmal hc:;d nouns are not amdyzcd Ibr partitive readings.",
"type_str": "figure"
},
"FIGREF3": {
"num": null,
"uris": null,
"text": "nrmmmls t~rc eveJ~ warm-hhmded creature.(Dt, fi, Keness: L ~\u00a3 c) , (Quanlifiutlion: i ot c) indicates the ,ma!ysis of the NI\" ,nder it. 7\"he definiteness categories.\" indefinite (i). definite (d). ttn,l class (c). ?'he quanlifi\u00a2atLon categories.\" mdivMual (i). class (c). \" hldicales an ungrammalical senlenCe.",
"type_str": "figure"
},
"FIGREF4": {
"num": null,
"uris": null,
"text": "(.'lassificalion of ('olmlar I,inks in III\"I,,VI'US Sulqect Re;tl ()hject l.i+,k ('l",
"type_str": "figure"
},
"TABREF1": {
"html": null,
"content": "<table><tr><td>Characteristic of NP</td><td>NP Classification</td></tr><tr><td>Singular Proper Noun</td><td>Definite</td></tr><tr><td>Plural</td><td>Indefinite</td></tr><tr><td>Possessively Modified</td><td>l)elinite</td></tr><tr><td>Animate Pronouns</td><td>Dclinite</td></tr><tr><td colspan=\"2\">In his discussion, ,hlckcndoll'[lgX3: 77-106, esp.</td></tr></table>",
"num": null,
"text": "table is exponetitial in the number of ,/ariables. turn post corresponding constraints on themselves.Fig. 3. Categories for Determiner-less NPs 8X-91.94-10hl nifty c~,tcguri/c.', determiners acc()r(ling to the distinction between definite and indefinite . I have",
"type_str": "table"
},
"TABREF2": {
"html": null,
"content": "<table><tr><td>Case</td><td>Sentence</td><td colspan=\"2\">Determiner Classification</td><td colspan=\"2\">Noun Phrase Quantification</td></tr><tr><td/><td/><td>Subject</td><td>Object</td><td>Subject</td><td>Object</td></tr><tr><td>C1</td><td>SI. $2</td><td>Indefinite</td><td>Indefinite</td><td>Class</td><td>Class</td></tr><tr><td>C2</td><td>$3</td><td>Indefinite</td><td>Class</td><td>Class</td><td>Class</td></tr><tr><td>C3</td><td>$4</td><td>Indefinite</td><td>Definite</td><td>Class</td><td>Class</td></tr><tr><td>C4</td><td>$5, $6, $7</td><td>Definite</td><td>Definite</td><td>Individual*</td><td>Individual*</td></tr><tr><td>C5</td><td>$8. $9</td><td>Definite</td><td>Indefinite</td><td>Individual*</td><td>Class</td></tr><tr><td>C6</td><td>Sll</td><td>Definite</td><td>Class</td><td>Individual</td><td>Class+</td></tr><tr><td>C7</td><td>Sl2</td><td>Class</td><td>Definite</td><td>Class</td><td>Class</td></tr><tr><td>C8</td><td>St3</td><td>Class</td><td>Class</td><td>Class</td><td>Class+</td></tr><tr><td>C9</td><td>$10, S14</td><td>Class</td><td>Indefinite</td><td>Class</td><td>Class</td></tr></table>",
"num": null,
"text": "",
"type_str": "table"
},
"TABREF3": {
"html": null,
"content": "<table><tr><td/><td/><td>c</td></tr><tr><td>($2)</td><td colspan=\"2\">An antelope is not similar to a Fish.</td></tr><tr><td/><td>i~C</td><td>C ~C</td></tr><tr><td>($3)</td><td colspan=\"2\">A priest is similar to all religious figures.</td></tr><tr><td/><td>i-'c</td><td>d,c</td></tr><tr><td>($4)</td><td colspan=\"2\">I':u'ailclism is not the panacea ofcombinatorial explosion.</td></tr><tr><td/><td>d,i</td><td>d-,i</td></tr><tr><td>(SS)</td><td>('lurk-d \" i</td><td>d \" i</td></tr><tr><td>($6)</td><td colspan=\"2\">('l;uk-Kent is ~ul)ernlan. (hlt,,lily [Jackcndoff. 1983: 95])</td></tr><tr><td/><td>d,i.d.c</td><td>d.,i.d,c</td></tr><tr><td>(S7)</td><td colspan=\"2\">The tiger is the fiercest I~e'ast of the jungle.</td></tr><tr><td/><td>d-.i</td><td>i .c</td></tr><tr><td>($8)</td><td colspan=\"2\">{;lark-Kent is ~ friendly super-hero. (Or,.li, ary calegori~almn [Jackcndoff. 1983: 95])</td></tr><tr><td/><td>d ,Ld-.c</td><td>i ,c</td></tr><tr><td>($9)</td><td colspan=\"2\">The tiger is a fiightening be:Int. [.lackendoff, 1983:971</td></tr><tr><td/><td>C ~C</td><td>i*c</td></tr><tr><td>(S10)</td><td colspan=\"2\">No m'.mmml is a reptile.</td></tr><tr><td/><td>d,i</td><td>c,c</td></tr></table>",
"num": null,
"text": "Kent is the man who was given the martini by Mary.",
"type_str": "table"
}
}
}
} |