File size: 103,792 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 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 | {
"paper_id": "R13-1024",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T14:55:27.658936Z"
},
"title": "Normalization of Dutch User-Generated Content",
"authors": [
{
"first": "Orph\u00e9e",
"middle": [],
"last": "De Clercq",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Team -University College Ghent Groot",
"location": {
"addrLine": "Brittanni\u00eblaan 45",
"postCode": "9000",
"settlement": "Ghent",
"country": "Belgium"
}
},
"email": ""
},
{
"first": "Sarah",
"middle": [],
"last": "Schulz",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Ghent University",
"location": {
"addrLine": "Blandijnberg 1",
"postCode": "9000",
"settlement": "Ghent",
"country": "Belgium"
}
},
"email": ""
},
{
"first": "Bart",
"middle": [],
"last": "Desmet",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Team -University College Ghent Groot",
"location": {
"addrLine": "Brittanni\u00eblaan 45",
"postCode": "9000",
"settlement": "Ghent",
"country": "Belgium"
}
},
"email": ""
},
{
"first": "Els",
"middle": [],
"last": "Lefever",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Team -University College Ghent Groot",
"location": {
"addrLine": "Brittanni\u00eblaan 45",
"postCode": "9000",
"settlement": "Ghent",
"country": "Belgium"
}
},
"email": ""
},
{
"first": "V\u00e9ronique",
"middle": [],
"last": "Hoste",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Team -University College Ghent Groot",
"location": {
"addrLine": "Brittanni\u00eblaan 45",
"postCode": "9000",
"settlement": "Ghent",
"country": "Belgium"
}
},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "This paper describes a phrase-based machine translation approach to normalize Dutch user-generated content (UGC). We compiled a corpus of three different social media genres (text messages, message board posts and tweets) to have a sample of this recent domain. We describe the various characteristics of this noisy text material and explain how it has been manually normalized using newly developed guidelines. For the automatic normalization task we focus on text messages, and find that a cascaded SMT system where a token-based module is followed by a translation at the character level gives the best word error rate reduction. After these initial experiments, we investigate the system's robustness on the complete domain of UGC by testing it on the other two social media genres, and find that the cascaded approach performs best on these genres as well. To our knowledge, we deliver the first proof-of-concept system for Dutch UGC normalization, which can serve as a baseline for future work.",
"pdf_parse": {
"paper_id": "R13-1024",
"_pdf_hash": "",
"abstract": [
{
"text": "This paper describes a phrase-based machine translation approach to normalize Dutch user-generated content (UGC). We compiled a corpus of three different social media genres (text messages, message board posts and tweets) to have a sample of this recent domain. We describe the various characteristics of this noisy text material and explain how it has been manually normalized using newly developed guidelines. For the automatic normalization task we focus on text messages, and find that a cascaded SMT system where a token-based module is followed by a translation at the character level gives the best word error rate reduction. After these initial experiments, we investigate the system's robustness on the complete domain of UGC by testing it on the other two social media genres, and find that the cascaded approach performs best on these genres as well. To our knowledge, we deliver the first proof-of-concept system for Dutch UGC normalization, which can serve as a baseline for future work.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "In the past two decades, many resources have been invested to develop state-of-the-art text processing tools for Dutch 1 . Similar to other reported languages, these tools, which have all been developed with standard text in mind, show a significant drop in performance when applied to usergenerated content (UGC). This is for example the 1 Among others, in the framework of the STEVIN programme, see Spijns and Odijk (2013) for an overview. case when applying parsing (Foster et al., 2011) or named entity recognition (Liu et al., 2011b; Ritter et al., 2011) to Twitter data. Typical problems that hinder automatic text processing include the use and productivity of abbreviations, deliberate misspellings, phonetic text, colloquial and ungrammatical language use, lack of punctuation and inconsistent capitalization.",
"cite_spans": [
{
"start": 401,
"end": 424,
"text": "Spijns and Odijk (2013)",
"ref_id": null
},
{
"start": 469,
"end": 490,
"text": "(Foster et al., 2011)",
"ref_id": "BIBREF8"
},
{
"start": 519,
"end": 538,
"text": "(Liu et al., 2011b;",
"ref_id": "BIBREF15"
},
{
"start": 539,
"end": 559,
"text": "Ritter et al., 2011)",
"ref_id": "BIBREF20"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "No systems currently exist to automatically normalize Dutch noisy text into its standard equivalent. In order to develop a system which can handle different types of user-generated content, we collected and studied three social media genres: text messages, message board posts and tweets. In this paper, we investigate the viability of adopting a character-based machine translation approach to the normalization task. This is different from previous research investigating MT approaches for normalization, which has mainly focused on token-based translation (Aw et al., 2006; Kobus et al., 2008) .",
"cite_spans": [
{
"start": 559,
"end": 576,
"text": "(Aw et al., 2006;",
"ref_id": "BIBREF1"
},
{
"start": 577,
"end": 596,
"text": "Kobus et al., 2008)",
"ref_id": "BIBREF10"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "For our experiments we first focus on the genre that poses the largest number of normalization challenges in our corpus, namely text messages, in order to have a proof of concept. We will show that a cascaded SMT system with a token-based module followed by a transliteration at the character level yields the best results, i.e. a 63% drop in word error rate. In this cascade, the first module aims at obtaining high precision, thus presenting high-confidence translations. The second module further improves this output by generalizing over character mappings.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "To conclude, we applied this proof-of-concept system tuned for text messages to the other genres and observed similar improvements.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The paper is structured as follows. After the literature overview (Section 2) we discuss the social media genres used, their characteristics and how these have been normalized in Section 3. The setup and experiments are presented in Section 4. We examine the results in Section 5, perform a qualitative error analysis in Section 6 to end with some conclusions and prospects for future work in Section 7.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Traditionally, the task of text normalization is a crucial first step for every text-to-speech system, in which specific numbers and digit sequences, acronyms, etc. need to be rewritten in order to have them pronounced correctly. A thorough overview of the main characteristics and bottlenecks can be found in Sproat et al. (2001) .",
"cite_spans": [
{
"start": 310,
"end": 330,
"text": "Sproat et al. (2001)",
"ref_id": "BIBREF23"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "More recently, however, the surge of usergenerated content has introduced new problems such as non-existent abbreviations and deliberate misspellings. This reality combined with the need to process UGC data has revived the interest in normalization techniques. In this regard, we can define three dominant approaches to transfer noisy into standard text. These are referred to as the spell-checking, machine translation and speech recognition metaphors (Kobus et al., 2008) .",
"cite_spans": [
{
"start": 453,
"end": 473,
"text": "(Kobus et al., 2008)",
"ref_id": "BIBREF10"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "The most intuitive way of normalizing text would be to approach the problem as a spellchecking one where noisy text has to be transformed to standard text using noisy channel models. Choudhury et al. (2007) , for example, proposed a supervised noisy channel model using Hidden Markov Models to calculate the probability of less frequent words. Extensions to this approach were made by studying word processes (Cook and Stevenson, 2009) , adapting weighted finite-state machines and rewrite rules (Beaufort et al., 2010) or by adding other elements such as orthographic, phonetic and contextual factors (Xue et al., 2011) .",
"cite_spans": [
{
"start": 183,
"end": 206,
"text": "Choudhury et al. (2007)",
"ref_id": "BIBREF21"
},
{
"start": 409,
"end": 435,
"text": "(Cook and Stevenson, 2009)",
"ref_id": "BIBREF5"
},
{
"start": 496,
"end": 519,
"text": "(Beaufort et al., 2010)",
"ref_id": "BIBREF4"
},
{
"start": 602,
"end": 620,
"text": "(Xue et al., 2011)",
"ref_id": "BIBREF29"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "Another approach is using statistical machine translation (SMT) techniques for text normalization. Previous work in this field has mostly focused on phrase-based machine translation at the word level. Aw et al. (2006) were the first to compare dictionary substitution using frequencies with phrase-based machine translation. They revealed that SMT improves BLEU scores for English SMS translation. Also working on English text, Raghunathan et al. (2009) confirmed that using an SMT system outperforms a dictionary look-up, most no-tably when used on an out-of-domain test set. Kobus et al. (2008) followed the same approach but combined the machine translation features with a speech recognition approach using HMMs on a French corpus. They concluded that the two systems perform better on different aspects of the task and that combining these two modules works best.",
"cite_spans": [
{
"start": 201,
"end": 217,
"text": "Aw et al. (2006)",
"ref_id": "BIBREF1"
},
{
"start": 428,
"end": 453,
"text": "Raghunathan et al. (2009)",
"ref_id": "BIBREF19"
},
{
"start": 577,
"end": 596,
"text": "Kobus et al. (2008)",
"ref_id": "BIBREF10"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "A different way of approaching normalization is the work by Liu et al. (2011a; 2012) . They propose a cognition-driven text normalization system using an unsupervised approach. By observing and simulating human techniques for the normalization task, they avoid dependence on human annotations. They construct a broad-coverage system to enable better word-coverage, using three key components: enhanced letter transformation, visual priming and string/phonetic similarity.",
"cite_spans": [
{
"start": 60,
"end": 78,
"text": "Liu et al. (2011a;",
"ref_id": "BIBREF14"
},
{
"start": 79,
"end": 84,
"text": "2012)",
"ref_id": "BIBREF26"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "If we consider normalization, the task intuitively has a lot in common with transliteration tasks for which character-based SMT systems have proven adequate (Vilar et al., 2007) . Pennell and Liu (2011) were the first to study characterbased normalization. They, however, limited their approach by only focusing on abbreviations.",
"cite_spans": [
{
"start": 157,
"end": 177,
"text": "(Vilar et al., 2007)",
"ref_id": "BIBREF28"
},
{
"start": 180,
"end": 202,
"text": "Pennell and Liu (2011)",
"ref_id": "BIBREF18"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "In this paper, we propose a cascaded model that follows a machine translation approach and tries to tackle the full range of normalization problems.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "In order to normalize using a machine translation system, and to evaluate the performance, it is essential to build a gold standard data set that can serve as training and test material. As far as we know, no such data set is currently available for Dutch.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Three Genres of UGC",
"sec_num": "3"
},
{
"text": "To ensure that our corpus is representative of the domain of user-generated content (UGC), we decided to include three different social media genres: text messages (SMS), message board posts from a social networking site (SNS) and tweets (TWE). As text messages, we sampled 1,000 messages from the Flemish part of the SoNaR corpus (Treurniet et al., 2012) , aimed at a balanced spread of two characteristics: age and region. In order to also include longer streams of UGC, 1,505 message board posts were randomly selected from the social networking site Netlog, which is popular amongst Belgian teenagers. In order to take into Table 1 : Examples of UGC from the three social media genres representing the original utterance, its normalized version and an English translation account the vast amount of normalization research done on Twitter data, we also included 246 randomly selected tweets. It is to be noted, however, that average Twitter content in Belgium differs from that in English-speaking countries or The Netherlands, because Twitter has mainly been adopted amongst professionals. An example of each genre can be found in the left column of Table 1. These examples clearly illustrate the main characteristics of Dutch UGC, most of which are similar to previously reported problems in other languages (Baron, 2003; Beaufort et al., 2010) .",
"cite_spans": [
{
"start": 331,
"end": 355,
"text": "(Treurniet et al., 2012)",
"ref_id": "BIBREF27"
},
{
"start": 1313,
"end": 1326,
"text": "(Baron, 2003;",
"ref_id": "BIBREF3"
},
{
"start": 1327,
"end": 1349,
"text": "Beaufort et al., 2010)",
"ref_id": "BIBREF4"
}
],
"ref_spans": [
{
"start": 628,
"end": 635,
"text": "Table 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Corpus Compilation",
"sec_num": "3.1"
},
{
"text": "Some of the more well-known problems include the omission of words or characters, e.g. the omission of the final n in gesproke (Eng: spoke versus spoken). The frequent use of abbreviations and acronyms, such as gwn, hvj (Eng: LOL), which are highly productive. Moreover, many utterances deviate from the standard spelling at the lexical level, such as lyk instead of gelijk (Eng: luv versus love) or by writing colloquially, e.g. et em instead of hebt hem (Eng: you iz vs you are). In UGC, emotions are also expressed by using flooding (repetition of the same character or sequence, baaaaaaby), emoticons (:p) and capitalized letters (STUPID).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Corpus Compilation",
"sec_num": "3.1"
},
{
"text": "More specific to the Dutch language is the concatenation of tokens which leads to the elimination of clitics and pronouns (Edde instead of Heb je, khou instead ik hou, Tis instead of Het is). Moreover, the influence of the English-speaking world on Belgium and the fact that it is a trilingual country often leads to various languages within a single utterance, which are often adapted to Dutch aspects (Oguz, daddy, we are forever).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Corpus Compilation",
"sec_num": "3.1"
},
{
"text": "All text material was annotated by two annotators, independently of each other using newly developed normalization guidelines. These guidelines, tailored for Dutch, have been drawn up in close collaboration with the developers of the Chatty Corpus (Kestemont et al., 2012) .",
"cite_spans": [
{
"start": 248,
"end": 272,
"text": "(Kestemont et al., 2012)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Corpus Annotation",
"sec_num": "3.2"
},
{
"text": "The guidelines can be roughly divided into two parts. The first part consists of the actual text normalization and comprises three steps: clearing all obvious tokenization problems, stating the different normalization operations and writing down the full normalized version. We allow four different operations: insertions, deletions, substitutions and transpositions; examples of tokens requiring these operations are given below (in English).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Corpus Annotation",
"sec_num": "3.2"
},
{
"text": "\u2022 INS: spoke (spoken), sis (sister)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Corpus Annotation",
"sec_num": "3.2"
},
{
"text": "\u2022 DEL: baaaaabyyyy (baby)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Corpus Annotation",
"sec_num": "3.2"
},
{
"text": "\u2022 SUB: iz (is), stoopid (stupid)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Corpus Annotation",
"sec_num": "3.2"
},
{
"text": "\u2022 TRANS: liek (like) Insertions allow to indicate missing characters in a string. Deletions are used when characters should be deleted from a certain string. Substitutions are used when a character has been replaced with another similar one. Finally, transpositions are used when a combination of characters should be switched within one string.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Corpus Annotation",
"sec_num": "3.2"
},
{
"text": "The second part consists of flagging additional information that might be useful for automatic processing purposes. Within each utterance the Table 2 : Data statistics of the three genres of UGC. The left-hand side shows the number of tokens before and after normalization and the increase in %. The right-hand side visualizes the actual normalization effort expressed in the number of operations.",
"cite_spans": [],
"ref_spans": [
{
"start": 142,
"end": 149,
"text": "Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Corpus Annotation",
"sec_num": "3.2"
},
{
"text": "annotators were asked to indicate the end of a thought (to account for missing punctuation), regional words, foreign words and named entities. They could also flag words that are ungrammatical, stressed, part of a compound, used as interjections or words that require consecutive normalization operations.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Corpus Annotation",
"sec_num": "3.2"
},
{
"text": "To check the reliability of our annotation guidelines, the two annotators each normalized the 1,000 text messages. We estimated the interannotator reliability by computing the word error rate (cf. infra) between the two fully normalized versions. The WER was 0.048, which indicates near-perfect overlap.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Corpus Annotation",
"sec_num": "3.2"
},
{
"text": "In order to give an idea of the normalization effort required, we present some data statistics for each genre in Table 2 . The left-hand side visualizes the increase in the number of tokens before and after normalization in absolute numbers and percentage-wise. On the right one can see the actual normalization effort, which is expressed by the number of individual operations. The normalized versions of the previously mentioned examples can be found in the middle column of Table 1 and their translation to English in the right column.",
"cite_spans": [],
"ref_spans": [
{
"start": 113,
"end": 120,
"text": "Table 2",
"ref_id": null
},
{
"start": 477,
"end": 485,
"text": "Table 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Corpus Annotation",
"sec_num": "3.2"
},
{
"text": "For the experiments presented in this paper we work with the first part of the manual normalization (ignoring flagging information such as ends of thought). We chose to focus on SMS, because it was the noisiest data in our corpus, with a token increase of 3.39% (see Table 2 ).",
"cite_spans": [],
"ref_spans": [
{
"start": 267,
"end": 274,
"text": "Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Corpus Annotation",
"sec_num": "3.2"
},
{
"text": "Using SMT for noisy text normalization can be done at various levels of granularity. The advantage of working at the token level is that the high-frequency words and abbreviations can be translated in context, which outperforms a simple dictionary look-up (Raghunathan and Krawczyk, 2009) . However, working at the character level allows one to generalize over character mappings which makes the system more robust (Pennell and Liu, 2011) .",
"cite_spans": [
{
"start": 256,
"end": 288,
"text": "(Raghunathan and Krawczyk, 2009)",
"ref_id": "BIBREF19"
},
{
"start": 415,
"end": 438,
"text": "(Pennell and Liu, 2011)",
"ref_id": "BIBREF18"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "System Architecture",
"sec_num": "4"
},
{
"text": "Prior to any sort of learning, we adapted our tokenizer to be able to handle emoticons, hyperlinks, hashtags and at-replies. Similar to Beaufort et al. (2010) , we devised some rewrite rules: we decided to tackle the flooding of characters before translating in order to avoid too many confounding factors. Characters and character sequences were allowed to occur twice consecutively, at maximum. A higher number of repetitions was reduced to two. The validity of this approach was checked by running the rewrite module on the CELEX database (Baayen et al., 1995) , which contains 381,292 valid Dutch words, including inflections. Only two (highly infrequent) entries were changed by the module, which confirms that it virtually does not overnormalize.",
"cite_spans": [
{
"start": 136,
"end": 158,
"text": "Beaufort et al. (2010)",
"ref_id": "BIBREF4"
},
{
"start": 542,
"end": 563,
"text": "(Baayen et al., 1995)",
"ref_id": "BIBREF2"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "System Architecture",
"sec_num": "4"
},
{
"text": "After this preliminary preprocessing, the noisy text is processed by two modules. First, the standard phrase-based SMT approach at the token level is used to ensure the translation of the more frequently used abbreviations (such as fb for facebook and other highly frequent normalization problems, e.g. tht for that). Afterwards, the translated text is split into characters and a translation at the character level takes place. This intuitively makes sense, because transformations at the character level are more likely to be reproduced than a combination of possible transformations at the word level. Trying to generalize such character transformations at the word level would probably fail due to data sparseness. We worked with both character unigram and bigram translation models. Bigrams supposedly have the advantage that one character of context across phrase boundaries is used in the selection of translation alternatives from the phrase table (Tiedemann, 2012) . This means that more precise translations will be suggested.",
"cite_spans": [
{
"start": 956,
"end": 973,
"text": "(Tiedemann, 2012)",
"ref_id": "BIBREF26"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "System Architecture",
"sec_num": "4"
},
{
"text": "For our experiments we first focus on the individual performance we can achieve within the SMS genre, after which we test this approach on the other genres to see whether it is possible to create a robust system that can process all three UGC genres.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "System Architecture",
"sec_num": "4"
},
{
"text": "To evaluate our approach, both the Word Error Rate (WER) and BLEU scores were calculated. WER, an evaluation metric that is based on edit distance at the word level, is very well suited for the evaluation of NLP tasks where the input and output strings are closely related. As a consequence, the metric is used for the evaluation of optical character recognition (Kolak et al., 2003) , grapheme-to-phoneme conversion (Demberg et al., 2007) , diacritization (Schlippe et al., 2008) and vocalization of Arabic (K\u00fcbler and Mohamed, 2008) . The BLEU metric, which has been specifically designed for measuring machine translation quality, measures the n-gram overlap between the translation being evaluated and a set of target translations. We therefore believe that BLEU is less appropriate for evaluation in the current set-up, but we include it for comparison's sake (as other systems mention it such as Aw et al. (2006) , Kobus et al. (2008) , etc.).",
"cite_spans": [
{
"start": 363,
"end": 383,
"text": "(Kolak et al., 2003)",
"ref_id": "BIBREF12"
},
{
"start": 417,
"end": 439,
"text": "(Demberg et al., 2007)",
"ref_id": "BIBREF6"
},
{
"start": 457,
"end": 480,
"text": "(Schlippe et al., 2008)",
"ref_id": "BIBREF22"
},
{
"start": 508,
"end": 534,
"text": "(K\u00fcbler and Mohamed, 2008)",
"ref_id": "BIBREF13"
},
{
"start": 902,
"end": 918,
"text": "Aw et al. (2006)",
"ref_id": "BIBREF1"
},
{
"start": 921,
"end": 940,
"text": "Kobus et al. (2008)",
"ref_id": "BIBREF10"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "System Architecture",
"sec_num": "4"
},
{
"text": "For all experiments, we used the Moses SMT system (Koehn et al., 2007) . As a target corpus for our language model, we used the Spoken Dutch Corpus (Corpus Gesproken Nederlands, CGN (Oostdijk, 2000)) since spoken language could better reflect the language used in UGC. The target training data was also added to the model. All language models were built using the SRILM toolkit (Stolcke, 2002) with Witten-Bell discounting which has been proven to work well on small data sets (Tiedemann, 2012) We experimented with different translation models. The token-level translation model was each time built using Moses with standard settings and a 5-gram language model. For the characterlevel model the same Moses setting was used. For the language model we experimented with different sizes of n on our training data, 5 -7 -10 -15, and found that a 10-gram language model gave the best results.",
"cite_spans": [
{
"start": 50,
"end": 70,
"text": "(Koehn et al., 2007)",
"ref_id": "BIBREF11"
},
{
"start": 378,
"end": 393,
"text": "(Stolcke, 2002)",
"ref_id": "BIBREF25"
},
{
"start": 477,
"end": 494,
"text": "(Tiedemann, 2012)",
"ref_id": "BIBREF26"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Set-up and Results",
"sec_num": "5"
},
{
"text": "For the first set of experiments (Section 5.1), training was performed on the SMS data, which was divided into three data sets: 625 messages for training, 125 for development and 125 for testing. In order to estimate the system's robustness to unseen genres, the SMS-tuned system was tested on the other two genres, 125 SNS posts and 125 tweets (Section 5.2).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Set-up and Results",
"sec_num": "5"
},
{
"text": "This is, to our knowledge, the first study on Dutch text normalization, so there is no basis for comparison to other systems. Figure 1 present a visual overview of the different set-ups' performance on the Dutch SMS data. We start by reporting the difference between the original source and target text (A) as well as a baseline where only the rewrite rules have been applied (B). We see that a moderate improvement in WER, from 21.70 to 21.47%, already occurs by eliminating flooding. Figure 1: Visualisation of the WER reduction on the SMS data set using our seven different set-ups",
"cite_spans": [],
"ref_spans": [
{
"start": 126,
"end": 134,
"text": "Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Results on SMS",
"sec_num": "5.1"
},
{
"text": "In the next step, the various translation models were trained and tested and we clearly see that all the following results outperform the baseline. The token-based model (C) accounts for a moderate improvement but clearly the character-based models, both with unigrams (D) and bigrams (E), perform much better. Introducing the unigram and bigram cascaded models leads to the best results (F and G). The best result is reached by the cascaded unigram model (F). This model has a WER of 13.11 which is a 63% drop in word error rate over the baseline and 56% over the non-cascaded word level SMT.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Results on SMS",
"sec_num": "5.1"
},
{
"text": "If we perform the same analysis on the BLEU results (Figure 2 ), we observe a different tendency. Clearly, the token-based model (C) accounts here for the best performance whereas the cascaded un- Figure 2: Visualisation of BLEU on the SMS data set using our seven different set-ups igram model (F) only achieves the second best result. This could be explained by the inherent differences between the metrics. WER is based on the edit distance whereas BLEU measures n-gram overlap. This means that the output of the unigram cascaded model can be closer -but not perfect -to the reference than the output from the token model. If we consider the example below from our data we see that the token model was not able to find the correct version, whereas the cascaded unigram output is already a bit closer. If we would then feed this closer version back into our token model it should be able to resolve it correctly 2 . This insight could be used to improve our system by extending the cascaded unigram module with another run of the token-based system in future work.",
"cite_spans": [],
"ref_spans": [
{
"start": 52,
"end": 61,
"text": "(Figure 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Results on SMS",
"sec_num": "5.1"
},
{
"text": "\u2022 original: laatk -target: laat ik",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Results on SMS",
"sec_num": "5.1"
},
{
"text": "\u2022 output C: laatk -output F: laat k -output C based on output F: laat ik All experimental results on the SMS data, expressed both in WER and BLEU, can be found in Table 3 .",
"cite_spans": [],
"ref_spans": [
{
"start": 163,
"end": 170,
"text": "Table 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Results on SMS",
"sec_num": "5.1"
},
{
"text": "By testing our translation models tuned for text messages on the other two genres, we aim to verify the robustness of our approach. These results can be found in Table 3 . Applying the baseline system with rewrite rules gives the same minor positive effect for SNS as for SMS, compared to the original source and target text. For tweets, on the other hand, no improvement is noted. Upon closer inspection of the Twitter data, not a single instance of flooding was found, which explains this status quo.",
"cite_spans": [],
"ref_spans": [
{
"start": 162,
"end": 169,
"text": "Table 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Results on three genres of UGC",
"sec_num": "5.2"
},
{
"text": "When comparing the other models, the same evolution in word error rate can be observed. For each genre, the best WER reduction over the baseline is reached with the cascaded unigram model, namely 63% for SMS, 39% for SNS and 28% for TWE. For the SNS data, the cascaded unigram and bigram translation models give an equal performance.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Results on three genres of UGC",
"sec_num": "5.2"
},
{
"text": "We performed a qualitative error analysis of our best performing set-up, i.e. the cascaded unigram approach (F). After close inspection of the output on the SMS test data we learned that the system was able to locate and resolve 172 of the 320 words requiring normalization. Besides this, the system also generated 51 false positives, which leads to a precision of 77.13%, a recall of 55.66% and thus an overall F-measure of 64.66%.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Error Analysis",
"sec_num": "6"
},
{
"text": "In order to gain more insights, the instances our system missed were classified in two ways. We first inspected which types of operations seem most difficult to resolve (cf. Section 3.2 ).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Error Analysis",
"sec_num": "6"
},
{
"text": "Total Table 4 : Absolute number of the operations missed at the character-level together with the relative number when compared to the total number of operations",
"cite_spans": [],
"ref_spans": [
{
"start": 6,
"end": 13,
"text": "Table 4",
"ref_id": null
}
],
"eq_spans": [],
"section": "Operations",
"sec_num": null
},
{
"text": "Since one word may need multiple or different operations 3 , this was calculated at the character level. Table 4 presents the number of operations missed by our system both in absolute and relative numbers.",
"cite_spans": [
{
"start": 57,
"end": 58,
"text": "3",
"ref_id": null
}
],
"ref_spans": [
{
"start": 105,
"end": 112,
"text": "Table 4",
"ref_id": null
}
],
"eq_spans": [],
"section": "Operations",
"sec_num": null
},
{
"text": "At first sight, especially the deletions seem hard to resolve, followed by the substitutions and trans- Table 3 : Results of the different set-ups on the SMS genre positions. When taking the absolute numbers into account, however, proportionally these classes are much less frequent than the total number of insertions needed (549 to be exact). Apparently our system is able to resolve most of these insertions (i.e. 51%). On closer inspection, however, we found that the system is especially good in normalizing shorter words requiring only one or two insertions, such as eb for heb, nie for niet, and not in building longer words such as gr for groetjes. If we extrapolate this finding to the number of insertions needed at the word level, we indeed discovered that at the word level 60% gets successfully resolved. Another observation at the word level is that words requiring different types of operations are difficult for our system: only 44% is successfully replaced.",
"cite_spans": [],
"ref_spans": [
{
"start": 104,
"end": 111,
"text": "Table 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Operations",
"sec_num": null
},
{
"text": "The second error classification consists of a more linguistically motivated subdivision. Inspired by the work of Androutsopoulos (2007) , we defined three categories: abbreviation (ABBR), phonetic (PHON) and orthographic (ORTH) issues. Examples of some instances our system missed following this classification are presented in Table 5 .",
"cite_spans": [
{
"start": 113,
"end": 135,
"text": "Androutsopoulos (2007)",
"ref_id": null
}
],
"ref_spans": [
{
"start": 328,
"end": 335,
"text": "Table 5",
"ref_id": "TABREF4"
}
],
"eq_spans": [],
"section": "Operations",
"sec_num": null
},
{
"text": "Classes Output Correct ABBR aug augustus PHON hebk heb ik ORTH uan van This classification is visualized in Figure 3 , where we see that especially resolving phonetic problems seems difficult for our system, i.e. 103 instances. In order to better grasp this we had a closer look at the various phonetic issues and ABBR PHON ORTH Figure 3 : Pie chart visualizing the number of missed instances according to the second error classification further classified these into fusions (concatenations of words, 25%), omissions (missing characters, 43%), equivalents (characters referring to the same sound, 26%) and onomatopoeias (sounds like, 6%). Especially the omission of characters seems problematic, which is consistent with the high number of missed insertions (i.e. 270 characters).",
"cite_spans": [],
"ref_spans": [
{
"start": 108,
"end": 116,
"text": "Figure 3",
"ref_id": null
},
{
"start": 329,
"end": 337,
"text": "Figure 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Operations",
"sec_num": null
},
{
"text": "This error analysis indicates that our system might benefit from including other modules besides machine translation. The orthographic issues might probably be resolved using a spell checker, whereas the phonetic ones, especially the equivalents, might benefit from grapheme-to-phoneme conversion.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Operations",
"sec_num": null
},
{
"text": "As far as the hypercorrections are concerned (our system generated 51 false positives), we found that 15 of these are actually named entities or foreign words which should not be normalized at all. This is why we are also thinking of expanding our preprocessing module so that these words can be filtered out before processing them with the other modules.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Operations",
"sec_num": null
},
{
"text": "In this paper, we have discussed a cascaded machine translation approach to normalize Dutch user-generated content (UGC). Three social media genres have been collected and normalized using newly developed guidelines. After a short description of the main normalization errors and characteristics of this particular domain, we investigated the viability of an SMT approach at the character level.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion and Future Work",
"sec_num": "7"
},
{
"text": "Experiments on text messages, the genre requiring most normalization, revealed that a cascaded model where a token-based module is followed by a translation at the character level yields the best results. Testing this model on two other genres revealed the same trend, which indicates that this approach is robust across genres. To our knowledge, we have developed the first proofof-concept system for Dutch UGC normalization, which can serve as a baseline for future work. A first error analysis revealed that our best system already reaches an F-measure of 64.66%. Looking at the different operations, insertions occur most frequently. Moreover, it appears that our system is best at resolving smaller words requiring only one or two insertions. When we analyzed the output in a different way, especially the high number of phonetic alternations remaining unresolved drew our attention.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion and Future Work",
"sec_num": "7"
},
{
"text": "For future work we believe that incorporating other modules into our system will further increase the overall performance. Considering the error analysis, we feel that a combination of the three metaphors (machine translation, spell checking and speech recognition) might produce an optimal combination of various features. Moreover, sometimes we would like to introduce a second round through some modules to tackle modulespecific problems. In order to really evaluate the ability to generalize over multiple genres we are currently training and testing our system on the individual text genres. Since we aim to make a system that can handle UGC, we also envisage to combine our three genres and thus experiment on the full set. First experiments have revealed that this does indeed increase overall performance. For now, we have only focused on normalization at the lexical level, so colloquial and ungrammatical language usage also presents an interesting alley for future work. Since previous work on English text normalization using MT approaches at the character-level has only focussed on abbreviations (Pennell and Liu, 2011) , we would also like to investigate whether our methodology can be applied to English noisy text as well.",
"cite_spans": [
{
"start": 1110,
"end": 1133,
"text": "(Pennell and Liu, 2011)",
"ref_id": "BIBREF18"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion and Future Work",
"sec_num": "7"
},
{
"text": "We are looking for ways to make our data sets publicly available.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion and Future Work",
"sec_num": "7"
},
{
"text": "Proof of this was found in the output of our token-based system.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "For example sis requires three insertions and luv requires both a substitution and an insertion.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [
{
"text": "We would like to thank our annotators for their hard work. and the reviewers for their valuable comments. This work was funded by three projects: PARIS 4 , SUBTLE 5 and AMiCA 6 .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgments",
"sec_num": null
}
],
"bib_entries": {
"BIBREF1": {
"ref_id": "b1",
"title": "A Phrase-based Statistical Model for SMS Text Normalization",
"authors": [
{
"first": "Aiti",
"middle": [],
"last": "Aw",
"suffix": ""
},
{
"first": "Zhang",
"middle": [],
"last": "Min",
"suffix": ""
},
{
"first": "Xiao",
"middle": [],
"last": "Juan",
"suffix": ""
},
{
"first": "Su",
"middle": [],
"last": "Jian",
"suffix": ""
}
],
"year": 2006,
"venue": "Proceedings of the COLING/ACL 2006 Main Conference Poster Sessions",
"volume": "",
"issue": "",
"pages": "33--40",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "AiTi Aw, Zhang Min, Xiao Juan, and Su Jian. 2006. A Phrase-based Statistical Model for SMS Text Nor- malization. In Proceedings of the COLING/ACL 2006 Main Conference Poster Sessions, pages 33- 40, Sydney, Australia.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "The CELEX Lexical Database. Linguistic Data Consortium. CD-ROM",
"authors": [
{
"first": "Harald",
"middle": [
"R"
],
"last": "Baayen",
"suffix": ""
},
{
"first": "Richard",
"middle": [],
"last": "Piepenbrock",
"suffix": ""
},
{
"first": "Leon",
"middle": [],
"last": "Gulikers",
"suffix": ""
}
],
"year": 1995,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Harald R. Baayen, Richard Piepenbrock, and Leon Gu- likers. 1995. The CELEX Lexical Database. Lin- guistic Data Consortium. CD-ROM.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Language of the internet. The Stanford Handbook for Language Engineers",
"authors": [
{
"first": "Naomi",
"middle": [
"S"
],
"last": "Baron",
"suffix": ""
}
],
"year": 2003,
"venue": "",
"volume": "",
"issue": "",
"pages": "59--127",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Naomi S. Baron. 2003. Language of the internet. The Stanford Handbook for Language Engineers, pages 59-127.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "A hybrid rule/model-based finite-state framework for normalizing sms messages",
"authors": [
{
"first": "Richard",
"middle": [],
"last": "Beaufort",
"suffix": ""
},
{
"first": "Sophie",
"middle": [],
"last": "Roekhaut",
"suffix": ""
},
{
"first": "Louise-Am\u00e9lie",
"middle": [],
"last": "Cougnon",
"suffix": ""
},
{
"first": "C\u00e9drick",
"middle": [],
"last": "Fairon",
"suffix": ""
}
],
"year": 2010,
"venue": "Proceedings of ACL",
"volume": "",
"issue": "",
"pages": "770--779",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Richard Beaufort, Sophie Roekhaut, Louise-Am\u00e9lie Cougnon, and C\u00e9drick Fairon. 2010. A hybrid rule/model-based finite-state framework for normal- izing sms messages. In Proceedings of ACL, pages 770-779.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "An unsupervised model for text message normalization",
"authors": [
{
"first": "Paul",
"middle": [],
"last": "Cook",
"suffix": ""
},
{
"first": "Suzanne",
"middle": [],
"last": "Stevenson",
"suffix": ""
}
],
"year": 2009,
"venue": "Proceedings of the NAACL HLT Workshop on Computational Approaches to Linguistic Creativity",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Paul Cook and Suzanne Stevenson. 2009. An unsu- pervised model for text message normalization. In Proceedings of the NAACL HLT Workshop on Com- putational Approaches to Linguistic Creativity.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Phonological Constraints and Morphological Preprocessing for Grapheme-to-Phoneme Conversion",
"authors": [
{
"first": "Vera",
"middle": [],
"last": "Demberg",
"suffix": ""
},
{
"first": "Helmut",
"middle": [],
"last": "Schmid",
"suffix": ""
},
{
"first": "Gregor",
"middle": [],
"last": "M\u00f6hler",
"suffix": ""
}
],
"year": 2007,
"venue": "45th Annual Meeting of the Association for Computational Linguistics (ACL 2007), 4 www",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Vera Demberg, Helmut Schmid, and Gregor M\u00f6hler. 2007. Phonological Constraints and Morphologi- cal Preprocessing for Grapheme-to-Phoneme Con- version. In 45th Annual Meeting of the Associ- ation for Computational Linguistics (ACL 2007), 4 www.parisproject.be 5 http://lt3.hogent.be/en/projects/subtle/ 6 http://www.amicaproject.be/",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Association for Computational Linguistics",
"authors": [
{
"first": "Czech",
"middle": [],
"last": "Prague",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Republic",
"suffix": ""
}
],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Prague, Czech Republic. Association for Computa- tional Linguistics.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "#hard-toparse: POS tagging and parsing the twitterverse",
"authors": [
{
"first": "Jennifer",
"middle": [],
"last": "Foster",
"suffix": ""
},
{
"first": "Ozlem",
"middle": [],
"last": "Cetinoglu",
"suffix": ""
},
{
"first": "Joachim",
"middle": [],
"last": "Wagner",
"suffix": ""
},
{
"first": "Joseph",
"middle": [
"Le"
],
"last": "Roux",
"suffix": ""
},
{
"first": "Stephen",
"middle": [],
"last": "Hogan",
"suffix": ""
},
{
"first": "Joakim",
"middle": [],
"last": "Nivre",
"suffix": ""
},
{
"first": "Deirdre",
"middle": [],
"last": "Hogan",
"suffix": ""
},
{
"first": "Josef",
"middle": [],
"last": "Van Genabith",
"suffix": ""
}
],
"year": 2011,
"venue": "Proceedings of the AAAI workshop on Analyzing Microtext",
"volume": "",
"issue": "",
"pages": "20--25",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jennifer Foster, Ozlem Cetinoglu, Joachim Wagner, Joseph Le Roux, Stephen Hogan, Joakim Nivre, Deirdre Hogan, and Josef van Genabith. 2011. #hard-toparse: POS tagging and parsing the twit- terverse. In Proceedings of the AAAI workshop on Analyzing Microtext, pages 20-25.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "The netlog corpus. a resource for the study of flemish dutch internet language",
"authors": [
{
"first": "Mike",
"middle": [],
"last": "Kestemont",
"suffix": ""
},
{
"first": "Claudia",
"middle": [],
"last": "Peersman",
"suffix": ""
},
{
"first": "Benny",
"middle": [
"De"
],
"last": "Decker",
"suffix": ""
},
{
"first": "Guy",
"middle": [
"De"
],
"last": "Pauw",
"suffix": ""
},
{
"first": "Kim",
"middle": [],
"last": "Luyckx",
"suffix": ""
},
{
"first": "Roser",
"middle": [],
"last": "Morante",
"suffix": ""
},
{
"first": "Frederik",
"middle": [],
"last": "Vaassen",
"suffix": ""
},
{
"first": "Janneke",
"middle": [],
"last": "Van De Loo",
"suffix": ""
},
{
"first": "Walter",
"middle": [],
"last": "Daelemans",
"suffix": ""
}
],
"year": 2012,
"venue": "Proceedings of the Eight International Conference on Language Resources and Evaluation (LREC'12)",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Mike Kestemont, Claudia Peersman, Benny De Decker, Guy De Pauw, Kim Luyckx, Roser Morante, Frederik Vaassen, Janneke van de Loo, and Walter Daelemans. 2012. The netlog corpus. a resource for the study of flemish dutch internet language. In Proceedings of the Eight International Conference on Language Resources and Evaluation (LREC'12), Istanbul, Turkey, may.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Normalizing SMS: are two metaphors better than one?",
"authors": [
{
"first": "Catherine",
"middle": [],
"last": "Kobus",
"suffix": ""
},
{
"first": "Yvon",
"middle": [],
"last": "Fran\u00e7ois",
"suffix": ""
},
{
"first": "Damnati",
"middle": [],
"last": "G\u00e9raldine",
"suffix": ""
}
],
"year": 2008,
"venue": "Proceedings of the 22nd International Conference on Computational Linguistics",
"volume": "",
"issue": "",
"pages": "441--448",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Catherine Kobus, Yvon Fran\u00e7ois, and Damnati G\u00e9raldine. 2008. Normalizing SMS: are two metaphors better than one? In Proceedings of the 22nd International Conference on Computational Linguistics (Coling 2008), pages 441-448, Manch- ester, UK.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Moses: Open Source Toolkit for Statistical Machine Translation",
"authors": [
{
"first": "Philipp",
"middle": [],
"last": "Koehn",
"suffix": ""
},
{
"first": "Hieu",
"middle": [],
"last": "Hoang",
"suffix": ""
},
{
"first": "Alexandra",
"middle": [],
"last": "Birch",
"suffix": ""
},
{
"first": "Chris",
"middle": [],
"last": "Callison-Burch",
"suffix": ""
},
{
"first": "Marcello",
"middle": [],
"last": "Federico",
"suffix": ""
},
{
"first": "Nicola",
"middle": [],
"last": "Bertoldi",
"suffix": ""
},
{
"first": "Brooke",
"middle": [],
"last": "Cowan",
"suffix": ""
},
{
"first": "Wade",
"middle": [],
"last": "Shen",
"suffix": ""
},
{
"first": "Christine",
"middle": [],
"last": "Moran",
"suffix": ""
},
{
"first": "Richard",
"middle": [],
"last": "Zens",
"suffix": ""
},
{
"first": "Chris",
"middle": [],
"last": "Dyer",
"suffix": ""
},
{
"first": "Ondrej",
"middle": [],
"last": "Bojar",
"suffix": ""
},
{
"first": "Alexandra",
"middle": [],
"last": "Constantin",
"suffix": ""
},
{
"first": "Evan",
"middle": [],
"last": "Herbst",
"suffix": ""
}
],
"year": 2007,
"venue": "Proceedings of the ACL 2007 Demo and Poster Sessions",
"volume": "",
"issue": "",
"pages": "177--180",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Philipp Koehn, Hieu Hoang, Alexandra Birch, Chris Callison-Burch, Marcello Federico, Nicola Bertoldi, Brooke Cowan, Wade Shen, Christine Moran, Richard Zens, Chris Dyer, Ondrej Bojar, Alexandra Constantin, and Evan Herbst. 2007. Moses: Open Source Toolkit for Statistical Machine Translation. In Proceedings of the ACL 2007 Demo and Poster Sessions, pages 177-180, Prague, Czech Republic.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "A Generative Probabilistic OCR Model for NLP Applications",
"authors": [
{
"first": "Okan",
"middle": [],
"last": "Kolak",
"suffix": ""
},
{
"first": "William",
"middle": [
"J"
],
"last": "Byrne",
"suffix": ""
},
{
"first": "Philip",
"middle": [],
"last": "Resnik",
"suffix": ""
}
],
"year": 2003,
"venue": "HLT-NAACL 2003: conference combining Human Language Technology conference series and the North American Chapter of the Association for Computational Linguistics conference series",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Okan Kolak, William J. Byrne, and Philip Resnik. 2003. A Generative Probabilistic OCR Model for NLP Applications. In HLT-NAACL 2003: confer- ence combining Human Language Technology con- ference series and the North American Chapter of the Association for Computational Linguistics con- ference series, Edmonton, Canada.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Memorybased vocalization of Arabic",
"authors": [
{
"first": "Sandra",
"middle": [],
"last": "K\u00fcbler",
"suffix": ""
},
{
"first": "Emad",
"middle": [],
"last": "Mohamed",
"suffix": ""
}
],
"year": 2008,
"venue": "Proceedings of the LREC Workshop on HLT and NLP within the Arabic World",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sandra K\u00fcbler and Emad Mohamed. 2008. Memory- based vocalization of Arabic. In Proceedings of the LREC Workshop on HLT and NLP within the Arabic World., Marrakech, Morocco.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Insertion, deletion or substitution? Normalizing text messages without pre-categorization nor supervision",
"authors": [
{
"first": "Fei",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Fuliang",
"middle": [],
"last": "Weng",
"suffix": ""
},
{
"first": "Bingqing",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Yang",
"middle": [],
"last": "Liu",
"suffix": ""
}
],
"year": 2011,
"venue": "Proceedings of the Annual Meeting of the Association for Computational Linguistics (ACL)",
"volume": "",
"issue": "",
"pages": "71--76",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Fei Liu, Fuliang Weng, Bingqing Wang, and Yang Liu. 2011a. Insertion, deletion or substitution? Normal- izing text messages without pre-categorization nor supervision. In Proceedings of the Annual Meet- ing of the Association for Computational Linguistics (ACL), pages 71-76.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Recognizing named entities in tweets",
"authors": [
{
"first": "Xiaohua",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Furu",
"middle": [],
"last": "Wei Shaodian",
"suffix": ""
},
{
"first": "Ming",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Zhou",
"suffix": ""
}
],
"year": 2011,
"venue": "Proceedings of the Annual Meeting of the Association for Computational Linguistics (ACL)",
"volume": "",
"issue": "",
"pages": "359--367",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Xiaohua Liu, Furu Wei Shaodian Zhang, and Ming Zhou. 2011b. Recognizing named entities in tweets. In Proceedings of the Annual Meeting of the Asso- ciation for Computational Linguistics (ACL), pages 359-367.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "A broad-coverage normalization system for social media language",
"authors": [
{
"first": "Fei",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Fuliang",
"middle": [],
"last": "Weng",
"suffix": ""
},
{
"first": "Xiao",
"middle": [],
"last": "Jiang",
"suffix": ""
}
],
"year": 2012,
"venue": "Proceedings of the Annual Meeting of the Association for Computational Linguistics (ACL)",
"volume": "",
"issue": "",
"pages": "1035--1044",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Fei Liu, Fuliang Weng, and Xiao Jiang. 2012. A broad-coverage normalization system for social me- dia language. In Proceedings of the Annual Meet- ing of the Association for Computational Linguistics (ACL), pages 1035-1044.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "The spoken dutch corpus. Outline and rst evaluation",
"authors": [
{
"first": "Nelleke",
"middle": [],
"last": "Oostdijk",
"suffix": ""
}
],
"year": 2000,
"venue": "Proceedings of the Second International Conference on Language Resources and Evaluation",
"volume": "",
"issue": "",
"pages": "887--894",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Nelleke Oostdijk. 2000. The spoken dutch corpus. Outline and rst evaluation. In Proceedings of the Second International Conference on Language Re- sources and Evaluation, pages 887-894.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "A characterlevel machine translation approach for normalization of SMS abbreviations",
"authors": [
{
"first": "Deana",
"middle": [
"L"
],
"last": "Pennell",
"suffix": ""
},
{
"first": "Yang",
"middle": [],
"last": "Liu",
"suffix": ""
}
],
"year": 2011,
"venue": "Proceedings of 5th International Joint Conference on Natural Language Processing",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Deana L. Pennell and Yang Liu. 2011. A character- level machine translation approach for normaliza- tion of SMS abbreviations. In Proceedings of 5th In- ternational Joint Conference on Natural Language Processing, Chiang Mai, Thailand. Asian Federation of Natural Language Processing.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "CS224N: Investigating SMS Text Normalization using Statistical Machine Translation",
"authors": [
{
"first": "Karthik",
"middle": [],
"last": "Raghunathan",
"suffix": ""
},
{
"first": "Stefan",
"middle": [],
"last": "Krawczyk",
"suffix": ""
}
],
"year": 2009,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Karthik Raghunathan and Stefan Krawczyk. 2009. CS224N: Investigating SMS Text Normalization us- ing Statistical Machine Translation. Technical re- port, Stanford University: Department of Computer Science.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Named entity recognition in tweets: An experimental study",
"authors": [
{
"first": "Alan",
"middle": [],
"last": "Ritter",
"suffix": ""
},
{
"first": "Sam",
"middle": [],
"last": "Clark",
"suffix": ""
},
{
"first": "Mausam",
"middle": [],
"last": "",
"suffix": ""
},
{
"first": "Oren",
"middle": [],
"last": "Etzioni",
"suffix": ""
}
],
"year": 2011,
"venue": "Proceedings of Empirical Methods for Natural Language Processing EMNLP",
"volume": "",
"issue": "",
"pages": "1524--1534",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Alan Ritter, Sam Clark, Mausam, and Oren Etzioni. 2011. Named entity recognition in tweets: An experimental study. In Proceedings of Empirical Methods for Natural Language Processing EMNLP, pages 1524-1534.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Investigating and modeling the structure of texting language",
"authors": [
{
"first": "Monojit",
"middle": [],
"last": "Choudhury Rahul",
"suffix": ""
},
{
"first": "Vijit",
"middle": [],
"last": "Saraf",
"suffix": ""
},
{
"first": "Animesh",
"middle": [],
"last": "Jain",
"suffix": ""
},
{
"first": "Sudeshna",
"middle": [],
"last": "Mukherjee",
"suffix": ""
},
{
"first": "Anupan",
"middle": [],
"last": "Sarkar",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Basu",
"suffix": ""
}
],
"year": 2007,
"venue": "International Journal on Document Analysis and Recognition",
"volume": "10",
"issue": "3",
"pages": "157--174",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Monojit Choudhury Rahul Saraf, Vijit Jain, Animesh Mukherjee, Sudeshna Sarkar, and Anupan Basu. 2007. Investigating and modeling the structure of texting language. International Journal on Docu- ment Analysis and Recognition, 10(3):157-174.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Diacritization as a machine translation problem and as a sequence labeling problem",
"authors": [
{
"first": "Tim",
"middle": [],
"last": "Schlippe",
"suffix": ""
},
{
"first": "Thuylinh",
"middle": [],
"last": "Nguyen",
"suffix": ""
},
{
"first": "Stephan",
"middle": [],
"last": "Vogel",
"suffix": ""
}
],
"year": 2008,
"venue": "MT at work: Proceedings of the Eighth Conference of the Association for Machine Translation in the Americas (AMTA-2008)",
"volume": "",
"issue": "",
"pages": "270--278",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Tim Schlippe, ThuyLinh Nguyen, and Stephan Vo- gel. 2008. Diacritization as a machine translation problem and as a sequence labeling problem. In MT at work: Proceedings of the Eighth Conference of the Association for Machine Translation in the Americas (AMTA-2008), pages 270-278, Waikiki, Hawai'i.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "Normalization of non-standard words",
"authors": [
{
"first": "Richard",
"middle": [],
"last": "Sproat",
"suffix": ""
},
{
"first": "Alan",
"middle": [
"W"
],
"last": "Black",
"suffix": ""
},
{
"first": "Stanley",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Shankar",
"middle": [],
"last": "Kumar",
"suffix": ""
},
{
"first": "Mari",
"middle": [],
"last": "Ostendorf",
"suffix": ""
},
{
"first": "Christopher",
"middle": [],
"last": "Richards",
"suffix": ""
}
],
"year": 2001,
"venue": "Computer, Speech and Language",
"volume": "15",
"issue": "3",
"pages": "287--333",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Richard Sproat, Alan W. Black, Stanley Chen, Shankar Kumar, Mari Ostendorf, and Christopher Richards. 2001. Normalization of non-standard words. Com- puter, Speech and Language, 15(3):287-333.",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "Essential Speech and Language Technology for Dutch, Theory and Applications of Natural Language Processing",
"authors": [
{
"first": "Peter",
"middle": [],
"last": "Spyns",
"suffix": ""
},
{
"first": "Jan",
"middle": [],
"last": "Odijk",
"suffix": ""
}
],
"year": 2013,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Peter Spyns and Jan Odijk. 2013. Essential Speech and Language Technology for Dutch, Theory and Applications of Natural Language Processing. Springer, Berlin.",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "Srilm -an extensible language modeling toolkit",
"authors": [
{
"first": "Andreas",
"middle": [],
"last": "Stolcke",
"suffix": ""
}
],
"year": 2002,
"venue": "Proceedings of the 7th International Conference on Spoken Language Processing",
"volume": "",
"issue": "",
"pages": "901--904",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Andreas Stolcke. 2002. Srilm -an extensible language modeling toolkit. In Proceedings of the 7th Interna- tional Conference on Spoken Language Processing (ICSLP 2002, pages 901-904.",
"links": null
},
"BIBREF26": {
"ref_id": "b26",
"title": "Character-based pivot translation for under-resourced languages and domains",
"authors": [
{
"first": "J\u00f6rg",
"middle": [],
"last": "Tiedemann",
"suffix": ""
}
],
"year": 2012,
"venue": "Proceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "141--151",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "J\u00f6rg Tiedemann. 2012. Character-based pivot trans- lation for under-resourced languages and domains. In Proceedings of the 13th Conference of the Euro- pean Chapter of the Association for Computational Linguistics, pages 141-151, Avignon, France.",
"links": null
},
"BIBREF27": {
"ref_id": "b27",
"title": "Henk van den Heuvel, and Nelleke Oostdijk",
"authors": [
{
"first": "Maaske",
"middle": [],
"last": "Treurniet",
"suffix": ""
},
{
"first": "Orph\u00e9e",
"middle": [],
"last": "De Clercq",
"suffix": ""
}
],
"year": 2012,
"venue": "Proceedings of the 8th Language Resources and Evaluation Conference (LREC'12)",
"volume": "",
"issue": "",
"pages": "2268--2273",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Maaske Treurniet, Orph\u00e9e De Clercq, Henk van den Heuvel, and Nelleke Oostdijk. 2012. Collection of a Corpus of Dutch SMS. In Proceedings of the 8th Language Resources and Evaluation Conference (LREC'12), pages 2268-2273, Istanbul, Turkey.",
"links": null
},
"BIBREF28": {
"ref_id": "b28",
"title": "Can we translate letters?",
"authors": [
{
"first": "David",
"middle": [],
"last": "Vilar",
"suffix": ""
},
{
"first": "Jan-Thorsten",
"middle": [],
"last": "Peter",
"suffix": ""
},
{
"first": "Herman",
"middle": [],
"last": "Ney",
"suffix": ""
}
],
"year": 2007,
"venue": "Proceedings of the Second Workshop on Statistical Machine Translation",
"volume": "",
"issue": "",
"pages": "33--39",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "David Vilar, Jan-Thorsten Peter, and Herman Ney. 2007. Can we translate letters? In Proceedings of the Second Workshop on Statistical Machine Trans- lation, pages 33-39, Prague, Czech Republic.",
"links": null
},
"BIBREF29": {
"ref_id": "b29",
"title": "Normalizing microtext",
"authors": [
{
"first": "Zhenzhen",
"middle": [],
"last": "Xue",
"suffix": ""
},
{
"first": "Dawei",
"middle": [],
"last": "Yin",
"suffix": ""
},
{
"first": "Brian",
"middle": [
"D"
],
"last": "Davison",
"suffix": ""
}
],
"year": 2011,
"venue": "Proceedings of the AAAI Workshop on Analyzing Microtext",
"volume": "",
"issue": "",
"pages": "74--79",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Zhenzhen Xue, Dawei Yin, and Brian D. Davison. 2011. Normalizing microtext. In Proceedings of the AAAI Workshop on Analyzing Microtext, pages 74-79.",
"links": null
}
},
"ref_entries": {
"TABREF3": {
"num": null,
"text": "Cascaded unigram 13.11 69.48 14.59 65.17 10.35 72.25 G. Cascaded bigram 14.65 66.55 14.59 64.79 10.36 72.25",
"html": null,
"content": "<table><tr><td>Training Set-ups</td><td/><td>Testing</td></tr><tr><td/><td>SMS</td><td>SNS</td><td>TWE</td></tr><tr><td/><td colspan=\"3\">WER BLEU WER BLEU WER BLEU</td></tr><tr><td>A. Original</td><td colspan=\"3\">21.70 65.54 20.41 66.03 13.26 76.10</td></tr><tr><td>B. Baseline</td><td colspan=\"3\">21.47 65.64 20.36 65.93 13.26 76.10</td></tr><tr><td>C. Token-level only</td><td colspan=\"3\">20.41 76.04 25.03 73.26 19.03 78.32</td></tr><tr><td>D. Unigram only</td><td colspan=\"3\">14.93 66.45 15.41 64.02 13.52 66.29</td></tr><tr><td>E. Bigram only</td><td colspan=\"3\">15.90 64.26 15.17 63.94 14.08 65.50</td></tr><tr><td>F.</td><td/><td/></tr></table>",
"type_str": "table"
},
"TABREF4": {
"num": null,
"text": "Missed instances according to error classification 2",
"html": null,
"content": "<table/>",
"type_str": "table"
}
}
}
} |