File size: 126,860 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 | {
"paper_id": "P13-1024",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T09:35:32.080416Z"
},
"title": "Linking Tweets to News: A Framework to Enrich Short Text Data in Social Media",
"authors": [
{
"first": "Weiwei",
"middle": [],
"last": "Guo",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Columbia University",
"location": {}
},
"email": "weiwei@cs.columbia.edu"
},
{
"first": "Hao",
"middle": [],
"last": "Li",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "George Washington University",
"location": {}
},
"email": ""
},
{
"first": "Heng",
"middle": [],
"last": "Ji",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "George Washington University",
"location": {}
},
"email": ""
},
{
"first": "Mona",
"middle": [],
"last": "Diab",
"suffix": "",
"affiliation": {},
"email": "mtdiab@gwu.edu"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "Many current Natural Language Processing [NLP] techniques work well assuming a large context of text as input data. However they become ineffective when applied to short texts such as Twitter feeds. To overcome the issue, we want to find a related newswire document to a given tweet to provide contextual support for NLP tasks. This requires robust modeling and understanding of the semantics of short texts.",
"pdf_parse": {
"paper_id": "P13-1024",
"_pdf_hash": "",
"abstract": [
{
"text": "Many current Natural Language Processing [NLP] techniques work well assuming a large context of text as input data. However they become ineffective when applied to short texts such as Twitter feeds. To overcome the issue, we want to find a related newswire document to a given tweet to provide contextual support for NLP tasks. This requires robust modeling and understanding of the semantics of short texts.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "The contribution of the paper is two-fold: 1. we introduce the Linking-Tweets-to-News task as well as a dataset of linked tweet-news pairs, which can benefit many NLP applications; 2. in contrast to previous research which focuses on lexical features within the short texts (text-to-word information), we propose a graph based latent variable model that models the inter short text correlations (text-to-text information). This is motivated by the observation that a tweet usually only covers one aspect of an event. We show that using tweet specific feature (hashtag) and news specific feature (named entities) as well as temporal constraints, we are able to extract text-to-text correlations, and thus completes the semantic picture of a short text. Our experiments show significant improvement of our new model over baselines with three evaluation metrics in the new task.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Recently there has been an increasing interest in language understanding of Twitter messages. Researchers (Speriosui et al., 2011; Brody and Diakopoulos, 2011; Jiang et al., 2011) were in-terested in sentiment analysis on Twitter feeds, and opinion mining towards political issues or politicians (Tumasjan et al., 2010; Conover et al., 2011) . Others (Ramage et al., 2010; Jin et al., 2011) summarized tweets using topic models. Although these NLP techniques are mature, their performance on tweets inevitably degrades, due to the inherent sparsity in short texts. In the case of sentiment analysis, while people are able to achieve 87.5% accuracy (Maas et al., 2011 ) on a movie review dataset (Pang and Lee, 2004) , the performance drops to 75% ) on a sentence level movie review dataset (Pang and Lee, 2005) . The problem worsens when some existing NLP systems cannot produce any results given the short texts. Considering the following tweet:",
"cite_spans": [
{
"start": 106,
"end": 130,
"text": "(Speriosui et al., 2011;",
"ref_id": "BIBREF32"
},
{
"start": 131,
"end": 159,
"text": "Brody and Diakopoulos, 2011;",
"ref_id": "BIBREF4"
},
{
"start": 160,
"end": 179,
"text": "Jiang et al., 2011)",
"ref_id": "BIBREF17"
},
{
"start": 296,
"end": 319,
"text": "(Tumasjan et al., 2010;",
"ref_id": "BIBREF37"
},
{
"start": 320,
"end": 341,
"text": "Conover et al., 2011)",
"ref_id": "BIBREF6"
},
{
"start": 351,
"end": 372,
"text": "(Ramage et al., 2010;",
"ref_id": "BIBREF29"
},
{
"start": 373,
"end": 390,
"text": "Jin et al., 2011)",
"ref_id": "BIBREF18"
},
{
"start": 648,
"end": 666,
"text": "(Maas et al., 2011",
"ref_id": "BIBREF24"
},
{
"start": 695,
"end": 715,
"text": "(Pang and Lee, 2004)",
"ref_id": "BIBREF26"
},
{
"start": 790,
"end": 810,
"text": "(Pang and Lee, 2005)",
"ref_id": "BIBREF27"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Pray for Mali...",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "A typical event extraction/discovery system (Ji and Grishman, 2008) fails to discover the war event due to the lack of context information (Benson et al., 2011) , and thus fails to shed light on the users focus/interests.",
"cite_spans": [
{
"start": 44,
"end": 67,
"text": "(Ji and Grishman, 2008)",
"ref_id": "BIBREF16"
},
{
"start": 139,
"end": 160,
"text": "(Benson et al., 2011)",
"ref_id": "BIBREF2"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "To enable the NLP tools to better understand Twitter feeds, we propose the task of linking a tweet to a news article that is relevant to the tweet, thereby augmenting the context of the tweet. For example, we want to supplement the implicit context of the above tweet with a news article such as the following entitled:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "where abundant evidence can be fed into an offthe-shelf event extraction/discovery system. To create a gold standard dataset, we download tweets spanning over 18 days, each with a url linking to a news article of CNN or NYTIMES, as well as all the news of CNN and NYTIMES published during the period. The goal is to predict the url referred news article based on the text in each tweet. 1 We believe many NLP tasks will benefit from this task. In fact, in the topic modeling research, previous work (Jin et al., 2011) already showed that by incorporating webpages whose urls are contained in tweets, the tweet clustering purity score was boosted from 0.280 to 0.392.",
"cite_spans": [
{
"start": 387,
"end": 388,
"text": "1",
"ref_id": null
},
{
"start": 499,
"end": 517,
"text": "(Jin et al., 2011)",
"ref_id": "BIBREF18"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "State of emergency declared in Mali",
"sec_num": null
},
{
"text": "Given the few number of words in a tweet (14 words on average in our dataset), the traditional high dimensional surface word matching is lossy and fails to pinpoint the news article. This constitutes a classic short text semantics impediment (Agirre et al., 2012) . Latent variable models are powerful by going beyond the surface word level and mapping short texts into a low dimensional dense vector (Socher et al., 2011; Guo and Diab, 2012b) . Accordingly, we apply a latent variable model, namely, the Weighted Textual Matrix Factorization [WTMF] (Guo and Diab, 2012b; Guo and Diab, 2012c) to both the tweets and the news articles. WTMF is a state-of-the-art unsupervised model that was tested on two short text similarity datasets: (Li et al., 2006) and (Agirre et al., 2012) , which outperforms Latent Semantic Analysis [LSA] (Landauer et al., 1998) and Latent Dirichelet Allocation [LDA] (Blei et al., 2003) by a large margin. We employ it as a strong baseline in this task as it exploits and effectively models the missing words in a tweet, in practice adding thousands of more features for the tweet, by contrast LDA, for example, only leverages observed words (14 features) to infer the latent vector for a tweet.",
"cite_spans": [
{
"start": 242,
"end": 263,
"text": "(Agirre et al., 2012)",
"ref_id": "BIBREF1"
},
{
"start": 401,
"end": 422,
"text": "(Socher et al., 2011;",
"ref_id": "BIBREF31"
},
{
"start": 423,
"end": 443,
"text": "Guo and Diab, 2012b)",
"ref_id": "BIBREF11"
},
{
"start": 543,
"end": 549,
"text": "[WTMF]",
"ref_id": null
},
{
"start": 550,
"end": 571,
"text": "(Guo and Diab, 2012b;",
"ref_id": "BIBREF11"
},
{
"start": 572,
"end": 592,
"text": "Guo and Diab, 2012c)",
"ref_id": "BIBREF12"
},
{
"start": 736,
"end": 753,
"text": "(Li et al., 2006)",
"ref_id": "BIBREF21"
},
{
"start": 758,
"end": 779,
"text": "(Agirre et al., 2012)",
"ref_id": "BIBREF1"
},
{
"start": 825,
"end": 854,
"text": "[LSA] (Landauer et al., 1998)",
"ref_id": null
},
{
"start": 888,
"end": 893,
"text": "[LDA]",
"ref_id": null
},
{
"start": 894,
"end": 913,
"text": "(Blei et al., 2003)",
"ref_id": "BIBREF3"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "State of emergency declared in Mali",
"sec_num": null
},
{
"text": "Apart from the data sparseness, our dataset proposes another challenge: a tweet usually covers only one aspect of an event. In our previous example, the tweet only contains the location Mali while the event is about French army participated in Mali war. In this scenario, we would like to find the missing elements of the tweet such as French, war from other short texts, to complete the semantic picture of Pray in Mali tweet. One drawback of WTMF for our purposes is that it simply models the text-to-word information without leveraging the correlation between short texts. While this is acceptable on standard short text similarity datasets (data points are independently generated), it ignores some valuable information characteristically present in our dataset: (1) The tweet specific features such as hashtags. Hashtags prove to be a direct indication of the semantics of tweets (Ramage et al., 2010) ; (2) The news specific features columbia.edu/\u02dcweiwei such as named entities in a document. Named entities acquired from a news document, typically with high accuracy using Named Entity Recognition [NER] tools, may be particularly informative. If two texts mention the same entities then they might describe the same event; (3) The temporal information in both genres (tweets and news articles). We note that there is a higher chance of event description overlap between two texts if their time of publication is similar.",
"cite_spans": [
{
"start": 885,
"end": 906,
"text": "(Ramage et al., 2010)",
"ref_id": "BIBREF29"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "State of emergency declared in Mali",
"sec_num": null
},
{
"text": "In this paper, we study the problem of mining and exploiting correlations between texts using these features. Two texts may be considered related or complementary if they share a hashtag/NE or satisfies the temporal constraints. Our proposed latent variable model not only models text-to-word information, but also is aware of the text-to-text information (illustrated in Figure 1 ): two linked texts should have similar latent vectors, accordingly the semantic picture of a tweet is completed by receiving semantics from its related tweets. We incorporate this additional information in the WTMF model. We also show the different impact of the text-to-text relations in the tweet genre and news genre. We are able to achieve significantly better results than with a text-to-words WTMF model. This work can be regarded as a short text modeling approach that extends previous work however with a focus on combining the mining of information within short texts coupled with utilizing extra shared information across the short texts.",
"cite_spans": [],
"ref_spans": [
{
"start": 372,
"end": 380,
"text": "Figure 1",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "State of emergency declared in Mali",
"sec_num": null
},
{
"text": "The task is given the text in a tweet, a system aims to find the most relevant news article. For gold standard data, we harvest all the tweets that have a single url link to a CNN or NYTIMES news article, dated from the 11th of Jan to the 27th of Jan, 2013. In evaluation, we consider this url-referred news article as the gold standard -the most relevant document for the tweet, and remove the url from the text of the tweet. We also collect all the news articles from both CNN and NYTIMES from RSS feeds during the same timeframe. Each tweet entry has the published time, author, text; each news entry contains published time, title, news summary, url. The tweet/news pairs are extracted by matching urls. We manually filtered \"trivial\" tweets where the tweet content is simply the news title or news summary. The final dataset results in 34,888 tweets and 12,704 news articles. It is worth noting that the news corpus is not restricted to current events. It covers various genres and topics, such as travel guides. e.g. World's most beautiful lakes, and health issues, e.g. The importance of a 'stop day', etc.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Task and Data",
"sec_num": "2"
},
{
"text": "(a) t 1 t 2 n 2 n 1 t 3 w 1 w 2 w 3 w 4 w 5 w 6 w 7 w 8 t 1 t 2 n 2 n 1 t 3 w 1 w 2 w 3 w 4 w 5 w 6 w 7 w 8 #healthcare Obama temporal (b)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Task and Data",
"sec_num": "2"
},
{
"text": "For our task evaluation, ideally, we would like the system to be able to identify the news article specifically referred to by the url within each tweet in the gold standard. However, this is very difficult given the large number of potential candidates, especially those with slight variations. Therefore, following the Concept Definition Retrieval task in (Guo and Diab, 2012b) and (Steck, 2010) we use a metric for evaluating the ranking of the correct news article to evaluate the systems, namely, ATOP t , area under the TOPK t (k) recall curve for a tweet t. Basically, it is the normalized ranking \u2208 [0, 1] of the correct news article among all candidate news articles: ATOP t = 1 means the url-referred news article has the highest similarity value with the tweet (a correct NARU); ATOP t = 0.95 means the similarity value with correct news article is larger than 95% of the candidates, i.e. within the top 5% of the candidates. ATOP t is calculated as follows:",
"cite_spans": [
{
"start": 358,
"end": 379,
"text": "(Guo and Diab, 2012b)",
"ref_id": "BIBREF11"
},
{
"start": 384,
"end": 397,
"text": "(Steck, 2010)",
"ref_id": "BIBREF34"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation metric",
"sec_num": "2.1"
},
{
"text": "ATOP t = 1 0 TOPK t (k)dk (1)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation metric",
"sec_num": "2.1"
},
{
"text": "where TOPK t (k) = 1 if the url referred news article is in the \"top k\" list, otherwise TOPK t (k) = 0.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation metric",
"sec_num": "2.1"
},
{
"text": "Here k \u2208 [0, 1] is the relative position (when k = 1, it means all the candidates). We also include other metrics to examine if the system is able to rank the url referred news article in the first few returned results: TOP10 recall hit rate to evaluate whether the correct news is in the top 10 results, and RR, Reciprocal Rank= 1/r (i.e., RR= 1/3 when the correct news article is ranked at the 3rd highest place).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation metric",
"sec_num": "2.1"
},
{
"text": "The WTMF model (Guo and Diab, 2012a) has been successfully applied to the short text similarity task, achieving state-of-the-art unsupervised performance. This can be attributed to the fact that it models the missing tokens as features, thereby adding many more features for a short text. The missing words of a sentence are defined as all the vocabulary of the training corpus minus the observed words in a sentence. Missing words serve as negative examples for the semantics of a short text: the short text should not be related to the missing words.",
"cite_spans": [
{
"start": 15,
"end": 36,
"text": "(Guo and Diab, 2012a)",
"ref_id": "BIBREF10"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Weighted Textual Matrix Factorization",
"sec_num": "3"
},
{
"text": "As per (Guo and Diab, 2012b) , the corpus is represented in a matrix X, where each cell stores the TF-IDF values of words. The rows of X are words and columns are short texts. As in Figure 2 , matrix X is approximated by the product of a K \u00d7 M matrix P and a K \u00d7 N matrix Q. Accordingly, each sentence s j is represented by a K dimensional latent vector Q \u2022,j . Similarly a word w i is generalized by P \u2022,i . Therefore, the inner product of a word vector P \u2022,i and a short text vector Q \u2022,j is to approximate the cell X ij (shaded part in Figure 2 ). In this way, the missing words are modeled by requiring the inner product of a word vector and short text vector to be close to 0 (the word and the short text should be irrelevant).",
"cite_spans": [
{
"start": 7,
"end": 28,
"text": "(Guo and Diab, 2012b)",
"ref_id": "BIBREF11"
}
],
"ref_spans": [
{
"start": 182,
"end": 191,
"text": "Figure 2",
"ref_id": null
},
{
"start": 540,
"end": 549,
"text": "Figure 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Weighted Textual Matrix Factorization",
"sec_num": "3"
},
{
"text": "Since 99% cells in X are missing tokens (0 value), the impact of observed words is significantly diminished. Therefore a small weight w m is assigned for each 0 cell (missing tokens) in the matrix X in order to preserve the influence of observed words. P and Q are optimized by minimize the objective function:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Weighted Textual Matrix Factorization",
"sec_num": "3"
},
{
"text": "Figure 2: Weighted Textual Matrix Factorization i j Wij (P\u2022,i \u2022 Q\u2022,j \u2212 Xij) 2 + \u03bb||P || 2 2 + \u03bb||Q|| 2 2 Wi,j = 1, if Xij = 0 wm, if Xij = 0 (2)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Weighted Textual Matrix Factorization",
"sec_num": "3"
},
{
"text": "where \u03bb is a regularization term.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Weighted Textual Matrix Factorization",
"sec_num": "3"
},
{
"text": "Twitter/News Features WTMF exploits the text-to-word information in a very nuanced way, while the dependency between texts is ignored. In this Section, we introduce how to create text-to-text relations.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Creating Text-to-text Relations via",
"sec_num": "4"
},
{
"text": "Hashtags highlight the topics in tweets, e.g., The #flu season has started. We believe two tweets sharing the same hashtag should be related, hence we place a link between them to explicitly inform the model that these two tweets should be similar. We find only 8,701 tweets out of 34,888 include hashtags. In fact, we observe many hashtag words are mentioned in tweets without explicitly being tagged with #. To overcome the hashtag sparseness issue, one can resort to keywords recommendation algorithms to mine hashtags for the tweets (Yang et al., 2012) . In this paper, we adopt a simple but effective approach: we collect all the hashtags in the dataset, and automatically hashtag any word in a tweet if that word appears hashtagged in any other tweets. This process resulted in 33,242 tweets automatically labeled with hashtags. For each tweet, and for each hashtag it contains, we extract k tweets that contain this hashtag, assuming they are complementary to the target tweet, and link the k tweets to the target tweet. If there are more than k tweets found, we choose the top k ones that are most chronologically close to the target tweet. The statistics of links can be found in table 2.",
"cite_spans": [
{
"start": 537,
"end": 556,
"text": "(Yang et al., 2012)",
"ref_id": "BIBREF40"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Hashtags and Named Entities",
"sec_num": "4.1"
},
{
"text": "Named entities are some of the most salient features in a news article. Directly applying Named Entity Recognition (NER) tools on news titles or tweets results in many errors due to the noise in the data, such as slang and capitalization. Accordingly, we first apply the NER tool on news summaries, then label named entities in the tweets in the same way as labeling the hashtags: if there is a string in the tweet that matches a named entity from the summaries, then it is labeled as a named entity in the tweet. 25,132 tweets are assigned at least one named entity. 2 To create the similar tweet set, we find k tweets that also contain the named entity.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Hashtags and Named Entities",
"sec_num": "4.1"
},
{
"text": "Tweets published in the same time interval have a larger chance of being similar than those are not chronologically close (Wang and McCallum, 2006) . However, we cannot simply assume any two tweets are similar only based on the timestamp. Therefore, for a tweet we link it to the k most similar tweets whose published time is within 24 hours of the target tweet's timestamp. We use the similarity score returned by WTMF model to measure the similarity of two tweets.",
"cite_spans": [
{
"start": 122,
"end": 147,
"text": "(Wang and McCallum, 2006)",
"ref_id": "BIBREF38"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Temporal Relations",
"sec_num": "4.2"
},
{
"text": "We experimented with other features such as authorship. We note that it was not a helpful feature. While authorship information helps in the task of news/tweets recommendation for a user (Corso et al., 2005; Yan et al., 2012) , the authorship information is too general for this task where we target on \"recommending\" a news article for a tweet.",
"cite_spans": [
{
"start": 187,
"end": 207,
"text": "(Corso et al., 2005;",
"ref_id": "BIBREF7"
},
{
"start": 208,
"end": 225,
"text": "Yan et al., 2012)",
"ref_id": "BIBREF39"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Temporal Relations",
"sec_num": "4.2"
},
{
"text": "We extract the 3 subgraphs (based on hashtags, named entities and temporal) on news articles. However, automatically tagging hashtags or named entities leads to much worse performance (around 93% ATOP values, a 3% decrease from baseline WTMF). There are several reasons for this: 1. When a hashtag-matched word appears in a tweet, it is often related to the central meaning of the tweet, however news articles are generally much longer than tweets, resulting in many more hashtags/named entities matches even though these named entities may not be closely related. 2. The noise introduced during automatic NER accumulates much faster given the large number of named entities in news data. Therefore we only extract temporal relations for news articles.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Creating Relations on News",
"sec_num": "4.3"
},
{
"text": "We propose a novel model to incorporate the links generated as described in the previous section.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "WTMF on Graphs",
"sec_num": "5"
},
{
"text": "If two texts are connected by a link, it means they should be semantically similar. In the WTMF model, we would like the latent vectors of two text nodes Q \u2022,j 1 , Q \u2022,j 2 to be as similar as possible, namely that their cosine similarity to be close to 1. To implement this, we add a regularization term in the objective function of WTMF (equation 2) for each linked pairs",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "WTMF on Graphs",
"sec_num": "5"
},
{
"text": "Q \u2022,j 1 , Q \u2022,j 2 : \u03b4 \u2022 ( Q \u2022,j 1 \u2022 Q \u2022,j 2 |Q \u2022,j 1 ||Q \u2022,j 2 | \u2212 1) 2 (3)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "WTMF on Graphs",
"sec_num": "5"
},
{
"text": "where |Q \u2022,j | denotes the length of vector Q \u2022,j . The coefficient \u03b4 denotes the importance of the text-totext links. A larger \u03b4 means we put more weights on the text-to-text links and less on the text-toword links. We refer to this model as WTMF-G (WTMF on graphs).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "WTMF on Graphs",
"sec_num": "5"
},
{
"text": "Alternating Least Square [ALS] is used for inference in weighted matrix factorization (Srebro and Jaakkola, 2003) . However, ALS is no longer applicable here with the new regularization term (equation 3) involving the length of text vectors |Q \u2022,j |, which is not in quadratic form. Therefore we approximate the objective function by treating the vector length |Q \u2022,j | as fixed values during the ALS iterations:",
"cite_spans": [
{
"start": 86,
"end": 113,
"text": "(Srebro and Jaakkola, 2003)",
"ref_id": "BIBREF33"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Inference",
"sec_num": "5.1"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "P\u2022,i = QW (i) Q + \u03bbI \u22121 QW (i) X\u2022,i Q\u2022,j = PW (j) P + \u03bbI + \u03b4L 2 (j) Q \u2022,s(j) diag(L 2 (s(j)) )Q \u2022,s(j) \u22121 PW (j) X j,\u2022 + \u03b4L (j) Q \u2022,s(j) L n(j)",
"eq_num": "(4)"
}
],
"section": "Inference",
"sec_num": "5.1"
},
{
"text": "We define n(j) as the linked neighbors of short text j, and Q \u2022,n(j) as the set of latent vectors of j's neighbors. The reciprocal of length of these vectors in the current iteration are stored in L s(j) . Similarly, the reciprocal of the length of the short",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Inference",
"sec_num": "5.1"
},
{
"text": "text vector Q \u2022,j is L j .W (i) = diag(W \u2022,i )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Inference",
"sec_num": "5.1"
},
{
"text": "is an M \u00d7 M diagonal matrix containing the ith row of weight matrix W . Due to limited space, the details of the optimization are not shown in this paper; they can be found in (Steck, 2010) .",
"cite_spans": [
{
"start": 176,
"end": 189,
"text": "(Steck, 2010)",
"ref_id": "BIBREF34"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Inference",
"sec_num": "5.1"
},
{
"text": "Corpora: We use the same corpora as in (Guo and Diab, 2012b) : Brown corpus (each sentence is treated as a document), sense definitions of Wiktionary and Wordnet (Fellbaum, 1998) . The tweets and news articles are also included in the corpus, generating 441,258 short texts and 5,149,122 words. The data is tokenized, POS-tagged by Stanford POS tagger (Toutanova et al., 2003) , and lemmatized by WordNet::QueryData.pm. The value of each word in matrix X is its TF-IDF value in the short text.",
"cite_spans": [
{
"start": 39,
"end": 60,
"text": "(Guo and Diab, 2012b)",
"ref_id": "BIBREF11"
},
{
"start": 162,
"end": 178,
"text": "(Fellbaum, 1998)",
"ref_id": "BIBREF9"
},
{
"start": 352,
"end": 376,
"text": "(Toutanova et al., 2003)",
"ref_id": "BIBREF35"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Experiments 6.1 Experiment Setting",
"sec_num": "6"
},
{
"text": "Baselines: We present 4 baselines: 1. Information Retrieval model [IR] , which simply treats a tweet as a document, and performs traditional surface word matching. 2. LDA-\u03b8 with Gibbs Sampling as inference method. We use the inferred topic distribution \u03b8 as a latent vector to represent the tweet/news. 3. LDA-wvec. The problem with LDA-\u03b8 is the inferred topic distribution latent vector is very sparse with only a few non-zero values, resulting in many tweet/news pairs receiving a high similarity value as long as they are in the same topic domain. Hence following (Guo and Diab, 2012b), we first compute the latent vector of a word by P (z|w) (topic distribution per word), then average the word latent vectors weighted by TF-IDF values to represent the short text, which yields much better results. 4. WTMF. In these baselines, hashtags and named entities are simply treated as words.",
"cite_spans": [
{
"start": 66,
"end": 70,
"text": "[IR]",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Experiments 6.1 Experiment Setting",
"sec_num": "6"
},
{
"text": "To curtail variation in results due to randomness, each reported number is the average of 10 runs. For WTMF and WTMF-G, we assign the same initial random values and run 20 iterations. In both systems we fix the missing words weight as w m = 0.01 and regularization coefficient at \u03bb = 20, which is the best condition of WTMF found in (Guo and Diab, 2012b; Guo and Diab, 2012c) . For LDA-\u03b8 and LDA-wvec, we run Gibbs Sampling based LDA for 2000 iterations and average the model over the last 10 iterations. Evaluation: The similarity between a tweet and a news article is measured by cosine similarity. A news article is represented as the concatenation of its title and its summary, which yields better performance. 3 As in (Guo and Diab, 2012b) , for each tweet, we collect the 1,000 news articles published prior to the tweet whose dates of publication are closest to that of the tweet. 4 The cosine similarity score between the url referred news article and the tweet is compared against the scores of these 1,000 news articles to calculate the metric scores. 1/10 of the tweet/news pairs are used as development set, based on which all the parameters are tuned. The metrics ATOP, TOP10 and RR are used to evaluate the performance of systems. Table 1 summarizes the performance of the baselines and WTMF-G at latent dimension D = 100. All the parameters are chosen based on the development set. For WTMF-G, we try different values of k (the number of neighbors linked to a tweet/news for a hashtag/NE/time constraint) and \u03b4 (the weight of link information). We choose to model the links in four subgraphs: (a) hashtags in tweet; (b) named entities in tweet; (c) time in tweet; (d) time in news article. For LDA we tune the hyperparameter \u03b1 (Dirichlet prior for topic distribution of a document) and \u03b2 (Dirichlet prior for word distribution given a topic). It is worth noting that ATOP measures the overall ranking in 1000 samples while TOP10/RR focus on whether the aligned news article is in the first few returned results. Same as reported in (Guo and Diab, 2012b) , LDA-\u03b8 has the worst results due to directly using prior to the tweet, however, that will give a bias to some tweets, since the latter tweets have a larger candidate set than the earlier ones the inferred topic distribution of a text \u03b8. The inferred topic vector has only a few non-zero values, hence a lot of information is missing. LDA-wvec preserves more information by creating a dense latent vector from the topic distribution of a word P (z|w), and thus does much better in ATOP.",
"cite_spans": [
{
"start": 333,
"end": 354,
"text": "(Guo and Diab, 2012b;",
"ref_id": "BIBREF11"
},
{
"start": 355,
"end": 375,
"text": "Guo and Diab, 2012c)",
"ref_id": "BIBREF12"
},
{
"start": 715,
"end": 716,
"text": "3",
"ref_id": null
},
{
"start": 723,
"end": 744,
"text": "(Guo and Diab, 2012b)",
"ref_id": "BIBREF11"
},
{
"start": 888,
"end": 889,
"text": "4",
"ref_id": null
},
{
"start": 2047,
"end": 2068,
"text": "(Guo and Diab, 2012b)",
"ref_id": "BIBREF11"
}
],
"ref_spans": [
{
"start": 1245,
"end": 1252,
"text": "Table 1",
"ref_id": "TABREF1"
}
],
"eq_spans": [],
"section": "Experiments 6.1 Experiment Setting",
"sec_num": "6"
},
{
"text": "It is interesting to see that IR model has a very low ATOP (90.795%) and an acceptable RR (46.281%) score, in contrast to LDA-wvec with a high ATOP (94.148%) and a low RR(27.904%) score. This is caused by the nature of the two models. LDA-wvec is able to identify global coarse grained topic information (such as politics vs. economics), hence receiving a high ATOP by excluding the most irrelevant news articles, however it does not distinguish fine grained difference such as Hillary vs. Obama. IR model exerts the opposite influence via word matching. It ranks a correct news article very high if overlapping words exist (leading to a high RR), or the news article is ranked very low if no overlapping words (hence a low ATOP).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Results",
"sec_num": "6.2"
},
{
"text": "We can conclude WTMF is a very strong baseline given that it achieves high scores with three metrics. As a latent variable model, it is able to capture global topics (+1.89% ATOP over LDAwvec); moreover, by explicitly modeling missing words, the existence of a word is also encoded in the latent vector (+2.31% TOP10 and \u22120.011% RR over IR model). Table 2 : Contribution of subgraphs when D = 100, k = 4, \u03b4 = 3 (gain over baseline WTMF)",
"cite_spans": [],
"ref_spans": [
{
"start": 348,
"end": 355,
"text": "Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Results",
"sec_num": "6.2"
},
{
"text": "With WTMF being a very challenging baseline, WTMF-G can still significantly improve all 3 metrics. In the case k = 4, \u03b4 = 3 compared to WTMF, WTMF-G receives +1.371% TOP10, +2.727% RR, and +0.518% ATOP value (this is a significant improvement of ATOP value considering that it is averaged on 30,000 data points, at an already high level of 96% reducing error rate by 13%). All the improvement of WTMF-G over WTMF is statistically signicant at the 99% condence level with a two-tailed paired t-test.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Results",
"sec_num": "6.2"
},
{
"text": "We also present results using different number of links k in WTMF-G in table 1. We experiment with k = {3, 4, 5}. k = 4 is found to be the optimal value (although k = 5 has a better ATOP). Figure 3 demonstrates the impact of \u03b4 = {0, 1, 2, 3, 4} on each metric when k = 4. Note when \u03b4 = 0 no link is used, which is the baseline WTMF. We can see using links is always helpful. When \u03b4 = 4, we receive a higher ATOP value but lower TOP10 and RR. ",
"cite_spans": [],
"ref_spans": [
{
"start": 189,
"end": 197,
"text": "Figure 3",
"ref_id": "FIGREF1"
}
],
"eq_spans": [],
"section": "Results",
"sec_num": "6.2"
},
{
"text": "We are interested in the contribution of each feature subgraph. Therefore we list the impact of individual components in table 2. The impact of each subgraph is evaluated in two conditions: (a) the subgraph-only; (b) the full-model-minus the subgraph. The full model is the combination of the 4 subgraphs (which is also the best model k = 4 in table 1). In the last two rows of table 2 we also present the results of using authorship only and the full model plus authorship. The 2nd column lists the number of links in the subgraph. To highlight the difference, we report the gain of each model over the baseline model WTMF.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Contribution of Subgraphs",
"sec_num": "6.3"
},
{
"text": "We have several interesting observations from table 2.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Contribution of Subgraphs",
"sec_num": "6.3"
},
{
"text": "It is clear that the hashtag subgraph on tweets is the most useful subgraph: with hashtag tweet it has the best ATOP and TOP10 values among subgraph-only condition (ATOP: +0.379% vs. 2nd best +0.136%, TOP10: +1.021% vs. 2nd best +0.503%), while in the full-model-minus condition, minus hashtag has the lowest ATOP and TOP10. Observing that it also contains the most links, we believe the coverage is another important reason for the great performance.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Contribution of Subgraphs",
"sec_num": "6.3"
},
{
"text": "It seems the named entity subgraph helps the least. Looking into the extracted named entities and hashtags, we find many popular named enti-ties are covered by hashtags. That said, adding named entity subgraph into final model has a positive contribution.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Contribution of Subgraphs",
"sec_num": "6.3"
},
{
"text": "It is worth noting that the time news subgraph has the most positive influence on RR. This is because temporal information is very salient in news domain: usually there are several reports to describe an event within a short period, therefore the news latent vector is strengthened by receiving semantics from its neighbors.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Contribution of Subgraphs",
"sec_num": "6.3"
},
{
"text": "At last, we analyze the influence of authorship of tweets. Adding authorship into the full model greatly hurts the scores of TOP10 and RR, whereas it is helpful to ATOP. This is understandable since by introducing author links between tweets, to some degree we are averaging the latent vectors of tweets written by the same person. Therefore, for a tweet whose topic is vague and hard to detect, it will get some prior knowledge of topics through the author links (hence increase ATOP), whereas this prior knowledge becomes noise for the tweets that are already handled very well by the model (hence decrease TOP10 and RR).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Contribution of Subgraphs",
"sec_num": "6.3"
},
{
"text": "We look closely into ATOP results to obtain an intuitive feel for what is captured and what is not. For example, the ATOP score of WTMF for the tweet-news pair below is 89.9%: Tweet: ...stoked growing speculation that Pakistan's powerful military was quietly supporting moves... @declanwalsh News: Pakistan Supreme Court Orders Arrest of Prime Minister By identifying \"Pakistan\" and \"Supreme Court\" as hashtags/named entity, WTMF-G is able to propagate the semantics from the following two informative tweets to the original tweet, hence achieving a higher ATOP score of 91.9%. Below is an example that shows the deficiency of both WTMF and WTMF-G: Tweet: Another reason to contemplate moving: an early death News: America flunks its health exam",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Error Analysis",
"sec_num": "6.4"
},
{
"text": "In this case WTMF and WTMF-G achieve a low ATOP of 69.8% and 75.1%, respectively. The only evidence the latent variable models rely on is lexical items (WTMF-G extract additional textto-text correlation by word matching). To pinpoint the url referred news articles, other advanced NLP features should be exploited. In this case, we believe sentiment information could be helpfulboth tweet and the news article contain a negative polarity.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Error Analysis",
"sec_num": "6.4"
},
{
"text": "Short Text Semantics: The field of short text semantics has progressed immensely in recent years. Early work focus on word pair similarity in the high dimensional space. The word pair similarity is either knowledge based (Mihalcea et al., 2006; Tsatsaronis et al., 2010) or corpus based (Li et al., 2006; Islam and Inkpen, 2008) , where cooccurrence information cannot be efficiently exploited. Guo and Diab (2012b; 2012a; 2013) show the superiority of the latent space approach in the WTMF model achieving state-of-the-art performance on two datasets. However, all of them only reply on text-to-word information. In this paper, we focus on modeling inter-text relations induced by Twitter/news features. We extend the WTMF model and adapt it into tweets modeling, achieving significantly better results. Modeling Tweets in a Latent Space: Ramage et al. (2010) also use hashtags to improve the latent representation of tweets in a LDA framework, Labeled-LDA (Ramage et al., 2009) , treating each hashtag as a label. Similar to the experiments presented in this paper, the result of using Labeled-LDA alone is worse than the IR model, due to the sparseness in the induced LDA latent vector. Jin et al. (2011) apply an LDA based model on clustering by incorporating url referred documents. The semantics of long documents are transferred to the topic distribution of tweets. News recommendation: A news recommendation system aims to recommend news articles to a user based on the features (e.g., key words, tags, category) in the documents that the user likes (hence these documents form a training set) (Claypool et al., 1999; Corso et al., 2005; Lee and Park, 2007) . Our paper resembles it in searching for a related news article. However, we target on recommending news article only based on a tweet, which is a much smaller context than the set of favorite documents chosen by a user .",
"cite_spans": [
{
"start": 221,
"end": 244,
"text": "(Mihalcea et al., 2006;",
"ref_id": "BIBREF25"
},
{
"start": 245,
"end": 270,
"text": "Tsatsaronis et al., 2010)",
"ref_id": "BIBREF36"
},
{
"start": 287,
"end": 304,
"text": "(Li et al., 2006;",
"ref_id": "BIBREF21"
},
{
"start": 305,
"end": 328,
"text": "Islam and Inkpen, 2008)",
"ref_id": "BIBREF15"
},
{
"start": 395,
"end": 415,
"text": "Guo and Diab (2012b;",
"ref_id": "BIBREF11"
},
{
"start": 416,
"end": 422,
"text": "2012a;",
"ref_id": "BIBREF10"
},
{
"start": 423,
"end": 428,
"text": "2013)",
"ref_id": "BIBREF13"
},
{
"start": 958,
"end": 979,
"text": "(Ramage et al., 2009)",
"ref_id": "BIBREF28"
},
{
"start": 1190,
"end": 1207,
"text": "Jin et al. (2011)",
"ref_id": "BIBREF18"
},
{
"start": 1602,
"end": 1625,
"text": "(Claypool et al., 1999;",
"ref_id": "BIBREF5"
},
{
"start": 1626,
"end": 1645,
"text": "Corso et al., 2005;",
"ref_id": "BIBREF7"
},
{
"start": 1646,
"end": 1665,
"text": "Lee and Park, 2007)",
"ref_id": "BIBREF20"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "7"
},
{
"text": "Research on Tweets: In (Duan et al., 2010) , url availability is an important feature for tweets ranking. However, the number of tweets with an explicit url is very limited. Huang et al. (2012) propose a graph-based framework to propagate tweet ranking scores, where relevant web documents is found to be helpful to discover informative tweets. Both work can take advantage of our work to either extract potential url features or retrieve topically similar web documents. (Sankaranarayanan et al., 2009) aims at capturing tweets that correspond to late breaking news. However, they cluster tweets and simply choose a url referred news in those tweets as the related news for the whole cluster (the urls are visible to the systems). (Abel et al., 2011) is most related work to our paper, however their focus is the user profiling task, therefore they do not provide a paired tweet/news data set and have to conduct manual evaluation.",
"cite_spans": [
{
"start": 23,
"end": 42,
"text": "(Duan et al., 2010)",
"ref_id": "BIBREF8"
},
{
"start": 174,
"end": 193,
"text": "Huang et al. (2012)",
"ref_id": "BIBREF14"
},
{
"start": 472,
"end": 503,
"text": "(Sankaranarayanan et al., 2009)",
"ref_id": "BIBREF30"
},
{
"start": 732,
"end": 751,
"text": "(Abel et al., 2011)",
"ref_id": "BIBREF0"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "7"
},
{
"text": "We propose a Linking-Tweets-to-News task, which potentially benefits many NLP applications where off-the-shelf NLP tools can be applied to the most relevant news. We also collect a gold standard dataset by crawling tweets each with a url referring to a news article. We formalize the linking task as a short text modeling problem, and extract Twitter/news specific features to extract textto-text relations, which are incorporated into a latent variable model. We achieve significant improvement over baselines.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "8"
},
{
"text": "The data and code is publicly available at www.cs.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Note that there are some false positive named entities detected such as apple. We plan to address removing noisy named entities and hashtags in future work",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "While these are separated, WTMF receive ATOP 95.558% for representing news article as titles and 94.385% for representing news article as summaries4 Ideally we want to include all the news articles published",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Semantic enrichment of twitter posts for user profile construction on the social web",
"authors": [
{
"first": "Fabian",
"middle": [],
"last": "Abel",
"suffix": ""
},
{
"first": "Qi",
"middle": [],
"last": "Gao",
"suffix": ""
},
{
"first": "Geert-Jan",
"middle": [],
"last": "Houben",
"suffix": ""
},
{
"first": "Ke",
"middle": [],
"last": "Tao",
"suffix": ""
}
],
"year": 2011,
"venue": "Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Fabian Abel, Qi Gao, Geert-Jan Houben, and Ke Tao. 2011. Semantic enrichment of twitter posts for user profile construction on the social web. In Proceed- ings of the 49th Annual Meeting of the Association for Computational Linguistics.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Semeval-2012 task 6: A pilot on semantic textual similarity",
"authors": [
{
"first": "Eneko",
"middle": [],
"last": "Agirre",
"suffix": ""
},
{
"first": "Daniel",
"middle": [],
"last": "Cer",
"suffix": ""
},
{
"first": "Mona",
"middle": [],
"last": "Diab",
"suffix": ""
},
{
"first": "Aitor",
"middle": [],
"last": "Gonzalez-Agirre",
"suffix": ""
}
],
"year": 2012,
"venue": "First Joint Conference on Lexical and Computational Semantics (*SEM)",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Eneko Agirre, Daniel Cer, Mona Diab, and Aitor Gonzalez-Agirre. 2012. Semeval-2012 task 6: A pilot on semantic textual similarity. In First Joint Conference on Lexical and Computational Seman- tics (*SEM).",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Event discovery in social media feeds",
"authors": [
{
"first": "Edward",
"middle": [],
"last": "Benson",
"suffix": ""
},
{
"first": "Aria",
"middle": [],
"last": "Haghighi",
"suffix": ""
},
{
"first": "Regina",
"middle": [],
"last": "Barzilay",
"suffix": ""
}
],
"year": 2011,
"venue": "Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Edward Benson, Aria Haghighi, and Regina Barzilay. 2011. Event discovery in social media feeds. In Proceedings of the 49th Annual Meeting of the Asso- ciation for Computational Linguistics: Human Lan- guage Technologies.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Latent dirichlet allocation",
"authors": [
{
"first": "David",
"middle": [
"M"
],
"last": "Blei",
"suffix": ""
},
{
"first": "Andrew",
"middle": [
"Y"
],
"last": "Ng",
"suffix": ""
},
{
"first": "Michael",
"middle": [
"I"
],
"last": "Jordan",
"suffix": ""
}
],
"year": 2003,
"venue": "Journal of Machine Learning Research",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "David M. Blei, Andrew Y. Ng, and Michael I. Jordan. 2003. Latent dirichlet allocation. Journal of Ma- chine Learning Research, 3.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Cooooooooooooooollllllllllllll!!!!!!!!!!!!!! using word lengthening to detect sentiment in microblogs",
"authors": [
{
"first": "Samuel",
"middle": [],
"last": "Brody",
"suffix": ""
},
{
"first": "Nicholas",
"middle": [],
"last": "Diakopoulos",
"suffix": ""
}
],
"year": 2011,
"venue": "Proceedings of the 2011 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Samuel Brody and Nicholas Diakopoulos. 2011. Cooooooooooooooollllllllllllll!!!!!!!!!!!!!! using word lengthening to detect sentiment in microblogs. In Proceedings of the 2011 Conference on Empirical Methods in Natural Language Processing.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Combining content-based and collaborative filters in an online newspaper",
"authors": [
{
"first": "Mark",
"middle": [],
"last": "Claypool",
"suffix": ""
},
{
"first": "Anuja",
"middle": [],
"last": "Gokhale",
"suffix": ""
},
{
"first": "Tim",
"middle": [],
"last": "Miranda",
"suffix": ""
},
{
"first": "Pavel",
"middle": [],
"last": "Murnikov",
"suffix": ""
},
{
"first": "Dmitry",
"middle": [],
"last": "Netes",
"suffix": ""
},
{
"first": "Matthew",
"middle": [],
"last": "Sartin",
"suffix": ""
}
],
"year": 1999,
"venue": "Proceedings of the ACM SIGIR Workshop on Recommender Systems",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Mark Claypool, Anuja Gokhale, Tim Miranda, Pavel Murnikov, Dmitry Netes, and Matthew Sartin. 1999. Combining content-based and collaborative filters in an online newspaper. In In Proceedings of the ACM SIGIR Workshop on Recommender Systems.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Political polarization on twitter",
"authors": [
{
"first": "Michael",
"middle": [],
"last": "Conover",
"suffix": ""
},
{
"first": "Jacob",
"middle": [],
"last": "Ratkiewicz",
"suffix": ""
},
{
"first": "Matthew",
"middle": [],
"last": "Francisco",
"suffix": ""
},
{
"first": "Bruno",
"middle": [],
"last": "Gon\u00e7alves",
"suffix": ""
},
{
"first": "Filippo",
"middle": [],
"last": "Menczer",
"suffix": ""
},
{
"first": "Alessandro",
"middle": [],
"last": "Flammini",
"suffix": ""
}
],
"year": 2011,
"venue": "ICWSM",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Michael Conover, Jacob Ratkiewicz, Matthew Fran- cisco, Bruno Gon\u00e7alves, Filippo Menczer, and Alessandro Flammini. 2011. Political polarization on twitter. In ICWSM.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Ranking a stream of news",
"authors": [
{
"first": "Gianna",
"middle": [
"M Del"
],
"last": "Corso",
"suffix": ""
},
{
"first": "Antonio",
"middle": [],
"last": "Gulli",
"suffix": ""
},
{
"first": "Francesco",
"middle": [],
"last": "Romani",
"suffix": ""
}
],
"year": 2005,
"venue": "WWW",
"volume": "",
"issue": "",
"pages": "97--106",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Gianna M. Del Corso, Antonio Gulli, and Francesco Romani. 2005. Ranking a stream of news. In WWW, pages 97-106.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "An empirical study on learning to rank of tweets",
"authors": [
{
"first": "Yajuan",
"middle": [],
"last": "Duan",
"suffix": ""
},
{
"first": "Long",
"middle": [],
"last": "Jiang",
"suffix": ""
},
{
"first": "Tao",
"middle": [],
"last": "Qin",
"suffix": ""
},
{
"first": "Ming",
"middle": [],
"last": "Zhou",
"suffix": ""
},
{
"first": "Heung-Yeung",
"middle": [],
"last": "Shum",
"suffix": ""
}
],
"year": 2010,
"venue": "COLING",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yajuan Duan, Long Jiang, Tao Qin, Ming Zhou, and Heung-Yeung Shum. 2010. An empirical study on learning to rank of tweets. In COLING.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "WordNet: An Electronic Lexical Database",
"authors": [
{
"first": "Christiane",
"middle": [],
"last": "Fellbaum",
"suffix": ""
}
],
"year": 1998,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Christiane Fellbaum. 1998. WordNet: An Electronic Lexical Database. MIT Press.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Learning the latent semantics of a concept by its definition",
"authors": [
{
"first": "Weiwei",
"middle": [],
"last": "Guo",
"suffix": ""
},
{
"first": "Mona",
"middle": [],
"last": "Diab",
"suffix": ""
}
],
"year": 2012,
"venue": "Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Weiwei Guo and Mona Diab. 2012a. Learning the la- tent semantics of a concept by its definition. In Pro- ceedings of the 50th Annual Meeting of the Associa- tion for Computational Linguistics.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Modeling sentences in the latent space",
"authors": [
{
"first": "Weiwei",
"middle": [],
"last": "Guo",
"suffix": ""
},
{
"first": "Mona",
"middle": [],
"last": "Diab",
"suffix": ""
}
],
"year": 2012,
"venue": "Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Weiwei Guo and Mona Diab. 2012b. Modeling sen- tences in the latent space. In Proceedings of the 50th Annual Meeting of the Association for Compu- tational Linguistics.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Weiwei: A simple unsupervised latent semantics based approach for sentence similarity",
"authors": [
{
"first": "Weiwei",
"middle": [],
"last": "Guo",
"suffix": ""
},
{
"first": "Mona",
"middle": [],
"last": "Diab",
"suffix": ""
}
],
"year": 2012,
"venue": "First Joint Conference on Lexical and Computational Semantics (*SEM)",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Weiwei Guo and Mona Diab. 2012c. Weiwei: A sim- ple unsupervised latent semantics based approach for sentence similarity. In First Joint Conference on Lexical and Computational Semantics (*SEM).",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Improving lexical semantics for sentential semantics: Modeling selectional preference and similar words in a latent variable model",
"authors": [
{
"first": "Weiwei",
"middle": [],
"last": "Guo",
"suffix": ""
},
{
"first": "Mona",
"middle": [],
"last": "Diab",
"suffix": ""
}
],
"year": 2013,
"venue": "The 2013 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Weiwei Guo and Mona Diab. 2013. Improving lexical semantics for sentential semantics: Modeling selec- tional preference and similar words in a latent vari- able model. In The 2013 Conference of the North American Chapter of the Association for Computa- tional Linguistics: Human Language Technologies.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Tweet ranking based on heterogeneous networks",
"authors": [
{
"first": "Hongzhao",
"middle": [],
"last": "Huang",
"suffix": ""
},
{
"first": "Arkaitz",
"middle": [],
"last": "Zubiaga",
"suffix": ""
},
{
"first": "Heng",
"middle": [],
"last": "Ji",
"suffix": ""
},
{
"first": "Hongbo",
"middle": [],
"last": "Deng",
"suffix": ""
},
{
"first": "Dong",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Hieu",
"middle": [],
"last": "Le",
"suffix": ""
},
{
"first": "Tarek",
"middle": [],
"last": "Abdelzather",
"suffix": ""
},
{
"first": "Jiawei",
"middle": [],
"last": "Han",
"suffix": ""
},
{
"first": "Alice",
"middle": [],
"last": "Leung",
"suffix": ""
},
{
"first": "John",
"middle": [],
"last": "Hancock",
"suffix": ""
},
{
"first": "Clare",
"middle": [],
"last": "Voss",
"suffix": ""
}
],
"year": 2012,
"venue": "Proceedings of the 24th International Conference on Computational Linguistics",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Hongzhao Huang, Arkaitz Zubiaga, Heng Ji, Hongbo Deng, Dong Wang, Hieu Le, Tarek Abdelzather, Ji- awei Han, Alice Leung, John Hancock, and Clare Voss. 2012. Tweet ranking based on heterogeneous networks. In Proceedings of the 24th International Conference on Computational Linguistics.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Semantic text similarity using corpus-based word similarity and string similarity",
"authors": [
{
"first": "Aminul",
"middle": [],
"last": "Islam",
"suffix": ""
},
{
"first": "Diana",
"middle": [],
"last": "Inkpen",
"suffix": ""
}
],
"year": 2008,
"venue": "ACM Transactions on Knowledge Discovery from Data",
"volume": "2",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Aminul Islam and Diana Inkpen. 2008. Semantic text similarity using corpus-based word similarity and string similarity. ACM Transactions on Knowledge Discovery from Data, 2.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Refining event extraction through cross-document inference",
"authors": [
{
"first": "Heng",
"middle": [],
"last": "Ji",
"suffix": ""
},
{
"first": "Ralph",
"middle": [],
"last": "Grishman",
"suffix": ""
}
],
"year": 2008,
"venue": "Proceedings of ACL-08: HLT",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Heng Ji and Ralph Grishman. 2008. Refining event ex- traction through cross-document inference. In Pro- ceedings of ACL-08: HLT.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Target-dependent twitter sentiment classification",
"authors": [
{
"first": "Long",
"middle": [],
"last": "Jiang",
"suffix": ""
},
{
"first": "Mo",
"middle": [],
"last": "Yu",
"suffix": ""
},
{
"first": "Ming",
"middle": [],
"last": "Zhou",
"suffix": ""
},
{
"first": "Xiaohua",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Tiejun",
"middle": [],
"last": "Zhao",
"suffix": ""
}
],
"year": 2011,
"venue": "Proceedings of the 49th Annual Meeting of Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Long Jiang, Mo Yu, Ming Zhou, Xiaohua Liu, and Tiejun Zhao. 2011. Target-dependent twitter sen- timent classification. In Proceedings of the 49th An- nual Meeting of Association for Computational Lin- guistics.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Transferring topical knowledge from auxiliary long texts for short text clustering",
"authors": [
{
"first": "Ou",
"middle": [],
"last": "Jin",
"suffix": ""
},
{
"first": "Nathan",
"middle": [
"N"
],
"last": "Liu",
"suffix": ""
},
{
"first": "Kai",
"middle": [],
"last": "Zhao",
"suffix": ""
},
{
"first": "Yong",
"middle": [],
"last": "Yu",
"suffix": ""
},
{
"first": "Qiang",
"middle": [],
"last": "Yang",
"suffix": ""
}
],
"year": 2011,
"venue": "Proceedings of the 20th ACM international conference on Information and knowledge management",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ou Jin, Nathan N. Liu, Kai Zhao, Yong Yu, and Qiang Yang. 2011. Transferring topical knowledge from auxiliary long texts for short text clustering. In Pro- ceedings of the 20th ACM international conference on Information and knowledge management.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "An introduction to latent semantic analysis",
"authors": [
{
"first": "K",
"middle": [],
"last": "Thomas",
"suffix": ""
},
{
"first": "Peter",
"middle": [
"W"
],
"last": "Landauer",
"suffix": ""
},
{
"first": "Darrell",
"middle": [],
"last": "Foltz",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Laham",
"suffix": ""
}
],
"year": 1998,
"venue": "Discourse Processes",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Thomas K Landauer, Peter W. Foltz, and Darrell La- ham. 1998. An introduction to latent semantic anal- ysis. Discourse Processes, 25.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Moners: A news recommender for the mobile web",
"authors": [
{
"first": "H",
"middle": [
"J"
],
"last": "Lee",
"suffix": ""
},
{
"first": "Sung Joo",
"middle": [],
"last": "Park",
"suffix": ""
}
],
"year": 2007,
"venue": "Expert Syst. Appl",
"volume": "32",
"issue": "1",
"pages": "143--150",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "H. J. Lee and Sung Joo Park. 2007. Moners: A news recommender for the mobile web. Expert Syst. Appl., 32(1):143-150.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Sentence similarity based on semantic nets and corpus statistics",
"authors": [
{
"first": "Yuhua",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "David",
"middle": [],
"last": "Mclean",
"suffix": ""
},
{
"first": "Zuhair",
"middle": [
"A"
],
"last": "Bandar",
"suffix": ""
},
{
"first": "James",
"middle": [
"D"
],
"last": "O'shea",
"suffix": ""
},
{
"first": "Keeley",
"middle": [],
"last": "Crockett",
"suffix": ""
}
],
"year": 2006,
"venue": "IEEE Transaction on Knowledge and Data Engineering",
"volume": "18",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yuhua Li, David McLean, Zuhair A. Bandar, James D. O'Shea, and Keeley Crockett. 2006. Sentence simi- larity based on semantic nets and corpus statistics. IEEE Transaction on Knowledge and Data Engi- neering, 18.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Combining social cognitive theories with linguistic features for multi-genre sentiment analysis",
"authors": [
{
"first": "Hao",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Yu",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Heng",
"middle": [],
"last": "Ji",
"suffix": ""
},
{
"first": "Smaranda",
"middle": [],
"last": "Muresan",
"suffix": ""
},
{
"first": "Dequan",
"middle": [],
"last": "Zheng",
"suffix": ""
}
],
"year": 2012,
"venue": "Proceedings of the 26th Pacific Asia Conference on Language, Information and Computation",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Hao Li, Yu Chen, Heng Ji, Smaranda Muresan, and Dequan Zheng. 2012. Combining social cognitive theories with linguistic features for multi-genre sen- timent analysis. In In Proceedings of the 26th Pa- cific Asia Conference on Language, Information and Computation.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "Recognizing named entities in tweets",
"authors": [
{
"first": "Xiaohua",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Shaodian",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Furu",
"middle": [],
"last": "Wei",
"suffix": ""
},
{
"first": "Ming",
"middle": [],
"last": "Zhou",
"suffix": ""
}
],
"year": 2011,
"venue": "The Semanic Web: Research and Applications",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Xiaohua Liu, Shaodian Zhang, Furu Wei, and Ming Zhou. 2011. Recognizing named entities in tweets. In The Semanic Web: Research and Applications.",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "Learning word vectors for sentiment analysis",
"authors": [
{
"first": "Andrew",
"middle": [
"L"
],
"last": "Maas",
"suffix": ""
},
{
"first": "Raymond",
"middle": [
"E"
],
"last": "Daly",
"suffix": ""
},
{
"first": "Peter",
"middle": [
"T"
],
"last": "Pham",
"suffix": ""
},
{
"first": "Dan",
"middle": [],
"last": "Huang",
"suffix": ""
},
{
"first": "Andrew",
"middle": [
"Y"
],
"last": "Ng",
"suffix": ""
},
{
"first": "Christopher",
"middle": [],
"last": "Potts",
"suffix": ""
}
],
"year": 2011,
"venue": "Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Andrew L. Maas, Raymond E. Daly, Peter T. Pham, Dan Huang, Andrew Y. Ng, and Christopher Potts. 2011. Learning word vectors for sentiment analysis. In Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies.",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "Corpus-based and knowledge-based measures of text semantic similarity",
"authors": [
{
"first": "Rada",
"middle": [],
"last": "Mihalcea",
"suffix": ""
},
{
"first": "Courtney",
"middle": [],
"last": "Corley",
"suffix": ""
},
{
"first": "Carlo",
"middle": [],
"last": "Strapparava",
"suffix": ""
}
],
"year": 2006,
"venue": "Proceedings of the 21st National Conference on Articial Intelligence",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Rada Mihalcea, Courtney Corley, and Carlo Strappa- rava. 2006. Corpus-based and knowledge-based measures of text semantic similarity. In Proceed- ings of the 21st National Conference on Articial In- telligence.",
"links": null
},
"BIBREF26": {
"ref_id": "b26",
"title": "A sentimental education: Sentiment analysis using subjectivity summarization based on minimum cuts",
"authors": [
{
"first": "Bo",
"middle": [],
"last": "Pang",
"suffix": ""
},
{
"first": "Lillian",
"middle": [],
"last": "Lee",
"suffix": ""
}
],
"year": 2004,
"venue": "Proceedings of the 42nd Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Bo Pang and Lillian Lee. 2004. A sentimental educa- tion: Sentiment analysis using subjectivity summa- rization based on minimum cuts. In Proceedings of the 42nd Meeting of the Association for Computa- tional Linguistics.",
"links": null
},
"BIBREF27": {
"ref_id": "b27",
"title": "Seeing stars: Exploiting class relationships for sentiment categorization with respect to rating scales",
"authors": [
{
"first": "Bo",
"middle": [],
"last": "Pang",
"suffix": ""
},
{
"first": "Lillian",
"middle": [],
"last": "Lee",
"suffix": ""
}
],
"year": 2005,
"venue": "Proceedings of the 43rd Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Bo Pang and Lillian Lee. 2005. Seeing stars: Exploit- ing class relationships for sentiment categorization with respect to rating scales. In Proceedings of the 43rd Annual Meeting of the Association for Compu- tational Linguistics.",
"links": null
},
"BIBREF28": {
"ref_id": "b28",
"title": "Labeled lda: A supervised topic model for credit attribution in multilabeled corpora",
"authors": [
{
"first": "Daniel",
"middle": [],
"last": "Ramage",
"suffix": ""
},
{
"first": "David",
"middle": [],
"last": "Hall",
"suffix": ""
},
{
"first": "Ramesh",
"middle": [],
"last": "Nallapati",
"suffix": ""
},
{
"first": "Christopher",
"middle": [
"D"
],
"last": "Manning",
"suffix": ""
}
],
"year": 2009,
"venue": "Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Daniel Ramage, David Hall, Ramesh Nallapati, and Christopher D. Manning. 2009. Labeled lda: A su- pervised topic model for credit attribution in multi- labeled corpora. In Proceedings of the 2009 Con- ference on Empirical Methods in Natural Language Processing.",
"links": null
},
"BIBREF29": {
"ref_id": "b29",
"title": "Characterizing microblogs with topic models",
"authors": [
{
"first": "Daniel",
"middle": [],
"last": "Ramage",
"suffix": ""
},
{
"first": "Susan",
"middle": [],
"last": "Dumais",
"suffix": ""
},
{
"first": "Dan",
"middle": [],
"last": "Liebling",
"suffix": ""
}
],
"year": 2010,
"venue": "Proceedings of the Fourth International AAAI Conference on Weblogs and Social Media",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Daniel Ramage, Susan Dumais, and Dan Liebling. 2010. Characterizing microblogs with topic mod- els. In Proceedings of the Fourth International AAAI Conference on Weblogs and Social Media.",
"links": null
},
"BIBREF30": {
"ref_id": "b30",
"title": "Twitterstand: news in tweets",
"authors": [
{
"first": "Jagan",
"middle": [],
"last": "Sankaranarayanan",
"suffix": ""
},
{
"first": "Hanan",
"middle": [],
"last": "Samet",
"suffix": ""
},
{
"first": "Benjamin",
"middle": [
"E"
],
"last": "Teitler",
"suffix": ""
},
{
"first": "Michael",
"middle": [
"D"
],
"last": "Lieberman",
"suffix": ""
},
{
"first": "Jon",
"middle": [],
"last": "Sperling",
"suffix": ""
}
],
"year": 2009,
"venue": "Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jagan Sankaranarayanan, Hanan Samet, Benjamin E. Teitler, Michael D. Lieberman, and Jon Sperling. 2009. Twitterstand: news in tweets. In Proceedings of the 17th ACM SIGSPATIAL International Confer- ence on Advances in Geographic Information Sys- tems.",
"links": null
},
"BIBREF31": {
"ref_id": "b31",
"title": "Dynamic pooling and unfolding recursive autoencoders for paraphrase detection",
"authors": [
{
"first": "Richard",
"middle": [],
"last": "Socher",
"suffix": ""
},
{
"first": "Eric",
"middle": [
"H"
],
"last": "Huang",
"suffix": ""
},
{
"first": "Jeffrey",
"middle": [],
"last": "Pennington",
"suffix": ""
},
{
"first": "Andrew",
"middle": [
"Y"
],
"last": "Ng",
"suffix": ""
},
{
"first": "Christopher",
"middle": [
"D"
],
"last": "Manning",
"suffix": ""
}
],
"year": 2011,
"venue": "Proceedings of Advances in Neural Information Processing Systems",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Richard Socher, Eric H. Huang, Jeffrey Pennington, Andrew Y. Ng, and Christopher D. Manning. 2011. Dynamic pooling and unfolding recursive autoen- coders for paraphrase detection. In Proceedings of Advances in Neural Information Processing Sys- tems.",
"links": null
},
"BIBREF32": {
"ref_id": "b32",
"title": "Twitter polarity classification with label propagation over lexical links and the follower graph",
"authors": [
{
"first": "Michael",
"middle": [],
"last": "Speriosui",
"suffix": ""
},
{
"first": "Nikita",
"middle": [],
"last": "Sudan",
"suffix": ""
},
{
"first": "Sid",
"middle": [],
"last": "Upadhyay",
"suffix": ""
},
{
"first": "Jason",
"middle": [],
"last": "Baldridge",
"suffix": ""
}
],
"year": 2011,
"venue": "Proceedings of the 2011 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Michael Speriosui, Nikita Sudan, Sid Upadhyay, and Jason Baldridge. 2011. Twitter polarity classifica- tion with label propagation over lexical links and the follower graph. In Proceedings of the 2011 Con- ference on Empirical Methods in Natural Language Processing.",
"links": null
},
"BIBREF33": {
"ref_id": "b33",
"title": "Weighted low-rank approximations",
"authors": [
{
"first": "Nathan",
"middle": [],
"last": "Srebro",
"suffix": ""
},
{
"first": "Tommi",
"middle": [],
"last": "Jaakkola",
"suffix": ""
}
],
"year": 2003,
"venue": "Proceedings of the Twentieth International Conference on Machine Learning",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Nathan Srebro and Tommi Jaakkola. 2003. Weighted low-rank approximations. In Proceedings of the Twentieth International Conference on Machine Learning.",
"links": null
},
"BIBREF34": {
"ref_id": "b34",
"title": "Training and testing of recommender systems on data missing not at random",
"authors": [
{
"first": "Harald",
"middle": [],
"last": "Steck",
"suffix": ""
}
],
"year": 2010,
"venue": "Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Harald Steck. 2010. Training and testing of rec- ommender systems on data missing not at random. In Proceedings of the 16th ACM SIGKDD Inter- national Conference on Knowledge Discovery and Data Mining.",
"links": null
},
"BIBREF35": {
"ref_id": "b35",
"title": "Feature-rich part-ofspeech tagging with a cyclic dependency network",
"authors": [
{
"first": "Kristina",
"middle": [],
"last": "Toutanova",
"suffix": ""
},
{
"first": "Dan",
"middle": [],
"last": "Klein",
"suffix": ""
},
{
"first": "Christopher",
"middle": [
"D"
],
"last": "Manning",
"suffix": ""
},
{
"first": "Yoram",
"middle": [],
"last": "Singer",
"suffix": ""
}
],
"year": 2003,
"venue": "HLT-NAACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kristina Toutanova, Dan Klein, Christopher D. Man- ning, and Yoram Singer. 2003. Feature-rich part-of- speech tagging with a cyclic dependency network. In HLT-NAACL.",
"links": null
},
"BIBREF36": {
"ref_id": "b36",
"title": "Iraklis Varlamis, and Michalis Vazirgiannis",
"authors": [
{
"first": "George",
"middle": [],
"last": "Tsatsaronis",
"suffix": ""
}
],
"year": 2010,
"venue": "Journal of Articial Intelligence Research",
"volume": "37",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "George Tsatsaronis, Iraklis Varlamis, and Michalis Vazirgiannis. 2010. Text relatedness based on a word thesaurus. Journal of Articial Intelligence Re- search, 37.",
"links": null
},
"BIBREF37": {
"ref_id": "b37",
"title": "Predicting elections with twitter: What 140 characters reveal about political sentiment",
"authors": [
{
"first": "Andranik",
"middle": [],
"last": "Tumasjan",
"suffix": ""
},
{
"first": "Oliver",
"middle": [],
"last": "Timm",
"suffix": ""
},
{
"first": "Philipp",
"middle": [
"G"
],
"last": "Sprenger",
"suffix": ""
},
{
"first": "Isabell",
"middle": [
"M"
],
"last": "Sandner",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Welpe",
"suffix": ""
}
],
"year": 2010,
"venue": "ICWSM",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Andranik Tumasjan, Timm Oliver Sprenger, Philipp G. Sandner, and Isabell M. Welpe. 2010. Predicting elections with twitter: What 140 characters reveal about political sentiment. In ICWSM.",
"links": null
},
"BIBREF38": {
"ref_id": "b38",
"title": "Topics over time: a non-markov continuous-time model of topical trends",
"authors": [
{
"first": "Xuerui",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Andrew",
"middle": [],
"last": "Mccallum",
"suffix": ""
}
],
"year": 2006,
"venue": "Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Xuerui Wang and Andrew McCallum. 2006. Top- ics over time: a non-markov continuous-time model of topical trends. In In Proceedings of the 12th ACM SIGKDD international conference on Knowl- edge discovery and data mining.",
"links": null
},
"BIBREF39": {
"ref_id": "b39",
"title": "Tweet recommendation with graph co-ranking",
"authors": [
{
"first": "Rui",
"middle": [],
"last": "Yan",
"suffix": ""
},
{
"first": "Mirella",
"middle": [],
"last": "Lapata",
"suffix": ""
},
{
"first": "Xiaoming",
"middle": [],
"last": "Li",
"suffix": ""
}
],
"year": 2012,
"venue": "Proceedings of the 24th International Conference on Computational Linguistics",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Rui Yan, Mirella Lapata, and Xiaoming Li. 2012. Tweet recommendation with graph co-ranking. In Proceedings of the 24th International Conference on Computational Linguistics.",
"links": null
},
"BIBREF40": {
"ref_id": "b40",
"title": "We know what @you #tag: does the dual role affect hashtag adoption?",
"authors": [
{
"first": "Lei",
"middle": [],
"last": "Yang",
"suffix": ""
},
{
"first": "Tao",
"middle": [],
"last": "Sun",
"suffix": ""
},
{
"first": "Ming",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Qiaozhu",
"middle": [],
"last": "Mei",
"suffix": ""
}
],
"year": 2012,
"venue": "Proceedings of the 21st international conference on World Wide Web",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Lei Yang, Tao Sun, Ming Zhang, and Qiaozhu Mei. 2012. We know what @you #tag: does the dual role affect hashtag adoption? In Proceedings of the 21st international conference on World Wide Web.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"text": "(a) WTMF. (b) WTMF-G: the tweet nodes t and news nodes n are connected by hashtags, named entities or temporal edges (for simplicity, the missing tokens are not shown in thefigure)",
"type_str": "figure",
"num": null,
"uris": null
},
"FIGREF1": {
"text": "Impact of \u03b4 (D = 100, k = 4)",
"type_str": "figure",
"num": null,
"uris": null
},
"FIGREF2": {
"text": "Impact of latent dimension D (k = 4)",
"type_str": "figure",
"num": null,
"uris": null
},
"FIGREF3": {
"text": "illustrates the impact of dimension D = {50, 75, 100, 125, 150} on WTMF and WTMF-G (k = 4) on the test set. The trends hold in different D values with a consistent improvement. Generally a larger D leads to a better performance. In all conditions WTMF-G outperforms WTMF.",
"type_str": "figure",
"num": null,
"uris": null
},
"FIGREF4": {
"text": "Pakistan Supreme Court orders the arrest of the PM on corruption charges. A discouraging sign from a tumultuous political system: Pakistan's Supreme Court ordered the arrest of PM Ashraf today.",
"type_str": "figure",
"num": null,
"uris": null
},
"TABREF1": {
"type_str": "table",
"content": "<table><tr><td/><td>96.8</td><td/><td/><td/></tr><tr><td/><td>96.6</td><td/><td/><td/></tr><tr><td>ATOP</td><td>96.4</td><td/><td/><td>dev</td></tr><tr><td/><td/><td/><td/><td>test</td></tr><tr><td/><td>96.2</td><td/><td/><td/></tr><tr><td/><td>96</td><td/><td/><td/></tr><tr><td/><td>0</td><td>1</td><td>2</td><td>3</td><td>4</td></tr><tr><td/><td/><td/><td>\u03b4</td><td/></tr></table>",
"html": null,
"text": "ATOP Performance (latent dimension D = 100 for LDA/WTMF/WTMF-G)",
"num": null
}
}
}
} |