File size: 85,501 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 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 | {
"paper_id": "P02-1044",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T09:30:32.982291Z"
},
"title": "Word Translation Disambiguation Using Bilingual Bootstrapping",
"authors": [
{
"first": "Cong",
"middle": [],
"last": "Li",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Sigma Center",
"location": {
"addrLine": "No.49 Zhichun Road, Haidian Beijing",
"postCode": "100080",
"country": "China"
}
},
"email": ""
},
{
"first": "Hang",
"middle": [],
"last": "Li",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Microsoft Research",
"location": {
"addrLine": "Asia 5F Sigma Center, No.49 Zhichun Road, Haidian Beijing",
"postCode": "100080",
"country": "China"
}
},
"email": "hangli@microsoft.com"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "This paper proposes a new method for word translation disambiguation using a machine learning technique called 'Bilingual Bootstrapping'. Bilingual Bootstrapping makes use of \u02c8 in learning\u02c8 a small number of classified data and a large number of unclassified data in the source and the target languages in translation. It constructs classifiers in the two languages in parallel and repeatedly boosts the performances of the classifiers by further classifying data in each of the two languages and by exchanging between the two languages information regarding the classified data. Experimental results indicate that word translation disambiguation based on Bilingual Bootstrapping consistently and significantly outperforms the existing methods based on 'Monolingual Bootstrapping'.",
"pdf_parse": {
"paper_id": "P02-1044",
"_pdf_hash": "",
"abstract": [
{
"text": "This paper proposes a new method for word translation disambiguation using a machine learning technique called 'Bilingual Bootstrapping'. Bilingual Bootstrapping makes use of \u02c8 in learning\u02c8 a small number of classified data and a large number of unclassified data in the source and the target languages in translation. It constructs classifiers in the two languages in parallel and repeatedly boosts the performances of the classifiers by further classifying data in each of the two languages and by exchanging between the two languages information regarding the classified data. Experimental results indicate that word translation disambiguation based on Bilingual Bootstrapping consistently and significantly outperforms the existing methods based on 'Monolingual Bootstrapping'.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "We address here the problem of word translation disambiguation. For instance, we are concerned with an ambiguous word in English (e.g., 'plant'), which has multiple translations in Chinese (e.g., '\u13b9\u0956 (gongchang)' and '\u1ee1\u012d (zhiwu)'). Our goal is to determine the correct Chinese translation of the ambiguous English word, given an English sentence which contains the word. Word translation disambiguation is actually a special case of word sense disambiguation (in the example above, 'gongchang' corresponds to the sense of 'factory' and 'zhiwu' corresponds to the sense of 'vegetation'). 1 Yarowsky (1995) proposes a method for word sense (translation) disambiguation that is based on a bootstrapping technique, which we refer to here as 'Monolingual Bootstrapping (MB)'.",
"cite_spans": [
{
"start": 589,
"end": 604,
"text": "Yarowsky (1995)",
"ref_id": "BIBREF16"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In this paper, we propose a new method for word translation disambiguation using a bootstrapping technique we have developed. We refer to the technique as 'Bilingual Bootstrapping (BB)'.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In order to evaluate the performance of BB, we conducted some experiments on word translation disambiguation using the BB technique and the MB technique. All of the results indicate that BB consistently and significantly outperforms MB.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The problem of word translation disambiguation (in general, word sense disambiguation) can be viewed as that of classification and can be addressed by employing a supervised learning method. In such a learning method, for instance, an English sentence containing an ambiguous English word corresponds to an example, and the Chinese translation of the word under the context corresponds to a classification decision (a label).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": null
},
{
"text": "Many methods for word sense disambiguation using a supervised learning technique have been proposed. They include those using Na\u00efve Bayes (Gale et al. 1992a) , Decision List (Yarowsky 1994) , Nearest Neighbor (Ng and Lee 1996) , Transformation Based Learning (Mangu and Brill 1997) , Neural Network (Towell and Voorhess 1998) , Winnow (Golding and Roth 1999) , Boosting (Escudero et al. 2000) , and Na\u00efve Bayesian Ensemble (Pedersen 2000) . Among these methods, the one using Na\u00efve Bayesian Ensemble (i.e., an ensemble of Na\u00efve Bayesian Classifiers) is reported to perform the best for word sense disambiguation with respect to a benchmark data set (Pedersen 2000) .",
"cite_spans": [
{
"start": 138,
"end": 157,
"text": "(Gale et al. 1992a)",
"ref_id": "BIBREF4"
},
{
"start": 174,
"end": 189,
"text": "(Yarowsky 1994)",
"ref_id": "BIBREF15"
},
{
"start": 209,
"end": 226,
"text": "(Ng and Lee 1996)",
"ref_id": "BIBREF10"
},
{
"start": 259,
"end": 281,
"text": "(Mangu and Brill 1997)",
"ref_id": "BIBREF8"
},
{
"start": 299,
"end": 325,
"text": "(Towell and Voorhess 1998)",
"ref_id": null
},
{
"start": 335,
"end": 358,
"text": "(Golding and Roth 1999)",
"ref_id": "BIBREF6"
},
{
"start": 370,
"end": 392,
"text": "(Escudero et al. 2000)",
"ref_id": "BIBREF3"
},
{
"start": 423,
"end": 438,
"text": "(Pedersen 2000)",
"ref_id": "BIBREF12"
},
{
"start": 649,
"end": 664,
"text": "(Pedersen 2000)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": null
},
{
"text": "The assumption behind the proposed methods is that it is nearly always possible to determine the translation of a word by referring to its context, and thus all of the methods actually manage to build a classifier (i.e., a classification program) using features representing context information (e.g., co-occurring words).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": null
},
{
"text": "Since preparing supervised learning data is expensive (in many cases, manually labeling data is required), it is desirable to develop a bootstrapping method that starts learning with a small number of classified data but is still able to achieve high performance under the help of a large number of unclassified data which is not expensive anyway. Yarowsky (1995) proposes a method for word sense disambiguation, which is based on Monolingual Bootstrapping. When applied to our current task, his method starts learning with a small number of English sentences which contain an ambiguous English word and which are respectively assigned with the correct Chinese translations of the word. It then uses the classified sentences as training data to learn a classifier (e.g., a decision list) and uses the constructed classifier to classify some unclassified sentences containing the ambiguous word as additional training data. It also adopts the heuristics of 'one sense per discourse' (Gale et al. 1992b) to further classify unclassified sentences. By repeating the above processes, it can create an accurate classifier for word translation disambiguation.",
"cite_spans": [
{
"start": 348,
"end": 363,
"text": "Yarowsky (1995)",
"ref_id": "BIBREF16"
},
{
"start": 982,
"end": 1001,
"text": "(Gale et al. 1992b)",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": null
},
{
"text": "For other related work, see, for example, (Brown et al. 1991; Dagan and Itai 1994; Pedersen and Bruce 1997; Schutze 1998; Kikui 1999; Mihalcea and Moldovan 1999) .",
"cite_spans": [
{
"start": 42,
"end": 61,
"text": "(Brown et al. 1991;",
"ref_id": "BIBREF0"
},
{
"start": 62,
"end": 82,
"text": "Dagan and Itai 1994;",
"ref_id": "BIBREF1"
},
{
"start": 83,
"end": 107,
"text": "Pedersen and Bruce 1997;",
"ref_id": "BIBREF11"
},
{
"start": 108,
"end": 121,
"text": "Schutze 1998;",
"ref_id": "BIBREF13"
},
{
"start": 122,
"end": 133,
"text": "Kikui 1999;",
"ref_id": "BIBREF7"
},
{
"start": 134,
"end": 161,
"text": "Mihalcea and Moldovan 1999)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": null
},
{
"text": "Instead of using Monolingual Bootstrapping, we propose a new method for word translation disambiguation using Bilingual Bootstrapping. In translation from English to Chinese, for instance, BB makes use of not only unclassified data in English, but also unclassified data in Chinese. It also uses a small number of classified data in English and, optionally, a small number of classified data in Chinese. The data in English and in Chinese are supposed to be not in parallel but from the same domain.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Overview",
"sec_num": "3.1"
},
{
"text": "BB constructs classifiers for English to Chinese translation disambiguation by repeating the following two steps: (1) constructing classifiers for each of the languages on the basis of the classified data in both languages, (2) using the constructed classifiers in each of the languages to classify some unclassified data and adding them to the classified training data set of the language. The reason that we can use classified data in both languages at step (1) is that words in one language generally have translations in the other and we can find their translation relationship by using a dictionary.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Overview",
"sec_num": "3.1"
},
{
"text": "Let E denote a set of words in English, C a set of words in Chinese, and T a set of links in a translation dictionary as shown in Figure 1 . (Any two linked words can be translation of each other.) Mathematically, T is defined as a relation between E and C , i.e.,",
"cite_spans": [],
"ref_spans": [
{
"start": 130,
"end": 138,
"text": "Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Algorithm",
"sec_num": "3.2"
},
{
"text": "C E T \u00d7 \u2286 .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Algorithm",
"sec_num": "3.2"
},
{
"text": "Let \u03b5 stand for a random variable on E, \u03b3 a random variable on C. Also let e stand for a random variable on E, c a random variable on C, and t a random variable on T. While \u03b5 and \u03b3 represent words to be translated, e and c represent context words. . Let c denote a sequence of words in Chinese",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Algorithm",
"sec_num": "3.2"
},
{
"text": "For an English word \u03b5, } ), , ( | { T t t t T \u2208 \u2032 = = \u03b3 \u03b5",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Algorithm",
"sec_num": "3.2"
},
{
"text": "( | { T t t t T \u2208 \u2032 = = \u03b3 \u03b5 \u03b3 and } ) , ( | { T E \u2208 \u2032 \u2032 = \u03b3 \u03b5 \u03b5 \u03b3 .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Algorithm",
"sec_num": "3.2"
},
{
"text": ") , , 2 , 1 ( }, , , , { 2 1 n i C c c c c i n L L = \u2208 = c",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Algorithm",
"sec_num": "3.2"
},
{
"text": ". We view e and c as examples representing context information for translation disambiguation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Algorithm",
"sec_num": "3.2"
},
{
"text": "For an English word \u03b5, we define a binary classifier for resolving each of its translation ambiguities in \u03b5 T in a general form as:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Algorithm",
"sec_num": "3.2"
},
{
"text": "}, { ), | ( & ), | ( t T t t P T t t P \u2212 \u2208 \u2208 \u03b5 \u03b5 \u03b5 \u03b5 e e",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Algorithm",
"sec_num": "3.2"
},
{
"text": "where e denotes an example in English. Similarly, for a Chinese word \u03b3, we define a classifier as:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Algorithm",
"sec_num": "3.2"
},
{
"text": "}, { ), | ( & ), | ( t T t t P T t t P \u2212 \u2208 \u2208 \u03b3 \u03b3 \u03b3 \u03b3 c c",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Algorithm",
"sec_num": "3.2"
},
{
"text": "where c denotes an example in Chinese.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Algorithm",
"sec_num": "3.2"
},
{
"text": "Let \u03b5 L denote a set of classified examples in English, each representing one context of \u03b5 ), , , 2 , 1 ( }, ) , ( , , ) , ( , ) , {( 2 2 1 1 k i T t t t t L i k k L L = \u2208 = \u03b5 \u03b5 \u03b5 \u03b5 \u03b5",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Algorithm",
"sec_num": "3.2"
},
{
"text": "e e e and \u03b5 U a set of unclassified examples in English, each representing one context of \u03b5",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Algorithm",
"sec_num": "3.2"
},
{
"text": "}. ) ( , , ) ( , ) {( 2 1 \u03b5 \u03b5 \u03b5 \u03b5 l U e e e L =",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Algorithm",
"sec_num": "3.2"
},
{
"text": "Similarly, we denote the sets of classified and unclassified examples with respect to \u03b3 in",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Algorithm",
"sec_num": "3.2"
},
{
"text": "\u03b3 L and \u03b3 U respectively. Furthermore, we have . , , , \u03b3 \u03b3 \u03b5 \u03b5 \u03b3 \u03b3 \u03b5 \u03b5 U U U U L L L L C C E E C C E E \u2208 \u2208 \u2208 \u2208 = = = = U U U U",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Chinese as",
"sec_num": null
},
{
"text": "We perform Bilingual Bootstrapping as described in Figure 2 . Hereafter, we will only explain the process for English (left-hand side); the process for Chinese (right-hand side) can be conducted similarly.",
"cite_spans": [],
"ref_spans": [
{
"start": 51,
"end": 59,
"text": "Figure 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Chinese as",
"sec_num": null
},
{
"text": "Input :",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Na\u00efve Bayesian Classifier",
"sec_num": "3.3"
},
{
"text": "C C E E U L U L T C E , , , , , , , Parameter : \u03b8 , b",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Na\u00efve Bayesian Classifier",
"sec_num": "3.3"
},
{
"text": "Repeat in parallel the following processes for English (left) and Chinese (right), until unable to continue : While we can in principle employ any kind of classifier in BB, we use here a Na\u00efve Bayesian Classifier. At step 1 in BB, we construct the classifier as described in Figure 3 . At step 2, for each example e, we calculate with the Na\u00efve Bayesian Classifier:",
"cite_spans": [],
"ref_spans": [
{
"start": 275,
"end": 283,
"text": "Figure 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Na\u00efve Bayesian Classifier",
"sec_num": "3.3"
},
{
"text": "1. for each ( E \u2208 \u03b5 ) { for each ( C \u2208 \u03b3 ) { for each ( \u03b5 T t \u2208 ) { use \u03b5 L and ) ( \u03b5 \u03b3 \u03b3 C L \u2208 to create classifier: \u03b5 \u03b5 T t t P \u2208 ), | ( e & }; { ), | ( t T t t P \u2212 \u2208 \u03b5 \u03b5 e }} for each ( \u03b3 T t \u2208 ) { use \u03b3 L and ) ( \u03b3 \u03b5 \u03b5 E L \u2208 to create classifier: \u03b3 \u03b3 T t t P \u2208 ), | ( c & }; { ), | ( t T t t P \u2212 \u2208 \u03b3 \u03b3 c }} 2. for each ( E \u2208 \u03b5 ) { {}; {}; \u2190 \u2190 NL NU for each ( \u03b5 T t \u2208 ) { } {}; {}; \u2190 \u2190 t t Q S for each ( C \u2208 \u03b3 ) { {}; {}; \u2190 \u2190 NL NU for each ( \u03b3 T t \u2208 ) { } {}; {}; \u2190 \u2190 t t Q S for each ( \u03b5 U \u2208 e ){ calculate ) | ( ) | ( max ) ( * e e e t P t P T t \u03b5 \u03b5 \u03b5 \u03bb \u2208 = ; let ) | ( ) | ( max arg ) ( * e e e t P t P t T t \u03b5 \u03b5 \u03b5 \u2208 = ; if ( t t = > ) ( & ) ( * * e e \u03b8 \u03bb ) put e into t S ;} for each ( \u03b3 U \u2208 c ){ calculate ) | ( ) | ( max ) ( * c c c t P t P T t \u03b3 \u03b3 \u03b3 \u03bb \u2208 = ; let ) | ( ) | ( max arg ) ( * c c c t P t P t T t \u03b3 \u03b3 \u03b3 \u2208 = ; if ( t t = > ) ( & ) ( * * c c \u03b8 \u03bb ) put c into t S ;} for each ( \u03b5 T t \u2208 ){ sort t S \u2208 e in",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Na\u00efve Bayesian Classifier",
"sec_num": "3.3"
},
{
"text": "Q U \u2208 c ){ put c into NU and put )) ( , ( c c * t into NL;} NL L L U \u03b5 \u03b5 \u2190 ; NU U U \u2212 \u2190 \u03b5 \u03b5 ;} NL L L U \u03b3 \u03b3 \u2190 ; NU U U \u2212 \u2190",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Na\u00efve Bayesian Classifier",
"sec_num": "3.3"
},
{
"text": ". ) | ( ) ( ) | ( ) ( max ) | ( ) | ( max ) ( * t P t P t P t P t P t P T t T t e e e e e \u03b5 \u03b5 \u03b5 \u03b5 \u03b5 \u03b5 \u03b5 \u03b5 \u03bb \u2208 \u2208 = =",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Na\u00efve Bayesian Classifier",
"sec_num": "3.3"
},
{
"text": "The second equation is based on Bayes' rule.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Na\u00efve Bayesian Classifier",
"sec_num": "3.3"
},
{
"text": "In the calculation, we assume that the context words in e (i.e., and thus we have",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Na\u00efve Bayesian Classifier",
"sec_num": "3.3"
},
{
"text": ". ) | ( ) | ( 1 \u220f = = m i i t e P t P \u03b5 \u03b5 e",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Na\u00efve Bayesian Classifier",
"sec_num": "3.3"
},
{
"text": "We can calculate (1)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Na\u00efve Bayesian Classifier",
"sec_num": "3.3"
},
{
"text": ") | ( t P e \u03b5 similarly.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Na\u00efve Bayesian Classifier",
"sec_num": "3.3"
},
{
"text": "where 1 0 \u2264 \u2264 \u03b1 , 1 0 \u2264 \u2264 \u03b2 , 1 \u2264 + \u03b2 \u03b1 , and ) ( ) ( e P U",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Na\u00efve Bayesian Classifier",
"sec_num": "3.3"
},
{
"text": "is a uniform distribution over E , which is used for avoiding zero probability. In this way, we estimate ) | ( t e P \u03b5 using information from not only English but also Chinese.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Na\u00efve Bayesian Classifier",
"sec_num": "3.3"
},
{
"text": "For ) | ( ) ( t e P E \u03b5 , we estimate it with MLE (Maximum Likelihood Estimation) using \u03b5 L as data. For ) | ( ) ( t e P C \u03b5",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Na\u00efve Bayesian Classifier",
"sec_num": "3.3"
},
{
"text": ", we estimate it as is described in Section 3.4.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Na\u00efve Bayesian Classifier",
"sec_num": "3.3"
},
{
"text": "For the sake of readability, we rewrite ) | ( and for a specific \u03b5 we assume that the data in",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "EM Algorithm",
"sec_num": "3.4"
},
{
"text": "\u03b5 \u03b3 \u03b3 \u03b3 \u03b3 \u03b3 \u03b3 C h i T t t t t L i h h \u2208 \u2200 = \u2208 = ), , , 1 ( }, ) , ( , , ) , ( , ) , {( 2 2 1 1 L L c c c",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "EM Algorithm",
"sec_num": "3.4"
},
{
"text": "are independently generated on the basis of the model. We can, therefore, employ the Expectation and Maximization Algorithm (EM Algorithm) (Dempster et al. 1977) to estimate the parameters of the model including ) | ( t e P",
"cite_spans": [
{
"start": 139,
"end": 161,
"text": "(Dempster et al. 1977)",
"ref_id": "BIBREF2"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "EM Algorithm",
"sec_num": "3.4"
},
{
"text": ". We also use the relation T in the estimation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "EM Algorithm",
"sec_num": "3.4"
},
{
"text": "Initially, we set",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "EM Algorithm",
"sec_num": "3.4"
},
{
"text": "\uf8f4 \uf8f3 \uf8f4 \uf8f2 \uf8f1 \u2209 \u2208 = e e e C c C c C t e c P if , 0 if , | | 1 ) , | ( , . , | | 1 ) | ( E e E t e P \u2208 =",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "EM Algorithm",
"sec_num": "3.4"
},
{
"text": "We next estimate the parameters by iteratively updating them ass described in Figure 4 until they converge. Here ) , ( t c f stands for the frequency of c related to t. The context information in Chinese is then 'translated' into that in English through the links in T.",
"cite_spans": [],
"ref_spans": [
{
"start": 78,
"end": 86,
"text": "Figure 4",
"ref_id": null
}
],
"eq_spans": [],
"section": "EM Algorithm",
"sec_num": "3.4"
},
{
"text": "We note that Monolingual Bootstrapping is a special case of Bilingual Bootstrapping (consider the situation in which \u03b1 equals 0 in formula (1)). Moreover, it seems safe to say that BB can always perform better than MB.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Comparison between BB and MB",
"sec_num": "4"
},
{
"text": "The many-to-many relationship between the words in the two languages stands out as key to the higher performance of BB.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Comparison between BB and MB",
"sec_num": "4"
},
{
"text": "Suppose that the classifier with respect to 'plant' has two decisions (denoted as A and B in Figure 5 ). Further suppose that the classifiers with",
"cite_spans": [],
"ref_spans": [
{
"start": 93,
"end": 102,
"text": "Figure 5",
"ref_id": null
}
],
"eq_spans": [],
"section": "Comparison between BB and MB",
"sec_num": "4"
},
{
"text": "estimate ) | ( ) ( t e P E \u03b5 with MLE using \u03b5 L as data; estimate ) | ( ) ( t e P C \u03b5 with EM Algorithm using \u03b3 L for each \u03b5 \u03b3 C \u2208 as data; calculate ) | ( t e P \u03b5",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Comparison between BB and MB",
"sec_num": "4"
},
{
"text": "as a linear combination of",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Comparison between BB and MB",
"sec_num": "4"
},
{
"text": ") | ( ) ( t e P E \u03b5 and ) | ( ) ( t e P C \u03b5 ; estimate ) (t P \u03b5 with MLE using \u03b5 L ; calculate ) | ( t e P \u03b5 and ) (t P \u03b5",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Comparison between BB and MB",
"sec_num": "4"
},
{
"text": "similarly. Assume that examples are classified after several iterations in BB as depicted in Figure 5 . Here, circles denote the examples that are correctly classified and crosses denote the examples that are incorrectly classified.",
"cite_spans": [],
"ref_spans": [
{
"start": 93,
"end": 101,
"text": "Figure 5",
"ref_id": null
}
],
"eq_spans": [],
"section": "Comparison between BB and MB",
"sec_num": "4"
},
{
"text": "Since A and D are equivalent to each other, we can 'translate' the examples with D and use them to boost the performance of classification to A. This is because the misclassified examples (crosses) with D are those mistakenly classified from C and they will not have much negative effect on classification to A, even though the translation from Chinese into English can introduce some noises. Similar explanations can be stated to other classification decisions.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Comparison between BB and MB",
"sec_num": "4"
},
{
"text": "In contrast, MB only uses the examples in A and B to construct a classifier, and when the number of misclassified examples increases (this is inevitable in bootstrapping), its performance will stop improving.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Comparison between BB and MB",
"sec_num": "4"
},
{
"text": "While it is possible to straightforwardly apply the algorithm of BB described in Section 3 to word translation disambiguation, we use here a variant of it for a better adaptation to the task and for a fairer comparison with existing technologies.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Using Bilingual Bootstrapping",
"sec_num": "5.1"
},
{
"text": "The variant of BB has four modifications.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Using Bilingual Bootstrapping",
"sec_num": "5.1"
},
{
"text": "(1) It actually employs an ensemble of the Na\u00efve Bayesian Classifiers (NBC), because an ensemble of NBCs generally performs better than a single NBC (Pedersen 2000) . In an ensemble, it creates different NBCs using as data the words within different window sizes surrounding the word to be disambiguated (e.g., 'plant' or 'zhiwu') and further constructs a new classifier by linearly combining the NBCs.",
"cite_spans": [
{
"start": 149,
"end": 164,
"text": "(Pedersen 2000)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Using Bilingual Bootstrapping",
"sec_num": "5.1"
},
{
"text": "(2) It employs the heuristics of 'one sense per discourse' (cf., Yarowsky 1995) after using an ensemble of NBCs.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Using Bilingual Bootstrapping",
"sec_num": "5.1"
},
{
"text": "(3) It uses only classified data in English at the beginning.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Using Bilingual Bootstrapping",
"sec_num": "5.1"
},
{
"text": "(4) It individually resolves ambiguities on selected English words such as 'plant', 'interest'. As a result, in the case of 'plant'; for example, the classifiers with respect to 'gongchang' and 'zhiwu' only make classification decisions to D and E but not C and F (in Figure 5) . ",
"cite_spans": [],
"ref_spans": [
{
"start": 268,
"end": 277,
"text": "Figure 5)",
"ref_id": null
}
],
"eq_spans": [],
"section": "Using Bilingual Bootstrapping",
"sec_num": "5.1"
},
{
"text": "We consider here two implementations of MB for word translation disambiguation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Using Monolingual Bootstrapping",
"sec_num": "5.2"
},
{
"text": "In the first implementation, in addition to the basic algorithm of MB, we also use (1) an ensemble of Na\u00efve Bayesian Classifiers, (2) the heuristics of 'one sense per discourse', and (3) a small number of classified data in English at the beginning. We will denote this implementation as MB-B hereafter.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Using Monolingual Bootstrapping",
"sec_num": "5.2"
},
{
"text": "The second implementation is different from the first one only in (1). That is, it employs as a classifier a decision list instead of an ensemble of NBCs. This implementation is exactly the one proposed in (Yarowsky 1995) , and we will denote it as MB-D hereafter.",
"cite_spans": [
{
"start": 206,
"end": 221,
"text": "(Yarowsky 1995)",
"ref_id": "BIBREF16"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Using Monolingual Bootstrapping",
"sec_num": "5.2"
},
{
"text": "MB-B and MB-D can be viewed as the state-of-the-art methods for word translation disambiguation using bootstrapping. ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Using Monolingual Bootstrapping",
"sec_num": "5.2"
},
{
"text": "We first applied BB, MB-B, and MB-D to translation of the English words 'line' and 'interest' using a benchmark data 2 . The data mainly consists of articles in the Wall Street Journal and it is designed for conducting Word 2 http://www.d.umn.edu/~tpederse/data.html.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experiment 1: WSD Benchmark Data",
"sec_num": "6.1"
},
{
"text": "Sense Disambiguation (WSD) on the two words (e.g., Pedersen 2000) .",
"cite_spans": [
{
"start": 51,
"end": 65,
"text": "Pedersen 2000)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Experiment 1: WSD Benchmark Data",
"sec_num": "6.1"
},
{
"text": "We adopted from the HIT dictionary 3 the Chinese translations of the two English words, as listed in Table 1 . One sense of the words corresponds to one group of translations.",
"cite_spans": [],
"ref_spans": [
{
"start": 101,
"end": 108,
"text": "Table 1",
"ref_id": "TABREF4"
}
],
"eq_spans": [],
"section": "Experiment 1: WSD Benchmark Data",
"sec_num": "6.1"
},
{
"text": "We then used the benchmark data as our test data. (For the word 'interest', we only used its four major senses, because the remaining two minor senses occur in only 3.3% of the data) 3 The dictionary is created by Harbin Institute of Technology. As classified data in English, we defined a 'seed word' for each group of translations based on our intuition (cf., Table 1 ). Each of the seed words was then used as a classified 'sentence'. This way of creating classified data is similar to that in (Yarowsky, 1995) . As unclassified data in English, we collected sentences in news articles from a web site (www.news.com), and as unclassified data in Chinese, we collected sentences in news articles from another web site (news.cn.tom.com). We observed that the distribution of translations in the unclassified data was balanced. Table 2 shows the sizes of the data. Note that there are in general more unclassified sentences in Chinese than in English because an English word usually has several Chinese words as translations (cf., Figure 5 ).",
"cite_spans": [
{
"start": 183,
"end": 184,
"text": "3",
"ref_id": null
},
{
"start": 497,
"end": 513,
"text": "(Yarowsky, 1995)",
"ref_id": "BIBREF16"
}
],
"ref_spans": [
{
"start": 362,
"end": 369,
"text": "Table 1",
"ref_id": "TABREF4"
},
{
"start": 828,
"end": 835,
"text": "Table 2",
"ref_id": "TABREF5"
},
{
"start": 1031,
"end": 1039,
"text": "Figure 5",
"ref_id": null
}
],
"eq_spans": [],
"section": "Experiment 1: WSD Benchmark Data",
"sec_num": "6.1"
},
{
"text": ", W H U D W L R Q $ F F X U D F \\ 0 % ' 0 % % % % Figure 6: Learning curves with 'interest' , W H U D W L R Q $ F F X U D F \\ 0 % ' 0 % % % % Figure 7: Learning curves with 'line' \u03b1 $ F F X U D F \\ L Q W H U H V W O L Q H",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experiment 1: WSD Benchmark Data",
"sec_num": "6.1"
},
{
"text": "As a translation dictionary, we used the HIT dictionary, which contains about 76000 Chinese words, 60000 English words, and 118000 links.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experiment 1: WSD Benchmark Data",
"sec_num": "6.1"
},
{
"text": "We then used the data to conduct translation disambiguation with BB, MB-B, and MB-D, as described in Section 5.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experiment 1: WSD Benchmark Data",
"sec_num": "6.1"
},
{
"text": "For both BB and MB-B, we used an ensemble of five Na\u00efve Bayesian Classifiers with the window sizes being \u00b11, \u00b13, \u00b15, \u00b17, \u00b19 words. For both BB and MB-B, we set the parameters of \u03b2, b, and \u03b8 to 0.2, 15, and 1.5 respectively. The parameters were tuned based on our preliminary experimental results on MB-B, they were not tuned, however, for BB. For the BB specific parameter \u03b1, we set it to 0.4, which meant that we treated the information from English and that from Chinese equally. Table 3 shows the translation disambiguation accuracies of the three methods as well as that of a baseline method in which we always choose the major translation. Figures 6 and 7 show the learning curves of MB-D, MB-B, and BB. Figure 8 shows the accuracies of BB with different \u03b1 values.",
"cite_spans": [],
"ref_spans": [
{
"start": 482,
"end": 489,
"text": "Table 3",
"ref_id": "TABREF6"
},
{
"start": 645,
"end": 660,
"text": "Figures 6 and 7",
"ref_id": null
},
{
"start": 709,
"end": 718,
"text": "Figure 8",
"ref_id": "FIGREF6"
}
],
"eq_spans": [],
"section": "Experiment 1: WSD Benchmark Data",
"sec_num": "6.1"
},
{
"text": "From the results, we see that BB consistently and significantly outperforms both MB-D and MB-B.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experiment 1: WSD Benchmark Data",
"sec_num": "6.1"
},
{
"text": "The results from the sign test are statistically significant (p-value < 0.001). Table 4 shows the results achieved by some existing supervised learning methods with respect to the benchmark data (cf., Pedersen 2000) . Although BB is a method nearly equivalent to one based on unsupervised learning, it still performs favorably well when compared with the supervised methods (note that since the experimental settings are different, the results cannot be directly compared).",
"cite_spans": [
{
"start": 201,
"end": 215,
"text": "Pedersen 2000)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [
{
"start": 80,
"end": 87,
"text": "Table 4",
"ref_id": "TABREF7"
}
],
"eq_spans": [],
"section": "Experiment 1: WSD Benchmark Data",
"sec_num": "6.1"
},
{
"text": "We also conducted translation on seven of the twelve English words studied in (Yarowsky, 1995) . Table 5 shows the list of the words.",
"cite_spans": [
{
"start": 78,
"end": 94,
"text": "(Yarowsky, 1995)",
"ref_id": "BIBREF16"
}
],
"ref_spans": [
{
"start": 97,
"end": 104,
"text": "Table 5",
"ref_id": "TABREF8"
}
],
"eq_spans": [],
"section": "Experiment 2: Yarowsky's Words",
"sec_num": "6.2"
},
{
"text": "For each of the words, we extracted about 200 sentences containing the word from the Encarta 4 English corpus and labeled those sentences with Chinese translations ourselves. We used the labeled sentences as test data and the remaining sentences as unclassified data in English. We also used the sentences in the Great Encyclopedia 5 Chinese corpus as unclassified data in Chinese. We defined, for each translation, a seed word in English as a classified example (cf., Table 5 ).",
"cite_spans": [],
"ref_spans": [
{
"start": 469,
"end": 476,
"text": "Table 5",
"ref_id": "TABREF8"
}
],
"eq_spans": [],
"section": "Experiment 2: Yarowsky's Words",
"sec_num": "6.2"
},
{
"text": "We did not, however, conduct translation disambiguation on the words 'crane', 'sake', 'poach', 'axes', and 'motion', because the first four words do not frequently occur in the Encarta corpus, and the accuracy of choosing the major translation for the last word has already exceeded 98%.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experiment 2: Yarowsky's Words",
"sec_num": "6.2"
},
{
"text": "We next applied BB, MB-B, and MB-D to word translation disambiguation. The experiment settings were the same as those in Experiment 1.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experiment 2: Yarowsky's Words",
"sec_num": "6.2"
},
{
"text": "From Table 6 , we see again that BB significantly outperforms MB-D and MB-B. (We will describe the results in detail in the full version of this paper.) Note that the results of MB-D here cannot be directly compared with those in (Yarowsky, 1995) , mainly because the data used are different.",
"cite_spans": [
{
"start": 230,
"end": 246,
"text": "(Yarowsky, 1995)",
"ref_id": "BIBREF16"
}
],
"ref_spans": [
{
"start": 5,
"end": 12,
"text": "Table 6",
"ref_id": "TABREF9"
}
],
"eq_spans": [],
"section": "Experiment 2: Yarowsky's Words",
"sec_num": "6.2"
},
{
"text": "We investigated the reason of BB's outperforming MB and found that the explanation on the reason in Section 4 appears to be true according to the following observations.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Discussions",
"sec_num": "6.3"
},
{
"text": "(1) In a Na\u00efve Bayesian Classifier, words having large values of probability ratio ) | ( ) | ( t e P t e P have strong influence on the classification of t when they occur, particularly, when they frequently occur. We collected the words having large values of probability ratio for each t in both BB and MB-B and found that BB obviously has more 'relevant words' than MB-B. Here 'relevant words' for t refer to the words which are strongly indicative to t on the basis of human judgments. Table 7 shows the top ten words in terms of probability ratio for the ' \u07fd \u1643",
"cite_spans": [],
"ref_spans": [
{
"start": 490,
"end": 497,
"text": "Table 7",
"ref_id": null
}
],
"eq_spans": [],
"section": "Discussions",
"sec_num": "6.3"
},
{
"text": "' translation ('money paid for the use of money') with respect to BB and MB-B, in which relevant words are underlined. Figure 9 shows the numbers of relevant words for the four translations of 'interest' with respect to BB and MB-B.",
"cite_spans": [],
"ref_spans": [
{
"start": 119,
"end": 127,
"text": "Figure 9",
"ref_id": null
}
],
"eq_spans": [],
"section": "Discussions",
"sec_num": "6.3"
},
{
"text": "(2) From Figure 8 , we see that the performance of BB remains high or gets higher when \u03b1 becomes larger than 0.4 (recall that \u03b2 was fixed to 0.2).",
"cite_spans": [],
"ref_spans": [
{
"start": 9,
"end": 17,
"text": "Figure 8",
"ref_id": "FIGREF6"
}
],
"eq_spans": [],
"section": "Discussions",
"sec_num": "6.3"
},
{
"text": "This result strongly indicates that the information from Chinese has positive effects on disambiguation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Discussions",
"sec_num": "6.3"
},
{
"text": "(3) One may argue that the higher performance of BB might be attributed to the larger unclassified data size it uses, and thus if we increase the Figure 10 : When more unlabeled data available unclassified data size for MB, it is likely that MB can perform as well as BB.",
"cite_spans": [],
"ref_spans": [
{
"start": 146,
"end": 155,
"text": "Figure 10",
"ref_id": null
}
],
"eq_spans": [],
"section": "Discussions",
"sec_num": "6.3"
},
{
"text": "We conducted an additional experiment and found that this is not the case. Figure 10 shows the accuracies achieved by MB-B when data sizes increase. Actually, the accuracies of MB-B cannot further improve when unlabeled data sizes increase. Figure 10 plots again the results of BB as well as those of a method referred to as MB-C. In MB-C, we linearly combine two MB-B classifiers constructed with two different unlabeled data sets and we found that although the accuracies get some improvements in MB-C, they are still much lower than those of BB.",
"cite_spans": [],
"ref_spans": [
{
"start": 75,
"end": 84,
"text": "Figure 10",
"ref_id": null
},
{
"start": 241,
"end": 250,
"text": "Figure 10",
"ref_id": null
}
],
"eq_spans": [],
"section": "Discussions",
"sec_num": "6.3"
},
{
"text": "This paper has presented a new word translation disambiguation method using a bootstrapping technique called Bilingual Bootstrapping. Experimental results indicate that BB significantly outperforms the existing Monolingual Bootstrapping technique in word translation disambiguation. This is because BB can effectively make use of information from two sources rather than from one source as in MB.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "7"
},
{
"text": "In this paper, we take English-Chinese translation as example; it is a relatively easy process, however, to extend the discussions to translations between other language pairs.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "http://encarta.msn.com/default.asp 5 http://www.whlib.ac.cn/sjk/bkqs.htm",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [
{
"text": "We thank Ming Zhou, Ashley Chang and Yao Meng for their valuable comments on an early draft of this paper.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgements",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Word Sense Disambiguation Using Statistical Methods",
"authors": [
{
"first": "P",
"middle": [],
"last": "Brown",
"suffix": ""
},
{
"first": "S",
"middle": [
"D"
],
"last": "Pietra",
"suffix": ""
},
{
"first": "V",
"middle": [
"D"
],
"last": "Pietra",
"suffix": ""
},
{
"first": "R",
"middle": [],
"last": "Mercer",
"suffix": ""
}
],
"year": 1991,
"venue": "Proceedings of the 29th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "264--270",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "P. Brown, S. D. Pietra, V. D. Pietra, and R. Mercer, 1991. Word Sense Disambiguation Using Statistical Methods. In Proceedings of the 29th Annual Meeting of the Association for Computational Linguistics, pp. 264-270.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Word Sense Disambiguation Using a Second Language Monolingual Corpus",
"authors": [
{
"first": "I",
"middle": [],
"last": "Dagan",
"suffix": ""
},
{
"first": "A",
"middle": [],
"last": "Itai",
"suffix": ""
}
],
"year": 1994,
"venue": "Computational Linguistics",
"volume": "20",
"issue": "",
"pages": "563--596",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "I. Dagan and A. Itai, 1994. Word Sense Disambiguation Using a Second Language Monolingual Corpus. Computational Linguistics, vol. 20, pp. 563-596.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Maximum Likelihood from Incomplete Data via the EM Algorithm",
"authors": [
{
"first": "A",
"middle": [
"P"
],
"last": "Dempster",
"suffix": ""
},
{
"first": "N",
"middle": [
"M"
],
"last": "Laird",
"suffix": ""
},
{
"first": "D",
"middle": [
"B"
],
"last": "Rubin",
"suffix": ""
}
],
"year": 1977,
"venue": "Journal of the Royal Statistical Society B",
"volume": "39",
"issue": "",
"pages": "1--38",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "A. P. Dempster, N. M. Laird, and D. B. Rubin, 1977. Maximum Likelihood from Incomplete Data via the EM Algorithm. Journal of the Royal Statistical Society B, vol. 39, pp. 1-38.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Boosting Applied to Word Sense Disambiguation",
"authors": [
{
"first": "G",
"middle": [],
"last": "Escudero",
"suffix": ""
},
{
"first": "L",
"middle": [],
"last": "Marquez",
"suffix": ""
},
{
"first": "G",
"middle": [],
"last": "Rigau",
"suffix": ""
}
],
"year": 2000,
"venue": "Proceedings of the 12th European Conference on Machine Learning",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "G. Escudero, L. Marquez, and G. Rigau, 2000. Boosting Applied to Word Sense Disambiguation. In Proceedings of the 12th European Conference on Machine Learning.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "A Method for Disambiguating Word Senses in a Large Corpus",
"authors": [
{
"first": "W",
"middle": [],
"last": "Gale",
"suffix": ""
},
{
"first": "K",
"middle": [],
"last": "Church",
"suffix": ""
},
{
"first": "D",
"middle": [],
"last": "Yarowsky",
"suffix": ""
}
],
"year": 1992,
"venue": "Computers and Humanities",
"volume": "26",
"issue": "",
"pages": "415--439",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "W. Gale, K. Church, and D. Yarowsky, 1992a. A Method for Disambiguating Word Senses in a Large Corpus. Computers and Humanities, vol. 26, pp. 415-439.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "One sense per discourse",
"authors": [
{
"first": "W",
"middle": [],
"last": "Gale",
"suffix": ""
},
{
"first": "K",
"middle": [],
"last": "Church",
"suffix": ""
},
{
"first": "D",
"middle": [],
"last": "Yarowsky",
"suffix": ""
}
],
"year": 1992,
"venue": "Proceedings of DARPA speech and Natural Language Workshop",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "W. Gale, K. Church, and D. Yarowsky, 1992b. One sense per discourse. In Proceedings of DARPA speech and Natural Language Workshop.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "A Winnow-Based Approach to Context-Sensitive Spelling Correction",
"authors": [
{
"first": "A",
"middle": [
"R"
],
"last": "Golding",
"suffix": ""
},
{
"first": "D",
"middle": [],
"last": "Roth",
"suffix": ""
}
],
"year": 1999,
"venue": "Machine Learning",
"volume": "34",
"issue": "",
"pages": "107--130",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "A. R. Golding and D. Roth, 1999. A Winnow-Based Approach to Context-Sensitive Spelling Correction. Machine Learning, vol. 34, pp. 107-130.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Resolving Translation Ambiguity Using Non-parallel Bilingual Corpora",
"authors": [
{
"first": "G",
"middle": [],
"last": "Kikui",
"suffix": ""
}
],
"year": 1999,
"venue": "Proceedings of ACL '99 Workshop on Unsupervised Learning in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "G. Kikui, 1999. Resolving Translation Ambiguity Using Non-parallel Bilingual Corpora. In Proceedings of ACL '99 Workshop on Unsupervised Learning in Natural Language Processing.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Automatic rule acquisition for spelling correction",
"authors": [
{
"first": "L",
"middle": [],
"last": "Mangu",
"suffix": ""
},
{
"first": "E",
"middle": [],
"last": "Brill",
"suffix": ""
}
],
"year": 1997,
"venue": "Proceedings of the 14th International Conference on Machine Learning",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "L. Mangu and E. Brill, 1997. Automatic rule acquisition for spelling correction. In Proceedings of the 14th International Conference on Machine Learning.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "A method for Word Sense Disambiguation of unrestricted text",
"authors": [
{
"first": "R",
"middle": [],
"last": "Mihalcea",
"suffix": ""
},
{
"first": "D",
"middle": [],
"last": "Moldovan",
"suffix": ""
}
],
"year": 1999,
"venue": "Proceedings of the 37th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "R. Mihalcea and D. Moldovan, 1999. A method for Word Sense Disambiguation of unrestricted text. In Proceedings of the 37th Annual Meeting of the Association for Computational Linguistics.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Integrating Multiple Knowledge Sources to Disambiguate Word Sense: An Exemplar-based Approach",
"authors": [
{
"first": "H",
"middle": [
"T"
],
"last": "Ng",
"suffix": ""
},
{
"first": "H",
"middle": [
"B"
],
"last": "Lee",
"suffix": ""
}
],
"year": 1996,
"venue": "Proceedings of the 34th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "40--47",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "H. T. Ng and H. B. Lee, 1996. Integrating Multiple Knowledge Sources to Disambiguate Word Sense: An Exemplar-based Approach. In Proceedings of the 34th Annual Meeting of the Association for Computational Linguistics, pp. 40-47.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Distinguishing Word Senses in Untagged Text",
"authors": [
{
"first": "T",
"middle": [],
"last": "Pedersen",
"suffix": ""
},
{
"first": "R",
"middle": [],
"last": "Bruce",
"suffix": ""
}
],
"year": 1997,
"venue": "Proceedings of the 2nd Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "197--207",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "T. Pedersen and R. Bruce, 1997. Distinguishing Word Senses in Untagged Text. In Proceedings of the 2nd Conference on Empirical Methods in Natural Language Processing, pp. 197-207.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "A Simple Approach to Building Ensembles of Na\u00efve Bayesian Classifiers for Word Sense Disambiguation",
"authors": [
{
"first": "T",
"middle": [],
"last": "Pedersen",
"suffix": ""
}
],
"year": 2000,
"venue": "Proceedings of the 1st Meeting of the North American Chapter",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "T. Pedersen, 2000. A Simple Approach to Building Ensembles of Na\u00efve Bayesian Classifiers for Word Sense Disambiguation. In Proceedings of the 1st Meeting of the North American Chapter of the Association for Computational Linguistics.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Automatic Word Sense Discrimination",
"authors": [
{
"first": "H",
"middle": [],
"last": "Schutze",
"suffix": ""
}
],
"year": 1998,
"venue": "Computational Linguistics",
"volume": "24",
"issue": "",
"pages": "97--124",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "H. Schutze, 1998. Automatic Word Sense Discrimination. In Computational Linguistics, vol. 24, no. 1, pp. 97-124.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Disambiguating Highly Ambiguous Words",
"authors": [
{
"first": "G",
"middle": [],
"last": "Towell",
"suffix": ""
},
{
"first": "E",
"middle": [],
"last": "Voothees",
"suffix": ""
}
],
"year": 1998,
"venue": "Computational Linguistics",
"volume": "24",
"issue": "1",
"pages": "125--146",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "G. Towell and E. Voothees, 1998. Disambiguating Highly Ambiguous Words. Computational Linguistics, vol. 24, no. 1, pp. 125-146.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Decision Lists for Lexical Ambiguity Resolution: Application to Accent Restoration in Spanish and French",
"authors": [
{
"first": "D",
"middle": [],
"last": "Yarowsky",
"suffix": ""
}
],
"year": 1994,
"venue": "Proceedings of the 32nd Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "88--95",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "D. Yarowsky, 1994. Decision Lists for Lexical Ambiguity Resolution: Application to Accent Restoration in Spanish and French. In Proceedings of the 32nd Annual Meeting of the Association for Computational Linguistics, pp. 88-95.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Unsupervised Word Sense Disambiguation Rivaling Supervised Methods",
"authors": [
{
"first": "D",
"middle": [],
"last": "Yarowsky",
"suffix": ""
}
],
"year": 1995,
"venue": "Proceedings of the 33rd Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "189--196",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "D. Yarowsky, 1995. Unsupervised Word Sense Disambiguation Rivaling Supervised Methods. In Proceedings of the 33rd Annual Meeting of the Association for Computational Linguistics, pp. 189-196.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"text": "Figure 1: Example of translation dictionary",
"num": null,
"type_str": "figure",
"uris": null
},
"FIGREF3": {
"text": "respect to 'gongchang' and 'zhiwu' in Chinese have two decisions respectively, (C and D) (E and F). A and D are equivalent to each other (i.e., they represent the same sense), and so are B and E.",
"num": null,
"type_str": "figure",
"uris": null
},
"FIGREF5": {
"text": "Figure 5: Example of BB",
"num": null,
"type_str": "figure",
"uris": null
},
"FIGREF6": {
"text": "Accuracies of BB with different \u03b1",
"num": null,
"type_str": "figure",
"uris": null
},
"TABREF4": {
"type_str": "table",
"content": "<table><tr><td>Words</td><td colspan=\"4\">Chinese translations</td><td>Corresponding English senses</td><td>Seed words</td></tr><tr><td>interest line</td><td>\u0f65 \u0db7 \u24e3 \u0410 \u047b</td><td>\u0748 \u07fd \u04d1 , \u07fd \u0be6 , \u1710 , \u0d83 \u04e1 , \u0d83 , \u0a95 ,</td><td>\u1c67 \u1643 \u0f65 \u058e \u0dca \u09b9 \u1cb3 \u24e3 \u1e7d \u0a95</td><td>\u1d17 \u0db7 \u07eb \u0410</td><td>readiness to give attention money paid for the use of money a share in company or business advantage, advancement or favor a thin flexible object written or spoken text telephone connection formation of people or things an artificial division product</td><td>show rate hold conflict cut write telephone wait between product</td></tr></table>",
"html": null,
"text": "",
"num": null
},
"TABREF5": {
"type_str": "table",
"content": "<table><tr><td/><td colspan=\"3\">: Data sizes in Experiment 1</td></tr><tr><td>Words</td><td colspan=\"2\">Unclassified sentences English Chinese</td><td>Test sentences</td></tr><tr><td>interest</td><td>1927</td><td>8811</td><td>2291</td></tr><tr><td>line</td><td>3666</td><td>5398</td><td>4148</td></tr></table>",
"html": null,
"text": "",
"num": null
},
"TABREF6": {
"type_str": "table",
"content": "<table><tr><td>Words</td><td>Major (%)</td><td>MB-D (%)</td><td>MB-B (%)</td><td>BB (%)</td></tr><tr><td>interest</td><td>54.6</td><td>54.7</td><td>69.3</td><td>75.5</td></tr><tr><td>line</td><td>53.5</td><td>55.6</td><td>54.1</td><td>62.7</td></tr></table>",
"html": null,
"text": "",
"num": null
},
"TABREF7": {
"type_str": "table",
"content": "<table><tr><td colspan=\"3\">: Accuracies of supervised methods</td></tr><tr><td/><td>interest (%)</td><td>line (%)</td></tr><tr><td>Ensembles of NBC</td><td>89</td><td>88</td></tr><tr><td>Na\u00efve Bayes</td><td>74</td><td>72</td></tr><tr><td>Decision Tree</td><td>78</td><td>-</td></tr><tr><td>Neural Network</td><td>-</td><td>76</td></tr><tr><td>Nearest Neighbor</td><td>87</td><td>-</td></tr></table>",
"html": null,
"text": "",
"num": null
},
"TABREF8": {
"type_str": "table",
"content": "<table><tr><td>2</td></tr></table>",
"html": null,
"text": "",
"num": null
},
"TABREF9": {
"type_str": "table",
"content": "<table><tr><td>Words bass drug duty palm plant</td><td>Major (%) 61.0 77.7 86.3 82.2 71.6</td><td>MB-D (%) 57.0 78.7 86.8 80.7 89.3</td><td>MB-B (%) 87.0 79.7 72.0 83.3 95.4</td><td>BB (%) 89.0 86.8 75.1 92.4 95.9</td><td>1 X P E H U R I U H O H Y D Q W Z R U G V</td><td>\u0748 \u1c67</td><td>\u07fd \u1643</td><td>\u0f65 \u04d1</td><td colspan=\"2\">\u0f65 \u082c</td><td/><td/><td/><td/><td>\u07fd \u058e 0 % % %</td><td>%</td></tr><tr><td>space</td><td>64.5</td><td>71.6</td><td>84.3</td><td>87.8</td><td/><td/><td colspan=\"2\">7 U D Q V O D W L R Q</td><td/><td/><td/><td/><td/><td/></tr><tr><td>tank</td><td>60.3</td><td>62.8</td><td>76.9</td><td>84.4</td><td/><td colspan=\"10\">Figure 9: Number of relevant words</td></tr><tr><td>Total</td><td>71.9</td><td>75.2</td><td>82.6</td><td>87.4</td><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/></tr><tr><td colspan=\"5\">Table 7: Top words for '\u07fd\u1643 \u07fd \u1643 \u07fd \u1643 \u07fd ' of 'interest' \u1643 MB-B BB</td><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/></tr><tr><td/><td>payment cut earn short short-term yield u.s.</td><td/><td>saving payment benchmark whose base prefer fixed</td><td/><td>$ F F X U D F \\</td><td/><td/><td/><td>L L L O O O</td><td>Q Q Q L L L</td><td>W W W Q Q Q</td><td>H H H H H H</td><td>U U U</td><td>H H H % 0 0</td><td>V V V % % %</td><td>W W W</td><td>% &</td><td>0 0 %</td><td>% % %</td><td>% &</td></tr><tr><td/><td>margin benchmark</td><td/><td>debt annual</td><td/><td/><td/><td>8 Q O D E H O O H G</td><td>G D W D</td><td colspan=\"2\">V L ] H</td><td/><td/><td/><td/></tr><tr><td/><td>regard</td><td/><td>dividend</td><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/></tr></table>",
"html": null,
"text": "",
"num": null
}
}
}
} |