File size: 63,248 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 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 | {
"paper_id": "C96-1012",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T12:52:11.146627Z"
},
"title": "To what extent does case contribute to verb sense disambiguation?",
"authors": [
{
"first": "Atsushi",
"middle": [],
"last": "Fuji1",
"suffix": "",
"affiliation": {},
"email": "fujii@cs.titech.ac.jp"
},
{
"first": "Inui",
"middle": [],
"last": "Kentaro",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Tokunaga",
"middle": [],
"last": "Takenobu",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Tanaka",
"middle": [],
"last": "Hozmni",
"suffix": "",
"affiliation": {},
"email": "tanaka@cs.titech.ac.jp"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "Word sense disambugation has recently been utilized in corpus-based aI)proaches, reflecting the growth in the number of nmehine readable texts. One (:ategory ()f al)l)roa(:hes disambiguates an input verb sense based on the similarity t)etween its governing (:its(; fillers and those in given examl)les. In this palter , we introdu<:c the degree of (:<mtriblltion of cast; to verb sells(', disambignation intt) this existing method, in this, greater diversity of semanti(: range of case filler examples will lead to that ease contributing to verb sense disambiguation more. We also report th(; result of a coml)arative ext)eriment, in which the t)erfornlance of disaml)igui~tion is iml)rt)ved t)y considering this notion of semantic contribution.",
"pdf_parse": {
"paper_id": "C96-1012",
"_pdf_hash": "",
"abstract": [
{
"text": "Word sense disambugation has recently been utilized in corpus-based aI)proaches, reflecting the growth in the number of nmehine readable texts. One (:ategory ()f al)l)roa(:hes disambiguates an input verb sense based on the similarity t)etween its governing (:its(; fillers and those in given examl)les. In this palter , we introdu<:c the degree of (:<mtriblltion of cast; to verb sells(', disambignation intt) this existing method, in this, greater diversity of semanti(: range of case filler examples will lead to that ease contributing to verb sense disambiguation more. We also report th(; result of a coml)arative ext)eriment, in which the t)erfornlance of disaml)igui~tion is iml)rt)ved t)y considering this notion of semantic contribution.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Word sense disambiguation is a crucial task in many kinds of natural language I)rot:essing at)l)lications, such as word selection in iIla(;hine translation (Sato, 1991) , pruning of syntactic structures in parsing (l,ytinen, 1986; Nagao, 11994) an(l text retrieval (Krovets and Croft, 1992; Voorht'.es, 1993) . Various researches on word sense disamil)ignation have recently been utilized in (:orlms-based apt)roache.s, reflecting the growth in the numlmr of machine readable texts. Unlike rule-basel1 ~l)l)roa('.hes, eortms-l)asext al)proa(:hes free us fl'om the task of generalizing observed 1)hent)Illena to l)roduce rnles for word sense, disaln-])igmttion, e.g. subt:ittegorization rules. Cortmsbased al)proaches are exet:ut(;(1 based on the intuitively t'easibh', assmnption that the higher the degree of similarity betwee, n the context of an illput word and tim context ill which tit(; word apl)cars in a sens(~' in a tort)us , the more plausible it becomes that the word is used in the same s(.~nse. Corpus-/)ased m(;thotls are. classified into two ap-1)rt)aches: examI)le-I)ased approaches (Kurohashi and Nagao, 1994; Urmnoto, 1994) and statisticbased apl)roa (:hes (l~rown et al., 1991 ; 1)tLglm and Itai, 1!)94; Niwa and Nitta, 11994; Schiitze, 1992; Ym'owsky, 1995) . We follow the examt)h>based apl)roach ill exl)laining its effe.etivity for verb sense disamibiguation in Japanese.",
"cite_spans": [
{
"start": 156,
"end": 168,
"text": "(Sato, 1991)",
"ref_id": "BIBREF10"
},
{
"start": 214,
"end": 230,
"text": "(l,ytinen, 1986;",
"ref_id": null
},
{
"start": 231,
"end": 244,
"text": "Nagao, 11994)",
"ref_id": null
},
{
"start": 265,
"end": 290,
"text": "(Krovets and Croft, 1992;",
"ref_id": "BIBREF4"
},
{
"start": 291,
"end": 308,
"text": "Voorht'.es, 1993)",
"ref_id": null
},
{
"start": 1099,
"end": 1126,
"text": "(Kurohashi and Nagao, 1994;",
"ref_id": "BIBREF5"
},
{
"start": 1127,
"end": 1141,
"text": "Urmnoto, 1994)",
"ref_id": null
},
{
"start": 1169,
"end": 1195,
"text": "(:hes (l~rown et al., 1991",
"ref_id": null
},
{
"start": 1223,
"end": 1245,
"text": "Niwa and Nitta, 11994;",
"ref_id": null
},
{
"start": 1246,
"end": 1261,
"text": "Schiitze, 1992;",
"ref_id": null
},
{
"start": 1262,
"end": 1277,
"text": "Ym'owsky, 1995)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": null
},
{
"text": "A representative example-based method for verb sense disambiguation was proposed by Kurohashi and Nagao (Kurohashi's inethod) (Kurohashi rand Nagao, 1994) . Their method uses an 0,xamph; database, containing examples of collocations as in figure 1. Figure 1 shows a fragment of tim entry associated wittl the Japan(;se verb to'ru. As with most words, the ve, rb to'r\"\u00a2t has multipie senses, examples of whit:h are \"to take/steal,\" \"to attain,\" \"to subst'ril)e\" and \"to reserve,\" The database gives one or more case frame(s) associated with tilt', verbs for each of their senses. In .Japanese, a coutI)lelnt;nt Of a verb, which is a constituent of the case frame of the verb, consists of a nonii phrase (case filler) followed by a case marker such ms ga (nominative) or o (accusative). The database has ~m example set of case fillers for each case. As shown in figure 1, examples of a comi)lement c.an be considered as an extensional description of the selectional restriction on it.",
"cite_spans": [
{
"start": 142,
"end": 154,
"text": "Nagao, 1994)",
"ref_id": "BIBREF7"
}
],
"ref_spans": [
{
"start": 249,
"end": 257,
"text": "Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Introduction",
"sec_num": null
},
{
"text": "The task (:onside.red in this paper is %o interpret\" a verb in an input s('.ntcnt:e, i.e. to choose ()lit) sense from a set of candidate senses of the verb. Given an input sentence, Kurohashi's method interprets the verb in the input by computing semantic similarity between the input and exalnples. For this computation, Kurohashi's nmthod experimeIltally uses the Ja,panese word thesaurus Bunruigoihyo (National-Language R(> search Institute, 1964) . As with Inost thesauruses, the length of the 1lath between two words in Bunr'uigoihyo is exl)e, eted tt) reflect the similarity be,tween them. (1) hisho .qa sh, indaish, a o tor,u.",
"cite_spans": [
{
"start": 434,
"end": 450,
"text": "Institute, 1964)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": null
},
{
"text": "(set:retm'y-NOM) (siegel,trig (:ar-ACC)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": null
},
{
"text": "lit this examph',, it may t)e judged according to tigure 2 that h, ish, o (\"secretary\") and shindaisha (\"sleeping car\")in (1)i~l(, ,'~emantically similar to joshu (\"assistant\") att(l hikbki (\"airplane\"), re-Sl)ectively, which are cxamI)les that collocate with t(rru (\"to reserve\"). As sut'h, the sense of rot'u, in (1) can be interpreted as \"to reserve.\" llowever, in Kurohashi's nmthod, several usefifl properties for verb disambuguatittn are missing:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": null
},
{
"text": "1. httuitively speaking, the, contribution of the 2. The seleetional restriction of a certain case is stronger than those of others. For example, in tile accusative, the selectional restriction of \"to subscribe\" is stronger than that of \"to take/steal\" which Mlows various kinds of objects as its case filler.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": null
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "sur{ (pickpocket) } kanojo (she) ga an'i ( }n'ot her) /,:a ,,,",
"eq_num": "(he)"
}
],
"section": "Introduction",
"sec_num": null
},
{
"text": "In this p~tt)er, we improve on Kurohashi's method by introducing a formalization of these notions, and report the result of a comparative experiment.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": null
},
{
"text": "Property 1 in section 1 is exemplified by the input sentence (2).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Motiw, tion",
"sec_num": "2"
},
{
"text": "(2) (presideut-NOM) (magazine-ACe)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Motiw, tion",
"sec_num": "2"
},
{
"text": "The nominative, shachd (\"company president\"), in (2) is found in the %o attaiIf' ease frame of torn and there is no other co-occurrence in any other sense of toru; therefore, the nominative supports an interpretation \"to attain.\" On the other hand, \u00a9 nominative accusative Figure 3 : The semantic ranges of the nominative and accusative with verb torn the accusative, ,sh, gtkanshi (\"magazine\"), is most similar to the examples included ill tile accusative of the \"to subscribe\" and therefore the accusative supports another interpretation \"to snt)scribe.\" Although tile most plausible interpretation here is actually the latter, Kurohashi's method would choose tile former since (a) the degree in which the nominative sut)ports \"to attain\" happe.ns to be stronger than the degree in which the accusatiw'~ supports \"to subscribe,\" and (b) their method always relies equally on the similarity in the nominative and the accusative. Itowever, in the case of torn, since the semantic range of nouns collocating with the verb in the nominative does not seem to have a strong delinearization in a semantic sense, it would be difficult, or even risky, to properly interpret the verb sense based on tile similarity in the nominative. In contrast, since the ranges are diverse in the accusative, it would lm fe.asible. to rely more strongly on the similarity in the accusative. This argument can be illustrated as in figure 3, in which the symbols \"1\" and \"2\" denote example case fillers of different case fraines respectively, and an input sentence includes two case fillers denoted by \"x\" and \"y.\" The figure shows the distribution of example case fillers tienoted by those symbols in a semantic space, where the semantic similarity between two case fillers is represented by the physical distance between two symbols. In the nominative, since \"x\" ha.ptmns to })e iliuch cl()s(;r to & \"2\" th~Ln ~tlly \"1~\" \"X\" IIh~y be estimated to belong to the range of \"2\"s all, hough \"x\" ae('.ually belongs to both sets of \"l\"s a.nd \"2\"s. Ill the accusative, however, \"y\" would he prol)erly estimated to belong to \"l\"s due. to (;tie mutuM indet)en(lence of the two ac(:usative case filler sets, even though examples (lid not fully (:over e~tch of the ranges of \"t\"s and \"2\"s. Note that this diiferen(:e would he critieM if example (1,~t~ w(;re sparse. This argument suggests that we introduce, the degree of (:ontribution of case to verb sense disaml)iguation. One may argue that this l)roperty ca.n tie generMized as the notion tha. (1,rother-NOM) (toy-ACC) ('?)",
"cite_spans": [],
"ref_spans": [
{
"start": 273,
"end": 281,
"text": "Figure 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Motiw, tion",
"sec_num": "2"
},
{
"text": "In (3) th(! mosl: plausible inte.rpretati(m of l.or,u is \"to st(~al.\" Tim nonlina.tiv(~ does llot give mu(:h inf(~rtna.ti()n for interl)r(Mtip; the vert) for t;h(~ same reason as exa.uiph+ (2). lu the accusative, the datallase in tigure] has two example case lillers that arm (;(lU;fl]y similar to om, ocha (\"toy\"): saiftt (\"wallet\") and h, ikaki (\"airplane\"). These exami)les equMly SUl)t)ort two (lifferent interi)ret;ttions: \"t() steal\" mM \"to res(;rve,\" which me.ires thnt the verl) sense aml)igui(;y still rcmMns. ]lea'e, one ina.y noti(:e thai; since tile a(:(;ust~l;ive examples in tile C;tSe [l'i/,lIle of [,OT'lt (\"to reserve:') ~Ll'e, less diverse in niea.uing than the other case fr;tmes, the se[(!el;ion;tl restrit:l;ion on the ;t(:(:us~tiv(; of to'v'tt ('%o restarve') is relatively strong, ~md thus that it can be estiniated tt) lie reJatively ilnplausible for ornocha (\"toy\") to sa.tis[y it. If su(:h reasoning is correct, given that the ex~mll)les in the accusative of tor\"u (\"to steal\" ) are most widely distributed, the inlmt verl) (:an lie interl)reted as \"to steal.\" The consideration M)ove motivated us to introduce the notion of rela.tive strength t)f select]ohM restriction into our e~xaJnple-1)ased verb sense disalnbigu~tion method.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Motiw, tion",
"sec_num": "2"
},
{
"text": "We assume that inputs ~re simple sentences, e~mh one of which consists of a sequellce of eases fl)llowe.d by their governing verb. The. task is to identify the sense of each input verb. The set of verl) senses we use are those defined in the existing machine re~tdal)le (li(:ti()llary \"IPAL\" (IPA, 1987), which also (:olltains example case fillers as shown in figure .t. As well as Kuroh~tshi's method the similarity between two (:as(; tillers, or more pre-('isely the semantic-head nouns of them, is corn- 1: The relation I)t'.tweell the length of path I)e-|;ween two i[()llns A\" {Mid Y (lt:7/,(.k', }:)) ill IJtL:l~r,Lil:o'ibye and the similarity hetween them (.sirn(X, Y)) [~a.n(X,Y) l 0,. . : 2 9468 l012 t [ s.zm(A, ~ ) tl 10 8 7 5 0 tinted by using IIv, rwuigoih, yo (National-Language l{esearch lnstil; ute, 1964) . Following Kurohashi's method, we define .sim(X,~), whi(:h stands for the silnilarity 1)etween words X mM Y, as in tattle 1. It should he noted here that both nl(~t;h()ds ~tre theoreti(:ally indel)endent of wh;tt resources }ire use(t. ~lb illustl'~te tit(; overall a.lgorithm, we r(~t)la.(:(~ the illustra.tive cases mentioned in section 1 wilh a slightly re(ire gelmral case as in figure. 4. The iut)ut is {nc,-'mc), nc:'m.ce, v}, where he. i all!notes the case filler in the case ci, a.nd 'ntc~ denotes the case maker of <:i. The candidates of ilH;(~rl)ret;ttion for v, which ~re ,sl, ,s2 ~md s3, are deriv(;d froln the datal)ase. The. d;ttal)ase also gives a set ~;si c i of case filler ex~mq)les for each case. c:.i (if each sense si. \" \" den()tes thnt the eorresl)ondit~t~; case is not allowed. eategrize the. case ct i. lit ('ontrast, s~ will not be reject(;d ~tt this step. This is based on the fact that in ,J;tl)~UleSe , t'~ts(!s t:tm lie easily omitted if they ;~re inferable from the given context. Thereafter, the system comt)utes the 1)la.usibility of the remaining candidates of interpret~ttion and chooses the most pla,usit)le interpretatiou as its output, in Kurohashi's method, tim plausil>ility of tui interl)retation is eonq)uted t)y aver;tging; the degree of similarity between the inl)ut com-1)leinent and the exalnple complements 'e for each case &S in e([u&tiOll (1): where P(,q) is thc [)[~LU-I Since I I'AI, does not necessarily eliIlll~(~lligte all the possible optional cases, the ~LbSellCe of C;tse C I from \"v (.~a) in the figure may denotl; that \u00a2:1 is optioual. If so, the interpretation s:) sht)uld not be dis(:arded in this stooge. To avoid this problem, we use the same technique as used in Kurohashi's method. That is, we deline several particular ea.ses befl)reha.nd, such as l, he nomin~d;ive, the accusative i~Iltl the (l~ttive, to be. obligatory, and impose tilt; graulm~rti(:~tI t:ase fHtllle t:onstrmnt as ~d)ove only in those obligatory (:ases. ()ptionality of case needs to be further exl)h)red. sibility of interpreting the input verb as sense 3, and SIM (nc, $~,c) is the degree of the similarity between the input complement nc and example complements $s,c. ws is the weight on an interpretation 3 such that more obligatory cases imposed by s being found in tile input, will lead to a greater value of the weight a. P(3) = w3 E SIM (nc, Ss,c) (1) c SIM(nc, \u00a33,c) is the maximum degree of similarity between nc and each of \u00a33,e as in equation 2. SIM(, c, &,e) = max sim(,+c,",
"cite_spans": [
{
"start": 662,
"end": 675,
"text": "(.sirn(X, Y))",
"ref_id": null
},
{
"start": 773,
"end": 809,
"text": "(National-Language l{esearch lnstil;",
"ref_id": null
},
{
"start": 810,
"end": 820,
"text": "ute, 1964)",
"ref_id": null
},
{
"start": 2921,
"end": 2931,
"text": "(nc, $~,c)",
"ref_id": null
},
{
"start": 3200,
"end": 3210,
"text": "(nc, Ss,c)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Algorithm",
"sec_num": null
},
{
"text": "ec~8,c",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Algorithm",
"sec_num": null
},
{
"text": "In our method, on the other hand, for the reason indicated in section 1, we introduce two new factors:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Algorithm",
"sec_num": null
},
{
"text": "\u2022 contribution of case to verb sense disambignalion (CCD),",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Algorithm",
"sec_num": null
},
{
"text": "\u2022 relative strength of selectional restriction (RSSR).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Algorithm",
"sec_num": null
},
{
"text": "First, in regard to CCD, we compute the plausibility of an interpretation by the weighted average of the degree of similarity for each case as in equation (a), replacing equation 1.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Algorithm",
"sec_num": null
},
{
"text": "P(3) = w3 Ec g3,e)\" CCD(c) Ec CUD(c) (3)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Algorithm",
"sec_num": null
},
{
"text": "Here, CCD(c) is a newly introduced weight, such that CCD(c) is greater when the degree of case e's contribution is higher.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Algorithm",
"sec_num": null
},
{
"text": "Second, in regard to RSSR, the stronger the selectional restriction on a case of a case frame is, the less plausible all input complement satisfies that restriction as mentioned in section 1. Note here that tile plausibility of an interpretation of an input verb can be regarded as the plausibility that the input complements satisfy the selectional restriction associated with that interpretation. This leads us to replace SIM (nc, Es,c) in equation 3with PSS(nc, \u00a3s,c) , which denotes the plausibility that the case filler nc satisfies the selectional restriction described by the example case fillers ~S,C.",
"cite_spans": [
{
"start": 428,
"end": 438,
"text": "(nc, Es,c)",
"ref_id": null
},
{
"start": 457,
"end": 470,
"text": "PSS(nc, \u00a3s,c)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Algorithm",
"sec_num": null
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "P(3) = w3 Ec PSS('nc, g3,c) \u2022 CCD(c) EcCCD(c)",
"eq_num": "(4)"
}
],
"section": "Algorithm",
"sec_num": null
},
{
"text": "From the assumption that PSS (nc,Es,c) should be greater for a larger SIM (ne,\u00a3s,c) and lesser relative strength of the selectional restriction described by \u00a3s,c, we can derive equation 5.",
"cite_spans": [
{
"start": 29,
"end": 38,
"text": "(nc,Es,c)",
"ref_id": null
},
{
"start": 74,
"end": 83,
"text": "(ne,\u00a3s,c)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Algorithm",
"sec_num": null
},
{
"text": "Here, RSSR(3, c) denotes the relative strength of tile selectional restriction on a case c associated with a sense 3.",
"cite_spans": [
{
"start": 6,
"end": 13,
"text": "RSSR(3,",
"ref_id": null
},
{
"start": 14,
"end": 16,
"text": "c)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "PSS(nc, \u00a3s,c) = SIM(nc, Ss,c) -RSSR(3, c)",
"sec_num": null
},
{
"text": "3For more detail, see Kurohashi's paper (Kurohashi and Nagao, 1994) .",
"cite_spans": [
{
"start": 22,
"end": 67,
"text": "Kurohashi's paper (Kurohashi and Nagao, 1994)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "PSS(nc, \u00a3s,c) = SIM(nc, Ss,c) -RSSR(3, c)",
"sec_num": null
},
{
"text": "Computation of CCD and RSSR",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "4",
"sec_num": null
},
{
"text": "The degree of contribution of case to verb sense disambiguation (CCD) is computed in the following way. The degree of contribution of a case should be high if the semantic range of the example case fillers in that case is diverse in the case frame (see figure 3) . Let a certain verb have n senses (sl, 32,..., s~) and the set of example case fillers of a case c associated with 3~ be $3~,c. Then, the degree of c's contribution to disambiguation, CCD(c), is expected to be higher if the example case filler sets {\u00a3si,c I i = 1,..., n} share less elements. This can be realized by equation 6.",
"cite_spans": [
{
"start": 298,
"end": 314,
"text": "(sl, 32,..., s~)",
"ref_id": null
}
],
"ref_spans": [
{
"start": 253,
"end": 262,
"text": "figure 3)",
"ref_id": null
}
],
"eq_spans": [],
"section": "4",
"sec_num": null
},
{
"text": "CCD( ) = 1 I&.d + I&j, l - n &j, l i=1 j=i+t",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "4",
"sec_num": null
},
{
"text": "(6) a is the constant for parameterizing to what extent CCD influences verb sense disambiguation. When a is larger, CCD more strongly influences the system's output. Considering the data sparseness problem, we do not distinguish two nonns X and Y in equation 6if X and Y are similar enough, as in equation 7.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "4",
"sec_num": null
},
{
"text": "{X} + {Y} = {X} if 3im(X,Y) >= 9 (7)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "4",
"sec_num": null
},
{
"text": "Relative strength of selectional restriction (RSSR) is computed in the following way. Tile selectional restriction on a ease of a case frame is expected to be strong if the example case fillers of tile case are similar to each ()tiler. Given a set of example case fillers ill a case associated with a verb sense, the strength of the selectional restriction on that case (SSR) can be estimated by averaging the similarity between any combination of two elements of that set. Thus, given a set Es,c of example case fillers in a case c associated with a verb sense s, tile SSR of c associated with s Call be estimated by equation 8 ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "4",
"sec_num": null
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "E =I Ej=++, SSR(s, c) = ,+C2 if m > 1 maximum otherwise",
"eq_num": "(8)"
}
],
"section": "4",
"sec_num": null
},
{
"text": "In the case m = 1, that is, the case has only one example case filler, tile SSR becomes maxinmm, because the selectional constraint associated with the case is highest (following table 1, we assign 11",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "4",
"sec_num": null
},
{
"text": "as the maximum to SSR). The relative strength of selectional restriction (RSSR) of a case associated with a verb sense is estimated by the ratio of tile SSR of tile case to the summation of the SSRs of each case associated with the verb sense, as in equation (9) 4ssR(. , ,0 (9) a Evahmtion",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "4",
"sec_num": null
},
{
"text": "Our experiment compared the performance of the following methods:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "4",
"sec_num": null
},
{
"text": "1. tOlrohashi's method: equation 12. our method (considering CCD): equation 33. our method (considering /)oth CCD and RSSR): equation 4In method 2 and 3, the influence of CCD, i.e. (~ in equation 6, was extremely large. We will show the relation between the w~riation of c~ and tile performance of the system later in this section. The training/test data used in tile ext)eriment contained over one thousand simple Japanese sentences collected from slews articles. The examples given by IPAL were also used as training data s. !),ach of tile sentences in the training/test data used in our experiment consisted of one or more complement(s) followed by one of the ten verbs enumerated in table 2. For each of the ten verbs, we conducted six-fold cross validation; that is, we divided the training/test data into six equal parts, and conducted six trials in each of which a different one of the six parts was used as test data and the rest was used as training data. We shall call the former the \"test set\" and the latter the \"training set,\" in each (:ase.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "4",
"sec_num": null
},
{
"text": "When inore than one interpretation of an input verb is assigned the highest t)lausibility score, any of the above methods will (;hoose as its outt)ut the one that appears most frequently in the training data. Therefore, tile applicability in each method is 100%, given that the applicability is tile ratio of the number of the cases where the system Rives only one intert)retation, to the numt)er of inputs. Thus, in tile ext)eriment, we compared the precision of each method, which is in our case equal to the ratio of the nuinber of correct outputs, to tile nulnt)er of int)uts.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "4",
"sec_num": null
},
{
"text": "Since tile 1)erformance of any corpus-based method depends on the size of training data, we tirst investigated how the precision of each method was improved as the training data increased. In this, we initially used only the examples given by IPAL, and progressively increased the size of the training data used, by considering an extra part of the training set (five parts of the total six data portions used) at each iteration, until finally taking all five l)arts in the training of our system. 4Note that., in equation 5, while SIM is an integer, PlSSI/. ranges in its value h'om 0 to 1. Therefore, II, SSI{, is influential only when several verb senses take the same value of SIM for a given ease.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "4",
"sec_num": null
},
{
"text": "'~The number of examples given by IPAL was, on ~verage, :1.7 for each ease of each case frame.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "4",
"sec_num": null
},
{
"text": "The results are shown in figure 5, in which the x-axis denotes the ratio of the data used froln the training set, to tile total size of the training set. What can be derived fl'om figure 5 are the following. First, as more training data was considered, tile precision got higher for each method. Second, tile consideration of CCD, i.e. contribution of case. to verb sense disambiguation, improved on Kurohashi's method regardless of tile size of training data. (liven the whole training set, the precision improved from 75.2% to 82.4% (7.2% gain). Third, the introduction of the notion of RSSR did not fltrther improve on the inethod using only CCD. Table 2 shows tile performance for each verb on using the whole training set. The column of \"lower bound\" denotes tile precision gained in a naive method such that the system always chooses tile interpretation most frequently al)pearing in the training data (Gale et al., 1992) . Tile column of \"two highest CCD\" gives the two highest CCD values from the cases for each verb, which are calculated using whole training set.",
"cite_spans": [
{
"start": 908,
"end": 927,
"text": "(Gale et al., 1992)",
"ref_id": "BIBREF2"
}
],
"ref_spans": [
{
"start": 650,
"end": 657,
"text": "Table 2",
"ref_id": "TABREF3"
}
],
"eq_spans": [],
"section": "4",
"sec_num": null
},
{
"text": "I i ' i J ! i --4 8O 65 j..'\" ; .... i CCD -~ = CCD'~RSSR",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I",
"sec_num": "85"
},
{
"text": "Finally, let us see to what extent we should al-. low CCD to influence verb sense disambiguation. Figure 6 shows the performance with the parametric constant ~ in equation (6) set to w~rious values. c~ = (/ corresponds with Kurohashi's method, in which CCD is never considered. As shown in figure 6 , the stronger influence we allow CCD to have, the better performance we gain.",
"cite_spans": [],
"ref_spans": [
{
"start": 98,
"end": 106,
"text": "Figure 6",
"ref_id": null
},
{
"start": 290,
"end": 298,
"text": "figure 6",
"ref_id": null
}
],
"eq_spans": [],
"section": "55--",
"sec_num": null
},
{
"text": "In this paper, we proposed a slew example-based method for verb sense (tisambiguation, which lint)roved the performance of the existing method by considering the degree of contribution of case to verb sense disambigu~tion.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": null
},
{
"text": "The performance of our method significantly depends on the method of assigning degree of similarity to a t)air of case fillers. Since Bunr'i~itloihyou is fundamentally based on human intuition, it does not reflect the similarity between a pair of case fillers computationaly. Proposed methods ....... ........... ............ .............. ...................... i ............... ~z9 ....... zo .............. ....... ; .................. ................ .................. .................. zz ! ....... ",
"cite_spans": [
{
"start": 293,
"end": 508,
"text": "....... ........... ............ .............. ...................... i ............... ~z9 ....... zo .............. ....... ; .................. ................ .................. .................. zz ! .......",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": null
},
{
"text": "Figure 6: The relation between the degree of CCD and 1)recision of word clustering (Tokunaga et al., 1995, etc.) can 1)otentially be used ill conjunction with our method to overcome this human reliance.",
"cite_spans": [
{
"start": 83,
"end": 112,
"text": "(Tokunaga et al., 1995, etc.)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "5 115 225 30",
"sec_num": "0"
},
{
"text": "In our current implenmntation, we consider the collocation between case fillers and verbs, but ignore the combination of case fillers. Instead of a database as in figure 1, we could store a set of combinations of example case fillers, e.g. the combination of s~wi (\"pickpocket\") and saifu (\"wallet\"), but not that of suri and otoko (\"man\"). Itowever, this way of data storage would require the collection of a much larger number of examples than the current method. This issue needs to be fl~rther investigated.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "5 115 225 30",
"sec_num": "0"
},
{
"text": "2g's2,ca is not taken into consideration in the com-put~ttion since ca does not ~H)pe~tr in tile input.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [
{
"text": "The authors would like to thank Dr. Manaim Okumura (JAIST, Japan), Dr. Michael Zock (LIMSI, France) and Mr. Timothy Baldwin (TITech, Jat)an) for their comments on the earlier version of this paper.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgments",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Word-Sense Dismnbiguation Using Statistical Methods",
"authors": [
{
"first": "F",
"middle": [],
"last": "Peter",
"suffix": ""
},
{
"first": "Stephen",
"middle": [
"A"
],
"last": "Brown",
"suffix": ""
},
{
"first": "Vincent",
"middle": [
"J Della"
],
"last": "Della Pietra",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Pietra",
"suffix": ""
}
],
"year": 1991,
"venue": "the Proc. of ACL",
"volume": "",
"issue": "",
"pages": "264--270",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Peter F. Brown, Stephen A. Della Pietra, and Vincent J. Della Pietra. 1991. Word-Sense Dismnbiguation Using Statistical Methods. In the Proc. of ACL, pages 264-270.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Word Sense Disambiguation Using a Second Language MonolinguM Corpus",
"authors": [
{
"first": "Alon",
"middle": [],
"last": "Agan",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Ltai",
"suffix": ""
}
],
"year": 1994,
"venue": "Computational Linguistics",
"volume": "20",
"issue": "4",
"pages": "563--596",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "ldo l)agan and Alon ltai. 1994. Word Sense Dis- ambiguation Using a Second Language MonolinguM Corpus. Computational Linguistics, 20(4):563-596.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Estimating Upper and l~ower Bounds on the Performance of Word-Sense ])isambiguation Programs",
"authors": [
{
"first": "William",
"middle": [],
"last": "Gale",
"suffix": ""
},
{
"first": "Kenneth",
"middle": [
"Ward"
],
"last": "Church",
"suffix": ""
},
{
"first": "David",
"middle": [],
"last": "Yarowsky",
"suffix": ""
}
],
"year": 1992,
"venue": "the t)roc, of AUL",
"volume": "249",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "William Gale, Kenneth Ward Church, and David Yarowsky. 1992. Estimating Upper and l~ower Bounds on the Performance of Word-Sense ])isam- biguation Programs. In the t)roc, of AUL, pages 249 256.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "IPA Lexicon of the Japanese Language for computers IPAL (Basic Vcvbs",
"authors": [],
"year": 1987,
"venue": "IPA",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "IPA, 1987. IPA Lexicon of the Japanese Language for computers IPAL (Basic Vcvbs) (in Japanese).",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Lexical Ambiguity and information Retrieval",
"authors": [
{
"first": "Robert",
"middle": [],
"last": "Krovets",
"suffix": ""
},
{
"first": "W. Bruce",
"middle": [],
"last": "Croft",
"suffix": ""
}
],
"year": 1992,
"venue": "ACM Transactions on Information Systems",
"volume": "10",
"issue": "2",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Robert Krovets and W. Bruce Croft. 1992. Lexical Ambiguity and information Retrieval. ACM Trans- actions on Information Systems, 10(2):115 141.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "A Method of Case Structure Analysis h)r Japanese Sentences Based on Examples in Case Frame Dictionary",
"authors": [
{
"first": "Sadao",
"middle": [],
"last": "Kurohashi",
"suffix": ""
},
{
"first": "Mal~oto",
"middle": [],
"last": "Nagao",
"suffix": ""
}
],
"year": 1994,
"venue": "IEICE 'I. TtANSA CT'IONS on .Information and Systems",
"volume": "",
"issue": "2",
"pages": "227--239",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sadao Kurohashi and Mal~oto Nagao. 1994. A Method of Case Structure Analysis h)r Japanese Sentences Based on Examples in Case Frame Dic- tionary. IEICE 'I. TtANSA CT'IONS on .Information and Systems, E77-D(2):227 239.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "11986. l)ynamicatly Combining Syntax and Semantics in Natural Language I)rocessing",
"authors": [
{
"first": "L",
"middle": [],
"last": "Steven",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Lytinen",
"suffix": ""
}
],
"year": null,
"venue": "the Proc. of AAAI",
"volume": "574",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Steven L. Lytinen. 11986. l)ynamicatly Combining Syntax and Semantics in Natural Language I)ro- cessing. [n the Proc. of AAAI, pages 574 578.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "A Preferential Constraint Sat-isNetion Technique for Natural Language Analysis",
"authors": [
{
"first": "Katashi",
"middle": [],
"last": "Nagao",
"suffix": ""
}
],
"year": 1994,
"venue": "IEICE 517~.ANSAC770NS on b~forrnation and Systems",
"volume": "77",
"issue": "",
"pages": "161--162",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Katashi Nagao. :1994. A Preferential Constraint Sat- isNetion Technique for Natural Language Analysis. IEICE 517~.ANSAC770NS on b~forrnation and Sys- tems, E77-1)(2):161 1.70.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Bunruigoihyo (in .Japanese). Syuei put)lisher",
"authors": [],
"year": 1964,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "National-Language Research Institute, editor. 1964. Bunruigoihyo (in .Japanese). Syuei put)lisher.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Cooccurrence vectors froxn corpora vs. distance w'.ctors from dictionaries",
"authors": [
{
"first": "Yoshiki",
"middle": [],
"last": "Niwa",
"suffix": ""
},
{
"first": "Yoshihiko",
"middle": [],
"last": "Nitta",
"suffix": ""
}
],
"year": 1994,
"venue": "the Proc. of COLING",
"volume": "",
"issue": "",
"pages": "304--309",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yoshiki Niwa and Yoshihiko Nitta. 1994. Co- occurrence vectors froxn corpora vs. distance w'.ctors from dictionaries. In the Proc. of COLING, pages 304-309.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Hinrich Schfitze. 1992. Word sense disambiguation with sublexical representations",
"authors": [
{
"first": "Satoshi",
"middle": [],
"last": "Sato",
"suffix": ""
}
],
"year": 1991,
"venue": "Workshop Notes, Statistically-Based NLP Techniques",
"volume": "6",
"issue": "",
"pages": "199--113",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Satoshi Sato. 1991. MB'F1: li;xample-Based Word Se- lection (in Japanese). Journal of Japanese Society for Artificial Intelligence, 6(4):592 600. Hinrich Schfitze. 1992. Word sense disambigua- tion with sublexical representations. In Workshop Notes, Statistically-Based NLP Techniques, AAA[, pages 199-113.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Automatic Thesmtrus Construction Based on Grammatical Rela.tions",
"authors": [
{
"first": "'",
"middle": [],
"last": "Tokunaga",
"suffix": ""
},
{
"first": "Makoto",
"middle": [],
"last": "Iwayama",
"suffix": ""
},
{
"first": "Llozumi",
"middle": [],
"last": "Tanaka",
"suffix": ""
}
],
"year": 1995,
"venue": "the Proc. of 1JCAI",
"volume": "",
"issue": "",
"pages": "1308--1313",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "'.l'akenobu Tokunaga, Makoto Iwayama, and llozumi Tanaka. 1995. Automatic Thesmtrus Construction Based on Grammatical Rela.tions. In the Proc. of 1JCAI; pages 1308-1313.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Example-l/ased Word-Sense l)isambiguation. LI','ICE TRANSA UTIONS on Information and Systems",
"authors": [],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "240--246",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Naohiko Uramoto. 71994. Example-l/ased Word-Sense l)isambiguation. LI','ICE TRANSA UTIONS on In- formation and Systems, ET7-D(2):240 246.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "!)3. Using Wor(tNet to l)isambiguate Word Senses for Text Retrieval",
"authors": [
{
"first": "Ellen",
"middle": [
"M"
],
"last": "Voorhees",
"suffix": ""
}
],
"year": null,
"venue": "Proc. of SIGIR",
"volume": "",
"issue": "",
"pages": "171--180",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ellen M. Voorhees. 19!)3. Using Wor(tNet to l)isam- biguate Word Senses for Text Retrieval. In Proc. of SIGIR, pages 171-180.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Unsupervised Word Sense Disambiguation Rivaling Supervised Methods",
"authors": [
{
"first": "David",
"middle": [],
"last": "Yarowsky",
"suffix": ""
}
],
"year": 1995,
"venue": "the Proc. of ACL",
"volume": "",
"issue": "",
"pages": "189--196",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "David Yarowsky. 1995. Unsupervised Word Sense Disambiguation Rivaling Supervised Methods. In the Proc. of ACL, pages 189-196.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"text": "Figure 2ilhlstrates a fragment of B'unruigoihyo in(:hlding some of the nouns in figure 1. I,et us take the example sentence (1).",
"num": null,
"uris": null,
"type_str": "figure"
},
"FIGREF1": {
"text": "A fragment of Bunruigoihyo accusative to verb sense disambiguation is greater than that of the nominative with the case of verb ~t(-)ru. 1'",
"num": null,
"uris": null,
"type_str": "figure"
},
"FIGREF3": {
"text": "An inl)uL aud Lhe database in the course of tlle verb sense disanll)iguation process, the system tirst discards the candidates whose case Dame coi~straint is grammatically violated by the input (this parallels Kurohashi's method). Ill the c}lse of figure 4, .s:) is dist:arded bec3.use the ('.&se fl'~Li[ie of v (,s3) does ilOt su])",
"num": null,
"uris": null,
"type_str": "figure"
},
"FIGREF4": {
"text": ", where \u00a3~,c is an i4h element of \u00a33,c, and m is the number of elements in \u00a3s,c, i.e. m = [$3,c[.",
"num": null,
"uris": null,
"type_str": "figure"
},
"FIGREF6": {
"text": "The precision of each method, for each size of training data",
"num": null,
"uris": null,
"type_str": "figure"
},
"TABREF2": {
"type_str": "table",
"content": "<table/>",
"text": "",
"html": null,
"num": null
},
"TABREF3": {
"type_str": "table",
"content": "<table><tr><td/><td/><td>data</td><td># of</td><td>lower</td><td/><td/><td colspan=\"2\">precision (%)</td></tr><tr><td/><td>wn'b</td><td>size</td><td>candidates</td><td>bound (%)</td><td colspan=\"2\">two highest COl)</td><td/></tr><tr><td/><td>ataer~t</td><td>136</td><td>4</td><td>66.9</td><td>o (0.98)</td><td>0a (0.86)</td><td>77.2</td><td>80.0</td></tr><tr><td/><td>kakeru</td><td>160</td><td>29</td><td>25.6</td><td>o (0.99)</td><td>ni (9.98)</td><td>66.3</td><td>76.9</td></tr><tr><td/><td>kztwa, eru</td><td>107</td><td>5</td><td>53.9</td><td>o (0.98)</td><td>ni (0.95)</td><td>82.6</td><td>88.0</td></tr><tr><td/><td>n o'r~t</td><td>126</td><td>I O</td><td>45.2</td><td>',~i (0.90)</td><td>0\" (0.9'))</td><td>82.5</td><td>81.0</td></tr><tr><td/><td>osamcr'u</td><td>108</td><td>8</td><td>25.0</td><td>o (0.95)</td><td>ni (0.94)</td><td>73.2</td><td>70.4</td></tr><tr><td/><td>tsul,'wrn</td><td>12(';</td><td>15</td><td>19.8</td><td>de (1.0)</td><td>o (0.98)</td><td>59.2</td><td>84.9</td></tr><tr><td/><td>to*'~l</td><td>84</td><td>29</td><td>26.2</td><td colspan=\"2\">kara (1.O) o (0.99)</td><td>56.0</td><td>71.4</td></tr><tr><td/><td>~n~u</td><td>90</td><td>2</td><td>81.1</td><td>o (1.O)</td><td>ga (0.94)</td><td>100</td><td>98.9</td></tr><tr><td/><td>wokaru</td><td>60</td><td>5</td><td>48.3</td><td>~(* (0.96)</td><td>,~i (o.ro)</td><td>05.0</td><td>70,O\"</td></tr><tr><td/><td>ya'm, ertt</td><td>54</td><td>2</td><td>59.3</td><td>o (1.0)</td><td>de (0.71)</td><td>96.3</td><td>96.3</td></tr><tr><td/><td>tottd</td><td>l 1 t1111</td><td/><td>43,7</td><td/><td/><td>r5.2</td><td>I 82.4_~</td></tr><tr><td>83</td><td/><td/><td/><td/><td/><td/><td/></tr><tr><td>so</td><td>.</td><td/><td/><td/><td/><td/><td/></tr></table>",
"text": "Performance for each verb (ga: nominative, ni: dative, o: accusative, kava: locative, de: instrumental)",
"html": null,
"num": null
}
}
}
} |