File size: 90,623 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 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 | {
"paper_id": "P06-1013",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T09:23:44.034245Z"
},
"title": "Ensemble Methods for Unsupervised WSD",
"authors": [
{
"first": "Samuel",
"middle": [],
"last": "Brody",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Edinburgh",
"location": {}
},
"email": "s.brody@sms.ed.ac.uk"
},
{
"first": "Roberto",
"middle": [],
"last": "Navigli",
"suffix": "",
"affiliation": {},
"email": "navigli@di.uniroma1.it"
},
{
"first": "Mirella",
"middle": [],
"last": "Lapata",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Edinburgh",
"location": {}
},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "Combination methods are an effective way of improving system performance. This paper examines the benefits of system combination for unsupervised WSD. We investigate several voting-and arbiterbased combination strategies over a diverse pool of unsupervised WSD systems. Our combination methods rely on predominant senses which are derived automatically from raw text. Experiments using the SemCor and Senseval-3 data sets demonstrate that our ensembles yield significantly better results when compared with state-of-the-art.",
"pdf_parse": {
"paper_id": "P06-1013",
"_pdf_hash": "",
"abstract": [
{
"text": "Combination methods are an effective way of improving system performance. This paper examines the benefits of system combination for unsupervised WSD. We investigate several voting-and arbiterbased combination strategies over a diverse pool of unsupervised WSD systems. Our combination methods rely on predominant senses which are derived automatically from raw text. Experiments using the SemCor and Senseval-3 data sets demonstrate that our ensembles yield significantly better results when compared with state-of-the-art.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Word sense disambiguation (WSD), the task of identifying the intended meanings (senses) of words in context, holds promise for many NLP applications requiring broad-coverage language understanding. Examples include summarization, question answering, and text simplification. Recent studies have also shown that WSD can benefit machine translation (Vickrey et al., 2005) and information retrieval (Stokoe, 2005) .",
"cite_spans": [
{
"start": 347,
"end": 369,
"text": "(Vickrey et al., 2005)",
"ref_id": "BIBREF22"
},
{
"start": 396,
"end": 410,
"text": "(Stokoe, 2005)",
"ref_id": "BIBREF18"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Given the potential of WSD for many NLP tasks, much work has focused on the computational treatment of sense ambiguity, primarily using data-driven methods. Most accurate WSD systems to date are supervised and rely on the availability of training data, i.e., corpus occurrences of ambiguous words marked up with labels indicating the appropriate sense given the context (see Mihalcea and Edmonds 2004 and the references therein). A classifier automatically learns disambiguation cues from these hand-labeled examples.",
"cite_spans": [
{
"start": 375,
"end": 400,
"text": "Mihalcea and Edmonds 2004",
"ref_id": "BIBREF11"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Although supervised methods typically achieve better performance than unsupervised alternatives, their applicability is limited to those words for which sense labeled data exists, and their accuracy is strongly correlated with the amount of labeled data available (Yarowsky and Florian, 2002) .",
"cite_spans": [
{
"start": 264,
"end": 292,
"text": "(Yarowsky and Florian, 2002)",
"ref_id": "BIBREF23"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Furthermore, obtaining manually labeled corpora with word senses is costly and the task must be repeated for new domains, languages, or sense inventories. Ng (1997) estimates that a high accuracy domain independent system for WSD would probably need a corpus of about 3.2 million sense tagged words. At a throughput of one word per minute (Edmonds, 2000) , this would require about 27 person-years of human annotation effort.",
"cite_spans": [
{
"start": 155,
"end": 164,
"text": "Ng (1997)",
"ref_id": "BIBREF17"
},
{
"start": 339,
"end": 354,
"text": "(Edmonds, 2000)",
"ref_id": "BIBREF3"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "This paper focuses on unsupervised methods which we argue are useful for broad coverage sense disambiguation. Unsupervised WSD algorithms fall into two general classes: those that perform token-based WSD by exploiting the similarity or relatedness between an ambiguous word and its context (e.g., Lesk 1986) ; and those that perform type-based WSD, simply by assigning all instances of an ambiguous word its most frequent (i.e., predominant) sense (e.g., McCarthy et al. 2004; Galley and McKeown 2003) . The predominant senses are automatically acquired from raw text without recourse to manually annotated data. The motivation for assigning all instances of a word to its most prevalent sense stems from the observation that current supervised approaches rarely outperform the simple heuristic of choosing the most common sense in the training data, despite taking local context into account (Hoste et al., 2002) . Furthermore, the approach allows sense inventories to be tailored to specific domains.",
"cite_spans": [
{
"start": 297,
"end": 307,
"text": "Lesk 1986)",
"ref_id": "BIBREF7"
},
{
"start": 455,
"end": 476,
"text": "McCarthy et al. 2004;",
"ref_id": "BIBREF9"
},
{
"start": 477,
"end": 501,
"text": "Galley and McKeown 2003)",
"ref_id": "BIBREF5"
},
{
"start": 893,
"end": 913,
"text": "(Hoste et al., 2002)",
"ref_id": "BIBREF6"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The work presented here evaluates and compares the performance of well-established unsupervised WSD algorithms. We show that these algorithms yield sufficiently diverse outputs, thus motivating the use of combination methods for improving WSD performance. While combination approaches have been studied previously for supervised WSD (Florian et al., 2002) , their use in an unsupervised setting is, to our knowledge, novel. We examine several existing and novel combination methods and demonstrate that our combined systems consistently outperform the state-of-the-art (e.g., McCarthy et al. 2004) . Importantly, our WSD algorithms and combination methods do not make use of training material in any way, nor do they use the first sense information available in WordNet.",
"cite_spans": [
{
"start": 333,
"end": 355,
"text": "(Florian et al., 2002)",
"ref_id": "BIBREF4"
},
{
"start": 576,
"end": 597,
"text": "McCarthy et al. 2004)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In the following section, we briefly describe the unsupervised WSD algorithms considered in this paper. Then, we present a detailed comparison of their performance on SemCor (Miller et al., 1993) . Next, we introduce our system combination methods and report on our evaluation experiments. We conclude the paper by discussing our results.",
"cite_spans": [
{
"start": 174,
"end": 195,
"text": "(Miller et al., 1993)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In this section we briefly describe the unsupervised WSD algorithms used in our experiments. We selected methods that vary along the following dimensions: (a) the type of WSD performed (i.e., token-based vs. type-based), (b) the representation and size of the context surrounding an ambiguous word (i.e., graph-based vs. word-based, document vs. sentence), and (c) the number and type of semantic relations considered for disambiguation. We base most of our discussion below on the WordNet sense inventory; however, the approaches are not limited to this particular lexicon but could be adapted for other resources with traditional dictionary-like sense definitions and alternative structure.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Disambiguation Algorithms",
"sec_num": "2"
},
{
"text": "Gloss Overlap was originally introduced by Lesk (1986) for performing token-based WSD. The method assigns a sense to a target word by comparing the dictionary definitions of each of its senses with those of the words in the surrounding context. The sense whose definition has the highest overlap (i.e., words in common) with the context words is assumed to be the correct one. Banerjee and Pedersen (2003) augment the dictionary definition (gloss) of each sense with the glosses of related words and senses. The extended glosses increase the information available in estimating the overlap between ambiguous words and their surrounding context.",
"cite_spans": [
{
"start": 43,
"end": 54,
"text": "Lesk (1986)",
"ref_id": "BIBREF7"
},
{
"start": 377,
"end": 405,
"text": "Banerjee and Pedersen (2003)",
"ref_id": "BIBREF0"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Extended Gloss Overlap",
"sec_num": null
},
{
"text": "The range of relationships used to extend the glosses is a parameter, and can be chosen from any combination of WordNet relations. For every sense s k of the target word we estimate:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Extended Gloss Overlap",
"sec_num": null
},
{
"text": "SenseScore(s k ) = \u2211 Rel\u2208Relations Overlap(context, Rel(s k ))",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Extended Gloss Overlap",
"sec_num": null
},
{
"text": "where context is a simple (space separated) concatenation of all words w i for \u2212n \u2264 i \u2264 n, i = 0 in a context window of length \u00b1n around the target word w 0 . The overlap scoring mechanism is also parametrized and can be adjusted to take the into account gloss length or to ignore function words. McCarthy et al. (2004) propose a method for automatically ranking the senses of ambiguous words from raw text. Key in their approach is the observation that distributionally similar neighbors often provide cues about a word's senses. Assuming that a set of neighbors is available, sense ranking is equivalent to quantifying the degree of similarity among the neighbors and the sense descriptions of the polysemous word.",
"cite_spans": [
{
"start": 297,
"end": 319,
"text": "McCarthy et al. (2004)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Extended Gloss Overlap",
"sec_num": null
},
{
"text": "Let N(w) = {n 1 , n 2 , . . . , n k } be the k most (distributionally) similar words to an ambiguous target word w and senses(w) = {s 1 , s 2 , . . . s n } the set of senses for w. For each sense s i and for each neighbor n j , the algorithm selects the neighbor's sense which has the highest WordNet similarity score (wnss) with regard to s i . The ranking score of sense s i is then increased as a function of the WordNet similarity score and the distributional similarity score (dss) between the target word and the neighbor:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Distributional and WordNet Similarity",
"sec_num": null
},
{
"text": "RankScore(s i ) = \u2211 n j \u2208N w dss(w, n j ) wnss(s i , n j ) \u2211 s i \u2208senses(w) wnss(s i , n j )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Distributional and WordNet Similarity",
"sec_num": null
},
{
"text": "where",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Distributional and WordNet Similarity",
"sec_num": null
},
{
"text": "wnss(s i , n j ) = max ns x \u2208senses(n j )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Distributional and WordNet Similarity",
"sec_num": null
},
{
"text": "wnss(s i , ns x ). The predominant sense is simply the sense with the highest ranking score (RankScore) and can be consequently used to perform type-based disambiguation. The method presented above has four parameters: (a) the semantic space model representing the distributional properties of the target words (it is acquired from a large corpus representative of the domain at hand and can be augmented with syntactic relations such as subject or object), (b) the measure of distributional similarity for discovering neighbors (c) the number of neighbors that the ranking score takes into account, and (d) the measure of sense similarity.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Distributional and WordNet Similarity",
"sec_num": null
},
{
"text": "Lexical cohesion is often represented via lexical chains, i.e., sequences of related words spanning a topical text unit (Morris and Hirst, 1991) . Algorithms for computing lexical chains often perform WSD before inferring which words are semantically related. Here we describe one such disambiguation algorithm, proposed by Galley and McKeown (2003) , while omitting the details of creating the lexical chains themselves. Galley and McKeown's (2003) method consists of two stages. First, a graph is built representing all possible interpretations of the target words in question. The text is processed sequentially, comparing each word against all words previously read. If a relation exists between the senses of the current word and any possible sense of a previous word, a connection is formed between the appropriate words and senses. The strength of the connection is a function of the type of relationship and of the distance between the words in the text (in terms of words, sentences and paragraphs). Words are represented as nodes in the graph and semantic relations as weighted edges. Again, the set of relations being considered is a parameter that can be tuned experimentally.",
"cite_spans": [
{
"start": 120,
"end": 144,
"text": "(Morris and Hirst, 1991)",
"ref_id": "BIBREF14"
},
{
"start": 324,
"end": 349,
"text": "Galley and McKeown (2003)",
"ref_id": "BIBREF5"
},
{
"start": 422,
"end": 449,
"text": "Galley and McKeown's (2003)",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Lexical Chains",
"sec_num": null
},
{
"text": "In the disambiguation stage, all occurrences of a given word are collected together. For each sense of a target word, the strength of all connections involving that sense are summed, giving that sense a unified score. The sense with the highest unified score is chosen as the correct sense for the target word. In subsequent stages the actual connections comprising the winning unified score are used as a basis for computing the lexical chains.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Lexical Chains",
"sec_num": null
},
{
"text": "The algorithm is based on the \"one sense per discourse\" hypothesis and uses information from every occurrence of the ambiguous target word in order to decide its appropriate sense. It is therefore a type-based algorithm, since it tries to determine the sense of the word in the entire document/discourse at once, and not separately for each instance.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Lexical Chains",
"sec_num": null
},
{
"text": "Inspired by lexical chains, Navigli and Velardi (2005) developed Structural Semantic Interconnections (SSI), a WSD algorithm which makes use of an extensive lexical knowledge base. The latter is primarily based on WordNet and its standard relation set (i.e., hypernymy, meronymy, antonymy, similarity, nominalization, pertainymy) but is also enriched with collocation information representing semantic relatedness between sense pairs. Collocations are gathered from existing resources (such as the Oxford Collocations, the Longman Language Activator, and collocation web sites). Each collocation is mapped to the WordNet sense inventory in a semi-automatic manner (Navigli, 2005) and transformed into a relatedness edge.",
"cite_spans": [
{
"start": 28,
"end": 54,
"text": "Navigli and Velardi (2005)",
"ref_id": "BIBREF16"
},
{
"start": 664,
"end": 679,
"text": "(Navigli, 2005)",
"ref_id": "BIBREF15"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Structural Semantic Interconnections",
"sec_num": null
},
{
"text": "Given a local word context Disambiguation is performed in an iterative fashion. At each step, for each sense s of a word in C (the set of senses of words yet to be disambiguated), SSI determines the degree of connectivity between s and the other senses in C :",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Structural Semantic Interconnections",
"sec_num": null
},
{
"text": "C = {w 1 , ..., w n }, SSI builds a graph G = (V, E) such that V = n S i=1 senses(w i ) and (s, s ) \u2208 E if",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Structural Semantic Interconnections",
"sec_num": null
},
{
"text": "SSIScore(s) = \u2211 s \u2208C \\{s} \u2211 j\u2208Interconn(s,s ) 1 length( j) \u2211 s \u2208C \\{s} |Interconn(s,s )|",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Structural Semantic Interconnections",
"sec_num": null
},
{
"text": "where Interconn(s, s ) is the set of interconnections between senses s and s . The contribution of a single interconnection is given by the reciprocal of its length, calculated as the number of edges connecting its ends. The overall degree of connectivity is then normalized by the number of contributing interconnections. The highest ranking sense s of word w i is chosen and the senses of w i are removed from the context C . The procedure terminates when either C is the empty set or there is no sense such that its SSIScore exceeds a fixed threshold.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Structural Semantic Interconnections",
"sec_num": null
},
{
"text": "The properties of the different WSD algorithms just described are summarized in Table 1 . The methods vary in the amount of data they employ for disambiguation. SSI and Extended Gloss Overlap (Overlap) rely on sentencelevel information for disambiguation whereas Mc-Carthy et al. (2004) (Similarity) and Galley and McKeown (2003) (LexChains) utilize the entire document or corpus. This enables the accumulation of large amounts of data regarding the ambiguous word, but does not allow separate consideration of each individual occurrence of that word. LexChains and Overlap take into account a restricted set of semantic relations (paths of length one) between any two words in the whole document, whereas SSI and Similarity use a wider set of relations.",
"cite_spans": [
{
"start": 304,
"end": 329,
"text": "Galley and McKeown (2003)",
"ref_id": "BIBREF5"
}
],
"ref_spans": [
{
"start": 80,
"end": 87,
"text": "Table 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Summary",
"sec_num": null
},
{
"text": "Unsupervised Algorithms for WSD",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experiment 1: Comparison of",
"sec_num": "3"
},
{
"text": "We evaluated the disambiguation algorithms outlined above on two tasks: predominant sense acquisition and token-based WSD. As previously explained, Overlap and SSI were not designed for acquiring predominant senses (see Table 1 ), but a token-based WSD algorithm can be trivially modified to acquire predominant senses by disambiguating every occurrence of the target word in context and selecting the sense which was chosen most frequently. Type-based WSD algorithms simply tag all occurrences of a target word with its predominant sense, disregarding the surrounding context. Our first set of experiments was conducted on the SemCor corpus, on the same 2,595 polysemous nouns (53,674 tokens) used as a test set by McCarthy et al. (2004) . These nouns were attested in SemCor with a frequency > 2 and occurred in the British National Corpus (BNC) more than 10 times. We used the WordNet 1.7.1 sense inventory.",
"cite_spans": [
{
"start": 716,
"end": 738,
"text": "McCarthy et al. (2004)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [
{
"start": 220,
"end": 227,
"text": "Table 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Method",
"sec_num": "3.1"
},
{
"text": "The following notation describes our evaluation measures: W is the set of all noun types in the SemCor corpus (|W | = 2, 595), and W f is the set of noun types with a dominant sense. senses(w) is the set of senses for noun type w, while f s (w) and f m (w) refer to w's first sense according to the SemCor gold standard and our algorithms, respectively. Finally, T (w) is the set of tokens of w and sense s (t) denotes the sense assigned to token t according to SemCor.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Method",
"sec_num": "3.1"
},
{
"text": "We first measure how well our algorithms can identify the predominant sense, if one exists:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Method",
"sec_num": "3.1"
},
{
"text": "Acc ps = |{w \u2208 W f | f s (w) = f m (w)}| |W f |",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Method",
"sec_num": "3.1"
},
{
"text": "A baseline for this task can be easily defined for each word type by selecting a sense at random from its sense inventory and assuming that this is the predominant sense:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Method",
"sec_num": "3.1"
},
{
"text": "Baseline sr = 1 |W f | \u2211 w \u2208W f 1 |senses(w)|",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Method",
"sec_num": "3.1"
},
{
"text": "We evaluate the algorithms' disambiguation performance by measuring the ratio of tokens for which our models choose the right sense:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Method",
"sec_num": "3.1"
},
{
"text": "Acc wsd = \u2211 w\u2208W |{t \u2208 T (w)| f m (w) = sense s (t)}| \u2211 w\u2208W |T (w)|",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Method",
"sec_num": "3.1"
},
{
"text": "In the predominant sense detection task, in case of ties in SemCor, any one of the predominant senses was considered correct. Also, all algorithms were designed to randomly choose from among the top scoring options in case of a tie in the calculated scores. This introduces a small amount of randomness (less than 0.5%) in the accuracy calculation, and was done to avoid the pitfall of defaulting to the first sense listed in WordNet, which is usually the actual predominant sense (the order of senses in WordNet is based primarily on the Sem-Cor sense distribution).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Method",
"sec_num": "3.1"
},
{
"text": "We did not specifically tune the parameters of our WSD algorithms on the SemCor corpus, as our goal was to use hand labeled data solely for testing purposes. We selected parameters that have been considered \"optimal\" in the literature, although admittedly some performance gains could be expected had parameter optimization taken place. For Overlap, we used the semantic relations proposed by Banerjee and Pedersen (2003) , namely hypernyms, hyponyms, meronyms, holonyms, and troponym synsets. We also adopted their overlap scoring mechanism which treats each gloss as a bag of words and assigns an n word overlap the score of n 2 . Function words were not considered in the overlap computation. For LexChains, we used the relations reported in Galley and McKeown (2003) . These are all first-order WordNet relations, with the addition of the siblings -two words are considered siblings if they are both hyponyms of the same hypernym. The relations have different weights, depending on their type and the distance between the words in the text. These weights were imported from Galley and McKeown into our implementation without modification.",
"cite_spans": [
{
"start": 393,
"end": 421,
"text": "Banerjee and Pedersen (2003)",
"ref_id": "BIBREF0"
},
{
"start": 745,
"end": 770,
"text": "Galley and McKeown (2003)",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Parameter Settings",
"sec_num": "3.2"
},
{
"text": "Because the SemCor corpus is relatively small (less than 700,00 words), it is not ideal for constructing a neighbor thesaurus appropriate for Mc-Carthy et al.'s (2004) method. The latter requires each word to participate in a large number of cooccurring contexts in order to obtain reliable distributional information. To overcome this problem, we followed McCarthy et al. and extracted the neighbor thesaurus from the entire BNC. We also recreated their semantic space, using a RASPparsed (Briscoe and Carroll, 2002) version of the BNC and their set of dependencies (i.e., Verb-Object, Verb-Subject, Noun-Noun and Adjective-Noun relations). Similarly to McCarthy et al., we used Lin's (1998) neighbors for a given target word. Sense similarity was computed using the Lesk's (Banerjee and Pedersen, 2003 ) similarity measure 1 .",
"cite_spans": [
{
"start": 142,
"end": 167,
"text": "Mc-Carthy et al.'s (2004)",
"ref_id": null
},
{
"start": 490,
"end": 517,
"text": "(Briscoe and Carroll, 2002)",
"ref_id": "BIBREF1"
},
{
"start": 680,
"end": 692,
"text": "Lin's (1998)",
"ref_id": "BIBREF8"
},
{
"start": 775,
"end": 803,
"text": "(Banerjee and Pedersen, 2003",
"ref_id": "BIBREF0"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Parameter Settings",
"sec_num": "3.2"
},
{
"text": "The performance of the individual algorithms is shown in Table 2 . We also include the baseline discussed in Section 3 and the upper bound of defaulting to the first (i.e., most frequent) sense provided by the manually annotated SemCor. We report predominant sense accuracy (Acc ps ), and WSD accuracy when using the automatically acquired predominant sense (Acc wsd/ps ). For tokenbased algorithms, we also report their WSD performance in context, i.e., without use of the predominant sense (Acc wsd/dir ). As expected, the accuracy scores in the WSD task are lower than the respective scores in the predominant sense task, since detecting the predominant sense correctly only insures the correct tagging of the instances of the word with that first sense. All methods perform significantly better than the baseline in the predominant sense detection task (using a \u03c7 2 -test, as indicated in Table 2). LexChains and Overlap perform significantly worse than Similarity and SSI, whereas LexChains is not significantly different from Overlap. Likewise, the difference in performance between SSI and Similarity is not significant. With respect to WSD, all the differences in performance are statistically significant.",
"cite_spans": [],
"ref_spans": [
{
"start": 57,
"end": 64,
"text": "Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Results",
"sec_num": "3.3"
},
{
"text": "1 This measure is identical to the Extended gloss Overlap from Section 2, but instead of searching for overlap between an extended gloss and a word's context, the comparison is done between two extended glosses of two synsets.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Results",
"sec_num": "3.3"
},
{
"text": "2 The LexChains results presented here are not directly comparable to those reported by Galley and McKeown (2003) , since they tested on a subset of SemCor, and included monosemous nouns. They also used the first sense in Sem-Cor in case of ties. The results for the Similarity method are slightly better than those reported by McCarthy et al. (2004) due to minor improvements in implementation. Table 3 : Algorithms' pairwise agreement in detecting the predominant sense (as % of all words)",
"cite_spans": [
{
"start": 88,
"end": 113,
"text": "Galley and McKeown (2003)",
"ref_id": "BIBREF5"
},
{
"start": 328,
"end": 350,
"text": "McCarthy et al. (2004)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [
{
"start": 396,
"end": 403,
"text": "Table 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Results",
"sec_num": "3.3"
},
{
"text": "Interestingly, using the predominant sense detected by the Gloss Overlap and the SSI algorithm to tag all instances is preferable to tagging each instance individually (compare Acc wsd/dir and Acc wsd/ps for Overlap and SSI in Table 2 ). This means that a large part of the instances which were not tagged individually with the predominant sense were actually that sense.",
"cite_spans": [],
"ref_spans": [
{
"start": 227,
"end": 234,
"text": "Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Results",
"sec_num": "3.3"
},
{
"text": "A close examination of the performance of the individual methods in the predominant-sense detection task shows that while the accuracy of all the methods is within a range of 7%, the actual words for which each algorithm gives the correct predominant sense are very different. Table 3 shows the degree of overlap in assigning the appropriate predominant sense among the four methods. As can be seen, the largest amount of overlap is between Similarity and SSI, and this corresponds approximately to 2 3 of the words they correctly label. This means that each of these two methods gets more than 350 words right which the other labels incorrectly.",
"cite_spans": [],
"ref_spans": [
{
"start": 277,
"end": 284,
"text": "Table 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Results",
"sec_num": "3.3"
},
{
"text": "If we had an \"oracle\" which would tell us which method to choose for each word, we would achieve approximately 82.4% in the predominant sense task, giving us 58% in the WSD task. We see that there is a large amount of complementation between the algorithms, where the successes of one make up for the failures of the others. This suggests that the errors of the individual methods are sufficiently uncorrelated, and that some advantage can be gained by combining their predictions.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Results",
"sec_num": "3.3"
},
{
"text": "An important finding in machine learning is that a set of classifiers whose individual decisions are combined in some way (an ensemble) can be more accurate than any of its component classifiers, provided that the individual components are relatively accurate and diverse (Dietterich, 1997) . This simple idea has been applied to a variety of classification problems ranging from optical character recognition to medical diagnosis, part-of-speech tagging (see Dietterich 1997 and van Halteren et al. 2001 for overviews), and notably supervised WSD (Florian et al., 2002) .",
"cite_spans": [
{
"start": 272,
"end": 290,
"text": "(Dietterich, 1997)",
"ref_id": "BIBREF2"
},
{
"start": 460,
"end": 479,
"text": "Dietterich 1997 and",
"ref_id": "BIBREF2"
},
{
"start": 480,
"end": 504,
"text": "van Halteren et al. 2001",
"ref_id": "BIBREF21"
},
{
"start": 548,
"end": 570,
"text": "(Florian et al., 2002)",
"ref_id": "BIBREF4"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Combination Methods",
"sec_num": "4"
},
{
"text": "Since our effort is focused exclusively on unsupervised methods, we cannot use most machine learning approaches for creating an ensemble (e.g., stacking, confidence-based combination), as they require a labeled training set. We therefore examined several basic ensemble combination approaches that do not require parameter estimation from training data.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Combination Methods",
"sec_num": "4"
},
{
"text": "We define Score(M i , s j ) as the (normalized) score which a method M i gives to word sense s j . The predominant sense calculated by method M i for word w is then determined by:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Combination Methods",
"sec_num": "4"
},
{
"text": "PS(M i , w) = argmax s j \u2208senses(w) Score(M i , s j )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Combination Methods",
"sec_num": "4"
},
{
"text": "All ensemble methods receive a set {M i } k i=1 of individual methods to combine, so we denote each ensemble method by MethodName({M i } k i=1 ).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Combination Methods",
"sec_num": "4"
},
{
"text": "Each ensemble component has one vote for the predominant sense, and the sense with the most votes is chosen. The scoring function for the voting ensemble is defined as:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Direct Voting",
"sec_num": null
},
{
"text": "Score(Voting({M i } k i=1 ), s)) = k \u2211 i=1 eq[s, PS(M i , w)]",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Direct Voting",
"sec_num": null
},
{
"text": "where",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Direct Voting",
"sec_num": null
},
{
"text": "eq[s, PS(M i , w)] = 1 if s = PS(M i , w) 0 otherwise",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Direct Voting",
"sec_num": null
},
{
"text": "Each method provides a probability distribution over the senses. These probabilities (normalized scores) are summed, and the sense with the highest score is chosen:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Probability Mixture",
"sec_num": null
},
{
"text": "Score(ProbMix({M i } k i=1 ), s)) = k \u2211 i=1 Score(M i , s)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Probability Mixture",
"sec_num": null
},
{
"text": "Rank-Based Combination Each method provides a ranking of the senses for a given target word. For each sense, its placements according to each of the methods are summed and the sense with the lowest total placement (closest to first place) wins.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Probability Mixture",
"sec_num": null
},
{
"text": "Score(Ranking({M i } k i=1 ), s)) = k \u2211 i=1 (\u22121)\u2022Place i (s)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Probability Mixture",
"sec_num": null
},
{
"text": "where Place i (s) is the number of distinct scores that are larger or equal to Score(M i , s).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Probability Mixture",
"sec_num": null
},
{
"text": "One WSD method can act as an arbiter for adjudicating disagreements among component systems. It makes sense for the adjudicator to have reasonable performance on its own. We therefore selected SSI as the arbiter since it had the best accuracy on the WSD task (see Table 2 ). For each disagreed word w, and for each sense s of w assigned by any of the systems in the ensemble {M i } k i=1 , we calculate the following score:",
"cite_spans": [],
"ref_spans": [
{
"start": 264,
"end": 271,
"text": "Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Arbiter-based Combination",
"sec_num": null
},
{
"text": "Score(Arbiter({M i } k i=1 ), s) = SSIScore * (s)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Arbiter-based Combination",
"sec_num": null
},
{
"text": "where SSIScore * (s) is a modified version of the score introduced in Section 2 which exploits as a context for s the set of agreed senses and the remaining words of each sentence. We exclude from the context used by SSI the senses of w which were not chosen by any of the systems in the ensemble . This effectively reduces the number of senses considered by the arbiter and can positively influence the algorithm's performance, since it eliminates noise coming from senses which are likely to be wrong.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Arbiter-based Combination",
"sec_num": null
},
{
"text": "Unsupervised WSD",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experiment 2: Ensembles for",
"sec_num": "5"
},
{
"text": "We assess the performance of the different ensemble systems on the same set of SemCor nouns on which the individual methods were tested. For the best ensemble, we also report results on disambiguating all nouns in the Senseval-3 data set. We focus exclusively on nouns to allow comparisons with the results obtained from SemCor. We used the same parameters as in Experiment 1 for constructing the ensembles. As discussed earlier, token-based methods can disambiguate target words either in context or using the predominant sense. SSI was employed in the predominant sense setting in our arbiter experiment.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Method and Parameter Settings",
"sec_num": "5.1"
},
{
"text": "Our results are summarized in Table 5 : Decrease in accuracy as a result of removal of each method from the rank-based ensemble.",
"cite_spans": [],
"ref_spans": [
{
"start": 30,
"end": 37,
"text": "Table 5",
"ref_id": null
}
],
"eq_spans": [],
"section": "Results",
"sec_num": "5.2"
},
{
"text": "better than the best individual methods, i.e., Similarity and SSI. On the WSD task, the voting, probability mixture, and rank-based ensembles significantly outperform the arbiter-based one. The performances of the probability mixture, and rankbased combinations do not differ significantly but both ensembles are significantly better than voting. One of the factors contributing to the arbiter's worse performance (compared to the other ensembles) is the fact that in many cases (almost 30%), none of the senses suggested by the disagreeing methods is correct. In these cases, there is no way for the arbiter to select the correct sense. We also examined the relative contribution of each component to overall performance. Table 5 displays the drop in performance by eliminating any particular component from the rank-based ensemble (indicated by \u2212). The system that contributes the most to the ensemble is SSI. Interestingly, Overlap and Similarity yield similar improvements in WSD accuracy (0.6 and 0.9, respectively) when added to the ensemble. Figure 1 shows the WSD accuracy of the best single methods and the ensembles as a function of the noun frequency in SemCor. We can see that there is at least one ensemble outperforming any single method in every frequency band and that the rank-based ensemble consistently outperforms Similarity and SSI in all bands. Although Similarity has an advantage over SSI for low and medium frequency words, it delivers worse performance for high frequency words. This is possibly due to the quality of neighbors obtained for very frequent words, which are not semantically distinct enough to reliably discriminate between different senses. Table 6 lists the performance of the rank-based ensemble on the Senseval-3 (noun) corpus. We also report results for the best individual method, namely SSI, and compare our results with the best unsupervised system that participated in Senseval-3. The latter was developed by Strapparava et al. (2004) and performs domain driven disambiguation (IRST-DDD). Specifically, the approach com- Table 6 : Results of individual disambiguation algorithms and rank-based ensemble on Senseval-3 nouns pares the domain of the context surrounding the target word with the domains of its senses and uses a version of WordNet augmented with domain labels (e.g., economy, geography). Our baseline selects the first sense randomly and uses it to disambiguate all instances of a target word. Our upper bound defaults to the first sense from SemCor. We report precision, recall and Fscore. In cases where precision and recall figures coincide, the algorithm has 100% coverage. As can be seen the rank-based, ensemble outperforms both SSI and the IRST-DDD system. This is an encouraging result, suggesting that there may be advantages in developing diverse classes of unsupervised WSD algorithms for system combination. The results in Table 6 are higher than those reported for SemCor (see Table 4 ). This is expected since the Senseval-3 data set contains monosemous nouns as well. Taking solely polysemous nouns into account, SSI's Fscore is 53.39% and the ranked-based ensemble's 55.0%. We further note that not all of the components in our ensemble are optimal. Predominant senses for Lesk and LexChains were estimated from the Senseval-3 data, however a larger corpus would probably yield more reliable estimates.",
"cite_spans": [
{
"start": 1958,
"end": 1983,
"text": "Strapparava et al. (2004)",
"ref_id": "BIBREF19"
}
],
"ref_spans": [
{
"start": 723,
"end": 730,
"text": "Table 5",
"ref_id": null
},
{
"start": 1049,
"end": 1057,
"text": "Figure 1",
"ref_id": null
},
{
"start": 1682,
"end": 1689,
"text": "Table 6",
"ref_id": null
},
{
"start": 2070,
"end": 2077,
"text": "Table 6",
"ref_id": null
},
{
"start": 2897,
"end": 2904,
"text": "Table 6",
"ref_id": null
},
{
"start": 2952,
"end": 2959,
"text": "Table 4",
"ref_id": "TABREF4"
}
],
"eq_spans": [],
"section": "Results",
"sec_num": "5.2"
},
{
"text": "In this paper we have presented an evaluation study of four well-known approaches to unsupervised WSD. Our comparison involved type-and token-based disambiguation algorithms relying on different kinds of WordNet relations and different amounts of corpus data. Our experiments revealed two important findings. First, type-based disambiguation yields results superior to a token-based approach. Using predominant senses is preferable to disambiguating instances individually, even for token-based algorithms. Second, the outputs of the different approaches examined here are sufficiently diverse to motivate combination methods for unsupervised WSD. We defined several ensembles on the predominant sense outputs of individual methods and showed that combination systems outperformed their best components both on the SemCor and Senseval-3 data sets.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusions and Discussion",
"sec_num": "6"
},
{
"text": "The work described here could be usefully employed in two tasks: (a) to create preliminary annotations, thus supporting the \"annotate automatically, correct manually\" methodology used to provide high volume annotation in the Penn Treebank project; and (b) in combination with supervised WSD methods that take context into account; for instance, such methods could default to an unsupervised system for unseen words or words with uninformative contexts.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusions and Discussion",
"sec_num": "6"
},
{
"text": "In the future we plan to integrate more components into our ensembles. These include not only domain driven disambiguation algorithms (Strapparava et al., 2004) but also graph theoretic ones (Mihalcea, 2005) as well as algorithms that quantify the degree of association between senses and their co-occurring contexts (Mohammad and Hirst, 2006) . Increasing the number of components would allow us to employ more sophisticated combination methods such as unsupervised rank aggregation algorithms (Tan and Jin, 2004) .",
"cite_spans": [
{
"start": 134,
"end": 160,
"text": "(Strapparava et al., 2004)",
"ref_id": "BIBREF19"
},
{
"start": 191,
"end": 207,
"text": "(Mihalcea, 2005)",
"ref_id": "BIBREF10"
},
{
"start": 317,
"end": 343,
"text": "(Mohammad and Hirst, 2006)",
"ref_id": "BIBREF13"
},
{
"start": 495,
"end": 514,
"text": "(Tan and Jin, 2004)",
"ref_id": "BIBREF20"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusions and Discussion",
"sec_num": "6"
}
],
"back_matter": [
{
"text": "We are grateful to Diana McCarthy for her help with this work and to Michel Galley for making his code available to us. Thanks to John Carroll and Rob Koeling for insightful comments and suggestions. The authors acknowledge the support of EPSRC (Brody and Lapata; grant EP/C538447/1) and the European Union (Navigli; Interop NoE (508011)).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgements",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Extended gloss overlaps as a measure of semantic relatedness",
"authors": [
{
"first": "Satanjeev",
"middle": [],
"last": "Banerjee",
"suffix": ""
},
{
"first": "Ted",
"middle": [],
"last": "Pedersen",
"suffix": ""
}
],
"year": 2003,
"venue": "Proceedings of the 18th IJCAI",
"volume": "",
"issue": "",
"pages": "805--810",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Banerjee, Satanjeev and Ted Pedersen. 2003. Extended gloss overlaps as a measure of semantic relatedness. In Proceed- ings of the 18th IJCAI. Acapulco, pages 805-810.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Robust accurate statistical annotation of general text",
"authors": [
{
"first": "Ted",
"middle": [],
"last": "Briscoe",
"suffix": ""
},
{
"first": "John",
"middle": [],
"last": "Carroll",
"suffix": ""
}
],
"year": 2002,
"venue": "Proceedings of the 3rd LREC",
"volume": "",
"issue": "",
"pages": "1499--1504",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Briscoe, Ted and John Carroll. 2002. Robust accurate statis- tical annotation of general text. In Proceedings of the 3rd LREC. Las Palmas, Gran Canaria, pages 1499-1504.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Machine learning research: Four current directions",
"authors": [
{
"first": "T",
"middle": [
"G"
],
"last": "Dietterich",
"suffix": ""
}
],
"year": 1997,
"venue": "AI Magazine",
"volume": "18",
"issue": "4",
"pages": "97--136",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dietterich, T. G. 1997. Machine learning research: Four cur- rent directions. AI Magazine 18(4):97-136.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Designing a task for SENSEVAL-2",
"authors": [
{
"first": "Philip",
"middle": [],
"last": "Edmonds",
"suffix": ""
}
],
"year": 2000,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Edmonds, Philip. 2000. Designing a task for SENSEVAL-2. Technical note.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Combining classifiers for word sense disambiguation",
"authors": [
{
"first": "Radu",
"middle": [],
"last": "Florian",
"suffix": ""
},
{
"first": "Silviu",
"middle": [],
"last": "Cucerzan",
"suffix": ""
},
{
"first": "Charles",
"middle": [],
"last": "Schafer",
"suffix": ""
},
{
"first": "David",
"middle": [],
"last": "Yarowsky",
"suffix": ""
}
],
"year": 2002,
"venue": "Natural Language Engineering",
"volume": "1",
"issue": "1",
"pages": "1--14",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Florian, Radu, Silviu Cucerzan, Charles Schafer, and David Yarowsky. 2002. Combining classifiers for word sense dis- ambiguation. Natural Language Engineering 1(1):1-14.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Improving word sense disambiguation in lexical chaining",
"authors": [
{
"first": "Michel",
"middle": [],
"last": "Galley",
"suffix": ""
},
{
"first": "Kathleen",
"middle": [],
"last": "Mckeown",
"suffix": ""
}
],
"year": 2003,
"venue": "Proceedings of the 18th IJCAI",
"volume": "",
"issue": "",
"pages": "1486--1488",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Galley, Michel and Kathleen McKeown. 2003. Improving word sense disambiguation in lexical chaining. In Pro- ceedings of the 18th IJCAI. Acapulco, pages 1486-1488.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Parameter optimization for machine-learning of word sense disambiguation",
"authors": [
{
"first": "V\u00e9ronique",
"middle": [],
"last": "Hoste",
"suffix": ""
},
{
"first": "Iris",
"middle": [],
"last": "Hendrickx",
"suffix": ""
},
{
"first": "Walter",
"middle": [],
"last": "Daelemans",
"suffix": ""
},
{
"first": "Antal",
"middle": [],
"last": "Van Den",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Bosch",
"suffix": ""
}
],
"year": 2002,
"venue": "Language Engineering",
"volume": "8",
"issue": "4",
"pages": "311--325",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Hoste, V\u00e9ronique, Iris Hendrickx, Walter Daelemans, and Antal van den Bosch. 2002. Parameter optimization for machine-learning of word sense disambiguation. Lan- guage Engineering 8(4):311-325.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Automatic sense disambiguation using machine readable dictionaries: How to tell a pine cone from an ice cream cone",
"authors": [
{
"first": "Michael",
"middle": [],
"last": "Lesk",
"suffix": ""
}
],
"year": 1986,
"venue": "Proceedings of the 5th SIG-DOC",
"volume": "",
"issue": "",
"pages": "24--26",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Lesk, Michael. 1986. Automatic sense disambiguation us- ing machine readable dictionaries: How to tell a pine cone from an ice cream cone. In Proceedings of the 5th SIG- DOC. New York, NY, pages 24-26.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "An information-theoretic definition of similarity",
"authors": [
{
"first": "Dekang",
"middle": [],
"last": "Lin",
"suffix": ""
}
],
"year": 1998,
"venue": "Proceedings of the 15th ICML. Madison, WI",
"volume": "",
"issue": "",
"pages": "296--304",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Lin, Dekang. 1998. An information-theoretic definition of similarity. In Proceedings of the 15th ICML. Madison, WI, pages 296-304.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Finding predominant senses in untagged text",
"authors": [
{
"first": "Diana",
"middle": [],
"last": "Mccarthy",
"suffix": ""
},
{
"first": "Rob",
"middle": [],
"last": "Koeling",
"suffix": ""
}
],
"year": 2004,
"venue": "Proceedings of the 42th ACL",
"volume": "",
"issue": "",
"pages": "280--287",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "McCarthy, Diana, Rob Koeling, Julie Weeds, and John Car- roll. 2004. Finding predominant senses in untagged text. In Proceedings of the 42th ACL. Barcelona, Spain, pages 280-287.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Unsupervised large-vocabulary word sense disambiguation with graph-based algorithms for sequence data labeling",
"authors": [
{
"first": "Rada",
"middle": [],
"last": "Mihalcea",
"suffix": ""
}
],
"year": 2005,
"venue": "Proceedings of the HLT/EMNLP",
"volume": "",
"issue": "",
"pages": "411--418",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Mihalcea, Rada. 2005. Unsupervised large-vocabulary word sense disambiguation with graph-based algorithms for se- quence data labeling. In Proceedings of the HLT/EMNLP. Vancouver, BC, pages 411-418.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Proceedings of the SENSEVAL-3",
"authors": [
{
"first": "Rada",
"middle": [],
"last": "Mihalcea",
"suffix": ""
},
{
"first": "Phil",
"middle": [],
"last": "Edmonds",
"suffix": ""
}
],
"year": 2004,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Mihalcea, Rada and Phil Edmonds, editors. 2004. Proceed- ings of the SENSEVAL-3. Barcelona, Spain.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "A semantic concordance",
"authors": [
{
"first": "George",
"middle": [
"A"
],
"last": "Miller",
"suffix": ""
},
{
"first": "Claudia",
"middle": [],
"last": "Leacock",
"suffix": ""
},
{
"first": "Randee",
"middle": [],
"last": "Tengi",
"suffix": ""
},
{
"first": "Ross",
"middle": [
"T"
],
"last": "Bunker",
"suffix": ""
}
],
"year": 1993,
"venue": "Proceedings of the ARPA HLT Workshop",
"volume": "",
"issue": "",
"pages": "303--308",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Miller, George A., Claudia Leacock, Randee Tengi, and Ross T. Bunker. 1993. A semantic concordance. In Pro- ceedings of the ARPA HLT Workshop. Morgan Kaufman, pages 303-308.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Determining word sense dominance using a thesaurus",
"authors": [
{
"first": "Saif",
"middle": [],
"last": "Mohammad",
"suffix": ""
},
{
"first": "Graeme",
"middle": [],
"last": "Hirst",
"suffix": ""
}
],
"year": 2006,
"venue": "Proceedings of the EACL",
"volume": "",
"issue": "",
"pages": "121--128",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Mohammad, Saif and Graeme Hirst. 2006. Determining word sense dominance using a thesaurus. In Proceedings of the EACL. Trento, Italy, pages 121-128.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Lexical cohesion computed by thesaural relations as an indicator of the structure of text",
"authors": [
{
"first": "Jane",
"middle": [],
"last": "Morris",
"suffix": ""
},
{
"first": "Graeme",
"middle": [],
"last": "Hirst",
"suffix": ""
}
],
"year": 1991,
"venue": "Computational Linguistics",
"volume": "1",
"issue": "17",
"pages": "21--43",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Morris, Jane and Graeme Hirst. 1991. Lexical cohesion com- puted by thesaural relations as an indicator of the structure of text. Computational Linguistics 1(17):21-43.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Semi-automatic extension of largescale linguistic knowledge bases",
"authors": [
{
"first": "Roberto",
"middle": [],
"last": "Navigli",
"suffix": ""
}
],
"year": 2005,
"venue": "Proceedings of the 18th FLAIRS. Florida",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Navigli, Roberto. 2005. Semi-automatic extension of large- scale linguistic knowledge bases. In Proceedings of the 18th FLAIRS. Florida.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Structural semantic interconnections: a knowledge-based approach to word sense disambiguation",
"authors": [
{
"first": "Roberto",
"middle": [],
"last": "Navigli",
"suffix": ""
},
{
"first": "Paola",
"middle": [],
"last": "Velardi",
"suffix": ""
}
],
"year": 2005,
"venue": "PAMI",
"volume": "27",
"issue": "7",
"pages": "1075--1088",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Navigli, Roberto and Paola Velardi. 2005. Structural seman- tic interconnections: a knowledge-based approach to word sense disambiguation. PAMI 27(7):1075-1088.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Getting serious about word sense disambiguation",
"authors": [
{
"first": "Tou",
"middle": [],
"last": "Ng",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Hwee",
"suffix": ""
}
],
"year": 1997,
"venue": "Proceedings of the ACL SIGLEX Workshop on Tagging Text with Lexical Semantics: Why, What, and How",
"volume": "",
"issue": "",
"pages": "1--7",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ng, Tou Hwee. 1997. Getting serious about word sense dis- ambiguation. In Proceedings of the ACL SIGLEX Work- shop on Tagging Text with Lexical Semantics: Why, What, and How?. Washington, DC, pages 1-7.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Differentiating homonymy and polysemy in information retrieval",
"authors": [
{
"first": "Christopher",
"middle": [],
"last": "Stokoe",
"suffix": ""
}
],
"year": 2005,
"venue": "Proceedings of the HLT/EMNLP",
"volume": "",
"issue": "",
"pages": "403--410",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Stokoe, Christopher. 2005. Differentiating homonymy and polysemy in information retrieval. In Proceedings of the HLT/EMNLP. Vancouver, BC, pages 403-410.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Word-sense disambiguation for machine translation",
"authors": [
{
"first": "Carlo",
"middle": [],
"last": "Strapparava",
"suffix": ""
},
{
"first": "Alfio",
"middle": [],
"last": "Gliozzo",
"suffix": ""
},
{
"first": "Claudio",
"middle": [],
"last": "Giuliano",
"suffix": ""
}
],
"year": 2004,
"venue": "Proceedings of the SENSEVAL-3",
"volume": "",
"issue": "",
"pages": "229--234",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Strapparava, Carlo, Alfio Gliozzo, and Claudio Giuliano. 2004. Word-sense disambiguation for machine transla- tion. In Proceedings of the SENSEVAL-3. Barcelona, Spain, pages 229-234.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Ordering patterns by combining opinions from multiple sources",
"authors": [
{
"first": "Pang-Ning",
"middle": [],
"last": "Tan",
"suffix": ""
},
{
"first": "Rong",
"middle": [],
"last": "Jin",
"suffix": ""
}
],
"year": 2004,
"venue": "Proceedings of the 10th KDD",
"volume": "",
"issue": "",
"pages": "22--25",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Tan, Pang-Ning and Rong Jin. 2004. Ordering patterns by combining opinions from multiple sources. In Proceed- ings of the 10th KDD. Seattle, WA, pages 22-25.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Improving accuracy in word class tagging through combination of machine learning systems",
"authors": [
{
"first": "",
"middle": [],
"last": "Van Halteren",
"suffix": ""
},
{
"first": "Jakub",
"middle": [],
"last": "Hans",
"suffix": ""
},
{
"first": "Walter",
"middle": [],
"last": "Zavrel",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Daelemans",
"suffix": ""
}
],
"year": 2001,
"venue": "Computational Linguistics",
"volume": "27",
"issue": "2",
"pages": "199--230",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "van Halteren, Hans, Jakub Zavrel, and Walter Daelemans. 2001. Improving accuracy in word class tagging through combination of machine learning systems. Computational Linguistics 27(2):199-230.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Word-sense disambiguation for machine translation",
"authors": [
{
"first": "David",
"middle": [],
"last": "Vickrey",
"suffix": ""
},
{
"first": "Luke",
"middle": [],
"last": "Biewald",
"suffix": ""
},
{
"first": "Marc",
"middle": [],
"last": "Teyssier",
"suffix": ""
},
{
"first": "Daphne",
"middle": [],
"last": "Koller",
"suffix": ""
}
],
"year": 2005,
"venue": "Proceedings of the HLT/EMNLP. Vancouver",
"volume": "",
"issue": "",
"pages": "771--778",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Vickrey, David, Luke Biewald, Marc Teyssier, and Daphne Koller. 2005. Word-sense disambiguation for machine translation. In Proceedings of the HLT/EMNLP. Vancou- ver, BC, pages 771-778.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "Evaluating sense disambiguation across diverse parameter spaces",
"authors": [
{
"first": "David",
"middle": [],
"last": "Yarowsky",
"suffix": ""
},
{
"first": "Radu",
"middle": [],
"last": "Florian",
"suffix": ""
}
],
"year": 2002,
"venue": "Natural Language Engineering",
"volume": "9",
"issue": "4",
"pages": "293--310",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yarowsky, David and Radu Florian. 2002. Evaluating sense disambiguation across diverse parameter spaces. Natural Language Engineering 9(4):293-310.",
"links": null
}
},
"ref_entries": {
"TABREF0": {
"text": "there is at least one interconnection j between s (a sense of the word) and s (a sense of its context) in the lexical knowledge base. The set of valid interconnections is determined by a manually-created context-free",
"html": null,
"type_str": "table",
"content": "<table><tr><td>Method</td><td>WSD Context</td><td>Relations</td></tr><tr><td colspan=\"3\">LexChains types Overlap tokens sentence document first-order first-order Similarity types corpus higher-order SSI tokens sentence higher-order</td></tr><tr><td colspan=\"3\">Table 1: Properties of the WSD algorithms</td></tr><tr><td colspan=\"3\">grammar consisting of a small number of rules. Valid interconnections are computed in advance on the lexical database, not at runtime.</td></tr></table>",
"num": null
},
"TABREF1": {
"text": ": sig. diff. from Baseline, \u2020 : sig. diff. from Similarity, $ : sig diff. from SSI, # : sig. diff. from Overlap, p < 0.01)",
"html": null,
"type_str": "table",
"content": "<table><tr><td>Method Baseline</td><td colspan=\"3\">Acc ps Acc wsd/dir Acc wsd/ps 34.5 -23.0</td></tr><tr><td colspan=\"2\">LexChains 48.3 * \u2020$ Overlap 49.4 * \u2020$ Similarity 54.9 * SSI 53.7 *</td><td>-36.5 $ -42.7</td><td>40.7 * # \u2020$ 42.5 * \u2020$ 46.5 * $ 47.9 *</td></tr><tr><td colspan=\"2\">UpperBnd 100</td><td>-</td><td>68.4</td></tr><tr><td colspan=\"4\">Table 2: Results of individual disambiguation al-gorithms on SemCor nouns 2 (</td></tr><tr><td/><td/><td/><td>measure of distributional simi-larity, and considered only the 50 highest ranked</td></tr></table>",
"num": null
},
"TABREF4": {
"text": "",
"html": null,
"type_str": "table",
"content": "<table><tr><td>. As can be seen, all ensemble methods perform significantly</td></tr></table>",
"num": null
}
}
}
} |