File size: 86,974 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 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 | {
"paper_id": "P06-1011",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T09:26:47.455073Z"
},
"title": "Extracting Parallel Sub-Sentential Fragments from Non-Parallel Corpora",
"authors": [
{
"first": "Stefan",
"middle": [],
"last": "Dragos",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Southern California Information Sciences Institute",
"location": {
"addrLine": "4676 Admiralty Way, Suite 1001 Marina del Rey",
"postCode": "90292",
"region": "CA"
}
},
"email": "dragos@isi.edu"
},
{
"first": "",
"middle": [],
"last": "Munteanu",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Southern California Information Sciences Institute",
"location": {
"addrLine": "4676 Admiralty Way, Suite 1001 Marina del Rey",
"postCode": "90292",
"region": "CA"
}
},
"email": ""
},
{
"first": "Daniel",
"middle": [],
"last": "Marcu",
"suffix": "",
"affiliation": {},
"email": "marcu@isi.edu"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "We present a novel method for extracting parallel sub-sentential fragments from comparable, non-parallel bilingual corpora. By analyzing potentially similar sentence pairs using a signal processinginspired approach, we detect which segments of the source sentence are translated into segments in the target sentence, and which are not. This method enables us to extract useful machine translation training data even from very non-parallel corpora, which contain no parallel sentence pairs. We evaluate the quality of the extracted data by showing that it improves the performance of a state-of-the-art statistical machine translation system.",
"pdf_parse": {
"paper_id": "P06-1011",
"_pdf_hash": "",
"abstract": [
{
"text": "We present a novel method for extracting parallel sub-sentential fragments from comparable, non-parallel bilingual corpora. By analyzing potentially similar sentence pairs using a signal processinginspired approach, we detect which segments of the source sentence are translated into segments in the target sentence, and which are not. This method enables us to extract useful machine translation training data even from very non-parallel corpora, which contain no parallel sentence pairs. We evaluate the quality of the extracted data by showing that it improves the performance of a state-of-the-art statistical machine translation system.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Recently, there has been a surge of interest in the automatic creation of parallel corpora. Several researchers (Zhao and Vogel, 2002; Vogel, 2003; Resnik and Smith, 2003; Fung and Cheung, 2004a; Wu and Fung, 2005; Munteanu and Marcu, 2005) have shown how fairly good-quality parallel sentence pairs can be automatically extracted from comparable corpora, and used to improve the performance of machine translation (MT) systems. This work addresses a major bottleneck in the development of Statistical MT (SMT) systems: the lack of sufficiently large parallel corpora for most language pairs. Since comparable corpora exist in large quantities and for many languages -tens of thousands of words of news describing the same events are produced daily -the ability to exploit them for parallel data acquisition is highly beneficial for the SMT field.",
"cite_spans": [
{
"start": 112,
"end": 134,
"text": "(Zhao and Vogel, 2002;",
"ref_id": "BIBREF27"
},
{
"start": 135,
"end": 147,
"text": "Vogel, 2003;",
"ref_id": "BIBREF25"
},
{
"start": 148,
"end": 171,
"text": "Resnik and Smith, 2003;",
"ref_id": "BIBREF20"
},
{
"start": 172,
"end": 195,
"text": "Fung and Cheung, 2004a;",
"ref_id": "BIBREF5"
},
{
"start": 196,
"end": 214,
"text": "Wu and Fung, 2005;",
"ref_id": "BIBREF26"
},
{
"start": 215,
"end": 240,
"text": "Munteanu and Marcu, 2005)",
"ref_id": "BIBREF14"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Comparable corpora exhibit various degrees of parallelism. Fung and Cheung (2004a) describe corpora ranging from noisy parallel, to comparable, and finally to very non-parallel. Corpora from the last category contain \"... disparate, very nonparallel bilingual documents that could either be on the same topic (on-topic) or not\". This is the kind of corpora that we are interested to exploit in the context of this paper.",
"cite_spans": [
{
"start": 59,
"end": 82,
"text": "Fung and Cheung (2004a)",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Existing methods for exploiting comparable corpora look for parallel data at the sentence level. However, we believe that very non-parallel corpora have none or few good sentence pairs; most of their parallel data exists at the sub-sentential level. As an example, consider Figure 1 , which presents two news articles from the English and Romanian editions of the BBC. The articles report on the same event (the one-year anniversary of Ukraine's Orange Revolution), have been published within 25 minutes of each other, and express overlapping content.",
"cite_spans": [],
"ref_spans": [
{
"start": 274,
"end": 282,
"text": "Figure 1",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Although they are \"on-topic\", these two documents are non-parallel. In particular, they contain no parallel sentence pairs; methods designed to extract full parallel sentences will not find any useful data in them. Still, as the lines and boxes from the figure show, some parallel fragments of data do exist; but they are present at the sub-sentential level.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In this paper, we present a method for extracting such parallel fragments from comparable corpora. Figure 2 illustrates our goals. It shows two sentences belonging to the articles in Figure 1 , and highlights and connects their parallel fragments.",
"cite_spans": [],
"ref_spans": [
{
"start": 99,
"end": 107,
"text": "Figure 2",
"ref_id": "FIGREF1"
},
{
"start": 183,
"end": 191,
"text": "Figure 1",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Although the sentences share some common meaning, each of them has content which is not translated on the other side. The English phrase reports the BBC's Helen Fawkes in Kiev, as well as the Romanian one De altfel, vorbind inaintea aniversarii have no translation correspondent, either in the other sentence or anywhere in the whole document. Since the sentence pair contains so much untranslated text, it is unlikely that any parallel sentence detection method would consider it useful. And, even if the sentences would be used for MT training, considering the amount of noise they contain, they might do more harm than good for the system's performance. The best way to make use of this sentence pair is to extract and use for training just the translated (highlighted) fragments. This is the aim of our work.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Identifying parallel subsentential fragments is a difficult task. It requires the ability to recognize translational equivalence in very noisy environments, namely sentence pairs that express different (although overlapping) content. However, a good solution to this problem would have a strong impact on parallel data acquisition efforts. Enabling the exploitation of corpora that do not share parallel sentences would greatly increase the amount of comparable data that can be used for SMT.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Fragments in Comparable Corpora",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Finding Parallel Sub-Sentential",
"sec_num": "2"
},
{
"text": "The high-level architecture of our parallel fragment extraction system is presented in Figure 3 . The first step of the pipeline identifies document pairs that are similar (and therefore more likely to contain parallel data), using the Lemur information retrieval toolkit 1 (Ogilvie and Callan, 2001) ; each document in the source language is translated word-for-word and turned into a query, which is run against the collection of target language documents. The top 20 results are retrieved and paired with the query document. We then take all sentence pairs from these document pairs and run them through the second step in the pipeline, the candidate selection filter. This step discards pairs which have very few words that are translations of each other. To all remaining sentence pairs we apply the fragment detection method (described in Section 2.3), which produces the output of the system.",
"cite_spans": [
{
"start": 274,
"end": 300,
"text": "(Ogilvie and Callan, 2001)",
"ref_id": "BIBREF17"
}
],
"ref_spans": [
{
"start": 87,
"end": 95,
"text": "Figure 3",
"ref_id": "FIGREF2"
}
],
"eq_spans": [],
"section": "Introduction",
"sec_num": "2.1"
},
{
"text": "We use two probabilistic lexicons, learned au- The first one, GIZA-Lex, is obtained by running the GIZA++ 2 implementation of the IBM word alignment models (Brown et al., 1993) on the initial parallel corpus. One of the characteristics of this lexicon is that each source word is associated with many possible translations. Although most of its high-probability entries are good translations, there are a lot of entries (of non-negligible probability) where the two words are at most related. As an example, in our GIZA-Lex lexicon, each source word has an average of 12 possible translations. This characteristic is useful for the first two stages of the extraction pipeline, which are not intended to be very precise. Their purpose is to accept most of the existing parallel data, and not too much of the non-parallel data; using such a lexicon helps achieve this purpose. For the last stage, however, precision is paramount. We found empirically that when using GIZA-Lex, the incorrect correspondences that it contains seriously impact the quality of our results; we therefore need a cleaner lexicon. In addition, since we want to distinguish between source words that have a translation on the target side and words that do not, we also need a measure of the probability that two words are not translations of each other. All these are part of our second lexicon, LLR-Lex, which we present in detail in Section 2.2. Subsequently, in Section 2.3, we present our algorithm for detecting parallel sub-sentential fragments.",
"cite_spans": [
{
"start": 156,
"end": 176,
"text": "(Brown et al., 1993)",
"ref_id": "BIBREF0"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "2.1"
},
{
"text": "Our method for computing the probabilistic translation lexicon LLR-Lex is based on the the Log-",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Using Log-Likelihood-Ratios to Estimate Word Translation Probabilities",
"sec_num": "2.2"
},
{
"text": "2 http://www.fjoch.com/GIZA++.html",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Using Log-Likelihood-Ratios to Estimate Word Translation Probabilities",
"sec_num": "2.2"
},
{
"text": "Likelihood-Ratio (LLR) statistic (Dunning, 1993) , which has also been used by Moore (2004a; 2004b) and Melamed (2000) as a measure of word association. Generally speaking, this statistic gives a measure of the likelihood that two samples are not independent (i.e. generated by the same probability distribution). We use it to estimate the independence of pairs of words which cooccur in our parallel corpus.",
"cite_spans": [
{
"start": 33,
"end": 48,
"text": "(Dunning, 1993)",
"ref_id": "BIBREF4"
},
{
"start": 79,
"end": 92,
"text": "Moore (2004a;",
"ref_id": "BIBREF12"
},
{
"start": 93,
"end": 99,
"text": "2004b)",
"ref_id": "BIBREF13"
},
{
"start": 104,
"end": 118,
"text": "Melamed (2000)",
"ref_id": "BIBREF11"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Using Log-Likelihood-Ratios to Estimate Word Translation Probabilities",
"sec_num": "2.2"
},
{
"text": "If source word and target word \u00a1 are independent (i.e. they are not translations of each other), we would expect that",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Using Log-Likelihood-Ratios to Estimate Word Translation Probabilities",
"sec_num": "2.2"
},
{
"text": "\u00a2 \u00a4 \u00a3 \u00a5 \u00a1 \u00a7 \u00a6 \u00a9 \u00a2 \u00a4 \u00a3 \u00a5 \u00a1 \u00a7 \u00a6 \u00a9 \u00a2 \u00a4 \u00a3 \u00a5 \u00a1 , i.e. the distribution of \u00a1",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Using Log-Likelihood-Ratios to Estimate Word Translation Probabilities",
"sec_num": "2.2"
},
{
"text": "given that is present is the same as the distribution of \u00a1 when is not present. The LLR statistic gives a measure of the likelihood of this hypothesis. The LLR score of a word pair is low when these two distributions are very similar (i.e. the words are independent), and high otherwise (i.e. the words are strongly associated). However, high LLR scores can indicate either a positive association (i.e.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Using Log-Likelihood-Ratios to Estimate Word Translation Probabilities",
"sec_num": "2.2"
},
{
"text": "\u00a5 \u00a1 \u00a6 \u00a9 \u00a2 \u00a4 \u00a3 \u00a5 \u00a1 \u00a7 \u00a6 \u00a9",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a2 \u00a4 \u00a3",
"sec_num": null
},
{
"text": ") or a negative one; and we can distinguish between them by checking whether",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a2 \u00a4 \u00a3",
"sec_num": null
},
{
"text": "\u00a2 \u00a4 \u00a3 \u00a5 \u00a1 \u00a9 \u00a2 \u00a4 \u00a3 \u00a5 \u00a1\u00a2 ! \u00a3 \u00a9 .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a2 \u00a4 \u00a3",
"sec_num": null
},
{
"text": "Thus, we can split the set of cooccurring word pairs into positively and negatively associated pairs, and obtain a measure for each of the two association types. The first type of association will provide us with our (cleaner) lexicon, while the second will allow us to estimate probabilities of words not being translations of each other.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a2 \u00a4 \u00a3",
"sec_num": null
},
{
"text": "Before describing our new method more formally, we address the notion of word cooccurrence. In the work of Moore (2004a) and Melamed (2000) , two words cooccur if they are present in a pair of aligned sentences in the parallel training corpus. However, most of the words from aligned sentences are actually unrelated; therefore, this is a rather weak notion of cooccurrence. We follow Resnik et. al (2001) and adopt a stronger definition, based not on sentence alignment but on word alignment: two words cooccur if they are linked together in the word-aligned parallel training corpus. We thus make use of the significant amount of knowledge brought in by the word alignment procedure.",
"cite_spans": [
{
"start": 107,
"end": 120,
"text": "Moore (2004a)",
"ref_id": "BIBREF12"
},
{
"start": 125,
"end": 139,
"text": "Melamed (2000)",
"ref_id": "BIBREF11"
},
{
"start": 385,
"end": 405,
"text": "Resnik et. al (2001)",
"ref_id": "BIBREF21"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a2 \u00a4 \u00a3",
"sec_num": null
},
{
"text": "We compute",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a2 \u00a4 \u00a3",
"sec_num": null
},
{
"text": "\" # \" % $ & \u00a3 \u00a5 \u00a1 \u00a9",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a2 \u00a4 \u00a3",
"sec_num": null
},
{
"text": ", the LLR score for words \u00a1 and , using the formula presented by Moore (2004b) , which we do not repeat here due to lack of space. We then use these values to compute two conditional probability distributions:",
"cite_spans": [
{
"start": 65,
"end": 78,
"text": "Moore (2004b)",
"ref_id": "BIBREF13"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a2 \u00a4 \u00a3",
"sec_num": null
},
{
"text": "' ( \u00a3 \u00a5 \u00a1 \u00a6 \u00a9",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a2 \u00a4 \u00a3",
"sec_num": null
},
{
"text": ", the probability that source word trans- ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a2 \u00a4 \u00a3",
"sec_num": null
},
{
"text": "' \u00a1 \u00a3 \u00a5 \u00a1 \u00a6 \u00a9",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a2 \u00a4 \u00a3",
"sec_num": null
},
{
"text": ", the probability that does not translate into",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a2 \u00a4 \u00a3",
"sec_num": null
},
{
"text": ". We obtain the distributions by normalizing the LLR scores for each source word.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a1",
"sec_num": null
},
{
"text": "The whole procedure follows: \u00a2 Word-align the parallel corpus. Following Och and Ney 2003, we run GIZA++ in both directions, and then symmetrize the alignments using the refined heuristic.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a1",
"sec_num": null
},
{
"text": "Compute all LLR scores. There will be an LLR score for each pair of words which are linked at least once in the word-aligned corpus distributions, we reverse the source and target languages and repeat the procedure.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a2",
"sec_num": null
},
{
"text": "\u00a2 Classify all \" % \" # $ & \u00a3 \u00a5 \u00a1 \u00a9 as either \" # \" % $ ( \u00a3 \u00a5 \u00a1 \u00a9 (positive association) if \u00a2 \u00a4 \u00a3 \u00a5 \u00a1 \u00a9 \u00a2 \u00a4 \u00a3 \u00a5 \u00a1\u00a2 ! \u00a3 \u00a9 , or \" % \" # $ \u00a3 \u00a5 \u00a1 \u00a9 (",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a2",
"sec_num": null
},
{
"text": "As we mentioned above, in GIZA-Lex the average number of possible translations for a source word is 12. In LLR-Lex that average is 5, which is a significant decrease.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u00a2",
"sec_num": null
},
{
"text": "Intuitively speaking, our method tries to distinguish between source fragments that have a translation on the target side, and fragments that do not. In Figure 4 we show the sentence pair from Figure 2, in which we have underlined those words of each sentence that have a translation in the other sentence, according to our lexicon LLR-Lex. The phrases \"to focus on the past year's achievements, which,\" and \"sa se concentreze pe succesele anului trecut, care,\" are mostly underlined (the lexicon is unaware of the fact that \"achievements\" and \"succesele\" are in fact translations of each other, because \"succesele\" is a morphologically inflected form which does not cooccur with \"achievements\" in our initial parallel corpus). The rest of the sentences are mostly not underlined, although we do have occasional connections, some correct and some wrong. The best we can do in this case is to infer that these two phrases are parallel, and discard the rest. Doing this gains us some new knowledge: the lexicon entry (achievements, succesele). We need to quantify more precisely the notions of \"mostly translated\" and \"mostly not translated\". Our approach is to consider the target sentence as a numeric signal, where translated words correspond to positive values (coming from the ' ( distribution described in the previous Section), and the others to negative ones (coming from the ' \u00a8 distribution). We want to retain the parts of the sentence where the signal is mostly positive. This can be achieved by applying a smoothing filter to the signal, and selecting those fragments of the sentence for which the corresponding filtered values are positive.",
"cite_spans": [],
"ref_spans": [
{
"start": 153,
"end": 161,
"text": "Figure 4",
"ref_id": "FIGREF3"
},
{
"start": 193,
"end": 199,
"text": "Figure",
"ref_id": null
}
],
"eq_spans": [],
"section": "Detecting Parallel Sub-Sentential Fragments",
"sec_num": "2.3"
},
{
"text": "The details of the procedure are presented below, and also illustrated in Figure 5 . Let the Romanian sentence be the source sentence \u00a9 , and the English one be the target, . We compute a word alignment \u00a9 by greedily linking each English word with its best translation candidate from the Romanian sentence. For each of the linked target words, the corresponding signal value is the probability of the link (there can be at most one link for each target word). Thus, if target word \u00a1 is linked to source word , the signal value corresponding to",
"cite_spans": [],
"ref_spans": [
{
"start": 74,
"end": 82,
"text": "Figure 5",
"ref_id": "FIGREF4"
}
],
"eq_spans": [],
"section": "Detecting Parallel Sub-Sentential Fragments",
"sec_num": "2.3"
},
{
"text": "\u00a1 is ' ( \u00a3 \u00a5 \u00a1 \u00a7 \u00a6 \u00a9",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Detecting Parallel Sub-Sentential Fragments",
"sec_num": "2.3"
},
{
"text": "(the distribution described in Section 2.2), i.e. the probability that \u00a1 is the translation of .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Detecting Parallel Sub-Sentential Fragments",
"sec_num": "2.3"
},
{
"text": "For the remaining target words, the signal value should reflect the probability that they are not . This is the initial signal. We obtain the filtered signal by applying an averaging filter, which sets the value at each point to be the average of several values surrounding it. In our experiments, we use the surrounding 5 values, which produced good results on a development set. We then simply retain the \"positive fragments\" of , i.e. those fragments for which the corresponding filtered signal values are positive.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Detecting Parallel Sub-Sentential Fragments",
"sec_num": "2.3"
},
{
"text": "However, this approach will often produce short \"positive fragments\" which are not, in fact, translated in the source sentence. An example of this is the fragment \", reports\" from Figure 5 , which although corresponds to positive values of the filtered signal, has no translation in Romanian. In an attempt to avoid such errors, we disregard fragments with less than 3 words.",
"cite_spans": [],
"ref_spans": [
{
"start": 180,
"end": 188,
"text": "Figure 5",
"ref_id": "FIGREF4"
}
],
"eq_spans": [],
"section": "Detecting Parallel Sub-Sentential Fragments",
"sec_num": "2.3"
},
{
"text": "We repeat the procedure in the other direction ( \u00a9 ) to obtain the fragments for , and consider the resulting two text chunks as parallel.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Detecting Parallel Sub-Sentential Fragments",
"sec_num": "2.3"
},
{
"text": "For the sentence pair from Figure 5 , our system will output the pair: people to focus on the past year's achievements, which, he says sa se concentreze pe succesele anului trecut, care, printre",
"cite_spans": [],
"ref_spans": [
{
"start": 27,
"end": 35,
"text": "Figure 5",
"ref_id": "FIGREF4"
}
],
"eq_spans": [],
"section": "Detecting Parallel Sub-Sentential Fragments",
"sec_num": "2.3"
},
{
"text": "In our experiments, we compare our fragment extraction method (which we call FragmentExtract) with the sentence extraction approach of Munteanu and Marcu (2005) (SentenceExtract). All extracted datasets are evaluated by using them as additional MT training data and measuring their impact on the performance of the MT system.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experiments",
"sec_num": "3"
},
{
"text": "We perform experiments in the context of Romanian to English machine translation. We use two initial parallel corpora. One is the training data for the Romanian-English word alignment task from the Workshop on Building and Using Parallel Corpora 3 which has approximately 1M English words. The other contains additional data We downloaded comparable data from three online news sites: the BBC, and the Romanian newspapers \"Evenimentul Zilei\" and \"Ziua\". The BBC corpus is precisely the kind of corpus that our method is designed to exploit. It is truly nonparallel; as our example from Figure 1 shows, even closely related documents have few or no parallel sentence pairs. Therefore, we expect that our extraction method should perform best on this corpus.",
"cite_spans": [],
"ref_spans": [
{
"start": 586,
"end": 594,
"text": "Figure 1",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Corpora",
"sec_num": "3.1"
},
{
"text": "The other two sources are fairly similar, both in genre and in degree of parallelism, so we group them together and refer to them as the EZZ corpus. This corpus exhibits a higher degree of parallelism than the BBC one; in particular, it contains many article pairs which are literal translations of each other. Therefore, although our subsentence extraction method should produce useful data from this corpus, we expect the sentence extraction method to be more successful. Using this second corpus should help highlight the strengths and weaknesses of our approach. Table 1 summarizes the relevant information concerning these corpora.",
"cite_spans": [],
"ref_spans": [
{
"start": 567,
"end": 574,
"text": "Table 1",
"ref_id": "TABREF1"
}
],
"eq_spans": [],
"section": "Corpora",
"sec_num": "3.1"
},
{
"text": "On each of our comparable corpora, and using each of our initial parallel corpora, we apply both the fragment extraction and the sentence extraction method of Munteanu and Marcu (2005) . In order to evaluate the importance of the LLR-Lex lexicon, we also performed fragment extraction experiments that do not use this lexicon, but only GIZA-Lex. Thus, for each initial parallel corpus and each comparable corpus, we extract three datasets: FragmentExtract, SentenceExtract, and Fragment-noLLR. The sizes of the extracted datasets, measured in million English tokens, are presented in Table 2 . Table 2 : Sizes of the extracted datasets.",
"cite_spans": [
{
"start": 159,
"end": 184,
"text": "Munteanu and Marcu (2005)",
"ref_id": "BIBREF14"
}
],
"ref_spans": [
{
"start": 584,
"end": 591,
"text": "Table 2",
"ref_id": null
},
{
"start": 594,
"end": 601,
"text": "Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Extraction Experiments",
"sec_num": "3.2"
},
{
"text": "We evaluate our extracted corpora by measuring their impact on the performance of an SMT system. We use the initial parallel corpora to train Baseline systems; and then train comparative systems using the initial corpora plus: the Frag-mentExtract corpora; the SentenceExtract corpora; and the FragmentExtract-noLLR corpora. In order to verify whether the fragment and sentence detection method complement each other, we also train a Fragment+Sentence system, on the initial corpus plus FragmentExtract and SentenceExtract.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SMT Performance Results",
"sec_num": "3.3"
},
{
"text": "All MT systems are trained using a variant of the alignment template model of Och and Ney (2004) . All systems use the same 2 language models: one trained on 800 million English tokens, and one trained on the English side of all our parallel and comparable corpora. This ensures that differences in performance are caused only by differences in the parallel training data.",
"cite_spans": [
{
"start": 78,
"end": 96,
"text": "Och and Ney (2004)",
"ref_id": "BIBREF16"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "SMT Performance Results",
"sec_num": "3.3"
},
{
"text": "Our test data consists of news articles from the Time Bank corpus, which were translated into Romanian, and has 1000 sentences. Translation performance is measured using the automatic BLEU (Papineni et al., 2002) metric, on one reference translation. We report BLEU% numbers, i.e. we multiply the original scores by 100. The 95% confidence intervals of our scores, computed by bootstrap resampling (Koehn, 2004) , indicate that a score increase of more than 1 BLEU% is statistically significant.",
"cite_spans": [
{
"start": 189,
"end": 212,
"text": "(Papineni et al., 2002)",
"ref_id": "BIBREF18"
},
{
"start": 398,
"end": 411,
"text": "(Koehn, 2004)",
"ref_id": "BIBREF10"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "SMT Performance Results",
"sec_num": "3.3"
},
{
"text": "The scores are presented in Figure 6 . On the BBC corpus, the fragment extraction method produces statistically significant improvements over the baseline, while the sentence extraction method does not. Training on both datasets together brings further improvements. This indicates that this corpus has few parallel sentences, and that by going to the sub-sentence level we make better use of it. On the EZZ corpus, although our method brings improvements in the BLEU score, the sen- Figure 6 : SMT performance results tence extraction method does better. Joining both extracted datasets does not improve performance; since most of the parallel data in this corpus exists at sentence level, the extracted fragments cannot bring much additional knowledge.",
"cite_spans": [],
"ref_spans": [
{
"start": 28,
"end": 36,
"text": "Figure 6",
"ref_id": null
},
{
"start": 484,
"end": 492,
"text": "Figure 6",
"ref_id": null
}
],
"eq_spans": [],
"section": "SMT Performance Results",
"sec_num": "3.3"
},
{
"text": "The Fragment-noLLR datasets bring no translation performance improvements; moreover, when the initial corpus is small (1M words) and the comparable corpus is noisy (BBC), the data has a negative impact on the BLEU score. This indicates that LLR-Lex is a higher-quality lexicon than GIZA-Lex, and an important component of our method.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SMT Performance Results",
"sec_num": "3.3"
},
{
"text": "Much of the work involving comparable corpora has focused on extracting word translations (Fung and Yee, 1998; Rapp, 1999; Diab and Finch, 2000; Koehn and Knight, 2000; Gaussier et al., 2004; Shao and Ng, 2004; Shinyama and Sekine, 2004) . Another related research effort is that of Resnik and Smith (2003) , whose system is designed to discover parallel document pairs on the Web.",
"cite_spans": [
{
"start": 90,
"end": 110,
"text": "(Fung and Yee, 1998;",
"ref_id": "BIBREF7"
},
{
"start": 111,
"end": 122,
"text": "Rapp, 1999;",
"ref_id": "BIBREF19"
},
{
"start": 123,
"end": 144,
"text": "Diab and Finch, 2000;",
"ref_id": "BIBREF3"
},
{
"start": 145,
"end": 168,
"text": "Koehn and Knight, 2000;",
"ref_id": "BIBREF9"
},
{
"start": 169,
"end": 191,
"text": "Gaussier et al., 2004;",
"ref_id": "BIBREF8"
},
{
"start": 192,
"end": 210,
"text": "Shao and Ng, 2004;",
"ref_id": "BIBREF22"
},
{
"start": 211,
"end": 237,
"text": "Shinyama and Sekine, 2004)",
"ref_id": "BIBREF23"
},
{
"start": 283,
"end": 306,
"text": "Resnik and Smith (2003)",
"ref_id": "BIBREF20"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Previous Work",
"sec_num": "4"
},
{
"text": "Our work lies between these two directions; we attempt to discover parallelism at the level of fragments, which are longer than one word but shorter than a document. Thus, the previous research most relevant to this paper is that aimed at mining comparable corpora for parallel sentences.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Previous Work",
"sec_num": "4"
},
{
"text": "The earliest efforts in this direction are those of Zhao and Vogel (2002) and Utiyama and Isahara (2003) . Both methods extend algorithms designed to perform sentence alignment of parallel texts: they use dynamic programming to do sentence alignment of documents hypothesized to be similar. These approaches are only applicable to corpora which are at most \"noisy-parallel\", i.e. contain documents which are fairly similar, both in content and in sentence ordering. Munteanu and Marcu (2005) analyze sentence pairs in isolation from their context, and classify them as parallel or non-parallel. They match each source document with several target ones, and classify all possible sentence pairs from each document pair. This enables them to find sentences from fairly dissimilar documents, and to handle any amount of reordering, which makes the method applicable to truly comparable corpora.",
"cite_spans": [
{
"start": 52,
"end": 73,
"text": "Zhao and Vogel (2002)",
"ref_id": "BIBREF27"
},
{
"start": 78,
"end": 104,
"text": "Utiyama and Isahara (2003)",
"ref_id": "BIBREF24"
},
{
"start": 466,
"end": 491,
"text": "Munteanu and Marcu (2005)",
"ref_id": "BIBREF14"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Previous Work",
"sec_num": "4"
},
{
"text": "The research reported by Fung and Cheung (2004a; 2004b) , Cheung and Fung (2004) and Wu and Fung (2005) is aimed explicitly at \"very non-parallel corpora\". They also pair each source document with several target ones and examine all possible sentence pairs; but the list of document pairs is not fixed. After one round of sentence extraction, the list is enriched with additional documents, and the system iterates. Thus, they include in the search document pairs which are dissimilar.",
"cite_spans": [
{
"start": 25,
"end": 48,
"text": "Fung and Cheung (2004a;",
"ref_id": "BIBREF5"
},
{
"start": 49,
"end": 55,
"text": "2004b)",
"ref_id": "BIBREF13"
},
{
"start": 58,
"end": 80,
"text": "Cheung and Fung (2004)",
"ref_id": "BIBREF1"
},
{
"start": 85,
"end": 103,
"text": "Wu and Fung (2005)",
"ref_id": "BIBREF26"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Previous Work",
"sec_num": "4"
},
{
"text": "One limitation of all these methods is that they are designed to find only full sentences. Our methodology is the first effort aimed at detecting sub-sentential correspondences. This is a difficult task, requiring the ability to recognize translationally equivalent fragments even in non-parallel sentence pairs.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Previous Work",
"sec_num": "4"
},
{
"text": "The work of Deng et. al (2006) also deals with sub-sentential fragments. However, they obtain parallel fragments from parallel sentence pairs (by chunking them and aligning the chunks appropriately), while we obtain them from comparable or non-parallel sentence pairs.",
"cite_spans": [
{
"start": 12,
"end": 30,
"text": "Deng et. al (2006)",
"ref_id": "BIBREF2"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Previous Work",
"sec_num": "4"
},
{
"text": "Since our approach can extract parallel data from texts which contain few or no parallel sentences, it greatly expands the range of corpora which can be usefully exploited.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Previous Work",
"sec_num": "4"
},
{
"text": "We have presented a simple and effective method for extracting sub-sentential fragments from comparable corpora. We also presented a method for computing a probabilistic lexicon based on the LLR statistic, which produces a higher quality lexicon. We showed that using this lexicon helps improve the precision of our extraction method.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "5"
},
{
"text": "Our approach can be improved in several aspects. The signal filtering function is very simple; more advanced filters might work better, and eliminate the need of applying additional heuristics (such as our requirement that the extracted fragments have at least 3 words). The fact that the source and target signal are filtered separately is also a weakness; a joint analysis should produce better results. Despite the better lexicon, the greatest source of errors is still related to false word correspondences, generally involving punctuation and very common, closed-class words. Giving special attention to such cases should help get rid of these errors, and improve the precision of the method.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "5"
},
{
"text": "http://www-2.cs.cmu.edu/$\\sim$lemur",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "http://www.statmt.org/wpt05/",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [
{
"text": "This work was partially supported under the GALE program of the Defense Advanced Research Projects Agency, Contract No. HR0011-06-C-0022.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgements",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "The mathematics of machine translation: Parameter estimation",
"authors": [
{
"first": "F",
"middle": [],
"last": "Peter",
"suffix": ""
},
{
"first": "Stephen",
"middle": [
"A Della"
],
"last": "Brown",
"suffix": ""
},
{
"first": "Vincent",
"middle": [
"J"
],
"last": "Pietra",
"suffix": ""
},
{
"first": "Robert",
"middle": [
"L"
],
"last": "Della Pietra",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Mercer",
"suffix": ""
}
],
"year": 1993,
"venue": "Computational Linguistics",
"volume": "19",
"issue": "2",
"pages": "263--311",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Peter F. Brown, Stephen A. Della Pietra, Vincent J. Della Pietra, and Robert L. Mercer. 1993. The mathematics of machine translation: Parameter esti- mation. Computational Linguistics, 19(2):263-311.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Sentence alignment in parallel, comparable, and quasicomparable corpora",
"authors": [
{
"first": "Percy",
"middle": [],
"last": "Cheung",
"suffix": ""
},
{
"first": "Pascale",
"middle": [],
"last": "Fung",
"suffix": ""
}
],
"year": 2004,
"venue": "LREC2004 Workshop",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Percy Cheung and Pascale Fung. 2004. Sen- tence alignment in parallel, comparable, and quasi- comparable corpora. In LREC2004 Workshop.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Segmentation and alignment of parallel text for statistical machine translation",
"authors": [
{
"first": "Yonggang",
"middle": [],
"last": "Deng",
"suffix": ""
},
{
"first": "Shankar",
"middle": [],
"last": "Kumar",
"suffix": ""
},
{
"first": "William",
"middle": [],
"last": "Byrne",
"suffix": ""
}
],
"year": 2006,
"venue": "Journal of Natural Language Engineering",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yonggang Deng, Shankar Kumar, and William Byrne. 2006. Segmentation and alignment of parallel text for statistical machine translation. Journal of Natu- ral Language Engineering. to appear.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "A statistical wordlevel translation model for comparable corpora",
"authors": [
{
"first": "Mona",
"middle": [],
"last": "Diab",
"suffix": ""
},
{
"first": "Steve",
"middle": [],
"last": "Finch",
"suffix": ""
}
],
"year": 2000,
"venue": "RIAO",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Mona Diab and Steve Finch. 2000. A statistical word- level translation model for comparable corpora. In RIAO 2000.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Accurate methods for the statistics of surprise and coincidence",
"authors": [
{
"first": "Ted",
"middle": [],
"last": "Dunning",
"suffix": ""
}
],
"year": 1993,
"venue": "Computational Linguistics",
"volume": "19",
"issue": "1",
"pages": "61--74",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ted Dunning. 1993. Accurate methods for the statis- tics of surprise and coincidence. Computational Linguistics, 19(1):61-74.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Mining very non-parallel corpora: Parallel sentence and lexicon extraction vie bootstrapping and EM",
"authors": [
{
"first": "Pascale",
"middle": [],
"last": "Fung",
"suffix": ""
},
{
"first": "Percy",
"middle": [],
"last": "Cheung",
"suffix": ""
}
],
"year": 2004,
"venue": "EMNLP 2004",
"volume": "",
"issue": "",
"pages": "57--63",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Pascale Fung and Percy Cheung. 2004a. Mining very non-parallel corpora: Parallel sentence and lexicon extraction vie bootstrapping and EM. In EMNLP 2004, pages 57-63.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Multilevel bootstrapping for extracting parallel sentences from a quasi-comparable corpus",
"authors": [
{
"first": "Pascale",
"middle": [],
"last": "Fung",
"suffix": ""
},
{
"first": "Percy",
"middle": [],
"last": "Cheung",
"suffix": ""
}
],
"year": 2004,
"venue": "COLING 2004",
"volume": "",
"issue": "",
"pages": "1051--1057",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Pascale Fung and Percy Cheung. 2004b. Multi- level bootstrapping for extracting parallel sentences from a quasi-comparable corpus. In COLING 2004, pages 1051-1057.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "An IR approach for translating new words from nonparallel, comparable texts",
"authors": [
{
"first": "Pascale",
"middle": [],
"last": "Fung",
"suffix": ""
},
{
"first": "Yee",
"middle": [],
"last": "Lo Yuen",
"suffix": ""
}
],
"year": 1998,
"venue": "ACL 1998",
"volume": "",
"issue": "",
"pages": "414--420",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Pascale Fung and Lo Yuen Yee. 1998. An IR approach for translating new words from nonparallel, compa- rable texts. In ACL 1998, pages 414-420.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "A geometric view on bilingual lexicon extraction from comparable corpora",
"authors": [
{
"first": "Eric",
"middle": [],
"last": "Gaussier",
"suffix": ""
},
{
"first": "Jean-Michel",
"middle": [],
"last": "Renders",
"suffix": ""
},
{
"first": "Irina",
"middle": [],
"last": "Matveeva",
"suffix": ""
},
{
"first": "Cyril",
"middle": [],
"last": "Goutte",
"suffix": ""
},
{
"first": "Herve",
"middle": [],
"last": "Dejean",
"suffix": ""
}
],
"year": 2004,
"venue": "",
"volume": "",
"issue": "",
"pages": "527--534",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Eric Gaussier, Jean-Michel Renders, Irina Matveeva, Cyril Goutte, and Herve Dejean. 2004. A geometric view on bilingual lexicon extraction from compara- ble corpora. In ACL 2004, pages 527-534.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Estimating word translation probabilities from unrelated monolingual corpora using the EM algorithm",
"authors": [
{
"first": "Philipp",
"middle": [],
"last": "Koehn",
"suffix": ""
},
{
"first": "Kevin",
"middle": [],
"last": "Knight",
"suffix": ""
}
],
"year": 2000,
"venue": "National Conference on Artificial Intelligence",
"volume": "",
"issue": "",
"pages": "711--715",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Philipp Koehn and Kevin Knight. 2000. Estimating word translation probabilities from unrelated mono- lingual corpora using the EM algorithm. In Na- tional Conference on Artificial Intelligence, pages 711-715.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Statistical significance tests for machine translation evaluation",
"authors": [
{
"first": "Philipp",
"middle": [],
"last": "Koehn",
"suffix": ""
}
],
"year": 2004,
"venue": "EMNLP 2004",
"volume": "",
"issue": "",
"pages": "388--395",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Philipp Koehn. 2004. Statistical significance tests for machine translation evaluation. In EMNLP 2004, pages 388-395.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Models of translational equivalence among words",
"authors": [
{
"first": "I",
"middle": [],
"last": "",
"suffix": ""
},
{
"first": "Dan",
"middle": [],
"last": "Melamed",
"suffix": ""
}
],
"year": 2000,
"venue": "Computational Linguistics",
"volume": "26",
"issue": "2",
"pages": "221--249",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "I. Dan Melamed. 2000. Models of translational equiv- alence among words. Computational Linguistics, 26(2):221-249.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Improving IBM wordalignment model 1",
"authors": [
{
"first": "Robert",
"middle": [
"C"
],
"last": "Moore",
"suffix": ""
}
],
"year": 2004,
"venue": "ACL 2004",
"volume": "",
"issue": "",
"pages": "519--526",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Robert C. Moore. 2004a. Improving IBM word- alignment model 1. In ACL 2004, pages 519-526.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "On log-likelihood-ratios and the significance of rare events",
"authors": [
{
"first": "Robert",
"middle": [
"C"
],
"last": "Moore",
"suffix": ""
}
],
"year": 2004,
"venue": "",
"volume": "",
"issue": "",
"pages": "333--340",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Robert C. Moore. 2004b. On log-likelihood-ratios and the significance of rare events. In EMNLP 2004, pages 333-340.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Improving machine translation performance by exploiting non-parallel corpora",
"authors": [
{
"first": "Stefan",
"middle": [],
"last": "Dragos",
"suffix": ""
},
{
"first": "Daniel",
"middle": [],
"last": "Munteanu",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Marcu",
"suffix": ""
}
],
"year": 2005,
"venue": "Computational Linguistics",
"volume": "31",
"issue": "4",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dragos Stefan Munteanu and Daniel Marcu. 2005. Im- proving machine translation performance by exploit- ing non-parallel corpora. Computational Linguis- tics, 31(4).",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "A systematic comparison of various statistical alignment models",
"authors": [
{
"first": "Joseph",
"middle": [],
"last": "Franz",
"suffix": ""
},
{
"first": "Hermann",
"middle": [],
"last": "Och",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Ney",
"suffix": ""
}
],
"year": 2003,
"venue": "Computational Linguistics",
"volume": "29",
"issue": "1",
"pages": "19--51",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Franz Joseph Och and Hermann Ney. 2003. A sys- tematic comparison of various statistical alignment models. Computational Linguistics, 29(1):19-51.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "The alignment template approach to statistical machine translation",
"authors": [
{
"first": "Joseph",
"middle": [],
"last": "Franz",
"suffix": ""
},
{
"first": "Hermann",
"middle": [],
"last": "Och",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Ney",
"suffix": ""
}
],
"year": 2004,
"venue": "Computational Linguistics",
"volume": "30",
"issue": "4",
"pages": "417--450",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Franz Joseph Och and Hermann Ney. 2004. The align- ment template approach to statistical machine trans- lation. Computational Linguistics, 30(4):417-450.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Experiments using the Lemur toolkit",
"authors": [
{
"first": "P",
"middle": [],
"last": "Ogilvie",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Callan",
"suffix": ""
}
],
"year": 2001,
"venue": "TREC 2001",
"volume": "",
"issue": "",
"pages": "103--108",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "P. Ogilvie and J. Callan. 2001. Experiments using the Lemur toolkit. In TREC 2001, pages 103-108.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "BLEU: a method for automatic evaluation of machine translation",
"authors": [
{
"first": "Kishore",
"middle": [],
"last": "Papineni",
"suffix": ""
},
{
"first": "Salim",
"middle": [],
"last": "Roukos",
"suffix": ""
},
{
"first": "Todd",
"middle": [],
"last": "Ward",
"suffix": ""
},
{
"first": "Wei-Jing",
"middle": [],
"last": "Zhu",
"suffix": ""
}
],
"year": 2002,
"venue": "ACL 2002",
"volume": "",
"issue": "",
"pages": "311--318",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kishore Papineni, Salim Roukos, Todd Ward, and Wei- Jing Zhu. 2002. BLEU: a method for automatic evaluation of machine translation. In ACL 2002, pages 311-318.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Automatic identification of word translations from unrelated English and German corpora",
"authors": [
{
"first": "Reinhard",
"middle": [],
"last": "Rapp",
"suffix": ""
}
],
"year": 1999,
"venue": "ACL 1999",
"volume": "",
"issue": "",
"pages": "519--526",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Reinhard Rapp. 1999. Automatic identification of word translations from unrelated English and Ger- man corpora. In ACL 1999, pages 519-526.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "The web as a parallel corpus",
"authors": [
{
"first": "Philip",
"middle": [],
"last": "Resnik",
"suffix": ""
},
{
"first": "Noah",
"middle": [
"A"
],
"last": "Smith",
"suffix": ""
}
],
"year": 2003,
"venue": "Computational Linguistics",
"volume": "29",
"issue": "3",
"pages": "349--380",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Philip Resnik and Noah A. Smith. 2003. The web as a parallel corpus. Computational Linguistics, 29(3):349-380.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Improved cross-language retrieval using backoff translation",
"authors": [
{
"first": "Philip",
"middle": [],
"last": "Resnik",
"suffix": ""
},
{
"first": "Douglas",
"middle": [],
"last": "Oard",
"suffix": ""
},
{
"first": "Gina",
"middle": [],
"last": "Lewow",
"suffix": ""
}
],
"year": 2001,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Philip Resnik, Douglas Oard, and Gina Lewow. 2001. Improved cross-language retrieval using backoff translation. In HLT 2001.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Mining new word translations from comparable corpora",
"authors": [
{
"first": "Li",
"middle": [],
"last": "Shao",
"suffix": ""
},
{
"first": "Hwee Tou",
"middle": [],
"last": "Ng",
"suffix": ""
}
],
"year": 2004,
"venue": "COLING 2004",
"volume": "",
"issue": "",
"pages": "618--624",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Li Shao and Hwee Tou Ng. 2004. Mining new word translations from comparable corpora. In COLING 2004, pages 618-624.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "Named entity discovery using comparable news articles",
"authors": [
{
"first": "Yusuke",
"middle": [],
"last": "Shinyama",
"suffix": ""
},
{
"first": "Satoshi",
"middle": [],
"last": "Sekine",
"suffix": ""
}
],
"year": 2004,
"venue": "COLING 2004",
"volume": "",
"issue": "",
"pages": "848--853",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yusuke Shinyama and Satoshi Sekine. 2004. Named entity discovery using comparable news articles. In COLING 2004, pages 848-853.",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "Reliable measures for aligning Japanese-English news articles and sentences",
"authors": [
{
"first": "Masao",
"middle": [],
"last": "Utiyama",
"suffix": ""
},
{
"first": "Hitoshi",
"middle": [],
"last": "Isahara",
"suffix": ""
}
],
"year": 2003,
"venue": "ACL 2003",
"volume": "",
"issue": "",
"pages": "72--79",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Masao Utiyama and Hitoshi Isahara. 2003. Reliable measures for aligning Japanese-English news arti- cles and sentences. In ACL 2003, pages 72-79.",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "Using noisy bilingual data for statistical machine translation",
"authors": [
{
"first": "Stephan",
"middle": [],
"last": "Vogel",
"suffix": ""
}
],
"year": 2003,
"venue": "EACL 2003",
"volume": "",
"issue": "",
"pages": "175--178",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Stephan Vogel. 2003. Using noisy bilingual data for statistical machine translation. In EACL 2003, pages 175-178.",
"links": null
},
"BIBREF26": {
"ref_id": "b26",
"title": "Inversion transduction grammar constraints for mining parallel sentences from quasi-comparable corpora",
"authors": [
{
"first": "Dekai",
"middle": [],
"last": "Wu",
"suffix": ""
},
{
"first": "Pascale",
"middle": [],
"last": "Fung",
"suffix": ""
}
],
"year": 2005,
"venue": "IJCNLP 2005",
"volume": "",
"issue": "",
"pages": "257--268",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dekai Wu and Pascale Fung. 2005. Inversion trans- duction grammar constraints for mining parallel sen- tences from quasi-comparable corpora. In IJCNLP 2005, pages 257-268.",
"links": null
},
"BIBREF27": {
"ref_id": "b27",
"title": "Adaptive parallel sentences mining from web bilingual news collection",
"authors": [
{
"first": "Bing",
"middle": [],
"last": "Zhao",
"suffix": ""
},
{
"first": "Stephan",
"middle": [],
"last": "Vogel",
"suffix": ""
}
],
"year": 2002,
"venue": "2002 IEEE Int. Conf. on Data Mining",
"volume": "",
"issue": "",
"pages": "745--748",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Bing Zhao and Stephan Vogel. 2002. Adaptive paral- lel sentences mining from web bilingual news col- lection. In 2002 IEEE Int. Conf. on Data Mining, pages 745-748.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"num": null,
"uris": null,
"type_str": "figure",
"text": "A pair of comparable, non-parallel documents"
},
"FIGREF1": {
"num": null,
"uris": null,
"type_str": "figure",
"text": "A pair of comparable sentences."
},
"FIGREF2": {
"num": null,
"uris": null,
"type_str": "figure",
"text": "A Parallel Fragment Extraction System tomatically from the same initial parallel corpus."
},
"FIGREF3": {
"num": null,
"uris": null,
"type_str": "figure",
"text": "Translated fragments, according to the lexicon. lates into target word \u00a1 , and"
},
"FIGREF4": {
"num": null,
"uris": null,
"type_str": "figure",
"text": "Our approach for detecting parallel fragments. The lower part of the figure shows the source and target sentence together with their alignment. Above are displayed the initial signal and the filtered signal. The circles indicate which fragments of the target sentence are selected by the procedure. translated; for this, we employ the ' distribution. Thus, for each non-linked target word \u00a1 , we look for the source word least likely to be its nontranslation:"
},
"TABREF1": {
"html": null,
"text": "Sizes of our comparable corpora from the Romanian translations of the European Union's acquis communautaire which we mined from the Web, and has about 10M English words.",
"content": "<table><tr><td/><td colspan=\"2\">Romanian</td><td colspan=\"2\">English</td></tr><tr><td colspan=\"2\">Source # articles</td><td># tokens</td><td># articles</td><td># tokens</td></tr><tr><td>BBC</td><td>6k</td><td colspan=\"3\">2.5M 200k 118M</td></tr><tr><td colspan=\"5\">EZZ 183k 91M 14k 8.5M</td></tr></table>",
"num": null,
"type_str": "table"
}
}
}
} |