File size: 80,381 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 | {
"paper_id": "P06-1010",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T09:26:10.370147Z"
},
"title": "Named Entity Transliteration with Comparable Corpora",
"authors": [
{
"first": "Richard",
"middle": [],
"last": "Sproat",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Illinois at Urbana-Champaign",
"location": {
"postCode": "61801",
"settlement": "Urbana",
"region": "IL"
}
},
"email": ""
},
{
"first": "Tao",
"middle": [],
"last": "Tao",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Illinois at Urbana-Champaign",
"location": {
"postCode": "61801",
"settlement": "Urbana",
"region": "IL"
}
},
"email": "taotao@cs.uiuc.edu"
},
{
"first": "Chengxiang",
"middle": [],
"last": "Zhai",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Illinois at Urbana-Champaign",
"location": {
"postCode": "61801",
"settlement": "Urbana",
"region": "IL"
}
},
"email": "czhai@cs.uiuc.edu"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "In this paper we investigate Chinese-English name transliteration using comparable corpora, corpora where texts in the two languages deal in some of the same topics-and therefore share references to named entities-but are not translations of each other. We present two distinct methods for transliteration, one approach using phonetic transliteration, and the second using the temporal distribution of candidate pairs. Each of these approaches works quite well, but by combining the approaches one can achieve even better results. We then propose a novel score propagation method that utilizes the co-occurrence of transliteration pairs within document pairs. This propagation method achieves further improvement over the best results from the previous step.",
"pdf_parse": {
"paper_id": "P06-1010",
"_pdf_hash": "",
"abstract": [
{
"text": "In this paper we investigate Chinese-English name transliteration using comparable corpora, corpora where texts in the two languages deal in some of the same topics-and therefore share references to named entities-but are not translations of each other. We present two distinct methods for transliteration, one approach using phonetic transliteration, and the second using the temporal distribution of candidate pairs. Each of these approaches works quite well, but by combining the approaches one can achieve even better results. We then propose a novel score propagation method that utilizes the co-occurrence of transliteration pairs within document pairs. This propagation method achieves further improvement over the best results from the previous step.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "As part of a more general project on multilingual named entity identification, we are interested in the problem of name transliteration across languages that use different scripts. One particular issue is the discovery of named entities in \"comparable\" texts in multiple languages, where by comparable we mean texts that are about the same topic, but are not in general translations of each other. For example, if one were to go through an English, Chinese and Arabic newspaper on the same day, it is likely that the more important international events in various topics such as politics, business, science and sports, would each be covered in each of the newspapers. Names of the same persons, locations and so forth -which are often transliterated rather than translated -would be found in comparable stories across the three papers. 1 We wish to use this expectation to leverage transliteration, and thus the identification of named entities across languages. Our idea is that the occurrence of a cluster of names in, say, an English text, should be useful if we find a cluster of what looks like the same names in a Chinese or Arabic text.",
"cite_spans": [
{
"start": 836,
"end": 837,
"text": "1",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "An example of what we are referring to can be found in Figure 1 . These are fragments of two stories from the June 8, 2001 Xinhua English and Chinese newswires, each covering an international women's badminton championship. Though these two stories are from the same newswire source, and cover the same event, they are not translations of each other. Still, not surprisingly, a lot of the names that occur in one, also occur in the other. Thus (Camilla) Martin shows up in the Chinese version as ma-er-ting; Judith Meulendijks is \u00f5 yu mo-lun-di-ke-si; and Mette Sorensen is mai su-lun-sen. Several other correspondences also occur. While some of the transliterations are \"standard\" -thus Martin is conventionally transliterated as ma-erting -many of them were clearly more novel, though all of them follow the standard Chinese conventions for transliterating foreign names.",
"cite_spans": [],
"ref_spans": [
{
"start": 55,
"end": 63,
"text": "Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "These sample documents illustrate an important point: if a document in language L 1 has a set of names, and one finds a document in L 2 containing a set of names that look as if they could be transliterations of the names in the L 1 document, then this should boost one's confidence that the two sets of names are indeed transliterations of each other. We will demonstrate that this intuition is correct. Figure 1: Sample from two stories about an international women's badminton championship.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In previous work on Chinese named-entity transliteration -e.g. (Meng et al., 2001; Gao et al., 2004) , the problem has been cast as the problem of producing, for a given Chinese name, an English equivalent such as one might need in a machine translation system. For example, for the name \u00f3\u00f5wei wei-lian-mu-si, one would like to arrive at the English name V(enus) Williams. Common approaches include sourcechannel methods, following (Knight and Graehl, 1998) or maximum-entropy models. Comparable corpora have been studied extensively in the literature (e.g., (Fung, 1995; Rapp, 1995; Tanaka and Iwasaki, 1996; Franz et al., 1998; Ballesteros and Croft, 1998; Masuichi et al., 2000; Sadat et al., 2003) ), but transliteration in the context of comparable corpora has not been well addressed.",
"cite_spans": [
{
"start": 63,
"end": 82,
"text": "(Meng et al., 2001;",
"ref_id": "BIBREF13"
},
{
"start": 83,
"end": 100,
"text": "Gao et al., 2004)",
"ref_id": "BIBREF5"
},
{
"start": 432,
"end": 457,
"text": "(Knight and Graehl, 1998)",
"ref_id": "BIBREF8"
},
{
"start": 559,
"end": 571,
"text": "(Fung, 1995;",
"ref_id": "BIBREF4"
},
{
"start": 572,
"end": 583,
"text": "Rapp, 1995;",
"ref_id": "BIBREF14"
},
{
"start": 584,
"end": 609,
"text": "Tanaka and Iwasaki, 1996;",
"ref_id": "BIBREF18"
},
{
"start": 610,
"end": 629,
"text": "Franz et al., 1998;",
"ref_id": "BIBREF3"
},
{
"start": 630,
"end": 658,
"text": "Ballesteros and Croft, 1998;",
"ref_id": "BIBREF0"
},
{
"start": 659,
"end": 681,
"text": "Masuichi et al., 2000;",
"ref_id": "BIBREF12"
},
{
"start": 682,
"end": 701,
"text": "Sadat et al., 2003)",
"ref_id": "BIBREF15"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Previous Work",
"sec_num": "2"
},
{
"text": "The general idea of exploiting frequency correlations to acquire word translations from comparable corpora has been explored in several previous studies (e.g., (Fung, 1995; Rapp, 1995; Tanaka and Iwasaki, 1996) ).Recently, a method based on Pearson correlation was proposed to mine word pairs from comparable corpora (Tao and Zhai, 2005) , an idea similar to the method used in (Kay and Roscheisen, 1993) for sentence alignment. In our work, we adopt the method proposed in (Tao and Zhai, 2005) and apply it to the problem of transliteration. We also study several variations of the similarity measures.",
"cite_spans": [
{
"start": 160,
"end": 172,
"text": "(Fung, 1995;",
"ref_id": "BIBREF4"
},
{
"start": 173,
"end": 184,
"text": "Rapp, 1995;",
"ref_id": "BIBREF14"
},
{
"start": 185,
"end": 210,
"text": "Tanaka and Iwasaki, 1996)",
"ref_id": "BIBREF18"
},
{
"start": 317,
"end": 337,
"text": "(Tao and Zhai, 2005)",
"ref_id": "BIBREF19"
},
{
"start": 378,
"end": 404,
"text": "(Kay and Roscheisen, 1993)",
"ref_id": "BIBREF7"
},
{
"start": 474,
"end": 494,
"text": "(Tao and Zhai, 2005)",
"ref_id": "BIBREF19"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Previous Work",
"sec_num": "2"
},
{
"text": "Mining transliterations from multilingual web pages was studied in (Zhang and Vines, 2004) ; Our work differs from this work in that we use comparable corpora (in particular, news data) and leverage the time correlation information naturally available in comparable corpora.",
"cite_spans": [
{
"start": 67,
"end": 90,
"text": "(Zhang and Vines, 2004)",
"ref_id": "BIBREF22"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Previous Work",
"sec_num": "2"
},
{
"text": "We assume that we have comparable corpora, consisting of newspaper articles in English and Chinese from the same day, or almost the same day. In our experiments we use data from the English and Chinese stories from the Xinhua News agency for about 6 months of 2001. 2 We assume that we have identified names for persons and locations-two types that have a strong tendency to be transliterated wholly or mostly phonetically-in the English text; in this work we use the named-entity recognizer described in (Li et al., 2004) , which is based on the SNoW machine learning toolkit (Carlson et al., 1999) . To perform the transliteration task, we propose the following general three-step approach:",
"cite_spans": [
{
"start": 266,
"end": 267,
"text": "2",
"ref_id": null
},
{
"start": 505,
"end": 522,
"text": "(Li et al., 2004)",
"ref_id": "BIBREF10"
},
{
"start": 577,
"end": 599,
"text": "(Carlson et al., 1999)",
"ref_id": "BIBREF2"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Chinese Transliteration with Comparable Corpora",
"sec_num": "3"
},
{
"text": "1. Given an English name, identify candidate Chinese character n-grams as possible transliterations.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Chinese Transliteration with Comparable Corpora",
"sec_num": "3"
},
{
"text": "2. Score each candidate based on how likely the candidate is to be a transliteration of the English name. We propose two different scoring methods. The first involves phonetic scoring, and the second uses the frequency profile of the candidate pair over time. We will show that each of these approaches works quite well, but by combining the approaches one can achieve even better results.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Chinese Transliteration with Comparable Corpora",
"sec_num": "3"
},
{
"text": "3. Propagate scores of all the candidate transliteration pairs globally based on their cooccurrences in document pairs in the comparable corpora.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Chinese Transliteration with Comparable Corpora",
"sec_num": "3"
},
{
"text": "The intuition behind the third step is the following. Suppose several high-confidence name transliteration pairs occur in a pair of English and Chinese documents. Intuitively, this would increase our confidence in the other plausible transliteration pairs in the same document pair. We thus propose a score propagation method to allow these high-confidence pairs to propagate some of their scores to other co-occurring transliteration pairs. As we will show later, such a propagation strategy can generally further improve the transliteration accuracy; in particular, it can further improve the already high performance from combining the two scoring methods.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Chinese Transliteration with Comparable Corpora",
"sec_num": "3"
},
{
"text": "The English named entity candidate selection process was already described above. Candidate Chinese transliterations are generated by consulting a list of characters that are frequently used for transliterating foreign names. As discussed elsewhere (Sproat et al., 1996) , a subset of a few hundred characters (out of several thousand) tends to be used overwhelmingly for transliterating foreign names into Chinese. We use a list of 495 such characters, derived from various online dictionaries. A sequence of three or more characters from the list is taken as a possible name. If the character \" \" occurs, which is frequently used to represent the space between parts of an English name, then at least one character to the left and right of this character will be collected, even if the character in question is not in the list of \"foreign\" characters. Armed with the English and Chinese candidate lists, we then consider the pairing of every English candidate with every Chinese candidate. Obviously it would be impractical to do this for all of the candidates generated for, say, an entire year: we consider as plausible pairings those candidates that occur within a day of each other in the two corpora.",
"cite_spans": [
{
"start": 249,
"end": 270,
"text": "(Sproat et al., 1996)",
"ref_id": "BIBREF17"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Candidate Selection",
"sec_num": "3.1"
},
{
"text": "We adopt a source-channel model for scoring English-Chinese transliteration pairs. In general, we seek to estimate P (e|c), where e is a word in Roman script, and c is a word in Chinese script. Since Chinese transliteration is mostly based on pronunciation, we estimate P (e \u2032 |c \u2032 ), where e \u2032 is the pronunciation of e and c \u2032 is the pronunciation of c. Again following standard practice, we decompose the estimate of P (e \u2032 |c \u2032 ) as P (e \u2032 |c \u2032 ) =",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Candidate scoring based on pronunciation",
"sec_num": "3.2"
},
{
"text": "i P (e \u2032 i |c \u2032 i ).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Candidate scoring based on pronunciation",
"sec_num": "3.2"
},
{
"text": "Here, e \u2032 i is the ith subsequence of the English phone string, and c \u2032 i is the ith subsequence of the Chinese phone string. Since Chinese transliteration attempts to match the syllablesized characters to equivalent sounding spans of the English language, we fix the c \u2032 i to be syllables, and let the e \u2032 i range over all possible subsequences of the English phone string. For training data we have a small list of 721 names in Roman script and their Chinese equivalent. 3 Pronunciations for English words are obtained using the Festival text-tospeech system (Taylor et al., 1998) ; for Chinese, we use the standard pinyin transliteration of the characters. English-Chinese pairs in our training dictionary were aligned using the alignment algorithm from (Kruskal, 1999) , and a hand-derived set of 21 rules-of-thumb: for example, we have rules that encode the fact that Chinese /l/ can correspond to English /r/, /n/ or /er/; and that Chinese /w/ may be used to represent /v/. Given that there are over 400 syllables in Mandarin (not counting tone) and each of these syllables can match a large number of potential English phone spans, this is clearly not enough training data to cover all the parameters, and so we use Good-Turing estimation to estimate probabilities for unseen correspondences. Since we would like to filter implausible transliteration pairs we are less lenient than standard estimation techniques in that we are willing to assign zero probability to some correspondences. Thus we set a hard rule that for an English phone span to correspond to a Chinese syllable, the initial phone of the English span must have been seen in the training data as corresponding to the initial of the Chinese syllable some minimum number of times. For consonant-initial syllables we set the minimum to 4. We omit further details of our estimation technique for lack of space. This phonetic correspondence model can then be used to score putative transliteration pairs.",
"cite_spans": [
{
"start": 561,
"end": 582,
"text": "(Taylor et al., 1998)",
"ref_id": "BIBREF21"
},
{
"start": 757,
"end": 772,
"text": "(Kruskal, 1999)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Candidate scoring based on pronunciation",
"sec_num": "3.2"
},
{
"text": "Names of the same entity that occur in different languages often have correlated frequency patterns due to common triggers such as a major event. Thus if we have comparable news articles over a sufficiently long time period, it is possible to exploit such correlations to learn the associations of names in different languages. The idea of exploiting frequency correlation has been well studied. (See the previous work section.) We adopt the method proposed in (Tao and Zhai, 2005) , which works as follows: We pool all documents in a single day to form a large pseudo-document. Then, for each transliteration candidate (both Chinese and English), we compute its frequency in each of those pseudo-documents and obtain a raw frequency vector. We further normalize the raw frequency vector so that it becomes a frequency distribution over all the time points (days). In order to compute the similarity between two distribution vectors, The Pearson correlation coefficient was used in (Tao and Zhai, 2005) ; here we also considered two other commonly used measures -cosine (Salton and McGill, 1983) , and Jensen-Shannon divergence (Lin, 1991) , though our results show that Pearson correlation coefficient performs better than these two other methods.",
"cite_spans": [
{
"start": 461,
"end": 481,
"text": "(Tao and Zhai, 2005)",
"ref_id": "BIBREF19"
},
{
"start": 982,
"end": 1002,
"text": "(Tao and Zhai, 2005)",
"ref_id": "BIBREF19"
},
{
"start": 1070,
"end": 1095,
"text": "(Salton and McGill, 1983)",
"ref_id": "BIBREF16"
},
{
"start": 1128,
"end": 1139,
"text": "(Lin, 1991)",
"ref_id": "BIBREF11"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Candidate Scoring based on Frequency Correlation",
"sec_num": "3.3"
},
{
"text": "In both scoring methods described above, scoring of each candidate transliteration pair is independent of the other. As we have noted, document pairs that contain lots of plausible transliteration pairs should be viewed as more plausible document pairs; at the same time, in such a situation we should also trust the putative transliteration pairs more. Thus these document pairs and transliteration pairs mutually \"reinforce\" each other, and this can be exploited to further optimize our transliteration scores by allowing transliteration pairs to propagate their scores to each other according to their co-occurrence strengths.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Score Propagation",
"sec_num": "3.4"
},
{
"text": "Formally, suppose the current generation of transliteration scores are (e i , c i , w i ) i = 1, ..., n, where (e i , c i ) is a distinct pair of English and Chinese names. Note that although for any i = j, we have (e i , c i ) = (e j , c j ), it is possible that e i = e j or c i = c j for some i = j. w i is the transliteration score of (e i , c i ).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Score Propagation",
"sec_num": "3.4"
},
{
"text": "These pairs along with their co-occurrence relation computed based on our comparable corpora can be formally represented by a graph as shown in Figure 2 . In such a graph, a node represents (e i , c i , w i ). An edge between (e i , c i , w i ) and (e j , c j , w j ) is constructed iff (e i , c i ) and (e j , c j ) co-occur in a certain document pair (E t , C t ), i.e. there exists a document pair (E t , C t ), such that e i , e j \u2208 E t and c i , c j \u2208 C t . Given a node (e i , c i , w i ), we refer to all its directly-connected nodes as its \"neighbors\". The documents do not appear explicitly in the graph, but they implicitly affect the graph's topology and the weight of each edge. Our idea of score propagation can now be formulated as the following recursive equation for updating the scores of all the transliteration pairs.",
"cite_spans": [],
"ref_spans": [
{
"start": 144,
"end": 152,
"text": "Figure 2",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Score Propagation",
"sec_num": "3.4"
},
{
"text": "w (k) i = \u03b1 \u00d7 w (k\u22121) i + (1 \u2212 \u03b1) \u00d7 n j =i,j=1 (w (k\u22121) j \u00d7 P (j|i)), where w (k) i",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Score Propagation",
"sec_num": "3.4"
},
{
"text": "is the new score of the pair (e i , c i ) after an iteration, while w (k\u22121) i is its old score before updating; \u03b1 \u2208 [0, 1] is a parameter to control the overall amount of propagation (when \u03b1 = 1, no propagation occurs); P (j|i) is the conditional probability of propagating a score from node (e j , c j , w j ) to node (e i , c i , w i ).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Score Propagation",
"sec_num": "3.4"
},
{
"text": "We estimate P (j|i) in two different ways: 1) The number of cooccurrences in the whole collection (Denote as CO). P (j|i) = C(i,j) j \u2032 C(i,j \u2032 ) , where C(i, j) is the cooccurrence count of (e i , c i ) and (e j , c j ); 2) A mutual information-based method (Denote as MI). P (j|i) =",
"cite_spans": [
{
"start": 124,
"end": 130,
"text": "C(i,j)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Score Propagation",
"sec_num": "3.4"
},
{
"text": "M I(i,j) j \u2032 M I(i,j \u2032 )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Score Propagation",
"sec_num": "3.4"
},
{
"text": ", where M I(i, j) is the mutual information of (e i , c i ) and (e j , c j ). As we will show, the CO method works better. Note that the transition probabilities between indirect neighbors are always 0. Thus propagation only happens between direct neighbors. This formulation is very similar to PageRank, a link-based ranking algorithm for Web retrieval (Brin and Page, 1998) . However, our motivation is propagating scores to exploit cooccurrences, so we do not necessarily want the equation to converge. Indeed, our results show that although the initial iterations always help improve accuracy, too many iterations actually would decrease the performance.",
"cite_spans": [
{
"start": 354,
"end": 375,
"text": "(Brin and Page, 1998)",
"ref_id": "BIBREF1"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Score Propagation",
"sec_num": "3.4"
},
{
"text": "We use a comparable English-Chinese corpus to evaluate our methods for Chinese transliteration. We take one day's worth of comparable news articles (234 Chinese stories and 322 English stories), generate about 600 English names with the entity recognizer (Li et al., 2004) as described above, and find potential Chinese transliterations also as previously described. We generated 627 Chinese candidates. In principle, all these 600 \u00d7 627 pairs are potential transliterations. We then apply the phonetic and time correlation methods to score and rank all the candidate Chinese-English correspondences.",
"cite_spans": [
{
"start": 255,
"end": 272,
"text": "(Li et al., 2004)",
"ref_id": "BIBREF10"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation",
"sec_num": "4"
},
{
"text": "To evaluate the proposed transliteration methods quantitatively, we measure the accuracy of the ranked list by Mean Reciprocal Rank (MRR), a measure commonly used in information retrieval when there is precisely one correct answer (Kantor and Voorhees, 2000) . The reciprocal rank is the reciprocal of the rank of the correct answer. For example, if the correct answer is ranked as the first, the reciprocal rank would be 1.0, whereas if it is ranked the second, it would be 0.5, and so forth. To evaluate the results for a set of English names, we take the mean of the reciprocal rank of each English name.",
"cite_spans": [
{
"start": 231,
"end": 258,
"text": "(Kantor and Voorhees, 2000)",
"ref_id": "BIBREF6"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation",
"sec_num": "4"
},
{
"text": "We attempted to create a complete set of answers for all the English names in our test set, but a small number of English names do not seem to have any standard transliteration according to the resources that we consulted. We ended up with a list of about 490 out of the 600 English names judged. We further notice that some answers (about 20%) are not in our Chinese candidate set. This could be due to two reasons: (1) The answer does not occur in the Chinese news articles we look at. (2) The answer is there, but our candidate generation method has missed it. In order to see more clearly how accurate each method is for ranking the candidates, we also compute the MRR for the subset of English names whose transliteration answers are in our candidate list. We distinguish the MRRs computed on these two sets of English names as \"AllMRR\" and \"CoreMRR\".",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation",
"sec_num": "4"
},
{
"text": "Below we first discuss the results of each of the two methods. We then compare the two methods and discuss results from combining the two methods.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation",
"sec_num": "4"
},
{
"text": "We show sample results for the phonetic scoring method in Table 1. This table shows core names it is 0.89. Thus on average, the correct answer, if it is included in our candidate list, is ranked mostly as the first one.",
"cite_spans": [],
"ref_spans": [
{
"start": 58,
"end": 83,
"text": "Table 1. This table shows",
"ref_id": null
}
],
"eq_spans": [],
"section": "Phonetic Correspondence",
"sec_num": "4.1"
},
{
"text": "Similarity AllMRR CoreMRR Pearson 0.1360 0.3643 Cosine 0.1141 0.3015 JS-div 0.0785 0.2016 Table 2 : MRRs of the frequency correlation methods.",
"cite_spans": [],
"ref_spans": [
{
"start": 90,
"end": 97,
"text": "Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Frequency correlation",
"sec_num": "4.2"
},
{
"text": "We proposed three similarity measures for the frequency correlation method, i.e., the Cosine, Pearson coefficient, and Jensen-Shannon divergence. In Table 2 , we show their MRRs. Given that the only resource the method needs is comparable text documents over a sufficiently long period, these results are quite encouraging. For example, with Pearson correlation, when the Chinese transliteration of an English name is included in our candidate list, the correct answer is, on average, ranked at the 3rd place or better. The results thus show that the idea of exploiting frequency correlation does work. We also see that among the three similarity measures, Pearson correlation performs the best; it performs better than Cosine, which is better than JS-divergence.",
"cite_spans": [],
"ref_spans": [
{
"start": 149,
"end": 156,
"text": "Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Frequency correlation",
"sec_num": "4.2"
},
{
"text": "Compared with the phonetic correspondence method, the performance of the frequency correlation method is in general much worse, which is not surprising, given the fact that terms may be correlated merely because they are topically related. Table 3 : Effectiveness of combining the two scoring methods.",
"cite_spans": [],
"ref_spans": [
{
"start": 240,
"end": 247,
"text": "Table 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Frequency correlation",
"sec_num": "4.2"
},
{
"text": "Since the two methods exploit complementary resources, it is natural to see if we can improve performance by combining the two methods. Indeed, intuitively the best candidate is the one that has a good pronunciation alignment as well as a correlated frequency distribution with the English name. We evaluated two strategies for combining the two methods. The first strategy is to use the phonetic model to filter out (clearly impossible) candidates and then use the frequency correlation method to rank the candidates. The second is to combine the scores of these two methods. Since the correlation coefficient has a maximum value of 1, we normalize the phonetic correspondence score by dividing all scores by the maximum score so that the maximum normalized value is also 1. We then take the average of the two scores and rank the candidates based on their average scores. Note that the second strategy implies the application of the first strategy.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Combination of phonetic correspondence and frequency correlation",
"sec_num": "4.3"
},
{
"text": "The results of these two combination strategies are shown in Table 3 along with the results of the two individual methods. We see that both combination strategies are effective and the MRRs of the combined results are all better than those of the two individual methods. It is interesting to see that the benefit of applying the phonetic correspondence model as a filter is quite significant. Indeed, although the performance of the frequency correlation method alone is much worse than that of the phonetic correspondence method, when working on the subset of candidates passing the phonetic filter (i.e., those candidates that have a reasonable phonetic alignment with the English name), it can outperform the phonetic correspondence method. This once again indicates that exploiting the frequency correlation can be effective. When combining the scores of these two methods, we not only (implicitly) apply the phonetic filter, but also exploit the discriminative power provided by the phonetic correspondence scores and this is shown to bring in additional benefit, giving the best performance among all the methods.",
"cite_spans": [],
"ref_spans": [
{
"start": 61,
"end": 68,
"text": "Table 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Combination of phonetic correspondence and frequency correlation",
"sec_num": "4.3"
},
{
"text": "From the results above, we see that the MRRs for the core English names are substantially higher than those for all the English names. This means that our methods perform very well whenever we have the answer in our candidate list, but we have also missed the answers for many English names. The missing of an answer in the candidate list is thus a major source of errors. To further understand the upper bound of our method, we manually add the missing correct answers to our candidate set and apply all the methods to rank this augmented set of candidates. The performance is reported in Table 4 with the corresponding performance on the original candidate set. We see that, as expected, the performance on the augmented candidate list, which can be interpreted as an upper bound of our method, is indeed much better, suggesting that if we can somehow improve the candidate generation method to include the answers in the list, we can expect to significantly improve the performance for all the methods. This is clearly an interesting topic for further research. The relative performance of different methods on this augmented candidate list is roughly the same as on the original candidate list, except that the \"Freq+PhoneticFilter\" is slightly worse than that of the phonetic method alone, though it is still much better than the performance of the frequency correlation alone. One possible explanation may be that since these names do not necessarily occur in our comparable corpora, we may not have sufficient frequency observations for some of the names. Table 5 : Effectiveness of score propagation.",
"cite_spans": [],
"ref_spans": [
{
"start": 590,
"end": 597,
"text": "Table 4",
"ref_id": "TABREF4"
},
{
"start": 1563,
"end": 1570,
"text": "Table 5",
"ref_id": null
}
],
"eq_spans": [],
"section": "Error Analysis",
"sec_num": "4.4"
},
{
"text": "To demonstrate that score propagation can further help transliteration, we use the combination scores in Table 3 as the initial scores, and apply our propagation algorithm to iteratively update them. We remove the entries when they do not co-occur with others. There are 25 such English name candidates. Thus, the initial scores are actually slightly different from the values in Table 3 . We show the new scores and the best propagation scores in Table 5 . In the table, \"init.\" refers to the initial scores. and \"CO\" and \"MI\" stand for best scores obtained using either the co-occurrence or mutual information method. While both methods result in gains, CO very slightly outperforms the MI approach. In the score propagation process, we introduce two additional parameters: the interpolation parameter \u03b1 and the number of iterations k. Figure 3 and Figure 4 show the effects of these parameters. Intuitively, we want to preserve the initial score of a pair, but add a slight boost from its neighbors. Thus, we set \u03b1 very close to 1 (0.9 and 0.95), and allow the system to perform 20 iterations. In both figures, the first few iterations certainly leverage the transliteration, demonstrating that the propagation method works. However, we observe that the performance drops when more iterations are used, presumably due to noise introduced from more distantly connected nodes. Thus, a relatively conservative approach is to choose a high \u03b1 value, and run only a few iterations. Note, finally, that the CO method seems to be more stable than the MI method.",
"cite_spans": [],
"ref_spans": [
{
"start": 105,
"end": 112,
"text": "Table 3",
"ref_id": null
},
{
"start": 380,
"end": 387,
"text": "Table 3",
"ref_id": null
},
{
"start": 448,
"end": 455,
"text": "Table 5",
"ref_id": null
},
{
"start": 838,
"end": 846,
"text": "Figure 3",
"ref_id": null
},
{
"start": 851,
"end": 859,
"text": "Figure 4",
"ref_id": "FIGREF1"
}
],
"eq_spans": [],
"section": "Experiments on score propagation",
"sec_num": "4.5"
},
{
"text": "In this paper we have discussed the problem of Chinese-English name transliteration as one component of a system to find matching names in comparable corpora. We have proposed two methods for transliteration, one that is more traditional and based on phonetic correspondences, and one that is based on word distributions and adopts methods from information retrieval. We have shown Figure 3 : Propagation: Core items that both methods yield good results, and that even better results can be achieved by combining the methods. We have further showed that one can improve upon the combined model by using reinforcement via score propagation when transliteration pairs cluster together in document pairs. The work we report is ongoing. We are investigating transliterations among several language pairs, and are extending these methods to Korean, Arabic, Russian and Hindi -see (Tao et al., 2006) .",
"cite_spans": [
{
"start": 875,
"end": 893,
"text": "(Tao et al., 2006)",
"ref_id": "BIBREF20"
}
],
"ref_spans": [
{
"start": 382,
"end": 390,
"text": "Figure 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Conclusions and Future Work",
"sec_num": "5"
},
{
"text": "This work was funded by Dept. of the Interior contract NBCHC040176 (REFLEX). We also thank three anonymous reviewers for ACL06. ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgments",
"sec_num": "6"
},
{
"text": "Many names, particularly of organizations, may be translated rather than transliterated; the transliteration method we discuss here obviously will not account for such cases, though the time correlation and propagation methods we discuss will still be useful.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Available from the LDC via the English Gigaword (LDC2003T05) and Chinese Gigaword (LDC2003T09) corpora.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "The LDC provides a much larger list of transliterated Chinese-English names, but we did not use this here for two reasons. First, we have found it it be quite noisy. Secondly, we were interested in seeing how well one could do with a limited resource of just a few hundred names, which is a more realistic scenario for languages that have fewer resources than English and Chinese.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Resolving ambiguity for cross-language retrieval",
"authors": [
{
"first": "Lisa",
"middle": [],
"last": "Ballesteros",
"suffix": ""
},
{
"first": "W. Bruce",
"middle": [],
"last": "Croft",
"suffix": ""
}
],
"year": 1998,
"venue": "Research and Development in Information Retrieval",
"volume": "",
"issue": "",
"pages": "64--71",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Lisa Ballesteros and W. Bruce Croft. 1998. Resolv- ing ambiguity for cross-language retrieval. In Re- search and Development in Information Retrieval, pages 64-71.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems",
"authors": [
{
"first": "Sergey",
"middle": [],
"last": "Brin",
"suffix": ""
},
{
"first": "Lawrence",
"middle": [],
"last": "Page",
"suffix": ""
}
],
"year": 1998,
"venue": "",
"volume": "30",
"issue": "",
"pages": "107--117",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sergey Brin and Lawrence Page. 1998. The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems, 30:107- 117.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "The SNoW learning architecture",
"authors": [
{
"first": "A",
"middle": [],
"last": "Carlson",
"suffix": ""
},
{
"first": "C",
"middle": [],
"last": "Cumby",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Rosen",
"suffix": ""
},
{
"first": "D",
"middle": [],
"last": "Roth",
"suffix": ""
}
],
"year": 1999,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "A. Carlson, C. Cumby, J. Rosen, and D. Roth. 1999. The SNoW learning architecture. Technical Report UIUCDCS-R-99-2101, UIUC CS Dept.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Ad hoc and multilingual information retrieval at IBM",
"authors": [
{
"first": "Martin",
"middle": [],
"last": "Franz",
"suffix": ""
},
{
"first": "J",
"middle": [
"Scott"
],
"last": "Mccarley",
"suffix": ""
},
{
"first": "Salim",
"middle": [],
"last": "Roukos",
"suffix": ""
}
],
"year": 1998,
"venue": "Text REtrieval Conference",
"volume": "",
"issue": "",
"pages": "104--115",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Martin Franz, J. Scott McCarley, and Salim Roukos. 1998. Ad hoc and multilingual information retrieval at IBM. In Text REtrieval Conference, pages 104- 115.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "A pattern matching method for finding noun and proper noun translations from noisy parallel corpora",
"authors": [
{
"first": "Pascale",
"middle": [],
"last": "Fung",
"suffix": ""
}
],
"year": 1995,
"venue": "Proceedings of ACL 1995",
"volume": "",
"issue": "",
"pages": "236--243",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Pascale Fung. 1995. A pattern matching method for finding noun and proper noun translations from noisy parallel corpora. In Proceedings of ACL 1995, pages 236-243.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Phonemebased transliteration of foreign names for OOV problem",
"authors": [
{
"first": "W",
"middle": [],
"last": "Gao",
"suffix": ""
},
{
"first": "K.-F",
"middle": [],
"last": "Wong",
"suffix": ""
},
{
"first": "W",
"middle": [],
"last": "Lam",
"suffix": ""
}
],
"year": 2004,
"venue": "IJCNLP",
"volume": "",
"issue": "",
"pages": "374--381",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "W. Gao, K.-F. Wong, and W. Lam. 2004. Phoneme- based transliteration of foreign names for OOV problem. In IJCNLP, pages 374-381, Sanya, Hainan.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "The TREC-5 confusion track: Comparing retrieval methods for scanned text",
"authors": [
{
"first": "P",
"middle": [],
"last": "Kantor",
"suffix": ""
},
{
"first": "E",
"middle": [],
"last": "Voorhees",
"suffix": ""
}
],
"year": 2000,
"venue": "Information Retrieval",
"volume": "2",
"issue": "",
"pages": "165--176",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "P. Kantor and E. Voorhees. 2000. The TREC-5 confu- sion track: Comparing retrieval methods for scanned text. Information Retrieval, 2:165-176.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Text translation alignment",
"authors": [
{
"first": "M",
"middle": [],
"last": "Kay",
"suffix": ""
},
{
"first": "M",
"middle": [],
"last": "Roscheisen",
"suffix": ""
}
],
"year": 1993,
"venue": "Computational Linguistics",
"volume": "19",
"issue": "1",
"pages": "75--102",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "M. Kay and M. Roscheisen. 1993. Text translation alignment. Computational Linguistics, 19(1):75- 102.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Machine transliteration",
"authors": [
{
"first": "K",
"middle": [],
"last": "Knight",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Graehl",
"suffix": ""
}
],
"year": 1998,
"venue": "CL",
"volume": "",
"issue": "4",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "K. Knight and J. Graehl. 1998. Machine translitera- tion. CL, 24(4).",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "An overview of sequence comparison",
"authors": [
{
"first": "J",
"middle": [],
"last": "",
"suffix": ""
}
],
"year": 1999,
"venue": "Time Warps, String Edits, and Macromolecules",
"volume": "",
"issue": "",
"pages": "1--44",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "J. Kruskal. 1999. An overview of sequence compar- ison. In D. Sankoff and J. Kruskal, editors, Time Warps, String Edits, and Macromolecules, chapter 1, pages 1-44. CSLI, 2nd edition.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Robust reading: Identification and tracing of ambiguous names",
"authors": [
{
"first": "X",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "P",
"middle": [],
"last": "Morie",
"suffix": ""
},
{
"first": "D",
"middle": [],
"last": "Roth",
"suffix": ""
}
],
"year": 2004,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "X. Li, P. Morie, and D. Roth. 2004. Robust reading: Identification and tracing of ambiguous names. In NAACL-2004.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Divergence measures based on the shannon entropy",
"authors": [
{
"first": "J",
"middle": [],
"last": "Lin",
"suffix": ""
}
],
"year": 1991,
"venue": "IEEE Transactions on Information Theory",
"volume": "37",
"issue": "1",
"pages": "145--151",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "J. Lin. 1991. Divergence measures based on the shan- non entropy. IEEE Transactions on Information Theory, 37(1):145-151.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "A bootstrapping method for extracting bilingual text pairs",
"authors": [
{
"first": "H",
"middle": [],
"last": "Masuichi",
"suffix": ""
},
{
"first": "R",
"middle": [],
"last": "Flournoy",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Kaufmann",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Peters",
"suffix": ""
}
],
"year": 2000,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "H. Masuichi, R. Flournoy, S. Kaufmann, and S. Peters. 2000. A bootstrapping method for extracting bilin- gual text pairs.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Generating phonetic cognates to handle named entities in English-Chinese cross-languge spoken document retrieval",
"authors": [
{
"first": "H",
"middle": [
"M"
],
"last": "Meng",
"suffix": ""
},
{
"first": "W",
"middle": [],
"last": "Lo",
"suffix": ""
},
{
"first": "B",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "K",
"middle": [],
"last": "Tang",
"suffix": ""
}
],
"year": 2001,
"venue": "Proceedings of the Automatic Speech Recognition and Understanding Workshop",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "H.M. Meng, W.K Lo, B. Chen, and K. Tang. 2001. Generating phonetic cognates to handle named enti- ties in English-Chinese cross-languge spoken doc- ument retrieval. In Proceedings of the Automatic Speech Recognition and Understanding Workshop.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Identifying word translations in nonparallel texts",
"authors": [
{
"first": "R",
"middle": [],
"last": "Rapp",
"suffix": ""
}
],
"year": 1995,
"venue": "Proceedings of ACL 1995",
"volume": "",
"issue": "",
"pages": "320--322",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "R. Rapp. 1995. Identifying word translations in non- parallel texts. In Proceedings of ACL 1995, pages 320-322.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Bilingual terminology acquisition from comparable corpora and phrasal translation to crosslanguage information retrieval",
"authors": [
{
"first": "Fatiha",
"middle": [],
"last": "Sadat",
"suffix": ""
},
{
"first": "Masatoshi",
"middle": [],
"last": "Yoshikawa",
"suffix": ""
},
{
"first": "Shunsuke",
"middle": [],
"last": "Uemura",
"suffix": ""
}
],
"year": 2003,
"venue": "ACL '03",
"volume": "",
"issue": "",
"pages": "141--144",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Fatiha Sadat, Masatoshi Yoshikawa, and Shunsuke Ue- mura. 2003. Bilingual terminology acquisition from comparable corpora and phrasal translation to cross- language information retrieval. In ACL '03, pages 141-144.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Introduction to Modern Information Retrieval",
"authors": [
{
"first": "G",
"middle": [],
"last": "Salton",
"suffix": ""
},
{
"first": "M",
"middle": [],
"last": "Mcgill",
"suffix": ""
}
],
"year": 1983,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "G. Salton and M. McGill. 1983. Introduction to Mod- ern Information Retrieval. McGraw-Hill.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "A stochastic finite-state word-segmentation algorithm for Chinese",
"authors": [
{
"first": "R",
"middle": [],
"last": "Sproat",
"suffix": ""
},
{
"first": "C",
"middle": [],
"last": "Shih",
"suffix": ""
},
{
"first": "W",
"middle": [],
"last": "Gale",
"suffix": ""
},
{
"first": "N",
"middle": [],
"last": "Chang",
"suffix": ""
}
],
"year": 1996,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "R. Sproat, C. Shih, W. Gale, and N. Chang. 1996. A stochastic finite-state word-segmentation algorithm for Chinese. CL, 22(3).",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Extraction of lexical translation from non-aligned corpora",
"authors": [
{
"first": "K",
"middle": [],
"last": "Tanaka",
"suffix": ""
},
{
"first": "H",
"middle": [],
"last": "Iwasaki",
"suffix": ""
}
],
"year": 1996,
"venue": "Proceedings of COLING",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "K. Tanaka and H. Iwasaki. 1996. Extraction of lexical translation from non-aligned corpora. In Proceed- ings of COLING 1996.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Mining comparable bilingual text corpora for cross-language information integration",
"authors": [
{
"first": "Tao",
"middle": [],
"last": "Tao",
"suffix": ""
},
{
"first": "Chengxiang",
"middle": [],
"last": "Zhai",
"suffix": ""
}
],
"year": 2005,
"venue": "KDD'05",
"volume": "",
"issue": "",
"pages": "691--696",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Tao Tao and ChengXiang Zhai. 2005. Mining compa- rable bilingual text corpora for cross-language infor- mation integration. In KDD'05, pages 691-696.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Unsupervised named entity transliteration using temporal and phonetic correlation",
"authors": [
{
"first": "Tao",
"middle": [],
"last": "Tao",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Su-Youn",
"suffix": ""
},
{
"first": "Andrew",
"middle": [],
"last": "Yoon",
"suffix": ""
},
{
"first": "Richard",
"middle": [],
"last": "Fister",
"suffix": ""
},
{
"first": "Chengxiang",
"middle": [],
"last": "Sproat",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Zhai",
"suffix": ""
}
],
"year": 2006,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Tao Tao, Su-Youn Yoon, Andrew Fister, Richard Sproat, and ChengXiang Zhai. 2006. Unsupervised named entity transliteration using temporal and pho- netic correlation. In EMNLP 2006, Sydney, July.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "The architecture of the Festival speech synthesis system",
"authors": [
{
"first": "P",
"middle": [],
"last": "Taylor",
"suffix": ""
},
{
"first": "A",
"middle": [],
"last": "Black",
"suffix": ""
},
{
"first": "R",
"middle": [],
"last": "Caley",
"suffix": ""
}
],
"year": 1998,
"venue": "Proceedings of the Third ESCA Workshop on Speech Synthesis",
"volume": "",
"issue": "",
"pages": "147--151",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "P. Taylor, A. Black, and R. Caley. 1998. The archi- tecture of the Festival speech synthesis system. In Proceedings of the Third ESCA Workshop on Speech Synthesis, pages 147-151, Jenolan Caves, Australia.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Using the web for automated translation extraction in cross-language information retrieval",
"authors": [
{
"first": "Ying",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Phil",
"middle": [],
"last": "Vines",
"suffix": ""
}
],
"year": 2004,
"venue": "SIGIR '04",
"volume": "",
"issue": "",
"pages": "162--169",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ying Zhang and Phil Vines. 2004. Using the web for automated translation extraction in cross-language information retrieval. In SIGIR '04, pages 162-169.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"type_str": "figure",
"num": null,
"uris": null,
"text": "Graph representing transliteration pairs and cooccurence relations."
},
"FIGREF1": {
"type_str": "figure",
"num": null,
"uris": null,
"text": "Propagation: All items"
},
"TABREF0": {
"content": "<table><tr><td>. . .</td><td>\u00fc \u00f5 , \u00f7 \u00f5\u00f3 , \u00f5,</td><td>\u00fb \u00f9 4 ,\u00f0\u00f5 . . . \u00fb \u00f9 11:1 11:2 11:9 \u00f8 \u00fe 11:4 11:1\u00f9</td></tr></table>",
"num": null,
"html": null,
"text": "Dai Yun Nips World No. 1 Martin to Shake off Olympic Shadow . . . In the day's other matches, second seed Zhou Mi overwhelmed Ling Wan Ting of Hong Kong, China 11-4, 11-4, Zhang Ning defeat Judith Meulendijks of Netherlands 11-2, 11-9 and third seed Gong Ruina took 21 minutes to eliminate Tine Rasmussen of Denmark 11-1, 11-1, enabling China to claim five quarterfinal places in the women's singles.",
"type_str": "table"
},
"TABREF1": {
"content": "<table><tr><td>iraq staub</td><td>\u00fd \u00f5</td><td>\u00f5</td><td>pei-lei-si yi-la-ke si-ta-bo</td><td>3.51 3.74 4.45</td></tr><tr><td>canada belfast</td><td colspan=\"4\">jia-na-da \u00f0 \u00f5 bei-er-fa-si-te 4.90 4.85</td></tr><tr><td>fischer</td><td/><td/><td>fei-she-er</td><td>4.91</td></tr><tr><td>philippine</td><td/><td/><td>fei-l\u00fc-bin</td><td>4.97</td></tr><tr><td>lesotho * tirana</td><td colspan=\"2\">\u00f3</td><td>lai-suo-two tye-lu-na</td><td>5.12 5.15</td></tr><tr><td>freeman</td><td/><td/><td>fu-li-man</td><td>5.26</td></tr><tr><td colspan=\"5\">Table 1: Ten highest-scoring matches for the Xin-</td></tr><tr><td colspan=\"5\">hua corpus for 8/13/01. The final column is the</td></tr><tr><td colspan=\"5\">\u2212log P estimate for the transliteration. Starred</td></tr><tr><td colspan=\"3\">entries are incorrect.</td><td/><td/></tr></table>",
"num": null,
"html": null,
"text": "the 10 highest scoring transliterations for each Chinese character sequence based on all texts in the Chinese and English Xinhua newswire for the 13th ofAugust, 2001. 8 out of these 10 are correct. For all the English names the MRR is 0.3, and for the * paris",
"type_str": "table"
},
"TABREF4": {
"content": "<table/>",
"num": null,
"html": null,
"text": "MRRs on the augmented candidate list.",
"type_str": "table"
},
"TABREF5": {
"content": "<table><tr><td>Method</td><td>AllMRR</td><td/><td/><td>CoreMRR</td><td/></tr><tr><td>init.</td><td>CO</td><td>MI</td><td>init.</td><td>CO</td><td>MI</td></tr><tr><td>Freq+PhoneticFilter 0</td><td/><td/><td/><td/><td/></tr></table>",
"num": null,
"html": null,
"text": ".3171 0.3255 0.3255 0.9058 0.9372 0.9372 Freq+PhoneticScore 0.3290 0.3373 0.3392 0.9422 0.9659 0.9573",
"type_str": "table"
}
}
}
} |