File size: 121,608 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 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 |
{
"paper_id": "O15-2002",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T08:10:01.572841Z"
},
"title": "HANSpeller: A Unified Framework for Chinese Spelling Correction",
"authors": [
{
"first": "Jinhua",
"middle": [],
"last": "Xiong",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Chinese Academy of Sciences",
"location": {
"settlement": "Beijing",
"country": "China"
}
},
"email": ""
},
{
"first": "Xueqi",
"middle": [],
"last": "Cheng",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Chinese Academy of Sciences",
"location": {
"settlement": "Beijing",
"country": "China"
}
},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "The number of people learning Chinese as a Foreign Language (CFL) has been booming in recent decades. The problem of spelling error correction for CFL learners increasingly is becoming important. Compared to the regular text spelling check task, more error types need to be considered in CFL cases. In this paper, we propose a unified framework for Chinese spelling correction. Instead of conventional methods, which focus on rules or statistics separately, our approach is based on extended HMM and ranker-based models, together with a rule-based model for further polishing, and a final decision-making step is adopted to decide whether to output the corrections or not. Experimental results on the test data of foreigner's Chinese essays provided by the SIGHAN 2014 bake-off illustrate the performance of our approach.",
"pdf_parse": {
"paper_id": "O15-2002",
"_pdf_hash": "",
"abstract": [
{
"text": "The number of people learning Chinese as a Foreign Language (CFL) has been booming in recent decades. The problem of spelling error correction for CFL learners increasingly is becoming important. Compared to the regular text spelling check task, more error types need to be considered in CFL cases. In this paper, we propose a unified framework for Chinese spelling correction. Instead of conventional methods, which focus on rules or statistics separately, our approach is based on extended HMM and ranker-based models, together with a rule-based model for further polishing, and a final decision-making step is adopted to decide whether to output the corrections or not. Experimental results on the test data of foreigner's Chinese essays provided by the SIGHAN 2014 bake-off illustrate the performance of our approach.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Recent studies have shown that Chinese has become a popular choice for a second language among international college students. More and more people are learning Chinese as a Foreign Language (CFL). It is very difficult, however, for CFL learners to master Chinese because of the intrinsic linguistic features of the Chinese language. When CFL learners write Chinese essays, they are prone to generating a greater number and more diversified spelling errors than native language learners. Therefore, spelling correction tools to support such learners in 2 Jinhua Xiong et al. correcting and polishing their Chinese essays is valuable and necessary. For the English language, there are many editing tools that provide spelling check functionality, e.g. Microsoft Word's spellchecker. For the Chinese language, however, such tools cannot be found until now.",
"cite_spans": [
{
"start": 562,
"end": 574,
"text": "Xiong et al.",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1."
},
{
"text": "Spelling correction has been studied for many years on regular text and web search queries. Although these two tasks share many common techniques, they have different concerns. Compared to techniques of web search query spelling correction, where corrections should be presented to search engine users in real-time, more complicated techniques can be applied to spelling correction on regular text to improve the performance, as such a situation has a lower real-time requirement.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1."
},
{
"text": "In spelling correction of Chinese essays of CFL learners, we face more challenges because of the uniqueness of the Chinese language. 1) Chinese corpora for spelling correction, especially publicly available ones, are rare, compared with English corpora. This impedes work on this practical topic.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1."
},
{
"text": "2) There are no natural delimiters, such as spaces, between Chinese words, which may result in errors in words splitting, which may cause more splitting errors.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1."
},
{
"text": "3) The number of error types is more than that of other cases, because CFL learners are prone to different kinds of errors that we cannot imagine as native speakers. There are four major error types that confuse people, as illustrated in Table 1 . ",
"cite_spans": [],
"ref_spans": [
{
"start": 238,
"end": 245,
"text": "Table 1",
"ref_id": "TABREF0"
}
],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1."
},
{
"text": "The first type is the misuse of homophone, which means learners choose the wrong characters with same pronunciation but different meanings. For example, \"\u4e00\u7b79\u83ab\u5c55\" may be misspelled as \"\u4e00\u6101\u83ab\u5c55\". Herein, the second character \"\u7b79\" is misspelled as \"\u6101,\" both with HANSpeller: A Unified Framework for Chinese Spelling Correction 3 the same pronunciation (ch\u00f3u). Another example is \"\u5e74\u5e74\u6709\u9c7c\" (There will be fish every year), which is homophonous with \"\u5e74\u5e74\u6709\u4f59\" (There will be surpluses every year). One should take context into account when judging this type of homophone. A single syllable may also have a range of different meanings. The Cihai dictionary lists 149 Chinese characters representing the syllable \"y\u00ec\".",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u6301\u7eed\u7684\u53d1\u5c55 \u6301\u7eed\u5730\u53d1\u5c55",
"sec_num": null
},
{
"text": "Second, there is the near-homophone error, which means the pronunciations of chosen words are very similar. For CFL learners, difference in diacritical markings may be not enough to distinguish. For example, there is a problem in discriminating pronunciation of the first character in the following sentences, \"\u597d\u7801\u5dee\u4e0d\u591a\u4e00\u6837\" and \"\u53f7\u7801\u5dee\u4e0d\u591a\u4e00\u6837\".",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u6301\u7eed\u7684\u53d1\u5c55 \u6301\u7eed\u5730\u53d1\u5c55",
"sec_num": null
},
{
"text": "Besides, some graphically similar Chinese characters are confusing, due to their similar shape. They differ only in subtle aspects. To distinguish between these characters, many aspects, such as sound, meaning, and collocations, should be taken into account. If you do not look carefully, you can hardly distinguish them, e.g. \"\u5982\u706b\u5982\u837c\" and \"\u5982\u706b\u5982\u8336,\" where the first one is correct, and the second one is wrong.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u6301\u7eed\u7684\u53d1\u5c55 \u6301\u7eed\u5730\u53d1\u5c55",
"sec_num": null
},
{
"text": "Finally, some error types usually are caused by grammar rules of Chinese, such as the usage of three confusable words \"\u7684,\" \"\u5730,\" and \"\u5f97\". Moreover, the last two words connect with two different pronunciations in different contexts. Therefore, checking correctness of the usage of these three words is difficult.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u6301\u7eed\u7684\u53d1\u5c55 \u6301\u7eed\u5730\u53d1\u5c55",
"sec_num": null
},
{
"text": "The direct reason why these error types are always encountered by CFL learners is that Chinese spelling is not phonetic and each word in a Chinese phrase has its specific meaning. Meanwhile, some other error types can be caused by various Chinese input methods.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u6301\u7eed\u7684\u53d1\u5c55 \u6301\u7eed\u5730\u53d1\u5c55",
"sec_num": null
},
{
"text": "The Chinese language is continuously evolving. Therefore, correction only based on static corpora is not enough. For example, traditional Chinese and simplified Chinese may have different choices for the same word. In some cases, it is very difficult to distinguish them. Thus, web-based high-quality resources should be considered for decision-making on spelling correction.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "4)",
"sec_num": null
},
{
"text": "To address the above challenges, we propose a unified framework, named HANSpeller, for Chinese essay spelling error detection and correction. Our method combines different methods to improve performance. The main contributions are as follows. (1) An HMM-based approach is used to segment sentences and generate candidates for sentence spelling corrections. (2) Under the unified framework, all kinds of error types can be integrated for candidate generation. We collect some error types that can only be found in CFL learner essays and add them into the candidate generation process. (3) In order to address evolving features of the Chinese language, an online high-quality corpus is collected for training and decision-making and online search engine results also are used in the ranking stage of our model, which can also improve the performance significantly.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "4)",
"sec_num": null
},
{
"text": "The rest of the paper is organized as follows. We discuss related works in Section 2, and we introduce our unified framework approach in Section 3, where we focus on the basic processes of our method. In Section 4, we present the detailed setup of the experimental evaluation and the results of the experiment. Finally, in Section 5, we conclude the paper and explore future directions.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "4)",
"sec_num": null
},
{
"text": "The study of spelling correction has a long history (Kukich, 1992) . It is aimed at identifying misspellings and choosing optimal words as suggested corrections. In other words, it contains two subtasks that involve spelling error detection and spelling error correction. In early research, the spelling corrections were mainly devoted to solving non-word errors; such errors were often caused by insertion, deletion, substitution, and transposition of letters in a valid word that result in an unknown word. A common strategy at that time was to rely on a word dictionary or some rules like Levenshtein distance (Levenshtein, 1966) . Mangu and Brill (1997) proposed a transition-based learning method for spelling correction. Their methods generated three types of rules from training data, which constructed a high performance and concise system for English.",
"cite_spans": [
{
"start": 52,
"end": 66,
"text": "(Kukich, 1992)",
"ref_id": "BIBREF23"
},
{
"start": 613,
"end": 632,
"text": "(Levenshtein, 1966)",
"ref_id": "BIBREF24"
},
{
"start": 635,
"end": 657,
"text": "Mangu and Brill (1997)",
"ref_id": "BIBREF27"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related works",
"sec_num": "2."
},
{
"text": "In these methods, however, the dictionaries and rules were always constructed manually, leading to very high cost. Therefore, statistics generative models were introduced for spelling correction, which made spelling correction step into a new stage. The error model and n-gram language model are two important models (Brill & Moore, 2000) . Atwell and Elliott (1987) used n-gram and part-of-speech language models for spelling corrections. Mays et al. (1991) used word-trigram probabilities for detecting and correcting real word errors. Brill et al. (2000) proposed a new channel model for spelling correction, based on generic string to string edits.",
"cite_spans": [
{
"start": 317,
"end": 338,
"text": "(Brill & Moore, 2000)",
"ref_id": null
},
{
"start": 341,
"end": 366,
"text": "Atwell and Elliott (1987)",
"ref_id": null
},
{
"start": 440,
"end": 458,
"text": "Mays et al. (1991)",
"ref_id": "BIBREF28"
},
{
"start": 538,
"end": 557,
"text": "Brill et al. (2000)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related works",
"sec_num": "2."
},
{
"text": "With the development of the Internet, the research and technology on query spelling correction for search engines has been studied intensively. The task of web-query spelling correction shares a lot of technology with traditional spelling correction, but it is more difficult. First, the spelling correction task is faced with more error types, as all kinds of errors may occur in a web environment. In addition, search queries consist of some key words rather than sentences, making some sentence-based methods achieve poor performance. Therefore, many novel ideas have been proposed by researchers. Cucerzan and Brill (2004) presented an iterative process for query spelling check, using a query log and trust dictionary. There, the noisy channel model was used to choose the best correction. Ahmad and Kondrak (2005) used the search query logs to learn a spelling error model, which improves the quality of query spelling check. Li et al. (2006) applied a distributional similarity based model for query spelling correction. Gao et al. (2010) presented a large-scale ranker-based system for search spelling correction, where the ranker uses web-scale language models and many kinds of features for better performance, including: surface-form similarity, phonetic-form similarity, entity, dictionary, and frequency features. Suzuki and Gao (2012) proposed a transliteration based character method using an approach inspired by the phrase-based statistical machine translation framework and attained good performance in online spelling correction.",
"cite_spans": [
{
"start": 601,
"end": 626,
"text": "Cucerzan and Brill (2004)",
"ref_id": "BIBREF9"
},
{
"start": 795,
"end": 819,
"text": "Ahmad and Kondrak (2005)",
"ref_id": "BIBREF0"
},
{
"start": 932,
"end": 948,
"text": "Li et al. (2006)",
"ref_id": "BIBREF25"
},
{
"start": 1028,
"end": 1045,
"text": "Gao et al. (2010)",
"ref_id": "BIBREF10"
},
{
"start": 1327,
"end": 1348,
"text": "Suzuki and Gao (2012)",
"ref_id": "BIBREF30"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related works",
"sec_num": "2."
},
{
"text": "Furthermore, Google and Microsoft have developed some application interfaces for checking spelling. Google (2010) has developed a Java API for a Google spelling check service. Microsoft (2010) provides a web n-gram service.",
"cite_spans": [
{
"start": 100,
"end": 113,
"text": "Google (2010)",
"ref_id": "BIBREF11"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related works",
"sec_num": "2."
},
{
"text": "The above works mainly target the task of English spelling correction. As to Chinese spelling correction, the situation is quite different because English words are separated naturally by spaces, while Chinese words are not. This nature of Chinese makes correction much more difficult than that of English. An early work was by Chang (1995) , which used a character dictionary of similar shape, pronunciation, meaning, and input-method-code to deal with the spelling correction task. The system replaced each character in the sentence with a similar character in the dictionary and calculated the probability of all modified sentences based on language model. Zhang (2000) introduced a method that can handle not only Chinese character substitution, but also insertion and deletion errors. They distinguished the way of matching between Chinese and English, thereby largely improving the performance over the work of Chang (1995) . Hung and Wu (2008) introduced a method that used manually edited error templates to correct errors. Zheng et al. (2011) found the fact that, when people type Chinese Pinyin, there are several wrong types. Then, they introduced a method based on a generative model and the input wrong types to correct spelling errors. Liu et al. (2011) pointed out that visually and phonologically similar characters are major factors for errors in Chinese text. Thus, by defining appropriate similarity measures that consider extended Cangjie codes, visually similar characters can be quickly identified.",
"cite_spans": [
{
"start": 328,
"end": 340,
"text": "Chang (1995)",
"ref_id": "BIBREF3"
},
{
"start": 660,
"end": 672,
"text": "Zhang (2000)",
"ref_id": "BIBREF34"
},
{
"start": 917,
"end": 929,
"text": "Chang (1995)",
"ref_id": "BIBREF3"
},
{
"start": 932,
"end": 950,
"text": "Hung and Wu (2008)",
"ref_id": "BIBREF19"
},
{
"start": 1032,
"end": 1051,
"text": "Zheng et al. (2011)",
"ref_id": "BIBREF36"
},
{
"start": 1250,
"end": 1267,
"text": "Liu et al. (2011)",
"ref_id": "BIBREF26"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related works",
"sec_num": "2."
},
{
"text": "Some Chinese spelling checkers have also incorporated word segmentation techniques. Huang et al. (2007) used a word segmentation tool (CKIP) to generate correction candidates before detecting Chinese spelling errors. Hung and Wu (2009) segmented the sentence using a bigram language model. In addition, they combined a confusion set and some error templates to improve the results. Chen and Wu (2010) modified the system on the basis of Huang and Wu (2009) using statistic-based methods and a template matching module.",
"cite_spans": [
{
"start": 84,
"end": 103,
"text": "Huang et al. (2007)",
"ref_id": "BIBREF17"
},
{
"start": 217,
"end": 235,
"text": "Hung and Wu (2009)",
"ref_id": null
},
{
"start": 437,
"end": 456,
"text": "Huang and Wu (2009)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related works",
"sec_num": "2."
},
{
"text": "In addition, a hybrid approach has been applied to Chinese spelling correction. Chang et al. (2012) used an inductive learning algorithm in Chinese spelling error classification and got better performance than C4.5, maximum entropy, and Naive Bayes classifiers. Hao et al. (2013) proposed a Tri-gram modeled-Weighted Finite-State Transducer method integrating confusing-character table, beam search, and A* to correct Chinese text errors. Jin et al. (2014) integrated three models, including an n-gram language model, a pinyin based language model, and a tone based language model, to improve the performance of a Chinese checking spelling error system.",
"cite_spans": [
{
"start": 80,
"end": 99,
"text": "Chang et al. (2012)",
"ref_id": "BIBREF5"
},
{
"start": 262,
"end": 279,
"text": "Hao et al. (2013)",
"ref_id": "BIBREF13"
},
{
"start": 439,
"end": 456,
"text": "Jin et al. (2014)",
"ref_id": "BIBREF22"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related works",
"sec_num": "2."
},
{
"text": "Chinese essay spelling correction as a special kind of spelling correction research effort has been promoted by efforts, such as the SIGHAN bake-offs (Yu et al., 2014; Wu et al., 2013) . Huang et al. (2014) used a tri-gram language model to detect and correct spelling errors. They also employed a dynamic algorithm and smoothing method to improve the efficiency. Chu and Lin (2014) used a word replacement strategy to generate candidates based on the expanded confusion set. Then, a rule-based classifier and SVM-based classifier were used to locate and correct errors. Gu et al. (2014) proposed two systems to solve the Chinese spelling check problem. One was built based on a CRF model, and the other was based on 2-Chars and 3-Chars model. Their experimental results showed that the latter model was better. Chiu et al. (2013) divided the correction task into two subtasks to solve. They used word segmentation to find errors and combined machine translation model to translate the wrong sentences into the appropriate ones. Hsieh et al. (2013) developed two error detection systems based on CKIP word segmentation tool and Google 1T uni-gram data, respectively. Jia et al. (2013) proposed a single source shortest path algorithm based on the graph model to correct spelling errors.",
"cite_spans": [
{
"start": 150,
"end": 167,
"text": "(Yu et al., 2014;",
"ref_id": "BIBREF33"
},
{
"start": 168,
"end": 184,
"text": "Wu et al., 2013)",
"ref_id": "BIBREF31"
},
{
"start": 187,
"end": 206,
"text": "Huang et al. (2014)",
"ref_id": null
},
{
"start": 571,
"end": 587,
"text": "Gu et al. (2014)",
"ref_id": "BIBREF12"
},
{
"start": 812,
"end": 830,
"text": "Chiu et al. (2013)",
"ref_id": "BIBREF7"
},
{
"start": 1029,
"end": 1048,
"text": "Hsieh et al. (2013)",
"ref_id": "BIBREF14"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related works",
"sec_num": "2."
},
{
"text": "In our system, we need to detect and correct spelling errors on Chinese essays that always are written by CFL learners. It has some different concerns with query text or query spelling correction. Noting that spelling correction methods require lexicons and/or language corpora, we adopt the method based on statistics combined with lexicon and rule-based methods.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Related works",
"sec_num": "2."
},
{
"text": "In this section, we present a unified framework, named HANSpeller, for Chinese spelling correction based on extended HMM and ranking models. The major idea of our approach is to model the spelling correction process as a ranking and decision-making problem. Figure 1 shows the whole outlined architecture of HANSpeller. It separates the Chinese spelling correction system into four major steps. First is to use the extended HMM model to generate the top-k candidates for the sentences being checked. Then, a ranking algorithm is applied to re-rank the correction candidates for later decision. The third step conducts rule-based analysis for a specific correction task, e.g. the correction rule of the usage of three confusable words \"\u7684,\" \"\u5730,\" and \"\u5f97\". Finally, the system makes decision whether to output the original sentence directly or correction results based on the previous output and global constrains.",
"cite_spans": [],
"ref_spans": [
{
"start": 258,
"end": 266,
"text": "Figure 1",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "A Unified Framework for Chinese Spelling Correction",
"sec_num": "3."
},
{
"text": "This framework provides a unified approach for spelling correction tasks, which can be regarded as a language independent framework and can be tailored to different scenarios. To HANSpeller: A Unified Framework for Chinese Spelling Correction 7 move to another scenario, you need to prepare a language related corpus, but you do not need to be an expert in that language. ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A Unified Framework for Chinese Spelling Correction",
"sec_num": "3."
},
{
"text": "Generating candidates of spelling correction is the basic part for the whole task, as it determines the upper bound of precision and recall rate of the approach. The HMM method can be used to generate candidates directly, but it faces several challenges when applied to Chinese essay spelling correction. (1) For high-quality spelling correction, the training of HMM is not a trivial task. (2) The long-span dependency in sentences makes a first-order hidden Markov model insufficient to catch contextual information. (3) Too many candidates make the algorithm not efficient enough, and some right corrections may be concealed by the wrong corrections.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Generating Candidates",
"sec_num": "3.1"
},
{
"text": "To address the above challenges, some extensions have been made to the HMM-based spelling correction approach. First, the HMM-based method is used only for the candidate generation phase, not for final output correction generation. All kinds of possible error transformations will be integrated into the framework of the HMM approach, so as to get a high recall rate. Second, a higher-order hidden Markov model is used to capture long-span context dependency. Third, in order to reduce the number of candidates generated in the process, each word in the sentence only can be replaced with its homophone, near-homophone, or similar-shape word. In addition, a pruning dynamic programming algorithm is adopted to dynamically select the best correction candidates for each round of sentence segmentation and correction. During the selection process of state, the edit distance and corrected results are combined to determine the quality of states. Let 1 2 3 N S w w w w \uf03d \uf0bc be a sentence needing correction, where each item i w is a word. C is a state generated from state transition and segmentation of the ' S s r-th character, and 1 2 3",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Generating Candidates",
"sec_num": "3.1"
},
{
"text": "s w w w w \uf0bc \uf025 \uf025 \uf025",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Generating Candidates",
"sec_num": "3.1"
},
{
"text": "\uf025 is the current corrected results in C . According to the noisy channel model, the occurrence probability of state C can be expressed as follows:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Generating Candidates",
"sec_num": "3.1"
},
{
"text": "\uf028 \uf029 \uf028 \uf029 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 | ( | ) ( ) ( ) r s r s s r P C P w w w w w w w w P w w w w w w w w P w w w w P w w w w \uf03d \uf0bc \uf0bc \uf0bc \uf0bc \uf0b4 \uf0bc \uf03d \uf0bc \uf025 \uf025 \uf025 \uf025 \uf025 \uf025 \uf025 \uf025 \uf025 \uf025 \uf025 \uf025 (1) As 1 2 3 ( ) r P w w w w \uf0bc",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Generating Candidates",
"sec_num": "3.1"
},
{
"text": "is the same for states in the same level, Equation (1) can be simplified as:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Generating Candidates",
"sec_num": "3.1"
},
{
"text": "1 2 3 1 2 3 1 2 3 ( | ) ( ) ( ) r s s P w w w w w w w w P P C w w w w \uf0bc \uf0bc \uf0b4 \uf0bc \uf0b5 \uf025 \uf025 \uf025 \uf025 \uf025 \uf025 \uf025 \uf025 (2) 1 w 1 r w \uf02d r w N w Candidates 1 2 3 s w w w w \uf0bc \uf025 \uf025 \uf025 \uf025",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Generating Candidates",
"sec_num": "3.1"
},
{
"text": "HANSpeller: A Unified Framework for Chinese Spelling Correction 9 1 2 3 1 2 3 1 2 3",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "State",
"sec_num": null
},
{
"text": "log ( | ) log ( ) log ( ) r s s P C P w w w w w w w w P w w w w \uf0b5 \uf0bc \uf0bc \uf02b \uf0bc \uf025 \uf025 \uf025 \uf025 \uf025 \uf025 \uf025 \uf025 (3)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "State",
"sec_num": null
},
{
"text": "Conceptually, the above formula can be calculated approximately using edit distance and n-gram language model. Symbolically, it can be represented by:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "State",
"sec_num": null
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "1 2 1 1 1 log ( ) tan ( ) ) log( | ) ... ( l lo og ( | ) . g ( ) . s s n s P w w w w P C edi w tdis ce C P w \uf02d \uf02b \uf02d \uf02b \uf02b \uf0b5 \uf02b \uf025 \uf025 \uf025 \uf025 \uf025 \uf025",
"eq_num": "(4)"
}
],
"section": "State",
"sec_num": null
},
{
"text": "In each round of the state generation stage, the best m states are selected according to the above calculated score. The remaining states are screened out to reduce the states' explosive growth, which improves the performance significantly. Finally, each sentence generates k candidates that represent the most likely correction results.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "State",
"sec_num": null
},
{
"text": "In the candidate generation phase, top-k best candidates for a sentence are generated, but the HMM-based framework does not have the flexibility to incorporate a wide variety of features useful for spelling correction, such as online search results. Therefore, it is necessary to re-rank the candidates using more rich features, which can improve the precision of spelling correction significantly.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Ranking Candidates",
"sec_num": "3.2"
},
{
"text": "Given the original sentence, our system first generates a list of candidate sentences based on previous results. Then, the candidates in the list are re-ranked at this stage, based on the confidence score generated by a ranker, herein by an SVM classifier. Finally, we choose the top-2 candidates with the highest score to make the final decision.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Ranking Candidates",
"sec_num": "3.2"
},
{
"text": "The features used in our system can be grouped into five categories. They are listed separately in the table below. The n-gram language probability for a sentence S can be illustrated as the following equation:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Ranking Candidates",
"sec_num": "3.2"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "\uf028 \uf029 \uf028 \uf029 \uf028 \uf029 \uf028 \uf029 \uf028 \uf029 1 2 1 2 1 1 2 1 , | |, ? n n n P S P w w w P w P w w P w w w w \uf02d \uf03d \uf0bc \uf03d \uf0bc \uf0bc",
"eq_num": "(5)"
}
],
"section": "Ranking Candidates",
"sec_num": "3.2"
},
{
"text": "Here,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Ranking Candidates",
"sec_num": "3.2"
},
{
"text": "1 P w is probability of word 1 w appearing in the corpus and 1 2 1",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\uf028 \uf029",
"sec_num": null
},
{
"text": "( | , )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\uf028 \uf029",
"sec_num": null
},
{
"text": "n n P w w w w \uf02d \uf0bc is the condition probability, which means the emergence probability of the word n w under conditions of words 1 2 1 , n w w w \uf02d \uf0bc appearing.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\uf028 \uf029",
"sec_num": null
},
{
"text": "Dictionary features count the number and proportion of phrases and idioms in candidates after segmentation, according to our dictionaries. In addition, some other factors, e.g. phrase length, are also taken into account.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\uf028 \uf029",
"sec_num": null
},
{
"text": "Here is an example of a traditional Chinese sentence: \u6839\u636e/\u8054\u5408\u56fd/\u516c\u5e03/\u7684/\u6570\u636e. The sub-sentence has 4 phrases and 0 idioms, and the proportion of phrases and idioms are 0.8 and 0.0, respectively, based on dictionaries.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\uf028 \uf029",
"sec_num": null
},
{
"text": "Edit distance features compute the edit number and its weight, from the original sentence to candidate sentences. Here, different edit operations are given different edit weights. For example, in our spelling correction system, we give homophone, near-homophone, and similar shape word different edit weights, which are determined by experience.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\uf028 \uf029",
"sec_num": null
},
{
"text": "Segmentation features use the results of the Maximum Matching Algorithm and the CKIP Parser segmentation. In addition, we count the number of single words. As we know, inappropriate candidates containing spelling errors will tend to have more single words after segmentation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\uf028 \uf029",
"sec_num": null
},
{
"text": "Web based features use Bing or another search engine's search results when submitting the spelling correction part and the corresponding part of the original sentence to the search engine.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\uf028 \uf029",
"sec_num": null
},
{
"text": "\"\u7ecf\u6d4e\u7279\u7eed\u589e\u957f\"and its candidate sentence \"\u7ecf\u6d4e\u6301\u7eed\u589e\u957f\" would be an example. When you search \"\u7ecf\u6d4e\u7279\u7eed\" or \"\u7279\u7eed\u589e\u957f\" and \"\u7ecf\u6d4e\u6301\u7eed\" or \"\u6301\u7eed\u589e\u957f\" using Bing, the search engine will return different hits.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\uf028 \uf029",
"sec_num": null
},
{
"text": "In our framework, the re-ranking phase is a must, because the candidates generated by HMM are ordered only by n-gram language probability and edit distance and the optimal state of the HMM is not necessarily the best candidate. So, we use more features to reorder the candidates to view the candidate sentences according to the actual quality of candidates as much as possible. This step can help to improve the performance of final spelling correction.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\uf028 \uf029",
"sec_num": null
},
{
"text": "In order to verify the effectiveness of re-ranking, we give the performance, whether adopting re-ranking or not, through experiments in the fourth section of the paper.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\uf028 \uf029",
"sec_num": null
},
{
"text": "As illustrated in Figure 1 , the third step conducts rule-based analysis for a specific correction task. Some common errors still are difficult to distinguish, such as the usage of three confusable words \"\u7684,\" \"\u5730,\" and \"\u5f97\". In order to correct such errors, syntactic analysis must be developed. The following sentence contains an error of Chinese syntax: \u4eca\u5929/\u6211/\u7a7f\u7740/\u521a/\u4e70/\u5730/\u65b0/\u8863\u670d\u3002 Here, the character \"\u5730\" should be corrected to another character \"\u7684\". To deal with these kinds of errors, sentence parsing must be done to check and correct such errors before the syntactic rules are applied. We have summarized three rules of usage for \"\u7684,\" \"\u5730,\" and \"\u5f97\" according to Chinese grammar as follows.",
"cite_spans": [],
"ref_spans": [
{
"start": 18,
"end": 26,
"text": "Figure 1",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Rule-based Correction for Errors",
"sec_num": "3.3"
},
{
"text": "The Chinese character \"\u7684\" is the tag of attributes, which generally is used in front of subjects and objects. Words in front of \"\u7684\" generally are used to modify or restrict things following \"\u7684\". The Chinese character \"\u5730\" is adverbial marker, usually used in front of predicates (verbs, adjectives) . Words in front of \"\u5730\" generally are used to describe actions following \"\u5730\". The Chinese character \"\u5f97\" makes the complement and generally is used behind predicates. The part follows \"\u5f97\" generally is used to supplement the previous action.",
"cite_spans": [
{
"start": 278,
"end": 297,
"text": "(verbs, adjectives)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Rule-based Correction for Errors",
"sec_num": "3.3"
},
{
"text": "In addition, some other specific rules are needed to improve the final performance, which can be concluded from the test data and corpus.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Rule-based Correction for Errors",
"sec_num": "3.3"
},
{
"text": "Through the aforementioned processing steps, we choose the top-2 candidates for each sub-sentence. To make the final decision on spelling correction, some global constraints should be considered, which can be summarized into four categories.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Decision-making on Corrections",
"sec_num": "3.4"
},
{
"text": "First, the number of errors in sub-sentence candidates should be considered. If there are more than three errors in a sub-sentence, then we do not correct the sub-sentence. Second, we set different weights for different types of spelling errors by experience. For example, syntactic errors need to be given more weight than others, as these errors are detected by some strong syntactic rules. Then, if the original sub-sentence is in its candidate set, the sub-sentence has a greater probability of being error-free. Finally, the ratio of corrected sentences to the total amount of checked sentences is also one of the factors to consider. This ratio relates to the average error rate of CFL essays. is all more than 3 or the original sub-sentence is in In",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Decision-making on Corrections",
"sec_num": "3.4"
},
{
"text": "Step 2) above, there is a function to calculate the score of candidate, and the score can be computed as follows:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Decision-making on Corrections",
"sec_num": "3.4"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "( ) _ _ _ score candidte edit weight original weight edit num \uf03d \uf02b \uf02d",
"eq_num": "(6)"
}
],
"section": "Decision-making on Corrections",
"sec_num": "3.4"
},
{
"text": "where _ edit weight is the edit weight of the candidate, _ original weight is the weight of whether the candidate is original sentence or not, and _ edit num is the number of edits in candidate. The weights currently are set by experience. The value of _ edit weight is set according to the error type. If the type is homophone or similar shape, _ edit weight is set to 0.8, otherwise it is set to 0.5. The value of _ original weight is also set by experience. If the candidate is original sentence, it is set to 1, otherwise it is set to 0.75.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Decision-making on Corrections",
"sec_num": "3.4"
},
{
"text": "On the basis of the above rules, we developed a rule-based classifier to get the final correction result of each sentence.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Decision-making on Corrections",
"sec_num": "3.4"
},
{
"text": "In the experiment, 1062 traditional Chinese sentences with/without spelling errors were given, which were from CFL learners' essays. The error types in the sentences mainly resulted from three different categories, being homophone, near-homophone, or similar-shape. The test data was provided by SIGHAN 2014 Bake-off: Chinese Spelling Check Task.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Setting",
"sec_num": "4.1"
},
{
"text": "As the test data set was based on traditional Chinese, we must consider building a traditional Chinese corpus to train our model. In our system, we use several corpora, including Taiwan Web as corpus; SogouW dictionary, which is a traditional Chinese dictionary translated from the simplified Chinese dictionary Sogou, a traditional Chinese dictionary of words and idioms; a pinyin table and a cangjie code table of common words; and some Web based resources. The details of the corpora are described below.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Setting",
"sec_num": "4.1"
},
{
"text": "(1) Taiwan Web Pages as Corpus Due to the difference in simplified Chinese and traditional Chinese, although we have a high quality simplified Chinese corpus, we do not translate the simplified corpus into a traditional corpus because the translation process may cause information loss, such as the fact that both\"\u9031\u672b\" and \"\u5468\u672b\" in traditional Chinese are translated into \"\u5468\u672b\" in simplified Chinese. Therefore, we try to find Taiwan webs whose pages contain high quality traditional Chinese text to build the corpus. We gathered pages from the artificially selected pages under the \".tw\" domain, containing around 3.2 million web pages, to build the corpus. Then, the content extracted from these pages was used to build a traditional Chinese n-gram model, where n is from 2 to 4.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Setting",
"sec_num": "4.1"
},
{
"text": "(2) SogouW Dictionary SogouW dictionary is built from the statistical analysis of Chinese Internet corpus by Sogou Search Engine. It contains about 150,000 high-frequency words of the Chinese Internet. Nevertheless, words in the corpus are simplified Chinese characters that cannot be used directly. We first translated them into traditional Chinese via Google translation service.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Setting",
"sec_num": "4.1"
},
{
"text": "As introduced in Chiu et al. (2013) , we also obtained the Chinese words and Chinese idioms published by the Ministry of Education of Taiwan, which are built from dictionaries and related books. There are 64,326 distinct Chinese words and 48,030 distinct Chinese idioms. We combined these two dictionaries with the SogouW dictionary to build our trie tree dictionary.",
"cite_spans": [
{
"start": 17,
"end": 35,
"text": "Chiu et al. (2013)",
"ref_id": "BIBREF7"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "(3) Chinese Words and Idioms Dictionary",
"sec_num": null
},
{
"text": "We collected more than 10000 pinyin forms of words commonly used in Taiwan to build the homophone and near-homophone words table, which will be used in candidate generation phase. In addition, cangjie code can be used to measure the form/shape similarity between Chinese characters. Therefore, we collected cangjie codes to build the table of Similar-form characters.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "(4) Pinyin and Cangjie Code Table",
"sec_num": null
},
{
"text": "We use the online CKIP Parser results to help rank the candidates. For example, the segmentation of \"\u7279\u7e8c\u4e0b\u6ed1\" is \"\u7279/\u7e8c/\u4e0b\u6ed1\" while \"\u6301\u7e8c\u4e0b\u6ed1\" is \"\u6301\u7e8c/\u4e0b\u6ed1\". Thus, the segmentation results of a wrong candidate sentence will have more words than the correct one.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "(5) Web based Resources",
"sec_num": null
},
{
"text": "In addition, we use the Bing search results as one feature in the candidate ranking phase, which clearly improves the performance. For example, the sentence \"\u6839\u64da\u806f\u5408\u570b\u516c\u5e03\u7684\u6578\u5b57\" has several candidate sentences, one of which may be \"\u6839\u64da\u806f\u5408\u570b\u516c\u4f48\u7684\u6578\u5b57\". If we use Bing to search the error correction part and the corresponding part of the original sentence \"\u806f \u5408\u570b\u516c\u4f48\" and \"\u806f\u5408\u570b\u516c\u5e03,\" the search results will be clear enough to identify the correct candidate sentence, because the first one would be more popular than the second one on the web corpus.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "(5) Web based Resources",
"sec_num": null
},
{
"text": "To evaluate the method we propose, a Chinese spelling check system was implemented. We have done some experiments to prove the effectiveness of our method for Chinese spelling correction. The task can be divided into two related subtasks. One is error detection and the other one is error correction. Chinese spelling error detection task aims to find out the location of the spelling errors in the sentences. The error correction task aims to correct the error words found in the error detection phase. There are five metrics, used to evaluate the performance of different methods. They are calculated as the following expression:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation Results and Analysis",
"sec_num": "4.2"
},
{
"text": "(FalsePositiveRate) FP FPR FP TN \uf03d \uf02b (Accuracy) TP TN A TP TN FP FN \uf02b \uf03d \uf02b \uf02b \uf02b (Precision) TP P TP FP \uf03d \uf02b (Re ) TP R call TP FN \uf03d \uf02b 2 * * 1 P R F Score P R \uf02d \uf03d \uf02b",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation Results and Analysis",
"sec_num": "4.2"
},
{
"text": "where TP , FP , TN , and FN can be obtained from the confusion matrix in Table 3 . 11 competing teams joined the SIGHAN Bake-off 2014 and submitted their final results. These submitted methods are used to evaluate the performance of our proposed framework. NCTU & NTUT used a CRF-based parser and scored with a tri-gram LM; NCYU combined E-Hownet and n-gram models to construct the rule induction; NJUPT developed two CSC systems based on CRF model and 2 Chars & 3-Chars model, respectively; NTHU used a channel model and a character-based language model in the noisy model; SinicaCKIP combined the error template rules and n-gram models for Chinese spelling correction; the SJTU proposed an improved graph model based on a graph model for generic errors and two independently trained models for specific errors. The results of the two subtasks are described in detail in Sections 4.2.1 and 4.1.2.",
"cite_spans": [],
"ref_spans": [
{
"start": 73,
"end": 80,
"text": "Table 3",
"ref_id": "TABREF3"
}
],
"eq_spans": [],
"section": "Evaluation Results and Analysis",
"sec_num": "4.2"
},
{
"text": "In addition, we will analyze the effects of several features used in the ranking stage on the final results. The comparative results are introduced in Section 4.2.3.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation Results and Analysis",
"sec_num": "4.2"
},
{
"text": "The goal of this subtask is to detect whether a Chinese sentence contains errors or not. If the sentence contains errors, the subtask must point out the location of the error word. Table 4 shows the evaluation results of Chinese spelling error detection. The above results illustrate that our system significantly outperforms other systems with submitted technique reports to the organizer in this subtask. This is due to our method using the extended HMM to guarantee the recall rate and introducing the re-rank phase combined with rich features to improve the precision.",
"cite_spans": [],
"ref_spans": [
{
"start": 181,
"end": 188,
"text": "Table 4",
"ref_id": null
}
],
"eq_spans": [],
"section": "Chinese Spelling Error Detection",
"sec_num": "4.2.1"
},
{
"text": "The subtask is based on the task of error detection. The main idea is to correct the errors found in the detection phase. In this stage, each sentence will be corrected and compared to the reference answer. Our system showed good performance in this subtask. The error correction results are shown in Table 5 . The results show that our system also provides good performance in the correction subtask. This is because it achieves good results in the detection subtask, which is the basis of the correction subtask.",
"cite_spans": [],
"ref_spans": [
{
"start": 301,
"end": 308,
"text": "Table 5",
"ref_id": "TABREF5"
}
],
"eq_spans": [],
"section": "Chinese Spelling Error Correction",
"sec_num": "4.2.2"
},
{
"text": "In this part, we compare the effects of several features used in the ranking step on the final results. As the dictionary features and segmentation features are closely related, we ignore the comparison of segmentation features. In the experiment, we conducted the test over multiple rounds, where we excluded one kind of feature in each round. The test results are shown in Table 6 . Based on the results above, the language model features and web-based features are the two most important features in the ranking phase on the final results, as the two features mainly reflect the quality of web based corpus.",
"cite_spans": [],
"ref_spans": [
{
"start": 375,
"end": 382,
"text": "Table 6",
"ref_id": "TABREF6"
}
],
"eq_spans": [],
"section": "The Influence of Different Ranking Features",
"sec_num": "4.2.3"
},
{
"text": "In this part, we verify the important role of re-ranking in the spelling correction. We correct the sentences in two ways, one only based on HMM and the other adopting re-ranking after generating candidates. Table 7 shows the final results. As illustrated by the above results, re-ranking significantly improves the performance of results both in the error-detection and the error-correction tasks. In the error-detection task, the method with re-ranking outperforms the method without re-ranking with 19.92% improvement in precision and 14.4% improvement in recall rate. In the error-correction task, the precision and recall rate increase by 27.22% and 16.67%, respectively.",
"cite_spans": [],
"ref_spans": [
{
"start": 208,
"end": 215,
"text": "Table 7",
"ref_id": "TABREF7"
}
],
"eq_spans": [],
"section": "The Influence of Re-ranking",
"sec_num": "4.2.4"
},
{
"text": "This paper proposes a unified framework (HANSpeller) for Chinese essay spelling correction based on extended HMM and ranker-based models. An extended HMM is proposed to generate candidate sentences for ranking. A rule-based strategy is used for further correction polishing and for a final decision on whether the output is the correction or not. Our approach was evaluated at the CLP-2014 bake-off on the Chinese spelling correction task, and it displayed good performance, ranking second among 13 teams.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "5."
},
{
"text": "Some interesting future work on Chinese spelling correction would include: (1) collecting and considering more error types in the candidates generating process and (2) how to better deal with the differences between traditional and simplified Chinese.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "5."
},
{
"text": "JinhuaXiong et al.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Learning a spelling error model from search query logs",
"authors": [
{
"first": "F",
"middle": [],
"last": "Ahmad",
"suffix": ""
},
{
"first": "G",
"middle": [],
"last": "Kondrak",
"suffix": ""
}
],
"year": 2005,
"venue": "Proceeding of the conference on Human Language Technology and Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "955--962",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ahmad, F., & Kondrak, G. (2005). Learning a spelling error model from search query logs. In Proceeding of the conference on Human Language Technology and Empirical Methods in Natural Language Processing, 955-962.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Dealing with ill-formed English text. The Computational Analysis of English: A Corpus-Based Approach",
"authors": [
{
"first": "E",
"middle": [
"S"
],
"last": "Atwell",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Elliot",
"suffix": ""
}
],
"year": 1987,
"venue": "",
"volume": "",
"issue": "",
"pages": "120--138",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Atwell, E. S., & Elliot, S. (1987). Dealing with ill-formed English text. The Computational Analysis of English: A Corpus-Based Approach, 120-138.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "An improved error model for noisy channel spelling correction",
"authors": [
{
"first": "E",
"middle": [],
"last": "Bril",
"suffix": ""
},
{
"first": "R",
"middle": [
"C"
],
"last": "Moore",
"suffix": ""
}
],
"year": 2000,
"venue": "Proceeding of the 38th Annual Meeting on Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "286--293",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Bril, E., & Moore, R. C. (2000). An improved error model for noisy channel spelling correction. In Proceeding of the 38th Annual Meeting on Association for Computational Linguistics, 286-293.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "A new approach for automatic Chinese spelling correction",
"authors": [
{
"first": "C",
"middle": [
"H"
],
"last": "Chang",
"suffix": ""
}
],
"year": 1995,
"venue": "Proceeding of Natural Language Processing Pacific Rim Symposium",
"volume": "",
"issue": "",
"pages": "278--283",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Chang, C. H. (1995). A new approach for automatic Chinese spelling correction. In Proceeding of Natural Language Processing Pacific Rim Symposium, 278-283.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "HANSpeller: A Unified Framework for Chinese Spelling Correction 19",
"authors": [],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "HANSpeller: A Unified Framework for Chinese Spelling Correction 19",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Error Diagnosis of Chinese Sentences Using Inductive Learning Algorithm and Decomposition-Based Testing Mechanism",
"authors": [
{
"first": "R",
"middle": [
"Y"
],
"last": "Chang",
"suffix": ""
},
{
"first": "C",
"middle": [
"H"
],
"last": "Wu",
"suffix": ""
},
{
"first": "P",
"middle": [
"K"
],
"last": "Prasetyo",
"suffix": ""
}
],
"year": 2012,
"venue": "ACM Transactions on Asian Language Information Processing (TALIP)",
"volume": "11",
"issue": "1",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Chang, R. Y., Wu, C. H., & Prasetyo, P. K. (2012). Error Diagnosis of Chinese Sentences Using Inductive Learning Algorithm and Decomposition-Based Testing Mechanism. ACM Transactions on Asian Language Information Processing (TALIP), 11(1), 3.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Improve the detection of improperly used Chinese characters with noisy channel model and detection template (Doctoral dissertation",
"authors": [
{
"first": "Y",
"middle": [
"Z"
],
"last": "Chen",
"suffix": ""
}
],
"year": 2010,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Chen, Y. Z. (2010). Improve the detection of improperly used Chinese characters with noisy channel model and detection template (Doctoral dissertation, Master thesis, Chaoyang University of Technology).",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Chinese Spelling Checker Based on Statistical Machine Translation",
"authors": [
{
"first": "H",
"middle": [
"W"
],
"last": "Chiu",
"suffix": ""
},
{
"first": "J",
"middle": [
"C"
],
"last": "Wu",
"suffix": ""
},
{
"first": "J",
"middle": [
"S"
],
"last": "Chang",
"suffix": ""
}
],
"year": 2013,
"venue": "Proceeding of the Seventh SIGHAN Workshop on Chinese Language Processing",
"volume": "",
"issue": "",
"pages": "49--53",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Chiu, H. W., Wu, J. C., & Chang, J. S. (2013). Chinese Spelling Checker Based on Statistical Machine Translation. In Proceeding of the Seventh SIGHAN Workshop on Chinese Language Processing (SIGHAN-7), 49-53.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "NTOU Chinese Spelling Check System in CLP Bake-off",
"authors": [
{
"first": "W",
"middle": [
"C"
],
"last": "Chu",
"suffix": ""
},
{
"first": "C",
"middle": [
"J"
],
"last": "Lin",
"suffix": ""
}
],
"year": 2014,
"venue": "Proceeding of the Third CIPS-SIGHAN Joint Conference on Chinese Language Processing",
"volume": "",
"issue": "",
"pages": "210--215",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Chu, W. C., & Lin, C. J. (2014). NTOU Chinese Spelling Check System in CLP Bake-off 2014. In Proceeding of the Third CIPS-SIGHAN Joint Conference on Chinese Language Processing, 210-215.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Spelling Correction as an Iterative Process that Exploits the Collective Knowledge of Web Users",
"authors": [
{
"first": "S",
"middle": [],
"last": "Cucerzan",
"suffix": ""
},
{
"first": "E",
"middle": [],
"last": "Brill",
"suffix": ""
}
],
"year": 2004,
"venue": "Proceeding of EMNLP",
"volume": "",
"issue": "",
"pages": "293--300",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Cucerzan, S., & Brill, E. (2004). Spelling Correction as an Iterative Process that Exploits the Collective Knowledge of Web Users. In Proceeding of EMNLP, 293-300.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "A large scale ranker-based system for search query spelling correction",
"authors": [
{
"first": "J",
"middle": [],
"last": "Gao",
"suffix": ""
},
{
"first": "X",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "D",
"middle": [],
"last": "Micol",
"suffix": ""
},
{
"first": "C",
"middle": [],
"last": "Quirk",
"suffix": ""
},
{
"first": "X",
"middle": [],
"last": "Sun",
"suffix": ""
}
],
"year": 2010,
"venue": "Proceeding of the 23rd International Conference on Computational Linguistics",
"volume": "",
"issue": "",
"pages": "358--366",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Gao, J., Li, X., Micol, D., Quirk, C., & Sun, X. (2010). A large scale ranker-based system for search query spelling correction. In Proceeding of the 23rd International Conference on Computational Linguistics, 358-366.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "A Java API for Google spelling check service",
"authors": [
{
"first": "",
"middle": [],
"last": "Google",
"suffix": ""
}
],
"year": 2010,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Google. (2010). A Java API for Google spelling check service. http://code.google.com/p/google-api-spellingjava/",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Introduction to NJUPT Chinese Spelling Check Systems in CLP-2014 Bakeoff",
"authors": [
{
"first": "L",
"middle": [],
"last": "Gu",
"suffix": ""
},
{
"first": "Y",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "X",
"middle": [],
"last": "Liang",
"suffix": ""
}
],
"year": 2014,
"venue": "Proceeding of the Third CIPS-SIGHAN Joint Conference on Chinese Language Processing",
"volume": "",
"issue": "",
"pages": "167--172",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Gu, L., Wang, Y., & Liang, X. (2014). Introduction to NJUPT Chinese Spelling Check Systems in CLP-2014 Bakeoff. In Proceeding of the Third CIPS-SIGHAN Joint Conference on Chinese Language Processing, 167-172.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Automated error detection and correction of chinese characters in written essays based on weighted finite-state transducer",
"authors": [
{
"first": "S",
"middle": [],
"last": "Hao",
"suffix": ""
},
{
"first": "Z",
"middle": [],
"last": "Gao",
"suffix": ""
},
{
"first": "M",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Y",
"middle": [],
"last": "Xu",
"suffix": ""
},
{
"first": "H",
"middle": [],
"last": "Peng",
"suffix": ""
},
{
"first": "K",
"middle": [],
"last": "Su",
"suffix": ""
},
{
"first": "D",
"middle": [],
"last": "Ke",
"suffix": ""
}
],
"year": 2013,
"venue": "Proceeding of the 12thInternational Conference on Document Analysis and Recognition (ICDAR)",
"volume": "",
"issue": "",
"pages": "763--767",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Hao, S., Gao, Z., Zhang, M., Xu, Y., Peng, H., Su, K., & Ke, D. (2013). Automated error detection and correction of chinese characters in written essays based on weighted finite-state transducer. In Proceeding of the 12thInternational Conference on Document Analysis and Recognition (ICDAR), 763-767.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Introduction to CKIP Spelling Check System for SIGHAN Bakeoff 2013 Evaluation",
"authors": [
{
"first": "Y",
"middle": [
"M"
],
"last": "Hsieh",
"suffix": ""
},
{
"first": "M",
"middle": [
"H"
],
"last": "Bai",
"suffix": ""
},
{
"first": "K",
"middle": [
"J"
],
"last": "Chen",
"suffix": ""
}
],
"year": 2013,
"venue": "Proceeding of the Seventh SIGHAN Workshop on Chinese Language Processing",
"volume": "",
"issue": "",
"pages": "59--63",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Hsieh, Y. M., Bai, M. H., & Chen, K. J. (2013). Introduction to CKIP Spelling Check System for SIGHAN Bakeoff 2013 Evaluation. In Proceeding of the Seventh SIGHAN Workshop on Chinese Language Processing (SIGHAN-7), 59-63.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Chinese Spelling Check System Based on Tri-gram model",
"authors": [],
"year": null,
"venue": "Proceeding of the Third CIPS-SIGHAN Joint Conference on Chinese Language Processing",
"volume": "",
"issue": "",
"pages": "173--178",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Chinese Spelling Check System Based on Tri-gram model. In Proceeding of the Third CIPS-SIGHAN Joint Conference on Chinese Language Processing, 173-178.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Error detection and correction based on Chinese phonemic alphabet in Chinese text",
"authors": [
{
"first": "C",
"middle": [
"M"
],
"last": "Huang",
"suffix": ""
},
{
"first": "M",
"middle": [
"C"
],
"last": "Wu",
"suffix": ""
},
{
"first": "C",
"middle": [
"C"
],
"last": "Chang",
"suffix": ""
}
],
"year": 2007,
"venue": "In Modeling Decisions for Artificial Intelligence",
"volume": "",
"issue": "",
"pages": "463--476",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Huang, C. M., Wu, M. C., & Chang, C. C. (2007). Error detection and correction based on Chinese phonemic alphabet in Chinese text. In Modeling Decisions for Artificial Intelligence, 463-476.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Automatic Chinese character error detecting system based on n-gram language model and pragmatics knowledge base (Doctoral dissertation",
"authors": [
{
"first": "T",
"middle": [
"H"
],
"last": "Hung",
"suffix": ""
}
],
"year": 2009,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Hung, T. H. (2009). Automatic Chinese character error detecting system based on n-gram language model and pragmatics knowledge base (Doctoral dissertation, Master thesis, Chaoyang University of Technology).",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Chinese essay error detection and suggestion system",
"authors": [
{
"first": "T",
"middle": [
"H"
],
"last": "Hung",
"suffix": ""
},
{
"first": "S",
"middle": [
"H"
],
"last": "Wu",
"suffix": ""
}
],
"year": 2008,
"venue": "Taiwan E-Learning Forum",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Hung, T. H., & Wu, S. H. (2008). Chinese essay error detection and suggestion system. In Taiwan E-Learning Forum 2008.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Graph Model for Chinese Spelling Checking",
"authors": [
{
"first": "Z",
"middle": [
"Y"
],
"last": "Jia",
"suffix": ""
},
{
"first": "P",
"middle": [
"L"
],
"last": "Wang",
"suffix": ""
},
{
"first": "H",
"middle": [],
"last": "Zhao",
"suffix": ""
}
],
"year": 2013,
"venue": "Proceeding of the Seventh SIGHAN Workshop on Chinese Language Processing",
"volume": "",
"issue": "",
"pages": "88--92",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jia, Z. Y., Wang, P. L., & Zhao, H. (2013). Graph Model for Chinese Spelling Checking. In Proceeding of the Seventh SIGHAN Workshop on Chinese Language Processing (SIGHAN-7), 88-92",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Integrating Pinyin to Improve Spelling Errors Detection for Chinese Language",
"authors": [
{
"first": "P",
"middle": [],
"last": "Jin",
"suffix": ""
},
{
"first": "X",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Z",
"middle": [],
"last": "Guo",
"suffix": ""
},
{
"first": "P",
"middle": [],
"last": "Liu",
"suffix": ""
}
],
"year": 2014,
"venue": "Proceeding of the 2014 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies",
"volume": "",
"issue": "",
"pages": "455--458",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jin, P., Chen, X., Guo, Z., & Liu, P. (2014). Integrating Pinyin to Improve Spelling Errors Detection for Chinese Language. In Proceeding of the 2014 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies, 455-458.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "Techniques for automatically correcting words in text",
"authors": [
{
"first": "K",
"middle": [],
"last": "Kukich",
"suffix": ""
}
],
"year": 1992,
"venue": "ACM Computing Surveys (CSUR)",
"volume": "24",
"issue": "4",
"pages": "377--439",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kukich, K. (1992). Techniques for automatically correcting words in text. ACM Computing Surveys (CSUR), 24(4), 377-439.",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "Binary code capable of correcting detections, insertions, and reversals. Soviet physics doklady",
"authors": [
{
"first": "V",
"middle": [
"I"
],
"last": "Levenshtein",
"suffix": ""
}
],
"year": 1966,
"venue": "",
"volume": "10",
"issue": "",
"pages": "707--710",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Levenshtein, V. I. (1966). Binary code capable of correcting detections, insertions, and reversals. Soviet physics doklady, 10(8), 707-710.",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "Exploring distributional similarity based models for query spelling correction",
"authors": [
{
"first": "M",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Y",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "M",
"middle": [],
"last": "Zhu",
"suffix": ""
},
{
"first": "M",
"middle": [],
"last": "Zhou",
"suffix": ""
}
],
"year": 2006,
"venue": "Proceeding of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "1025--1032",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Li, M., Zhang, Y., Zhu, M., & Zhou, M. (2006). Exploring distributional similarity based models for query spelling correction. In Proceeding of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics, 1025-1032.",
"links": null
},
"BIBREF26": {
"ref_id": "b26",
"title": "Visually and phonologically similar characters in incorrect Chinese words: Analyses, identification, and applications",
"authors": [
{
"first": "C",
"middle": [
"L"
],
"last": "Liu",
"suffix": ""
},
{
"first": "M",
"middle": [
"H"
],
"last": "Lai",
"suffix": ""
},
{
"first": "K",
"middle": [
"W"
],
"last": "Tien",
"suffix": ""
},
{
"first": "Y",
"middle": [
"H"
],
"last": "Chuang",
"suffix": ""
},
{
"first": "S",
"middle": [
"H"
],
"last": "Wu",
"suffix": ""
},
{
"first": "C",
"middle": [
"Y"
],
"last": "Lee",
"suffix": ""
}
],
"year": 2011,
"venue": "ACM Transactions on Asian Language Information Processing (TALIP)",
"volume": "10",
"issue": "2",
"pages": "1--39",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Liu, C. L., Lai, M. H., Tien, K. W., Chuang, Y. H., Wu, S. H., & Lee, C. Y.(2011). Visually and phonologically similar characters in incorrect Chinese words: Analyses, identification, and applications. ACM Transactions on Asian Language Information Processing (TALIP), 10(2), 1-39.",
"links": null
},
"BIBREF27": {
"ref_id": "b27",
"title": "Automatic rule acquisition for spelling correction",
"authors": [
{
"first": "L",
"middle": [],
"last": "Mangu",
"suffix": ""
},
{
"first": "E",
"middle": [],
"last": "Brill",
"suffix": ""
}
],
"year": 1997,
"venue": "Proceeding of the 14th International Conference on Machine Learning",
"volume": "",
"issue": "",
"pages": "187--194",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Mangu, L., & Brill, E. (1997). Automatic rule acquisition for spelling correction. In Proceeding of the 14th International Conference on Machine Learning, 187-194.",
"links": null
},
"BIBREF28": {
"ref_id": "b28",
"title": "Context based spelling correction",
"authors": [
{
"first": "E",
"middle": [],
"last": "Mays",
"suffix": ""
},
{
"first": "F",
"middle": [
"J"
],
"last": "Damerau",
"suffix": ""
},
{
"first": "R",
"middle": [
"L"
],
"last": "Mercer",
"suffix": ""
}
],
"year": 1991,
"venue": "Information Processing & Management",
"volume": "27",
"issue": "5",
"pages": "517--522",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Mays, E., Damerau, F. J., & Mercer, R. L. (1991). Context based spelling correction. Information Processing & Management, 27(5), 517-522.",
"links": null
},
"BIBREF29": {
"ref_id": "b29",
"title": "Microsoft Microsoft web n-gram services",
"authors": [],
"year": 2010,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Microsoft Microsoft web n-gram services. (2010). http://research.microsoft.com/web-ngram",
"links": null
},
"BIBREF30": {
"ref_id": "b30",
"title": "A unified approach to transliteration-based text input with online spelling correction",
"authors": [
{
"first": "H",
"middle": [],
"last": "Suzuki",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Gao",
"suffix": ""
}
],
"year": 2012,
"venue": "Proceeding of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning",
"volume": "",
"issue": "",
"pages": "609--618",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Suzuki, H., & Gao, J. (2012). A unified approach to transliteration-based text input with online spelling correction. In Proceeding of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning, 609-618.",
"links": null
},
"BIBREF31": {
"ref_id": "b31",
"title": "Chinese Spelling Check Evaluation at SIGHAN Bake-off 2013",
"authors": [
{
"first": "S",
"middle": [
"H"
],
"last": "Wu",
"suffix": ""
},
{
"first": "C",
"middle": [
"L"
],
"last": "Liu",
"suffix": ""
},
{
"first": "L",
"middle": [
"H"
],
"last": "Lee",
"suffix": ""
}
],
"year": 2013,
"venue": "Proceeding of the Sixth International Joint Conference on Natural Language Processing",
"volume": "",
"issue": "",
"pages": "35--42",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Wu, S. H., Liu, C. L., & Lee, L. H. (2013). Chinese Spelling Check Evaluation at SIGHAN Bake-off 2013. In Proceeding of the Sixth International Joint Conference on Natural Language Processing, 35-42.",
"links": null
},
"BIBREF32": {
"ref_id": "b32",
"title": "Extended HMM and Ranking models for Chinese Spelling Correction",
"authors": [
{
"first": "J",
"middle": [],
"last": "Xiong",
"suffix": ""
},
{
"first": "Q",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Hou",
"suffix": ""
},
{
"first": "Q",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Y",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "X",
"middle": [],
"last": "Cheng",
"suffix": ""
}
],
"year": 2014,
"venue": "CLP",
"volume": "2014",
"issue": "",
"pages": "133--138",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Xiong, J., Zhang, Q., Hou, J., Wang, Q., Wang, Y., & Cheng, X. (2014). Extended HMM and Ranking models for Chinese Spelling Correction. CLP 2014, 133-138.",
"links": null
},
"BIBREF33": {
"ref_id": "b33",
"title": "Overview of SIGHAN 2014 Bake-off for Chinese Spelling Check",
"authors": [
{
"first": "L",
"middle": [
"C"
],
"last": "Yu",
"suffix": ""
},
{
"first": "L",
"middle": [
"H"
],
"last": "Lee",
"suffix": ""
},
{
"first": "Y",
"middle": [
"H"
],
"last": "Tseng",
"suffix": ""
},
{
"first": "H",
"middle": [
"H"
],
"last": "Chen",
"suffix": ""
}
],
"year": 2014,
"venue": "Proceeding of the Third CIPS-SIGHAN Joint Conference on Chinese Language Processing",
"volume": "",
"issue": "",
"pages": "126--132",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yu, L. C., Lee, L. H., Tseng, Y. H., & Chen, H. H. (2014). Overview of SIGHAN 2014 Bake-off for Chinese Spelling Check. In Proceeding of the Third CIPS-SIGHAN Joint Conference on Chinese Language Processing, 126-132.",
"links": null
},
"BIBREF34": {
"ref_id": "b34",
"title": "Automatic detecting/correcting errors in Chinese text by an approximate word-matching algorithm",
"authors": [
{
"first": "L",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "C",
"middle": [],
"last": "Huang",
"suffix": ""
},
{
"first": "M",
"middle": [],
"last": "Zhou",
"suffix": ""
},
{
"first": "H",
"middle": [],
"last": "Pan",
"suffix": ""
}
],
"year": 2000,
"venue": "Proceeding of the 38th Annual Meeting on Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "248--254",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Zhang, L., Huang, C., Zhou, M., & Pan, H. (2000). Automatic detecting/correcting errors in Chinese text by an approximate word-matching algorithm. In Proceeding of the 38th Annual Meeting on Association for Computational Linguistics, 248-254.",
"links": null
},
"BIBREF35": {
"ref_id": "b35",
"title": "HANSpeller: A Unified Framework for Chinese Spelling Correction 21",
"authors": [],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "HANSpeller: A Unified Framework for Chinese Spelling Correction 21",
"links": null
},
"BIBREF36": {
"ref_id": "b36",
"title": "Chime: An efficient error-tolerant Chinese pinyin input method",
"authors": [
{
"first": "Y",
"middle": [],
"last": "Zheng",
"suffix": ""
},
{
"first": "C",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "M",
"middle": [],
"last": "Sun",
"suffix": ""
}
],
"year": 2011,
"venue": "Proceeding of International Joint Conference on Artificial Intelligence(IJCAI)",
"volume": "22",
"issue": "",
"pages": "2551--2256",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Zheng, Y., Li, C., & Sun, M. (2011). Chime: An efficient error-tolerant Chinese pinyin input method. In Proceeding of International Joint Conference on Artificial Intelligence(IJCAI), 22(3), 2551-2256.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"text": "A unified framework (HANSpeller) for Chinese spelling correction.",
"num": null,
"type_str": "figure",
"uris": null
},
"FIGREF1": {
"text": "illustrates the whole process of the candidate generation phase.",
"num": null,
"type_str": "figure",
"uris": null
},
"FIGREF2": {
"text": "The whole process of generating candidates phase.",
"num": null,
"type_str": "figure",
"uris": null
},
"FIGREF3": {
"text": "_ i candi sub and ranked first after re-ranking, store the original sub-sentence in _ Final Correction and continue scanning 1 _ i candi sub \uf02b ; otherwise, go to Step 2);2) Compute the scores of the top-2 candidates in _ i candi sub , and store the candidate with higher score in _ Final Candi . If the scan is not over, go to Step 1); otherwise, go to Step 3);3) Provide statistics for the total number of errors in _ Final Candi . If the error quantity is less than the threshold value, then output _ Correction according to the global error rate, and the remaining part of _ Final Candi is not corrected, go to step 5",
"num": null,
"type_str": "figure",
"uris": null
},
"TABREF0": {
"type_str": "table",
"content": "<table><tr><td>Error Types</td><td>Misspelled</td><td>Corrections</td></tr><tr><td/><td>\u4e00\u7b79\u83ab\u5c55</td><td>\u4e00\u6101\u83ab\u5c55</td></tr><tr><td>Homophone</td><td>\u5e74\u5e74\u6709\u9c7c</td><td>\u5e74\u5e74\u6709\u4f59</td></tr><tr><td/><td>\u806f\u5408\u570b\u516c\u5e03</td><td>\u806f\u5408\u570b\u516c\u4f48</td></tr><tr><td>Near-homophone</td><td>\u597d\u7801\u5dee\u4e0d\u591a\u4e00\u6837</td><td>\u53f7\u7801\u5dee\u4e0d\u591a\u4e00\u6837</td></tr><tr><td>Similar shape</td><td>\u5217\u5982\uff1a\u5bb6\u5ead\u6703\u8b8a\u51b7\u6f20 \u5982\u706b\u5982\u837c</td><td>\u4f8b\u5982\uff1a\u5bb6\u5ead\u6703\u8b8a\u51b7\u6f20 \u5982\u706b\u5982\u8336</td></tr><tr><td/><td>\u6bcf\u500b\u79ae\u62dc\uff11\u3001\uff13\u3001\uff15</td><td>\u6bcf\u500b\u79ae\u62dc\u4e00\u3001\u4e09\u3001\u4e94</td></tr><tr><td>Other errors</td><td>\u53d7\u4e86\u90fd\u5c11\u82e6</td><td>\u53d7\u4e86\u591a\u5c11\u82e6</td></tr></table>",
"text": "",
"html": null,
"num": null
},
"TABREF1": {
"type_str": "table",
"content": "<table><tr><td>Feature Types</td><td>Features</td></tr><tr><td>Language Model Features</td><td>1.Text probability of candidates 2.Text probability of original sentence</td></tr><tr><td/><td>1.Number of phrases</td></tr><tr><td/><td>2.Number of idioms</td></tr><tr><td>Dictionary Features</td><td>2.Proportion of phrases</td></tr><tr><td/><td>3.Proportion of idioms</td></tr><tr><td/><td>3.Phrases and idioms length</td></tr><tr><td/><td>1.The number of homophone edit operations</td></tr><tr><td>Edit Distance Features</td><td>2.The number of near-homophone edit operations 2.Total number of similar-shape edit operations</td></tr><tr><td/><td>3.Total edit cost</td></tr></table>",
"text": "",
"html": null,
"num": null
},
"TABREF3": {
"type_str": "table",
"content": "<table><tr><td/><td/><td>System Results</td><td/></tr><tr><td colspan=\"2\">Confusion Matrix</td><td/><td/></tr><tr><td/><td/><td>Positive (Error)</td><td>Negative (No Error)</td></tr><tr><td>Gold</td><td>Positive</td><td>TP</td><td>FN</td></tr><tr><td>Standard</td><td>Negative</td><td>FP</td><td>TN</td></tr></table>",
"text": "",
"html": null,
"num": null
},
"TABREF5": {
"type_str": "table",
"content": "<table><tr><td>Methods</td><td>FPR</td><td>A</td><td>P</td><td>R</td><td>F1</td></tr><tr><td>Decision-Making Model [CAS]</td><td>0.1525</td><td>0.5829</td><td>0.676</td><td>0.3183</td><td>0.4328</td></tr><tr><td>CRF-Model + N-gram model[NCTU& NTUT]</td><td>0.0998</td><td>0.4925</td><td>0.4592</td><td>0.0847</td><td>0.1431</td></tr><tr><td>Rule Induction [NCYU]</td><td>0.0414</td><td>0.5885</td><td>0.8406</td><td>0.2185</td><td>0.3468</td></tr><tr><td>CRF-Model + N-gram Model [NJUPT]</td><td>0.3898</td><td>0.3964</td><td>0.3191</td><td>0.1827</td><td>0.2323</td></tr><tr><td>Noisy Channel Model [NTHU]</td><td>0.3691</td><td>0.3823</td><td>0.2659</td><td>0.1337</td><td>0.1779</td></tr><tr><td>Error Template Rule +</td><td/><td/><td/><td/><td/></tr><tr><td>N-gram Model</td><td>0.2655</td><td>0.5104</td><td>0.5188</td><td>0.2863</td><td>0.3689</td></tr><tr><td>[SinicaCKIP]</td><td/><td/><td/><td/><td/></tr><tr><td>Graph-Model + CRF-Model [SJTU]</td><td>0.2279</td><td>0.5377</td><td>0.5709</td><td>0.3032</td><td>0.3961</td></tr></table>",
"text": "",
"html": null,
"num": null
},
"TABREF6": {
"type_str": "table",
"content": "<table><tr><td/><td/><td/><td colspan=\"2\">Detection-Level</td><td/></tr><tr><td>Features (Excluded)</td><td>FPR</td><td/><td/><td/><td/></tr><tr><td/><td/><td>A</td><td>P</td><td>R</td><td>F1</td></tr><tr><td>Language Model Features</td><td>0.2312</td><td>0.548</td><td>0.564</td><td>0.3153</td><td>0.4045</td></tr><tr><td>Dictionary Features</td><td>0.1523</td><td>0.5857</td><td>0.7068</td><td>0.3418</td><td>0.4608</td></tr><tr><td>Edit Distance Features</td><td>0.1726</td><td>0.5574</td><td>0.7003</td><td>0.3339</td><td>0.4522</td></tr><tr><td>Web Based Features</td><td>0.3663</td><td>0.5094</td><td>0.4401</td><td>0.3558</td><td>0.3935</td></tr><tr><td>None</td><td>0.1525</td><td>0.6149</td><td>0.7148</td><td>0.3823</td><td>0.4982</td></tr><tr><td/><td/><td/><td colspan=\"2\">Correction-Level</td><td/></tr><tr><td>Features (Excluded)</td><td>FPR</td><td/><td/><td/><td/></tr><tr><td/><td/><td>A</td><td>P</td><td>R</td><td>F1</td></tr><tr><td>Language Model Features</td><td>0.2312</td><td>0.5113</td><td>0.496</td><td>0.2398</td><td>0.3233</td></tr><tr><td>Dictionary Features</td><td>0.1523</td><td>0.5584</td><td>0.6709</td><td>0.2891</td><td>0.4041</td></tr><tr><td>Edit Distance Features</td><td>0.1726</td><td>0.5273</td><td>0.6612</td><td>0.2788</td><td>0.3923</td></tr><tr><td>Web Based Features</td><td>0.3663</td><td>0.4586</td><td>0.3485</td><td>0.2421</td><td>0.2857</td></tr><tr><td>None</td><td>0.1525</td><td>0.5829</td><td>0.676</td><td>0.3183</td><td>0.4328</td></tr></table>",
"text": "",
"html": null,
"num": null
},
"TABREF7": {
"type_str": "table",
"content": "<table><tr><td>Error-Detection</td><td>A</td><td/><td>P</td><td>R</td><td>F1</td></tr><tr><td>With Re-ranking</td><td>0.6149</td><td/><td>0.7148</td><td>0.3823</td><td>0.4982</td></tr><tr><td>Without Re-ranking</td><td>0.4859</td><td/><td>0.5156</td><td>0.2383</td><td>0.3259</td></tr><tr><td>Error-Correction</td><td>FPR</td><td>A</td><td>P</td><td>R</td><td>F1</td></tr><tr><td>With Re-ranking</td><td>0.1525</td><td>0.5829</td><td>0.676</td><td>0.3183</td><td>0.4328</td></tr><tr><td>Without Re-ranking</td><td>0.2441</td><td>0.4407</td><td>0.4038</td><td>0.1516</td><td>0.2205</td></tr></table>",
"text": "",
"html": null,
"num": null
}
}
}
} |