File size: 129,719 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 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 2407 2408 2409 2410 2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480 2481 2482 2483 2484 2485 2486 2487 2488 2489 2490 2491 2492 2493 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 2504 2505 2506 2507 2508 2509 2510 2511 2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531 2532 2533 2534 2535 2536 2537 2538 2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549 2550 2551 2552 2553 2554 2555 2556 2557 2558 2559 2560 2561 2562 2563 2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588 2589 2590 2591 2592 2593 2594 2595 2596 2597 2598 2599 2600 2601 2602 2603 2604 2605 2606 2607 2608 2609 2610 2611 2612 2613 2614 2615 2616 2617 2618 2619 2620 2621 2622 2623 2624 2625 2626 2627 2628 2629 2630 2631 2632 2633 2634 2635 2636 2637 2638 2639 2640 2641 2642 | {
"paper_id": "P14-1014",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T09:06:19.113096Z"
},
"title": "Tagging The Web: Building A Robust Web Tagger with Neural Network",
"authors": [
{
"first": "Ji",
"middle": [],
"last": "Ma",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Northeastern University",
"location": {
"country": "China"
}
},
"email": ""
},
{
"first": "Yue",
"middle": [],
"last": "Zhang",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Singapore University of Technology",
"location": {}
},
"email": "zhang@sutd.edu.sg"
},
{
"first": "Jingbo",
"middle": [],
"last": "Zhu",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Northeastern University",
"location": {
"country": "China"
}
},
"email": "zhujingbo@mail.neu.edu.cn"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "In this paper, we address the problem of web-domain POS tagging using a twophase approach. The first phase learns representations that capture regularities underlying web text. The representation is integrated as features into a neural network that serves as a scorer for an easy-first POS tagger. Parameters of the neural network are trained using guided learning in the second phase. Experiment on the SANCL 2012 shared task show that our approach achieves 93.15% average tagging accuracy, which is the best accuracy reported so far on this data set, higher than those given by ensembled syntactic parsers.",
"pdf_parse": {
"paper_id": "P14-1014",
"_pdf_hash": "",
"abstract": [
{
"text": "In this paper, we address the problem of web-domain POS tagging using a twophase approach. The first phase learns representations that capture regularities underlying web text. The representation is integrated as features into a neural network that serves as a scorer for an easy-first POS tagger. Parameters of the neural network are trained using guided learning in the second phase. Experiment on the SANCL 2012 shared task show that our approach achieves 93.15% average tagging accuracy, which is the best accuracy reported so far on this data set, higher than those given by ensembled syntactic parsers.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Analysing and extracting useful information from the web has become an increasingly important research direction for the NLP community, where many tasks require part-of-speech (POS) tagging as a fundamental preprocessing step. However, state-of-the-art POS taggers in the literature (Collins, 2002; Shen et al., 2007) are mainly optimized on the the Penn Treebank (PTB), and when shifted to web data, tagging accuracies drop significantly (Petrov and McDonald, 2012) .",
"cite_spans": [
{
"start": 283,
"end": 298,
"text": "(Collins, 2002;",
"ref_id": "BIBREF5"
},
{
"start": 299,
"end": 317,
"text": "Shen et al., 2007)",
"ref_id": "BIBREF25"
},
{
"start": 439,
"end": 466,
"text": "(Petrov and McDonald, 2012)",
"ref_id": "BIBREF18"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The problem we face here can be considered as a special case of domain adaptation, where we have access to labelled data on the source domain (PTB) and unlabelled data on the target domain (web data). Exploiting useful information from the web data can be the key to improving web domain tagging. Towards this end, we adopt the idea of learning representations which has been demonstrated useful in capturing hidden regularities underlying the raw input data (web text, in our case).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Our approach consists of two phrases. In the pre-training phase, we learn an encoder that con-verts the web text into an intermediate representation, which acts as useful features for prediction tasks. We integrate the learned encoder with a set of well-established features for POS tagging (Ratnaparkhi, 1996; Collins, 2002) in a single neural network, which is applied as a scorer to an easyfirst POS tagger. We choose the easy-first tagging approach since it has been demonstrated to give higher accuracies than the standard left-to-right POS tagger (Shen et al., 2007; Ma et al., 2013) .",
"cite_spans": [
{
"start": 291,
"end": 310,
"text": "(Ratnaparkhi, 1996;",
"ref_id": "BIBREF22"
},
{
"start": 311,
"end": 325,
"text": "Collins, 2002)",
"ref_id": "BIBREF5"
},
{
"start": 553,
"end": 572,
"text": "(Shen et al., 2007;",
"ref_id": "BIBREF25"
},
{
"start": 573,
"end": 589,
"text": "Ma et al., 2013)",
"ref_id": "BIBREF16"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In the fine-tuning phase, the parameters of the network are optimized on a set of labelled training data using guided learning. The learned model preserves the property of preferring to tag easy words first. To our knowledge, we are the first to investigate guided learning for neural networks.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The idea of learning representations from unlabelled data and then fine-tuning a model with such representations according to some supervised criterion has been studied before (Turian et al., 2010; Collobert et al., 2011; Glorot et al., 2011) . While most previous work focus on in-domain sequential labelling or cross-domain classification tasks, we are the first to learn representations for web-domain structured prediction. Previous work treats the learned representations either as model parameters that are further optimized in supervised fine-tuning (Collobert et al., 2011) or as fixed features that are kept unchanged (Turian et al., 2010; Glorot et al., 2011) . In this work, we investigate both strategies and give empirical comparisons in the cross-domain setting. Our results suggest that while both strategies improve in-domain tagging accuracies, keeping the learned representation unchanged consistently results in better cross-domain accuracies.",
"cite_spans": [
{
"start": 176,
"end": 197,
"text": "(Turian et al., 2010;",
"ref_id": "BIBREF29"
},
{
"start": 198,
"end": 221,
"text": "Collobert et al., 2011;",
"ref_id": "BIBREF6"
},
{
"start": 222,
"end": 242,
"text": "Glorot et al., 2011)",
"ref_id": "BIBREF8"
},
{
"start": 557,
"end": 581,
"text": "(Collobert et al., 2011)",
"ref_id": "BIBREF6"
},
{
"start": 627,
"end": 648,
"text": "(Turian et al., 2010;",
"ref_id": "BIBREF29"
},
{
"start": 649,
"end": 669,
"text": "Glorot et al., 2011)",
"ref_id": "BIBREF8"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "We conduct experiments on the official data set provided by the SANCL 2012 shared task (Petrov and McDonald, 2012) . Our method achieves a 93.15% average accuracy across the web-domain, which is the best result reported so far on this data set, higher than those given by ensembled syntactic parsers. Our code will be publicly available at https://github.com/majineu/TWeb.",
"cite_spans": [
{
"start": 87,
"end": 114,
"text": "(Petrov and McDonald, 2012)",
"ref_id": "BIBREF18"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Unsupervised learning is often used for training encoders that convert the input data to abstract representations (i.e. encoding vectors). Such representations capture hidden properties of the input, and can be used as features for supervised tasks (Bengio, 2009; Ranzato et al., 2007) . Among the many proposed encoders, we choose the restricted Boltzmann machine (RBM), which has been successfully used in many tasks (Lee et al., 2009b; Hinton et al., 2006) . In this section, we give some background on RBMs and then show how they can be used to learn representations of the web text.",
"cite_spans": [
{
"start": 249,
"end": 263,
"text": "(Bengio, 2009;",
"ref_id": "BIBREF2"
},
{
"start": 264,
"end": 285,
"text": "Ranzato et al., 2007)",
"ref_id": "BIBREF21"
},
{
"start": 419,
"end": 438,
"text": "(Lee et al., 2009b;",
"ref_id": "BIBREF15"
},
{
"start": 439,
"end": 459,
"text": "Hinton et al., 2006)",
"ref_id": "BIBREF10"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Learning from Web Text",
"sec_num": "2"
},
{
"text": "The RBM is a type of graphical model that contains two layers of binary stochastic units v \u2208 {0, 1} V and h \u2208 {0, 1} H , corresponding to a set of visible and hidden variables, respectively. The RBM defines the joint probability distribution over v and h by an energy function",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Restricted Boltzmann Machine",
"sec_num": "2.1"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "E(v, h) = \u2212c h \u2212 b v \u2212 h Wv,",
"eq_num": "(1)"
}
],
"section": "Restricted Boltzmann Machine",
"sec_num": "2.1"
},
{
"text": "which is factorized by a visible bias b \u2208 R V , a hidden bias c \u2208 R H and a weight matrix W \u2208 R H\u00d7V . The joint distribution P (v, h) is given by",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Restricted Boltzmann Machine",
"sec_num": "2.1"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "P (v, h) = 1 Z exp(E(v, h)),",
"eq_num": "(2)"
}
],
"section": "Restricted Boltzmann Machine",
"sec_num": "2.1"
},
{
"text": "where Z is the partition function. The affine form of E with respect to v and h implies that the visible variables are conditionally independent with each other given the hidden layer units, and vice versa. This yields the conditional distribution:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Restricted Boltzmann Machine",
"sec_num": "2.1"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "P (v|h) = V j=1 P (v j |h) P (h|v) = H i=1 P (h i |v) P (v j = 1|h) = \u03c3(b j + W \u2022j h)",
"eq_num": "(3)"
}
],
"section": "Restricted Boltzmann Machine",
"sec_num": "2.1"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "P (h i = 1|v) = \u03c3(c j + W i\u2022 v)",
"eq_num": "(4)"
}
],
"section": "Restricted Boltzmann Machine",
"sec_num": "2.1"
},
{
"text": "Here \u03c3 denotes the sigmoid function. Parameters of RBMs \u03b8 = {b, c, W} can be trained efficiently using contrastive divergence learning (CD), see (Hinton, 2002) for detailed descriptions of CD.",
"cite_spans": [
{
"start": 145,
"end": 159,
"text": "(Hinton, 2002)",
"ref_id": "BIBREF11"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Restricted Boltzmann Machine",
"sec_num": "2.1"
},
{
"text": "Most of the indicative features for POS disambiguation can be found from the words and word combinations within a local context (Ratnaparkhi, 1996; Collins, 2002) . Inspired by this observation, we apply the RBM to learn feature representations from word n-grams. More specifically, given the i th word w i of a sentence, we apply RBMs to model the joint distribution of the n-gram",
"cite_spans": [
{
"start": 128,
"end": 147,
"text": "(Ratnaparkhi, 1996;",
"ref_id": "BIBREF22"
},
{
"start": 148,
"end": 162,
"text": "Collins, 2002)",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Encoding Web Text with RBM",
"sec_num": "2.2"
},
{
"text": "(w i\u2212l , \u2022 \u2022 \u2022 , w i+r )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Encoding Web Text with RBM",
"sec_num": "2.2"
},
{
"text": ", where l and r denote the left and right window, respectively. Note that the visible units of RBMs are binary. While in our case, each visible variable corresponds to a word, which may take on tens-of-thousands of different values. Therefore, the RBM need to be re-factorized to make inference tractable. We utilize the Word Representation RBM (WR-RBM) factorization proposed by Dahl et al. (2012) . The basic idea is to share word representations across different positions in the input n-gram while using position-dependent weights to distinguish between different word orders.",
"cite_spans": [
{
"start": 380,
"end": 398,
"text": "Dahl et al. (2012)",
"ref_id": "BIBREF7"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Encoding Web Text with RBM",
"sec_num": "2.2"
},
{
"text": "Let w k be the k-th entry of lexicon L, and w k be its one-hot representation (i.e., only the k-th component of w k is 1, and all the others are 0). Let v (j) represents the j-th visible variable of the WRRBM, which is a vector of length |L|. Then v (j) = w k means that the j-th word in the n-gram is w k . Let D \u2208 R D\u00d7|L| be a projection matrix, then Dw k projects w k into a D-dimensional real value vector (embedding). For each position j, there is a weight matrix W (j) \u2208 R H\u00d7D , which is used to model the interaction between the hidden layer and the word projection in position j. The visible biases are also shared across different positions (b (j) = b \u2200j) and the energy function is:",
"cite_spans": [
{
"start": 155,
"end": 158,
"text": "(j)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Encoding Web Text with RBM",
"sec_num": "2.2"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "E(v, h) = \u2212c h \u2212 n j=1 (b v (j) + h W (j) Dv (j) ),",
"eq_num": "(5)"
}
],
"section": "Encoding Web Text with RBM",
"sec_num": "2.2"
},
{
"text": "which yields the conditional distributions:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Encoding Web Text with RBM",
"sec_num": "2.2"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "P (v|h) = n j=1 P (v (j) |h) P (h|v) = i=1 P (h i |v) P (h i = 1|v) = \u03c3(c i + n j=1 W (j) i\u2022 Dv (j) ) (6) P (v (j) = w k |h) = 1 Z exp(b w k + h W (j) Dw k )",
"eq_num": "(7)"
}
],
"section": "Encoding Web Text with RBM",
"sec_num": "2.2"
},
{
"text": "Again Z is the partition function. The parameters {b, c, D, W (1) , . . . , W (n) } can be trained using a Metropolis-Hastings-based CD variant and the learned word representations also capture certain syntactic information; see Dahl et al. (2012) for more details.",
"cite_spans": [
{
"start": 229,
"end": 247,
"text": "Dahl et al. (2012)",
"ref_id": "BIBREF7"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Encoding Web Text with RBM",
"sec_num": "2.2"
},
{
"text": "Note that one can stack standard RBMs on top of a WRRBM to construct a Deep Belief Network (DBN). By adopting greedy layer-wise training (Hinton et al., 2006; Bengio et al., 2007) , DBNs are capable of modelling higher order non-linear relations between the input, and has been demonstrated to improve performance for many computer vision tasks (Hinton et al., 2006; Bengio et al., 2007; Lee et al., 2009a) . However, in this work we do not observe further improvement by employing DBNs. This may partly be due to the fact that unlike computer vision tasks, the input structure of POS tagging or other sequential labelling tasks is relatively simple, and a single non-linear layer is enough to model the interactions within the input (Wang and Manning, 2013) .",
"cite_spans": [
{
"start": 137,
"end": 158,
"text": "(Hinton et al., 2006;",
"ref_id": "BIBREF10"
},
{
"start": 159,
"end": 179,
"text": "Bengio et al., 2007)",
"ref_id": "BIBREF1"
},
{
"start": 345,
"end": 366,
"text": "(Hinton et al., 2006;",
"ref_id": "BIBREF10"
},
{
"start": 367,
"end": 387,
"text": "Bengio et al., 2007;",
"ref_id": "BIBREF1"
},
{
"start": 388,
"end": 406,
"text": "Lee et al., 2009a)",
"ref_id": "BIBREF14"
},
{
"start": 734,
"end": 758,
"text": "(Wang and Manning, 2013)",
"ref_id": "BIBREF30"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Encoding Web Text with RBM",
"sec_num": "2.2"
},
{
"text": "We integrate the learned WRRBM into a neural network, which serves as a scorer for POS disambiguation. The main challenge to designing the neural network structure is: on the one hand, we hope that the model can take the advantage of information provided by the learned WRRBM, which reflects general properties of web texts, so that the model generalizes well in the web domain; on the other hand, we also hope to improve the model's discriminative power by utilizing wellestablished POS tagging features, such as those of Ratnaparkhi (1996) . Our approach is to leverage the two sources of information in one neural network by combining them though a shared output layer, as shown in Figure 1 . Under the output layer, the network consists of two modules: the web-feature module, which incorporates knowledge from the pretrained WRRBM, and the sparse-feature module, which makes use of other POS tagging features.",
"cite_spans": [
{
"start": 523,
"end": 541,
"text": "Ratnaparkhi (1996)",
"ref_id": "BIBREF22"
}
],
"ref_spans": [
{
"start": 685,
"end": 693,
"text": "Figure 1",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Neural Network for POS Disambiguation",
"sec_num": "3"
},
{
"text": "The web-feature module, shown in the lower left part of Figure 1 , consists of a input layer and two hidden layers. The input for the this module is the word n-gram (w i\u2212l , . . . , w i+r ), the form of which is identical to the training data of the pre-trained WRRBM.",
"cite_spans": [],
"ref_spans": [
{
"start": 56,
"end": 64,
"text": "Figure 1",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "The Web-Feature Module",
"sec_num": "3.1"
},
{
"text": "The first layer is a linear projection layer, where each word in the input is projected into a Ddimensional real value vector using the projection operation described in Section 2.2. The output of this layer o 1 w is the concatenation of the projections of w i\u2212l , . . . , w i+r :",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Web-Feature Module",
"sec_num": "3.1"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "o 1 w = \uf8eb \uf8ec \uf8ed M 1 w w i\u2212l . . . M 1 w w i+r \uf8f6 \uf8f7 \uf8f8",
"eq_num": "(8)"
}
],
"section": "The Web-Feature Module",
"sec_num": "3.1"
},
{
"text": "Here M 1 w denotes the parameters of the first layer of the web-feature module, which is a D \u00d7 |L| projection matrix.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Web-Feature Module",
"sec_num": "3.1"
},
{
"text": "The second layer is a sigmoid layer to model non-linear relations between the word projections:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Web-Feature Module",
"sec_num": "3.1"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "o 2 w = \u03c3(M 2 w o 1 w + b 2 w )",
"eq_num": "(9)"
}
],
"section": "The Web-Feature Module",
"sec_num": "3.1"
},
{
"text": "Parameters of this layer include: a bias vector b 2 w \u2208 R H and a weight matrix M 2 w \u2208 R H\u00d7nD . The web-feature module enables us to explore the learned WRRBM in various ways. First, it allows us to investigate knowledge from the WR-RBM incrementally. We can choose to use only the word representations of the learned WRRBM. This can be achieved by initializing only the first layer of the web module with the projection matrix D of the learned WRRBM:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Web-Feature Module",
"sec_num": "3.1"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "M 1 w \u2190 D.",
"eq_num": "(10)"
}
],
"section": "The Web-Feature Module",
"sec_num": "3.1"
},
{
"text": "Alternatively, we can choose to use the hidden states of the WRRBM, which can be treated as the representations of the input n-gram. This can be achieved by also initializing the parameters of the second layer of the web-feature module using the position-dependent weight matrix and hidden bias of the learned WRRBM:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Web-Feature Module",
"sec_num": "3.1"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "b 2 w \u2190 c (11) M 2 w \u2190 (W (1) , . . . , W (n) )",
"eq_num": "(12)"
}
],
"section": "The Web-Feature Module",
"sec_num": "3.1"
},
{
"text": "Second, the web-feature module also allows us to make a comparison between whether or not to further adjust the pre-trained representation in the supervised fine-tuning phase, which corresponds to the supervised learning strategies of Turian et al. (2010) and Collobert et al. (2011) , respectively. To our knowledge, no investigations have been presented in the literature on this issue.",
"cite_spans": [
{
"start": 235,
"end": 255,
"text": "Turian et al. (2010)",
"ref_id": "BIBREF29"
},
{
"start": 260,
"end": 283,
"text": "Collobert et al. (2011)",
"ref_id": "BIBREF6"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "The Web-Feature Module",
"sec_num": "3.1"
},
{
"text": "The sparse-feature module, as shown in the lower right part of Figure 1 , is designed to incorporate commonly-used tagging features. The input for this module is a vector of boolean values",
"cite_spans": [],
"ref_spans": [
{
"start": 63,
"end": 71,
"text": "Figure 1",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "The Sparse-Feature Module",
"sec_num": "3.2"
},
{
"text": "\u03a6(x) = (f 1 (x), . . . , f k (x))",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Sparse-Feature Module",
"sec_num": "3.2"
},
{
"text": ", where x denotes the partially tagged input sentence and f i (x) denotes a feature function, which returns 1 if the corresponding feature fires and 0 otherwise. The first layer of this module is a linear transformation layer, which converts the high dimensional sparse vector into a fixed-dimensional real value vector:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Sparse-Feature Module",
"sec_num": "3.2"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "o s = M s \u03a6(x) + b s",
"eq_num": "(13)"
}
],
"section": "The Sparse-Feature Module",
"sec_num": "3.2"
},
{
"text": "Depending on the specific task being considered, the output of this layer can be further fed to other non-linear layers, such as a sigmoid or hyperbolic tangent layer, to model more complex relations. For POS tagging, we found that a simple linear layer yields satisfactory accuracies. The web-feature and sparse-feature modules are combined by a linear output layer, as shown in the upper part of Figure 1 . The value of each unit in this layer denotes the score of the corresponding POS tag.",
"cite_spans": [],
"ref_spans": [
{
"start": 398,
"end": 406,
"text": "Figure 1",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "The Sparse-Feature Module",
"sec_num": "3.2"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "o o = M o o w o s + b o",
"eq_num": "(14)"
}
],
"section": "The Sparse-Feature Module",
"sec_num": "3.2"
},
{
"text": "In some circumstances, probability distribution over POS tags might be a more preferable form of output. Such distribution can be easily obtained by adding a soft-max layer on top of the output layer to perform a local normalization, as done by Collobert et al. (2011) .",
"cite_spans": [
{
"start": 245,
"end": 268,
"text": "Collobert et al. (2011)",
"ref_id": "BIBREF6"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "The Sparse-Feature Module",
"sec_num": "3.2"
},
{
"text": "Algorithm 1 Easy-first POS tagging Input: x a sentence of m words w 1 , . . . , w m Output: tag sequence of",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Sparse-Feature Module",
"sec_num": "3.2"
},
{
"text": "x 1: U \u2190 [w 1 , . . . , w m ] // untagged words 2: while U = [] do 3: (\u0175,t) \u2190 arg max (w,t)\u2208U\u00d7T S(w, t) 4:\u0175.t \u2190t 5: U \u2190 U/[\u0175] // remove\u0175 from U 6: end while 7: return [w 1 .t, . . . , w m .t]",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Sparse-Feature Module",
"sec_num": "3.2"
},
{
"text": "4 Easy-first POS tagging with Neural Network",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Sparse-Feature Module",
"sec_num": "3.2"
},
{
"text": "The neural network proposed in Section 3 is used for POS disambiguation by the easy-first POS tagger. Parameters of the network are trained using guided learning, where learning and search interact with each other.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Sparse-Feature Module",
"sec_num": "3.2"
},
{
"text": "Pseudo-code of easy-first tagging is shown in Algorithm 1. Rather than tagging a sentence from left to right, easy-first tagging is based on a deterministic process, repeatedly selecting the easiest word to tag. Here \"easiness\" is evaluated based on a statistical model. At each step, the algorithm adopts a scorer, the neural network in our case, to assign a score to each possible word-tag pair (w, t), and then selects the highest score one (\u0175,t) to tag (i.e., tag\u0175 witht). The algorithm repeats until all words are tagged.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Easy-first POS tagging",
"sec_num": "4.1"
},
{
"text": "The training algorithm repeats for several iterations over the training data, which is a set of sentences labelled with gold standard POS tags. In each iteration, the procedure shown in Algorithm 2 is applied to each sentence in the training set. At each step during the processing of a training example, the algorithm calculates a margin loss based on two word-tag pairs (w, t) and (\u0175,t) (line 4 \u223c line 6). (w, t) denotes the word-tag pair that has the highest model score among those that are inconsistent with the gold standard, while (\u0175,t) denotes the one that has the highest model score among those that are consistent with the gold standard. If the loss is zero, the algorithm continues to process the next untagged word. Otherwise, parameters are updated using back-propagation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Training",
"sec_num": "4.2"
},
{
"text": "The standard back-propagation algorithm (Rumelhart et al., 1988 ) cannot be applied directly. This is because the standard loss is calculated based on a unique input vector. This condition does not hold in our case, because\u0175 and w may refer to different words, which means that the margin loss in line 6 of Algorithm 2 is calculated based on two different input vectors, denoted by \u0175 and w , respectively. We solve this problem by decomposing the margin loss in line 6 into two parts:",
"cite_spans": [
{
"start": 40,
"end": 63,
"text": "(Rumelhart et al., 1988",
"ref_id": "BIBREF23"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Training",
"sec_num": "4.2"
},
{
"text": "\u2022 1 + nn(w, t), which is associated with w ;",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Training",
"sec_num": "4.2"
},
{
"text": "\u2022 \u2212nn(\u0175,t), which is associated with \u0175 .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Training",
"sec_num": "4.2"
},
{
"text": "In this way, two separate back-propagation updates can be used to update the model's parameters (line 8 \u223c line 11). For the special case where\u0175 and w do refer to the same word w, it can be easily verified that the two separate back-propagation updates equal to the standard back-propagation with a loss 1 + nn(w, t) \u2212 nn(w,t) on the input w .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Training",
"sec_num": "4.2"
},
{
"text": "The algorithm proposed here belongs to a general framework named guided learning, where search and learning interact with each other. The algorithm learns not only a local classifier, but also the inference order. While previous work (Shen et al., 2007; Zhang and Clark, 2011; Goldberg and Elhadad, 2010) apply guided learning to train a linear classifier by using variants of the perceptron algorithm, we are the first to combine guided learning with a neural network, by using a margin loss and a modified back-propagation algorithm.",
"cite_spans": [
{
"start": 234,
"end": 253,
"text": "(Shen et al., 2007;",
"ref_id": "BIBREF25"
},
{
"start": 254,
"end": 276,
"text": "Zhang and Clark, 2011;",
"ref_id": "BIBREF32"
},
{
"start": 277,
"end": 304,
"text": "Goldberg and Elhadad, 2010)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Training",
"sec_num": "4.2"
},
{
"text": "Our experiments are conducted on the data set provided by the SANCL 2012 shared task, which aims at building a single robust syntactic analysis system across the web-domain. The data set consists of labelled data for both the source (Wall Street Journal portion of the Penn Treebank) and target (web) domains. The web domain data can be further classified into five sub-domains, including emails, weblogs, business reviews, news groups and Yahoo!Answers. While emails and weblogs are used as the development sets, reviews, news groups and Yahoo!Answers are used as the final test sets. Participants are not allowed to use web-domain labelled data for training. In addition to labelled data, a large amount of unlabelled data on the web domain is also provided. Statistics Algorithm 2 Training over one sentence Input: (x, t) a tagged sentence, neural net nn Output: updated neural net nn",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Setup",
"sec_num": "5.1"
},
{
"text": "1: U \u2190 [w 1 , . . . , w m ] // untagged words 2: R \u2190 [(w 1 , t 1 ), . . . , (w m , t m )] // reference 3: while U = [] do 4: (w, t) \u2190 arg max (w,t)\u2208(U\u00d7T/R) nn(w, t) 5: (\u0175,t) \u2190 arg max (w,t)\u2208R nn(w, t) 6:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Setup",
"sec_num": "5.1"
},
{
"text": "loss \u2190 max(0, 1 + nn(w, t) \u2212 nn(\u0175,t))",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Setup",
"sec_num": "5.1"
},
{
"text": "if loss > 0 then 8:\u00ea \u2190 nn.BackPropErr( \u0175 , \u2212nn(\u0175,t))",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "7:",
"sec_num": null
},
{
"text": "9: e \u2190 nn.BackPropErr( w , 1+nn(w, t)) ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "7:",
"sec_num": null
},
{
"text": "U \u2190 U/{\u0175}, R \u2190 R/(\u0175,t) 14:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "7:",
"sec_num": null
},
{
"text": "end if 15: end while 16: return nn about labelled and unlabelled data are summarized in Table 1 and Table 2 , respectively.",
"cite_spans": [],
"ref_spans": [
{
"start": 88,
"end": 107,
"text": "Table 1 and Table 2",
"ref_id": "TABREF2"
}
],
"eq_spans": [],
"section": "7:",
"sec_num": null
},
{
"text": "The raw web domain data contains much noise, including spelling error, emotions and inconsistent capitalization. Following some participants (Le Roux et al., 2012), we conduct simple preprocessing steps to the input of the development and the test sets 1",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "7:",
"sec_num": null
},
{
"text": "\u2022 Neutral quotes are transformed to opening or closing quotes.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "7:",
"sec_num": null
},
{
"text": "\u2022 Tokens starting with \"www.\", \"http.\" or ending with \".org\", \".com\" are converted to a \"#URL\" symbol",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "7:",
"sec_num": null
},
{
"text": "\u2022 Repeated punctuations such as \"!!!!\" are collapsed into one.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "7:",
"sec_num": null
},
{
"text": "\u2022 Left brackets such as \"<\",\"{\" and \"[\" are converted to \"-LRB-\". Similarly, right brackets are converted to \"-RRB-\"",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "7:",
"sec_num": null
},
{
"text": "\u2022 Upper cased words that contain more than 4 letters are lowercased.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "7:",
"sec_num": null
},
{
"text": "\u2022 Consecutive occurrences of one or more digits within a word are replaced with \"#DIG\"",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "7:",
"sec_num": null
},
{
"text": "We apply the same preprocessing steps to all the unlabelled data. In addition, following Dahl et Table 3 : Feature templates, where w i denotes the current word. H(w) and C(w) indicates whether w contains hyphen and upper case letters, respectively. L(w) denotes a lowercased w.",
"cite_spans": [],
"ref_spans": [
{
"start": 97,
"end": 104,
"text": "Table 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "7:",
"sec_num": null
},
{
"text": "H(wi), C(wi), L(wi), L(wi\u22121), L(wi+1), ti\u22122, ti\u22121, ti+1, ti+2 bigram L(wi) L(wi\u22121), L(wi) L(wi+1), ti\u22122 ti\u22121, ti\u22121 ti+1, ti+1 ti+2, L(wi) ti\u22122, L(wi) ti\u22121, L(wi) ti+1, L(wi) ti+2 trigram L(wi) ti\u22122 ti\u22121, L(wi) ti\u22121 ti+1, L(wi) ti+1 ti+2",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "7:",
"sec_num": null
},
{
"text": "al. 2012and Turian et al. (2010) , we also lowercased all the unlabelled data and removed those sentences that contain less than 90% a-z letters. The tagging performance is evaluated according to the official evaluation metrics of SANCL 2012. The tagging accuracy is defined as the percentage of words (punctuations included) that are correctly tagged. The averaged accuracies are calculated across the web domain data.",
"cite_spans": [
{
"start": 12,
"end": 32,
"text": "Turian et al. (2010)",
"ref_id": "BIBREF29"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "7:",
"sec_num": null
},
{
"text": "We trained the WRRBM on web-domain data of different sizes (number of sentences). The data sets are generated by first concatenating all the cleaned unlabelled data, then selecting sentences evenly across the concatenated file.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "7:",
"sec_num": null
},
{
"text": "For each data set, we investigate an extensive set of combinations of hyper-parameters: the n-gram window (l, r) in {(1, 1), (2, 1), (1, 2), (2, 2)}; the hidden layer size in {200, 300, 400}; the learning rate in {0.1, 0.01, 0.001}. All these parameters are selected according to the averaged accuracy on the development set.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "7:",
"sec_num": null
},
{
"text": "We reimplemented the greedy easy-first POS tagger of Ma et al. (2013) , which is used for all the experiments. While the tagger of Ma et al. (2013) utilizes a linear scorer, our tagger adopts the neural network as its scorer. The neural network of our baseline tagger only contains the sparse-feature module. We use this baseline to examine the performance of a tagger trained purely on the source domain. Feature templates are shown in Table 3 , which are based on those of Ratnaparkhi (1996) and Shen et al. (2007) .",
"cite_spans": [
{
"start": 53,
"end": 69,
"text": "Ma et al. (2013)",
"ref_id": "BIBREF16"
},
{
"start": 131,
"end": 147,
"text": "Ma et al. (2013)",
"ref_id": "BIBREF16"
},
{
"start": 475,
"end": 493,
"text": "Ratnaparkhi (1996)",
"ref_id": "BIBREF22"
},
{
"start": 498,
"end": 516,
"text": "Shen et al. (2007)",
"ref_id": "BIBREF25"
}
],
"ref_spans": [
{
"start": 437,
"end": 444,
"text": "Table 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Baseline",
"sec_num": "5.2"
},
{
"text": "Accuracies of the baseline tagger are shown in the upper part of Table 6 . Compared with the performance of the official baseline (row 4 of Table 6), which is evaluated based on the output of BerkeleyParser (Petrov et al., 2006; Petrov and Klein, 2007) , our baseline tagger achieves comparable accuracies on both the source and target domain data. With data preprocessing, the average accuracy boosts to about 92.02 on the test set of the target domain. This is consistent with previous work (Le Roux et al., 2011) , which found that for noisy data such as web domain text, data cleaning is a effective and necessary step.",
"cite_spans": [
{
"start": 207,
"end": 228,
"text": "(Petrov et al., 2006;",
"ref_id": "BIBREF19"
},
{
"start": 229,
"end": 252,
"text": "Petrov and Klein, 2007)",
"ref_id": "BIBREF17"
},
{
"start": 493,
"end": 515,
"text": "(Le Roux et al., 2011)",
"ref_id": null
}
],
"ref_spans": [
{
"start": 65,
"end": 72,
"text": "Table 6",
"ref_id": null
}
],
"eq_spans": [],
"section": "Baseline",
"sec_num": "5.2"
},
{
"text": "As mentioned in Section 3.1, the knowledge learned from the WRRBM can be investigated incrementally, using word representation, which corresponds to initializing only the projection layer of web-feature module with the projection matrix of the learned WRRBM, or ngram-level representation, which corresponds to initializing both the projection and sigmoid layers of the webfeature module by the learned WRRBM. In each case, there can be two different training strategies depending on whether the learned representations are further adjusted or kept unchanged during the fine-turning phrase. Experimental results under the 4 combined settings on the development sets are illustrated in Figure 2, 3 and 4 Figure 2 : Tagging accuracies on the sourcedomain data. \"word\" and \"ngram\" denote using word representations and n-gram representations, respectively. \"fixed\" and \"adjust\" denote that the learned representation are kept unchanged or further adjusted in supervised learning, respectively. x-axis denotes the size of the training data and yaxis denotes tagging accuracy.",
"cite_spans": [],
"ref_spans": [
{
"start": 685,
"end": 702,
"text": "Figure 2, 3 and 4",
"ref_id": "FIGREF2"
},
{
"start": 703,
"end": 711,
"text": "Figure 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Exploring the Learned Knowledge",
"sec_num": "5.3"
},
{
"text": "From Figure 2 we can see that when knowledge from the pre-trained WRRBM is incorpo- Table 4 : Performance on the email domain.",
"cite_spans": [],
"ref_spans": [
{
"start": 5,
"end": 13,
"text": "Figure 2",
"ref_id": null
},
{
"start": 84,
"end": 91,
"text": "Table 4",
"ref_id": null
}
],
"eq_spans": [],
"section": "Effect of the Training Strategy",
"sec_num": "5.3.1"
},
{
"text": "rated, both the training strategies (\"word-fixed\" vs \"word-adjusted\", \"ngram-fixed\" vs \"ngramadjusted\") improve accuracies on the source domain, which is consistent with previous findings (Turian et al., 2010; Collobert et al., 2011) . In addition, adjusting the learned representation or keeping them fixed does not result in too much difference in tagging accuracies. On the web-domain data, shown in Figure 3 and 4, we found that leaving the learned representation unchanged (\"word-fixed\", \"ngram-fixed\") yields consistently higher performance gains. This result is to some degree expected. Intuitively, unsupervised pre-training moves the parameters of the WRRBM towards the region where properties of the web domain data are properly modelled. However, since fine-tuning is conducted with respect to the source domain, adjusting the parameters of the pre-trained representation towards optimizing source domain tagging accuracies would disrupt its ability in modelling the web domain data. Therefore, a better idea is to keep the representation unchanged so that we can learn a function that maps the general web-text properties to its syntactic categories.",
"cite_spans": [
{
"start": 188,
"end": 209,
"text": "(Turian et al., 2010;",
"ref_id": "BIBREF29"
},
{
"start": 210,
"end": 233,
"text": "Collobert et al., 2011)",
"ref_id": "BIBREF6"
}
],
"ref_spans": [
{
"start": 403,
"end": 411,
"text": "Figure 3",
"ref_id": "FIGREF2"
}
],
"eq_spans": [],
"section": "Effect of the Training Strategy",
"sec_num": "5.3.1"
},
{
"text": "From Figures 2, 3 and 4 , we can see that adopting the ngram-level representation consistently achieves better performance compared with using word representations only (\"word-fixed\" vs \"ngram-fixed\", \"word-adjusted\" vs \"ngramadjusted\"). This result illustrates that the ngramlevel knowledge captures more complex interactions of the web text, which cannot be recovered by using only word embeddings. Similar result was reported by Dahl et al. (2012) , who found that using both the word embeddings and the hidden units of a tri-gram WRRBM as additional features for a CRF chunker yields larger improvements than using word embeddings only.",
"cite_spans": [
{
"start": 432,
"end": 450,
"text": "Dahl et al. (2012)",
"ref_id": "BIBREF7"
}
],
"ref_spans": [
{
"start": 5,
"end": 23,
"text": "Figures 2, 3 and 4",
"ref_id": "FIGREF2"
}
],
"eq_spans": [],
"section": "Word and N-gram Representation",
"sec_num": "5.3.2"
},
{
"text": "Finally, more detailed accuracies under the 4 settings on the email domain are shown in Table 4 . We can see that the improvement of using word Table 5 : Effect of unlabelled data. \"+acc\" denotes improvement in tagging accuracy and \"cov\" denotes the lexicon coverages.",
"cite_spans": [],
"ref_spans": [
{
"start": 88,
"end": 96,
"text": "Table 4",
"ref_id": null
},
{
"start": 145,
"end": 152,
"text": "Table 5",
"ref_id": null
}
],
"eq_spans": [],
"section": "Word and N-gram Representation",
"sec_num": "5.3.2"
},
{
"text": "representations mainly comes from better accuracy of out-of-vocabulary (oov) words. By contrast, using n-gram representations improves the performance on both oov and non-oov.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Word and N-gram Representation",
"sec_num": "5.3.2"
},
{
"text": "In some circumstances, we may know beforehand that the target domain data belongs to a certain sub-domain, such as the email domain. In such cases, it might be desirable to train WRRBM using data only on that domain. We conduct experiments to test whether using the target domain data to train the WRRBM yields better performance compared with using mixed data from all sub-domains. We trained 3 WRRBMs using the email domain data (RBM-E), weblog domain data (RBM-W) and mixed domain data (RBM-M), respectively, with each data set consisting of 300k sentences. Tagging performance and lexicon coverages of each data set on the development sets are shown in Table 5 . We can see that using the target domain data achieves similar improvements compared with using the mixed data. However, for the email domain, RBM-W yields much smaller improvement compared with RBM-E, and vice versa. From the lexicon coverages, we can see that the sub-domains varies significantly. The results suggest that using mixed data can achieve almost as good performance as using the target sub-domain data, while using mixed data yields a much more robust tagger across all sub-domains.",
"cite_spans": [],
"ref_spans": [
{
"start": 657,
"end": 664,
"text": "Table 5",
"ref_id": null
}
],
"eq_spans": [],
"section": "Effect of Unlabelled Domain Data",
"sec_num": "5.4"
},
{
"text": "The best result achieved by using a 4-gram WR-RBM, (w i\u22122 , . . . , w i+1 ), with 300 hidden units learned on 1,000k web domain sentences are shown in row 3 of Table 6 . Performance of the top 2 systems of the SANCL 2012 task are also shown in Table 6 . Our greedy tagger achieves 93% tagging accuracy, which is significantly better than the baseline's 92.02% accuracy (p < 0.05 by Mc-Nemar's test) . Moreover, we achieve the highest tagging accuracy reported so far on this data set, surpassing those achieved using parser combinations based on self-training (Tang et al., 2012; Le Roux et al., 2012) . In addition, different from Le Roux et al. 2012, we do not use any external resources in data cleaning.",
"cite_spans": [
{
"start": 382,
"end": 398,
"text": "Mc-Nemar's test)",
"ref_id": null
},
{
"start": 560,
"end": 579,
"text": "(Tang et al., 2012;",
"ref_id": null
},
{
"start": 580,
"end": 601,
"text": "Le Roux et al., 2012)",
"ref_id": "BIBREF13"
}
],
"ref_spans": [
{
"start": 160,
"end": 167,
"text": "Table 6",
"ref_id": null
},
{
"start": 244,
"end": 251,
"text": "Table 6",
"ref_id": null
}
],
"eq_spans": [],
"section": "Final Results",
"sec_num": "5.5"
},
{
"text": "Learning representations has been intensively studied in computer vision tasks (Bengio et al., 2007; Lee et al., 2009a) . In NLP, there is also much work along this line. In particular, Collobert et al. (2011) and Turian et al. (2010) learn word embeddings to improve the performance of in-domain POS tagging, named entity recognition, chunking and semantic role labelling. induce bi-lingual word embeddings for word alignment. Zheng et al. (2013) investigate Chinese character embeddings for joint word segmentation and POS tagging. While those approaches mainly explore token-level representations (word or character embeddings), using WR-RBM is able to utilize both word and n-gram representations. Titov (2011) and Glorot et al. (2011) propose to learn representations from the mixture of both source and target domain unlabelled data to improve cross-domain sentiment classification. Titov (2011) also propose a regularizer to constrain the inter-domain variability. In particular, their regularizer aims to minimize the Kullback-Leibler (KL) distance between the marginal distributions of the learned representations on the source and target domains.",
"cite_spans": [
{
"start": 79,
"end": 100,
"text": "(Bengio et al., 2007;",
"ref_id": "BIBREF1"
},
{
"start": 101,
"end": 119,
"text": "Lee et al., 2009a)",
"ref_id": "BIBREF14"
},
{
"start": 186,
"end": 209,
"text": "Collobert et al. (2011)",
"ref_id": "BIBREF6"
},
{
"start": 214,
"end": 234,
"text": "Turian et al. (2010)",
"ref_id": "BIBREF29"
},
{
"start": 428,
"end": 447,
"text": "Zheng et al. (2013)",
"ref_id": "BIBREF33"
},
{
"start": 702,
"end": 714,
"text": "Titov (2011)",
"ref_id": "BIBREF28"
},
{
"start": 719,
"end": 739,
"text": "Glorot et al. (2011)",
"ref_id": "BIBREF8"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "6"
},
{
"text": "Their work differs from ours in that their approaches learn representations from the feature vectors for sentiment classification, which might be of thousands of dimensions. Such high dimensional input gives rise to high computational cost and it is not clear whether those approaches can be applied to large scale unlabelled data, with hundreds of millions of training examples. Our method learns representations from only word ngrams with n ranging from 3 to 5, which can be easily applied to large scale-data. In addition, while Titov (2011) and Glorot et al. (2011) use the learned representation to improve cross-domain classification tasks, we are the first to apply it to cross-domain structured prediction. Blitzer et al. (2006) propose to induce shared representations for domain adaptation, which is based on the alternating structure optimization Table 6 : Main results. \"baseline-raw\" and \"baseline-clean\" denote performance of our baseline tagger on the raw and cleaned data, respectively. \"best-clean\" is best performance achieved using a 4-gram WRRBM. The lower part shows accuracies of the official baseline and that of the top 2 participants.",
"cite_spans": [
{
"start": 532,
"end": 544,
"text": "Titov (2011)",
"ref_id": "BIBREF28"
},
{
"start": 549,
"end": 569,
"text": "Glorot et al. (2011)",
"ref_id": "BIBREF8"
},
{
"start": 715,
"end": 736,
"text": "Blitzer et al. (2006)",
"ref_id": "BIBREF4"
}
],
"ref_spans": [
{
"start": 858,
"end": 865,
"text": "Table 6",
"ref_id": null
}
],
"eq_spans": [],
"section": "Related Work",
"sec_num": "6"
},
{
"text": "(ASO) method of Ando and Zhang (2005) . The idea is to project the original feature representations into low dimensional representations, which yields a high-accuracy classifier on the target domain. The new representations are induced based on the auxiliary tasks defined on unlabelled data together with a dimensionality reduction technique. Such auxiliary tasks can be specific to the supervised task. As pointed out by Plank (2009) , for many NLP tasks, defining the auxiliary tasks is a non-trivial engineering problem. Compared with Blitzer et al. (2006) , the advantage of using RBMs is that it learns representations in a pure unsupervised manner, which is much simpler.",
"cite_spans": [
{
"start": 16,
"end": 37,
"text": "Ando and Zhang (2005)",
"ref_id": "BIBREF0"
},
{
"start": 423,
"end": 435,
"text": "Plank (2009)",
"ref_id": "BIBREF20"
},
{
"start": 539,
"end": 560,
"text": "Blitzer et al. (2006)",
"ref_id": "BIBREF4"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "6"
},
{
"text": "Besides learning representations, another line of research addresses domain-adaptation by instance re-weighting (Bickel et al., 2007; Jiang and Zhai, 2007) or feature re-weighting (Satpal and Sarawagi, 2007) . Those methods assume that each example x that has a non-zero probability on the source domain must have a non-zero probability on the target domain, and vice-versa. As pointed out by Titov (2011) , such an assumption is likely to be too restrictive since most NLP tasks adopt word-based or lexicon-based features that vary significantly across different domains.",
"cite_spans": [
{
"start": 112,
"end": 133,
"text": "(Bickel et al., 2007;",
"ref_id": "BIBREF3"
},
{
"start": 134,
"end": 155,
"text": "Jiang and Zhai, 2007)",
"ref_id": "BIBREF12"
},
{
"start": 180,
"end": 207,
"text": "(Satpal and Sarawagi, 2007)",
"ref_id": "BIBREF24"
},
{
"start": 393,
"end": 405,
"text": "Titov (2011)",
"ref_id": "BIBREF28"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "6"
},
{
"text": "Regarding using neural networks for sequential labelling, our approach shares similarity with that of Collobert et al. (2011) . In particular, we both use a non-linear layer to model complex relations underling word embeddings. However, our network differs from theirs in the following aspects. Collobert et al. (2011) model the dependency between neighbouring tags in a generative manner, by employing a transition score A ij . Training the score involves a forward process of complexity O(nT 2 ), where T denotes the number of tags. Our model captures such a dependency in a discriminative manner, by just adding tag-related features to the sparse-feature module. In addition, Collobert et al. (2011) train their network by maximizing the training set likelihood, while our approach is to minimize the margin loss using guided learning.",
"cite_spans": [
{
"start": 102,
"end": 125,
"text": "Collobert et al. (2011)",
"ref_id": "BIBREF6"
},
{
"start": 295,
"end": 318,
"text": "Collobert et al. (2011)",
"ref_id": "BIBREF6"
},
{
"start": 679,
"end": 702,
"text": "Collobert et al. (2011)",
"ref_id": "BIBREF6"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "6"
},
{
"text": "We built a web-domain POS tagger using a two-phase approach. We used a WRRBM to learn the representation of the web text and incorporate the representation in a neural network, which is trained using guided learning for easy-first POS tagging. Experiment showed that our approach achieved significant improvement in tagging the web domain text. In addition, we found that keeping the learned representations unchanged yields better performance compared with further optimizing them on the source domain data. We release our tools at https://github.com/majineu/TWeb.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "7"
},
{
"text": "For future work, we would like to investigate the two-phase approach to more challenging tasks, such as web domain syntactic parsing. We believe that high-accuracy web domain taggers and parsers would benefit a wide range of downstream tasks such as machine translation 2 .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "7"
},
{
"text": "ing. In Proceedings of the 43rd Annual Meeting of the Association for Computational Linguistics (ACL'05), pages 1-9, Ann Arbor, Michigan, June. Association for Computational Linguistics.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "7"
},
{
"text": "The preprocessing steps make use of no POS knowledge, and does not bring any unfair advantages to the participants.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "This work is done while the first author is visiting SUTD.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [
{
"text": "We would like to thank Hugo Larochelle for his advices on re-implementing WRRBM. We also thank Nan Yang, Shujie Liu and Tong Xiao for the fruitful discussions, and three anonymous reviewers for their insightful suggestions. This research was supported by the National Science Foundation of China (61272376; 61300097), the research grant T2MOE1301 from Singapore Ministry of Education (MOE) and the start-up grant SRG ISTD2012038 from SUTD.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgements",
"sec_num": "8"
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "A high-performance semi-supervised learning method for text chunk",
"authors": [
{
"first": "Rie",
"middle": [],
"last": "Ando",
"suffix": ""
},
{
"first": "Tong",
"middle": [],
"last": "Zhang",
"suffix": ""
}
],
"year": 2005,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Rie Ando and Tong Zhang. 2005. A high-performance semi-supervised learning method for text chunk-",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Greedy layer-wise training of deep networks",
"authors": [
{
"first": "Yoshua",
"middle": [],
"last": "Bengio",
"suffix": ""
},
{
"first": "Pascal",
"middle": [],
"last": "Lamblin",
"suffix": ""
},
{
"first": "Dan",
"middle": [],
"last": "Popovici",
"suffix": ""
},
{
"first": "Hugo",
"middle": [],
"last": "Larochelle",
"suffix": ""
}
],
"year": 2007,
"venue": "Advances in Neural Information Processing Systems 19",
"volume": "",
"issue": "",
"pages": "153--160",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yoshua Bengio, Pascal Lamblin, Dan Popovici, and Hugo Larochelle. 2007. Greedy layer-wise train- ing of deep networks. In B. Sch\u00f6lkopf, J. Platt, and T. Hoffman, editors, Advances in Neural Informa- tion Processing Systems 19, pages 153-160. MIT Press, Cambridge, MA.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Learning deep architectures for AI. Foundations and Trends in Machine Learning",
"authors": [
{
"first": "Yoshua",
"middle": [],
"last": "Bengio",
"suffix": ""
}
],
"year": 2009,
"venue": "",
"volume": "2",
"issue": "",
"pages": "1--127",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yoshua Bengio. 2009. Learning deep architectures for AI. Foundations and Trends in Machine Learning, 2(1):1-127. Also published as a book. Now Pub- lishers, 2009.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Discriminative learning for differing training and test distributions",
"authors": [
{
"first": "Steffen",
"middle": [],
"last": "Bickel",
"suffix": ""
},
{
"first": "Michael",
"middle": [],
"last": "Brckner",
"suffix": ""
},
{
"first": "Tobias",
"middle": [],
"last": "Scheffer",
"suffix": ""
}
],
"year": 2007,
"venue": "Proc of ICML 2007",
"volume": "",
"issue": "",
"pages": "81--88",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Steffen Bickel, Michael Brckner, and Tobias Scheffer. 2007. Discriminative learning for differing training and test distributions. In Proc of ICML 2007, pages 81-88. ACM Press.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Domain adaptation with structural correspondence learning",
"authors": [
{
"first": "John",
"middle": [],
"last": "Blitzer",
"suffix": ""
},
{
"first": "Ryan",
"middle": [],
"last": "Mcdonald",
"suffix": ""
},
{
"first": "Fernando",
"middle": [],
"last": "Pereira",
"suffix": ""
}
],
"year": 2006,
"venue": "Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "120--128",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "John Blitzer, Ryan McDonald, and Fernando Pereira. 2006. Domain adaptation with structural correspon- dence learning. In Proceedings of the 2006 Con- ference on Empirical Methods in Natural Language Processing, pages 120-128, Sydney, Australia, July. Association for Computational Linguistics.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Discriminative training methods for hidden markov models: theory and experiments with perceptron algorithms",
"authors": [
{
"first": "Michael",
"middle": [],
"last": "Collins",
"suffix": ""
}
],
"year": 2002,
"venue": "Proceedings of the ACL-02 conference on Empirical methods in natural language processing",
"volume": "10",
"issue": "",
"pages": "1--8",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Michael Collins. 2002. Discriminative training meth- ods for hidden markov models: theory and experi- ments with perceptron algorithms. In Proceedings of the ACL-02 conference on Empirical methods in natural language processing -Volume 10, EMNLP '02, pages 1-8, Stroudsburg, PA, USA. Association for Computational Linguistics.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Natural language processing (almost) from scratch",
"authors": [
{
"first": "R",
"middle": [],
"last": "Collobert",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Weston",
"suffix": ""
},
{
"first": "L",
"middle": [],
"last": "Bottou",
"suffix": ""
},
{
"first": "M",
"middle": [],
"last": "Karlen",
"suffix": ""
},
{
"first": "K",
"middle": [],
"last": "Kavukcuoglu",
"suffix": ""
},
{
"first": "P",
"middle": [],
"last": "Kuksa",
"suffix": ""
}
],
"year": 2011,
"venue": "Journal of Machine Learning Research",
"volume": "12",
"issue": "",
"pages": "2493--2537",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "R. Collobert, J. Weston, L. Bottou, M. Karlen, K. Kavukcuoglu, and P. Kuksa. 2011. Natural lan- guage processing (almost) from scratch. Journal of Machine Learning Research, 12:2493-2537.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Training restricted boltzmann machines on word observations",
"authors": [
{
"first": "George",
"middle": [
"E"
],
"last": "Dahl",
"suffix": ""
},
{
"first": "Ryan",
"middle": [
"P"
],
"last": "Adams",
"suffix": ""
},
{
"first": "Hugo",
"middle": [],
"last": "Larochelle",
"suffix": ""
}
],
"year": 2012,
"venue": "Proceedings of the 29th International Conference on Machine Learning (ICML-12), ICML '12",
"volume": "",
"issue": "",
"pages": "679--686",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "George E. Dahl, Ryan P. Adams, and Hugo Larochelle. 2012. Training restricted boltzmann machines on word observations. In John Langford and Joelle Pineau, editors, Proceedings of the 29th Interna- tional Conference on Machine Learning (ICML-12), ICML '12, pages 679-686, New York, NY, USA, July. Omnipress.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Domain adaptation for large-scale sentiment classification: A deep learning approach",
"authors": [
{
"first": "Xavier",
"middle": [],
"last": "Glorot",
"suffix": ""
},
{
"first": "Antoine",
"middle": [],
"last": "Bordes",
"suffix": ""
},
{
"first": "Yoshua",
"middle": [],
"last": "Bengio",
"suffix": ""
}
],
"year": 2011,
"venue": "Proc of ICML 2011",
"volume": "",
"issue": "",
"pages": "513--520",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Xavier Glorot, Antoine Bordes, and Yoshua Bengio. 2011. Domain adaptation for large-scale sentiment classification: A deep learning approach. In Proc of ICML 2011, pages 513-520.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "An efficient algorithm for easy-first non-directional dependency parsing",
"authors": [
{
"first": "Yoav",
"middle": [],
"last": "Goldberg",
"suffix": ""
},
{
"first": "Michael",
"middle": [
"Elhadad"
],
"last": "",
"suffix": ""
}
],
"year": 2010,
"venue": "Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics, HLT '10",
"volume": "",
"issue": "",
"pages": "742--750",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yoav Goldberg and Michael Elhadad. 2010. An effi- cient algorithm for easy-first non-directional depen- dency parsing. In Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Lin- guistics, HLT '10, pages 742-750, Stroudsburg, PA, USA. Association for Computational Linguistics.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "A fast learning algorithm for deep belief nets",
"authors": [
{
"first": "Geoffrey",
"middle": [
"E"
],
"last": "Hinton",
"suffix": ""
},
{
"first": "Simon",
"middle": [],
"last": "Osindero",
"suffix": ""
},
{
"first": "Yee-Whye",
"middle": [],
"last": "Teh",
"suffix": ""
}
],
"year": 2006,
"venue": "Neural Comput",
"volume": "18",
"issue": "7",
"pages": "1527--1554",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Geoffrey E. Hinton, Simon Osindero, and Yee-Whye Teh. 2006. A fast learning algorithm for deep belief nets. Neural Comput., 18(7):1527-1554, July.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Training products of experts by minimizing contrastive divergence",
"authors": [
{
"first": "Geoffrey",
"middle": [
"E"
],
"last": "Hinton",
"suffix": ""
}
],
"year": 2002,
"venue": "Neural Comput",
"volume": "14",
"issue": "8",
"pages": "1771--1800",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Geoffrey E. Hinton. 2002. Training products of ex- perts by minimizing contrastive divergence. Neural Comput., 14(8):1771-1800, August.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Instance weighting for domain adaptation in nlp",
"authors": [
{
"first": "Jing",
"middle": [],
"last": "Jiang",
"suffix": ""
},
{
"first": "Chengxiang",
"middle": [],
"last": "Zhai",
"suffix": ""
}
],
"year": 2007,
"venue": "Proceedings of the 45th Annual Meeting of the Association of Computational Linguistics",
"volume": "",
"issue": "",
"pages": "264--271",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jing Jiang and ChengXiang Zhai. 2007. Instance weighting for domain adaptation in nlp. In Pro- ceedings of the 45th Annual Meeting of the Associ- ation of Computational Linguistics, pages 264-271, Prague, Czech Republic, June. Association for Com- putational Linguistics.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "DCU-Paris13 Systems for the SANCL 2012 Shared Task",
"authors": [
{
"first": "Joseph",
"middle": [],
"last": "Le Roux",
"suffix": ""
},
{
"first": "Jennifer",
"middle": [],
"last": "Foster",
"suffix": ""
},
{
"first": "Joachim",
"middle": [],
"last": "Wagner",
"suffix": ""
}
],
"year": 2012,
"venue": "Proceedings of the NAACL 2012 First Workshop on Syntactic Analysis of Non-Canonical Language (SANCL)",
"volume": "",
"issue": "",
"pages": "1--4",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Joseph Le Roux, Jennifer Foster, Joachim Wagner, Ra- sul Samad Zadeh Kaljahi, and Anton Bryl. 2012. DCU-Paris13 Systems for the SANCL 2012 Shared Task. In Proceedings of the NAACL 2012 First Workshop on Syntactic Analysis of Non-Canonical Language (SANCL), pages 1-4, Montr\u00e9al, Canada, June.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Convolutional deep belief networks for scalable unsupervised learning of hierarchical representations",
"authors": [
{
"first": "Honglak",
"middle": [],
"last": "Lee",
"suffix": ""
},
{
"first": "Roger",
"middle": [],
"last": "Grosse",
"suffix": ""
},
{
"first": "Rajesh",
"middle": [],
"last": "Ranganath",
"suffix": ""
},
{
"first": "Andrew",
"middle": [
"Y"
],
"last": "Ng",
"suffix": ""
}
],
"year": 2009,
"venue": "Proc of ICML 2009",
"volume": "",
"issue": "",
"pages": "609--616",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Honglak Lee, Roger Grosse, Rajesh Ranganath, and Andrew Y. Ng. 2009a. Convolutional deep belief networks for scalable unsupervised learning of hi- erarchical representations. In Proc of ICML 2009, pages 609-616.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Unsupervised feature learning for audio classification using convolutional deep belief networks",
"authors": [
{
"first": "Honglak",
"middle": [],
"last": "Lee",
"suffix": ""
},
{
"first": "Peter",
"middle": [],
"last": "Pham",
"suffix": ""
},
{
"first": "Yan",
"middle": [],
"last": "Largman",
"suffix": ""
},
{
"first": "Andrew",
"middle": [],
"last": "Ng",
"suffix": ""
}
],
"year": 2009,
"venue": "Advances in Neural Information Processing Systems",
"volume": "22",
"issue": "",
"pages": "1096--1104",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Honglak Lee, Peter Pham, Yan Largman, and Andrew Ng. 2009b. Unsupervised feature learning for audio classification using convolutional deep belief net- works. In Y. Bengio, D. Schuurmans, J. Lafferty, C. K. I. Williams, and A. Culotta, editors, Advances in Neural Information Processing Systems 22, pages 1096-1104.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Easy-first pos tagging and dependency parsing with beam search",
"authors": [
{
"first": "Ji",
"middle": [],
"last": "Ma",
"suffix": ""
},
{
"first": "Jingbo",
"middle": [],
"last": "Zhu",
"suffix": ""
},
{
"first": "Tong",
"middle": [],
"last": "Xiao",
"suffix": ""
},
{
"first": "Nan",
"middle": [],
"last": "Yang",
"suffix": ""
}
],
"year": 2013,
"venue": "Proceedings of the 51st Annual Meeting of the Association for Computational Linguistics",
"volume": "2",
"issue": "",
"pages": "110--114",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ji Ma, Jingbo Zhu, Tong Xiao, and Nan Yang. 2013. Easy-first pos tagging and dependency parsing with beam search. In Proceedings of the 51st Annual Meeting of the Association for Computational Lin- guistics (Volume 2: Short Papers), pages 110-114, Sofia, Bulgaria, August. Association for Computa- tional Linguistics.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Improved inference for unlexicalized parsing",
"authors": [
{
"first": "Slav",
"middle": [],
"last": "Petrov",
"suffix": ""
},
{
"first": "Dan",
"middle": [],
"last": "Klein",
"suffix": ""
}
],
"year": 2007,
"venue": "Human Language Technologies 2007: The Conference of the North American Chapter of the Association for Computational Linguistics; Proceedings of the Main Conference",
"volume": "",
"issue": "",
"pages": "404--411",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Slav Petrov and Dan Klein. 2007. Improved infer- ence for unlexicalized parsing. In Human Language Technologies 2007: The Conference of the North American Chapter of the Association for Computa- tional Linguistics; Proceedings of the Main Confer- ence, pages 404-411, Rochester, New York, April. Association for Computational Linguistics.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Overview of the 2012 shared task on parsing the web. Notes of the First Workshop on Syntactic Analysis of Non-Canonical Language (SANCL)",
"authors": [
{
"first": "Slav",
"middle": [],
"last": "Petrov",
"suffix": ""
},
{
"first": "Ryan",
"middle": [],
"last": "Mcdonald",
"suffix": ""
}
],
"year": 2012,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Slav Petrov and Ryan McDonald. 2012. Overview of the 2012 shared task on parsing the web. Notes of the First Workshop on Syntactic Analysis of Non- Canonical Language (SANCL).",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Learning accurate, compact, and interpretable tree annotation",
"authors": [
{
"first": "Slav",
"middle": [],
"last": "Petrov",
"suffix": ""
},
{
"first": "Leon",
"middle": [],
"last": "Barrett",
"suffix": ""
},
{
"first": "Romain",
"middle": [],
"last": "Thibaux",
"suffix": ""
},
{
"first": "Dan",
"middle": [],
"last": "Klein",
"suffix": ""
}
],
"year": 2006,
"venue": "Proceedings of the 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "433--440",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Slav Petrov, Leon Barrett, Romain Thibaux, and Dan Klein. 2006. Learning accurate, compact, and interpretable tree annotation. In Proceedings of the 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Associa- tion for Computational Linguistics, pages 433-440, Sydney, Australia, July. Association for Computa- tional Linguistics.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Structural correspondence learning for parse disambiguation",
"authors": [
{
"first": "Barbara",
"middle": [],
"last": "Plank",
"suffix": ""
}
],
"year": 2009,
"venue": "The Association for Computer Linguistics",
"volume": "",
"issue": "",
"pages": "37--45",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Barbara Plank. 2009. Structural correspondence learn- ing for parse disambiguation. In Alex Lascarides, Claire Gardent, and Joakim Nivre, editors, EACL (Student Research Workshop), pages 37-45. The As- sociation for Computer Linguistics.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Efficient learning of sparse representations with an energy-based model",
"authors": [
{
"first": "Aurelio",
"middle": [],
"last": "Marc",
"suffix": ""
},
{
"first": "Christopher",
"middle": [],
"last": "Ranzato",
"suffix": ""
},
{
"first": "Sumit",
"middle": [],
"last": "Poultney",
"suffix": ""
},
{
"first": "Yann",
"middle": [],
"last": "Chopra",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Lecun",
"suffix": ""
}
],
"year": 2007,
"venue": "Advances in Neural Information Processing Systems",
"volume": "19",
"issue": "",
"pages": "1137--1144",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Marc'Aurelio Ranzato, Christopher Poultney, Sumit Chopra, and Yann LeCun. 2007. Efficient learn- ing of sparse representations with an energy-based model. In B. Sch\u00f6lkopf, J. Platt, and T. Hoffman, editors, Advances in Neural Information Process- ing Systems 19, pages 1137-1144. MIT Press, Cam- bridge, MA.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "A maximum entropy model for part-of-speech tagging",
"authors": [
{
"first": "Adwait",
"middle": [],
"last": "Ratnaparkhi",
"suffix": ""
}
],
"year": 1996,
"venue": "Proceedings of the Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Adwait Ratnaparkhi. 1996. A maximum entropy model for part-of-speech tagging. In Proceedings of the Conference on Empirical Methods in Natural Language Processing.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "Neurocomputing: Foundations of research. chapter Learning Representations by Back-propagating Errors",
"authors": [
{
"first": "David",
"middle": [
"E"
],
"last": "Rumelhart",
"suffix": ""
},
{
"first": "Geoffrey",
"middle": [
"E"
],
"last": "Hinton",
"suffix": ""
},
{
"first": "Ronald",
"middle": [
"J"
],
"last": "Williams",
"suffix": ""
}
],
"year": 1988,
"venue": "",
"volume": "",
"issue": "",
"pages": "696--699",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "David E. Rumelhart, Geoffrey E. Hinton, and Ronald J. Williams. 1988. Neurocomputing: Foundations of research. chapter Learning Representations by Back-propagating Errors, pages 696-699. MIT Press, Cambridge, MA, USA.",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "Domain adaptation of conditional probability models via feature subsetting",
"authors": [
{
"first": "Sandeepkumar",
"middle": [],
"last": "Satpal",
"suffix": ""
},
{
"first": "Sunita",
"middle": [],
"last": "Sarawagi",
"suffix": ""
}
],
"year": 2007,
"venue": "PKDD",
"volume": "4702",
"issue": "",
"pages": "224--235",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sandeepkumar Satpal and Sunita Sarawagi. 2007. Do- main adaptation of conditional probability models via feature subsetting. In PKDD, volume 4702 of Lecture Notes in Computer Science, pages 224-235. Springer.",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "Guided learning for bidirectional sequence classification",
"authors": [
{
"first": "Libin",
"middle": [],
"last": "Shen",
"suffix": ""
},
{
"first": "Giorgio",
"middle": [],
"last": "Satta",
"suffix": ""
},
{
"first": "Aravind",
"middle": [],
"last": "Joshi",
"suffix": ""
}
],
"year": 2007,
"venue": "Proceedings of the 45th Annual Meeting of the Association of Computational Linguistics",
"volume": "",
"issue": "",
"pages": "760--767",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Libin Shen, Giorgio Satta, and Aravind Joshi. 2007. Guided learning for bidirectional sequence classi- fication. In Proceedings of the 45th Annual Meet- ing of the Association of Computational Linguistics, pages 760-767, Prague, Czech Republic, June. As- sociation for Computational Linguistics.",
"links": null
},
"BIBREF27": {
"ref_id": "b27",
"title": "Varderlibt's systems for sancl2012 shared task",
"authors": [],
"year": null,
"venue": "Proceedings of the NAACL 2012 First Workshop on Syntactic Analysis of Non-Canonical Language (SANCL)",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Varderlibt's systems for sancl2012 shared task. In Proceedings of the NAACL 2012 First Workshop on Syntactic Analysis of Non-Canonical Language (SANCL), Montr\u00e9al, Canada, June.",
"links": null
},
"BIBREF28": {
"ref_id": "b28",
"title": "Domain adaptation by constraining inter-domain variability of latent feature representation",
"authors": [
{
"first": "Ivan",
"middle": [],
"last": "Titov",
"suffix": ""
}
],
"year": 2011,
"venue": "Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies",
"volume": "",
"issue": "",
"pages": "62--71",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ivan Titov. 2011. Domain adaptation by constraining inter-domain variability of latent feature representa- tion. In Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Hu- man Language Technologies, pages 62-71, Portland, Oregon, USA, June. Association for Computational Linguistics.",
"links": null
},
"BIBREF29": {
"ref_id": "b29",
"title": "Word representations: A simple and general method for semi-supervised learning",
"authors": [
{
"first": "Joseph",
"middle": [],
"last": "Turian",
"suffix": ""
},
{
"first": "Lev-Arie",
"middle": [],
"last": "Ratinov",
"suffix": ""
},
{
"first": "Yoshua",
"middle": [],
"last": "Bengio",
"suffix": ""
}
],
"year": 2010,
"venue": "Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "384--394",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Joseph Turian, Lev-Arie Ratinov, and Yoshua Bengio. 2010. Word representations: A simple and general method for semi-supervised learning. In Proceed- ings of the 48th Annual Meeting of the Association for Computational Linguistics, pages 384-394, Up- psala, Sweden, July. Association for Computational Linguistics.",
"links": null
},
"BIBREF30": {
"ref_id": "b30",
"title": "Effect of non-linear deep architecture in sequence labeling",
"authors": [
{
"first": "Mengqiu",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "D",
"middle": [],
"last": "Christopher",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Manning",
"suffix": ""
}
],
"year": 2013,
"venue": "Proceedings of the 6th International Joint Conference on Natural Language Processing",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Mengqiu Wang and Christopher D. Manning. 2013. Effect of non-linear deep architecture in sequence la- beling. In Proceedings of the 6th International Joint Conference on Natural Language Processing (IJC- NLP).",
"links": null
},
"BIBREF31": {
"ref_id": "b31",
"title": "Word alignment modeling with context dependent deep neural network",
"authors": [
{
"first": "Nan",
"middle": [],
"last": "Yang",
"suffix": ""
},
{
"first": "Shujie",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Mu",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Ming",
"middle": [],
"last": "Zhou",
"suffix": ""
},
{
"first": "Nenghai",
"middle": [],
"last": "Yu",
"suffix": ""
}
],
"year": 2013,
"venue": "Proceedings of the 51st Annual Meeting of the Association for Computational Linguistics",
"volume": "1",
"issue": "",
"pages": "166--175",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Nan Yang, Shujie Liu, Mu Li, Ming Zhou, and Neng- hai Yu. 2013. Word alignment modeling with con- text dependent deep neural network. In Proceed- ings of the 51st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Pa- pers), pages 166-175, Sofia, Bulgaria, August. As- sociation for Computational Linguistics.",
"links": null
},
"BIBREF32": {
"ref_id": "b32",
"title": "Syntax-based grammaticality improvement using ccg and guided search",
"authors": [
{
"first": "Yue",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Stephen",
"middle": [],
"last": "Clark",
"suffix": ""
}
],
"year": 2011,
"venue": "Proceedings of the 2011 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "1147--1157",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yue Zhang and Stephen Clark. 2011. Syntax-based grammaticality improvement using ccg and guided search. In Proceedings of the 2011 Conference on Empirical Methods in Natural Language Process- ing, pages 1147-1157, Edinburgh, Scotland, UK., July. Association for Computational Linguistics.",
"links": null
},
"BIBREF33": {
"ref_id": "b33",
"title": "Deep learning for Chinese word segmentation and POS tagging",
"authors": [
{
"first": "Xiaoqing",
"middle": [],
"last": "Zheng",
"suffix": ""
},
{
"first": "Hanyang",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Tianyu",
"middle": [],
"last": "Xu",
"suffix": ""
}
],
"year": 2013,
"venue": "Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "647--657",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Xiaoqing Zheng, Hanyang Chen, and Tianyu Xu. 2013. Deep learning for Chinese word segmenta- tion and POS tagging. In Proceedings of the 2013 Conference on Empirical Methods in Natural Lan- guage Processing, pages 647-657, Seattle, Wash- ington, USA, October. Association for Computa- tional Linguistics.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"uris": null,
"text": "The proposed neural network. The webfeature module (lower left) and sparse-feature module (lower right) are combined by a shared output layer (upper).",
"num": null,
"type_str": "figure"
},
"FIGREF2": {
"uris": null,
"text": "Accuracies on the email domain.",
"num": null,
"type_str": "figure"
},
"FIGREF3": {
"uris": null,
"text": "Accuracies on the weblog domain.",
"num": null,
"type_str": "figure"
},
"TABREF2": {
"type_str": "table",
"content": "<table><tr><td/><td>Emails</td><td>Weblogs</td><td colspan=\"2\">Answers Newsgroups</td><td>Reviews</td></tr><tr><td>#Sen</td><td>1,194,173</td><td>524,834</td><td>27,274</td><td>1,000,000</td><td>1,965,350</td></tr><tr><td colspan=\"4\">#Words 17,047,731 10,365,284 424,299</td><td>18,424,657</td><td>29,289,169</td></tr><tr><td>#Types</td><td>221,576</td><td>166,515</td><td>33,325</td><td>357,090</td><td>287,575</td></tr></table>",
"num": null,
"html": null,
"text": "Statistics of the labelled data. #Sen denotes number of sentences. #Words and #Types denote number of words and unique word types, respectively."
},
"TABREF3": {
"type_str": "table",
"content": "<table/>",
"num": null,
"html": null,
"text": "Statistics of the raw unlabelled data."
}
}
}
} |