File size: 122,358 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 | {
"paper_id": "P17-1019",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T08:19:49.205287Z"
},
"title": "Generating Natural Answers by Incorporating Copying and Retrieving Mechanisms in Sequence-to-Sequence Learning",
"authors": [
{
"first": "Shizhu",
"middle": [],
"last": "He",
"suffix": "",
"affiliation": {
"laboratory": "National Laboratory of Pattern Recognition",
"institution": "Chinese Academy of Sciences",
"location": {
"postCode": "100190",
"settlement": "Beijing",
"country": "China"
}
},
"email": "shizhu.he@nlpr.ia.ac.cn"
},
{
"first": "Cao",
"middle": [],
"last": "Liu",
"suffix": "",
"affiliation": {
"laboratory": "National Laboratory of Pattern Recognition",
"institution": "Chinese Academy of Sciences",
"location": {
"postCode": "100190",
"settlement": "Beijing",
"country": "China"
}
},
"email": "cao.liu@nlpr.ia.ac.cn"
},
{
"first": "Kang",
"middle": [],
"last": "Liu",
"suffix": "",
"affiliation": {
"laboratory": "National Laboratory of Pattern Recognition",
"institution": "Chinese Academy of Sciences",
"location": {
"postCode": "100190",
"settlement": "Beijing",
"country": "China"
}
},
"email": "kliu@nlpr.ia.ac.cn"
},
{
"first": "Jun",
"middle": [],
"last": "Zhao",
"suffix": "",
"affiliation": {
"laboratory": "National Laboratory of Pattern Recognition",
"institution": "Chinese Academy of Sciences",
"location": {
"postCode": "100190",
"settlement": "Beijing",
"country": "China"
}
},
"email": "jzhao@nlpr.ia.ac.cn"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "Generating answer with natural language sentence is very important in real-world question answering systems, which needs to obtain a right answer as well as a coherent natural response. In this paper, we propose an end-to-end question answering system called COREQA in sequence-to-sequence learning, which incorporates copying and retrieving mechanisms to generate natural answers within an encoder-decoder framework. Specifically, in COREQA, the semantic units (words, phrases and entities) in a natural answer are dynamically predicted from the vocabulary, copied from the given question and/or retrieved from the corresponding knowledge base jointly. Our empirical study on both synthetic and realworld datasets demonstrates the efficiency of COREQA, which is able to generate correct, coherent and natural answers for knowledge inquired questions.",
"pdf_parse": {
"paper_id": "P17-1019",
"_pdf_hash": "",
"abstract": [
{
"text": "Generating answer with natural language sentence is very important in real-world question answering systems, which needs to obtain a right answer as well as a coherent natural response. In this paper, we propose an end-to-end question answering system called COREQA in sequence-to-sequence learning, which incorporates copying and retrieving mechanisms to generate natural answers within an encoder-decoder framework. Specifically, in COREQA, the semantic units (words, phrases and entities) in a natural answer are dynamically predicted from the vocabulary, copied from the given question and/or retrieved from the corresponding knowledge base jointly. Our empirical study on both synthetic and realworld datasets demonstrates the efficiency of COREQA, which is able to generate correct, coherent and natural answers for knowledge inquired questions.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Question answering (QA) systems devote to providing exact answers, often in the form of phrases and entities for natural language questions (Woods, 1977; Ferrucci et al., 2010; Lopez et al., 2011; Yih et al., 2015) , which mainly focus on analyzing questions, retrieving related facts from text snippets or knowledge bases (KBs), and finally predicting the answering semantic units-SU (words, phrases and entities) through ranking (Yao and Van Durme, 2014) and reasoning (Kwok et al., 2001) .",
"cite_spans": [
{
"start": 140,
"end": 153,
"text": "(Woods, 1977;",
"ref_id": "BIBREF25"
},
{
"start": 154,
"end": 176,
"text": "Ferrucci et al., 2010;",
"ref_id": "BIBREF5"
},
{
"start": 177,
"end": 196,
"text": "Lopez et al., 2011;",
"ref_id": "BIBREF14"
},
{
"start": 197,
"end": 214,
"text": "Yih et al., 2015)",
"ref_id": "BIBREF30"
},
{
"start": 431,
"end": 456,
"text": "(Yao and Van Durme, 2014)",
"ref_id": "BIBREF28"
},
{
"start": 471,
"end": 490,
"text": "(Kwok et al., 2001)",
"ref_id": "BIBREF11"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "However, in real-world environments, most people prefer the correct answer replied with a more natural way. For example, most existing commercial products such as Siri 1 will reply a natural answer \"Jet Li is 1.64m in height.\" for the question \"How tall is Jet Li?\", rather than only answering one entity \"1.64m\". Basic on this observation, we define the \"natural answer\" as the natural response in our daily communication for replying factual questions, which is usually expressed in a complete/partial natural language sentence rather than a single entity/phrase. In this case, the system needs to not only parse question, retrieve relevant facts from KB but also generate a proper reply. To this end, most previous approaches employed message-response patterns. Figure 1 schematically illustrates the major steps and features in this process. The system first needs to recognize the topic entity \"Jet Li\" in the question and then extract multiple related facts <Jet Li, gender, Male>, <Jet Li, birthplace, Beijing> and <Jet Li, nationality, Singapore> from KB. Based on the chosen facts and the commonly used messageresponse patterns \"where was %entity from?\" -\"%entity was born in %birthplace, %pronoun is %nationality citizen.\" 2 , the system could finally generate the natural answer (McTear et al., 2016) .",
"cite_spans": [
{
"start": 1290,
"end": 1311,
"text": "(McTear et al., 2016)",
"ref_id": "BIBREF15"
}
],
"ref_spans": [
{
"start": 765,
"end": 773,
"text": "Figure 1",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In order to generate natural answers, typical products need lots of Natural Language Processing (NLP) tools and pattern engineering (McTear et al., 2016) , which not only suffers from high costs of manual annotations for training data and patterns, but also have low coverage that cannot flexibly deal with variable linguistic phenomena in different domains. Therefore, this paper devotes to develop an end-to-end paradigm that generates natural answers without any NLP tools (e.g. POS tagging, parsing, etc.) and pattern engineering. This paradigm tries to consider question answering in an end-to-end framework. In this way, the complicated QA process, including analyzing question, retrieving relevant facts from KB, and generating correct, coherent, natural answers, could be resolved jointly.",
"cite_spans": [
{
"start": 132,
"end": 153,
"text": "(McTear et al., 2016)",
"ref_id": "BIBREF15"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Nevertheless, generating natural answers in an end-to-end manner is not an easy task. The key challenge is that the words in a natural answer may be generated by different ways, including: 1) the common words usually are predicted using a (conditional) language model (e.g. \"born\" in Figure 1) ; 2) the major entities/phrases are selected from the source question (e.g. \"Jet Li\"); 3) the answering entities/phrases are retrieved from the corresponding KB (e.g. \"Beijing\"). In addition, some words or phrases even need to be inferred from related knowledge (e.g. \"He\" should be inferred from the value of \"gender\"). And we even need to deal with some morphological variants (e.g. \"Singapore\" in KB but \"Singaporean\" in answer). Although existing end-to-end models for KB-based question answering, such as GenQA (Yin et al., 2016) , were able to retrieve facts from KBs with neural models. Unfortunately, they cannot copy SUs from the question in generating answers. Moreover, they could not deal with complex questions which need to utilize multiple facts. In addition, existing approaches for conversational (Dialogue) systems are able to generate natural utterances (Serban et al., 2016; Li et al., 2016) in sequence-tosequence learning (Seq2Seq). But they cannot interact with KB and answer information-inquired questions. For example, CopyNet (Gu et al., 2016) is able to copy words from the original source in generating the target through incorporating copying mechanism in conventional Seq2Seq learning, but they cannot retrieve SUs from external memory (e.g. KBs, Texts, etc.).",
"cite_spans": [
{
"start": 810,
"end": 828,
"text": "(Yin et al., 2016)",
"ref_id": "BIBREF31"
},
{
"start": 1167,
"end": 1188,
"text": "(Serban et al., 2016;",
"ref_id": "BIBREF18"
},
{
"start": 1189,
"end": 1205,
"text": "Li et al., 2016)",
"ref_id": "BIBREF16"
},
{
"start": 1346,
"end": 1363,
"text": "(Gu et al., 2016)",
"ref_id": "BIBREF7"
}
],
"ref_spans": [
{
"start": 284,
"end": 293,
"text": "Figure 1)",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Therefore, facing the above challenges, this paper proposes a neural generative model called COREQA with Seq2Seq learning, which is able to reply an answer in a natural way for a given question. Specifically, we incorporate COpying and REtrieving mechanisms within Seq2Seq learning. COREQA is able to analyze the question, retrieve relevant facts and generate a sequence of SUs using a hybrid method with a completely end-to-end learning framework. We conduct experiments on both synthetic data sets and real-world datasets, and the experimental results demonstrate the efficiency of COREQA compared with existing endto-end QA/Dialogue methods.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In brief, our main contributions are as follows:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "\u2022 We propose a new and practical question answering task which devotes to generating natural answers for information inquired questions. It can be regarded as a fusion task of QA and Dialogue.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "\u2022 We propose a neural network based model, named as COREQA, by incorporating copying and retrieving mechanism in Seq2Seq learning. In our knowledge, it is the first end-to-end model that could answer complex questions in a natural way.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "\u2022 We implement experiments on both synthetic and real-world datasets. The experimental results demonstrate that the proposed model could be more effective for generating correct, coherent and natural answers for knowledge inquired questions compared with existing approaches. . In the Encoder-Decoder framework, an encoding RNN first transform a source sequential object",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "X = [x 1 , ..., x L X ]",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "into an encoded representation c. For example, we can utilize the basic model: tricks is Bi-directional RNN, which connect two hidden states of positive time direction and negative time direction. Once the source sequence is encoded, another decoding RNN model is to generate a target sequence",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "h t = f (x t , h t\u22121 ); c = \u03c6(h 1 , ..., h L X ),",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Y = [y 1 , ..., y L Y ],",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "through the following prediction model:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "s t = f (y t\u22121 , s t\u22121 , c); p(y t |y <t , X) = g(y t\u22121 , s t , c),",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "where s t is the RNN hidden state at time t, the predicted target word y t at time t is typically performed by a sof tmax classifier over a settled vocabulary (e.g. 30,000 words) through function g.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The prediction model of classical decoders for each target word y i share the same context vector c. However, a fixed vector is not enough to obtain a better result on generating a long targets.The attention mechanism in the decoding can dynamically choose context c t at each time step (Bahdanau et al., 2014), for example, representing c t as the weighted sum of the source",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Attention Mechanism",
"sec_num": "2.2"
},
{
"text": "states {h t }, c t = L X i=1 \u03b1 ti h i ; \u03b1 ti = e \u03c1(s t\u22121 ,h i ) i e \u03c1(s t\u22121 ,h i ) (1)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Attention Mechanism",
"sec_num": "2.2"
},
{
"text": "where the function \u03c1 use to compute the attentive strength with each source state, which usually adopts a neural network such as multi-layer perceptron (MLP).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Attention Mechanism",
"sec_num": "2.2"
},
{
"text": "Seq2Seq learning heavily rely on the \"meaning\" for each word in source and target sequences, however, some words in sequences are \"no-meaning\" symbols and it is improper to encode them in encoding and decoding processes. For example, generating the response \"Of course, read\" for replying the message \"Can you read the word 'read'?\" should not consider the meaning of the second \"read\". By incorporating the copying mechanism, the decoder could directly copy the sub-sequences of source into the target . The basic approach is to jointly predict the indexes of the target word in the fixed vocabulary and/or matched positions in the source sequences (Gu et al., 2016; Gulcehre et al., 2016) .",
"cite_spans": [
{
"start": 650,
"end": 667,
"text": "(Gu et al., 2016;",
"ref_id": "BIBREF7"
},
{
"start": 668,
"end": 690,
"text": "Gulcehre et al., 2016)",
"ref_id": "BIBREF8"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "The Copying Mechanism",
"sec_num": "2.3"
},
{
"text": "cabulary, copied from the given question, and/or retrieved from the corresponding KB.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Copying Mechanism",
"sec_num": "2.3"
},
{
"text": "As illustrated in Figure 2 , COREQA is an encoderdecoder framework plugged with a KB engineer. A knowledge retrieval module is firstly employed to retrieve related facts from KB by question analysis (see Section 3.2). And then the input question and the retrieved facts are transformed into the corresponding representations by Encoders (see Section 3.3). Finally, the encoded representations are feed to Decoder for generating the target natural answer (see Section 3.4).",
"cite_spans": [],
"ref_spans": [
{
"start": 18,
"end": 26,
"text": "Figure 2",
"ref_id": "FIGREF1"
}
],
"eq_spans": [],
"section": "Model Overview",
"sec_num": "3.1"
},
{
"text": "We mainly focus on answering the information inquired questions (factual questions, and each question usually contains one or more topic entities). This paper utilizes the gold topic entities for simplifying our design. Given the topic entities, we retrieve the related facts from the corresponding KB. KB consists of many relational data, which usually are sets of inter-linked subject-propertyobject (SPO) triple statements. Usually, question contains the information used to match the subject and property parts in a fact triple, and answer incorporates the object part information.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Knowledge (facts) Retrieval",
"sec_num": "3.2"
},
{
"text": "The encoder transforms all discrete input symbols (including words, entities, properties and properties' values) and their structures into numerical representations which are able to feed into neural models (Weston et al., 2014) .",
"cite_spans": [
{
"start": 207,
"end": 228,
"text": "(Weston et al., 2014)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Encoder",
"sec_num": "3.3"
},
{
"text": "Following (Gu et al., 2016) , a bi-directional RN-N (Schuster and Paliwal, 1997 ) is used to transform the question sequence into a sequence of concatenated hidden states with two independent RNNs. The forward and backward RNN respec-",
"cite_spans": [
{
"start": 10,
"end": 27,
"text": "(Gu et al., 2016)",
"ref_id": "BIBREF7"
},
{
"start": 52,
"end": 79,
"text": "(Schuster and Paliwal, 1997",
"ref_id": "BIBREF17"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Question Encoding",
"sec_num": "3.3.1"
},
{
"text": "tively obtain { \u2212 \u2192 h 1 , ..., \u2212 \u2192 h L X } and { \u2190 \u2212 h L X , ..., \u2190 \u2212 h 1 }.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Question Encoding",
"sec_num": "3.3.1"
},
{
"text": "The concatenated representation is considered to be the short-term memory of question (",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Question Encoding",
"sec_num": "3.3.1"
},
{
"text": "M Q = {h t }, h t = [ \u2212 \u2192 h t , \u2190 \u2212 h L X \u2212t+1 ]). q = [ \u2212 \u2192 h L X , \u2190 \u2212 h 1 ]",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Question Encoding",
"sec_num": "3.3.1"
},
{
"text": "is used to represent the entire question, which could be used to compute the similarity between the question and the retrieved facts.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Question Encoding",
"sec_num": "3.3.1"
},
{
"text": "We use s, p and o denote the subject, property and object (value) of one fact f, and e s , e p and e o to denote its corresponding embeddings. The fact representation f is then defined as the concatenation of e s , e p and e o . The list of all related facts' representations, {f} = {f 1 , ..., f L F } (refer to M KB , L F denotes the maximum of candidate facts), is considered to be a short-term memory of KB while answering questions about the topic entities.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Knowledge Base Encoding",
"sec_num": "3.3.2"
},
{
"text": "In addition, given the distributed representation of question and candidate facts, we define the matching scores function between question and facts as S(q, f",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Knowledge Base Encoding",
"sec_num": "3.3.2"
},
{
"text": "j ) = DN N 1 (q, f j ) = tanh(W 2 \u2022 tanh(W 1 \u2022[q, f j ]+b 1 )+b 2 ), ,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Knowledge Base Encoding",
"sec_num": "3.3.2"
},
{
"text": "where DN N 1 is the matching function defined by a two-layer perceptron, [\u2022, \u2022] denotes vector concatenation, and W 1 , W 2 , b 1 and b 2 are the learning parameters. In fact, we will make a slight change of the matching function because it will also depend on the state of decoding process at different times. The modified",
"cite_spans": [
{
"start": 73,
"end": 79,
"text": "[\u2022, \u2022]",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Knowledge Base Encoding",
"sec_num": "3.3.2"
},
{
"text": "function is S(q, s t , f j ) = DN N 1 (q, s t , f j )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Knowledge Base Encoding",
"sec_num": "3.3.2"
},
{
"text": "where s t is the hidden state of decoder at time t.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Knowledge Base Encoding",
"sec_num": "3.3.2"
},
{
"text": "The decoder uses an RNN to generate a natural answer based on the short-term memory of question and retrieved facts which represented as M Q and M KB , respectively. The decoding process of COREQA have the following differences compared with the conventional decoder: Answer words prediction: COREQA predicts SUs based on a mixed probabilistic model of three modes, namely the predict-mode, the copy-mode and the retrieve-mode, where the first mode predicts words with the vocabulary, and the two latter modes pick SUs from the questions and matched facts, respectively; State update: the predicted word at step t \u2212 1 is used to update s t , but COREQA uses not only its word embedding but also its corresponding positional attention informations in M Q and M KB ; Reading short-Memory M Q and M KB : M Q and M KB are fed into COREQA with two ways, the first one is the \"meaning\" with embeddings and the second one is the positions of different words (properties' values).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Decoder",
"sec_num": "3.4"
},
{
"text": "The generated words (entities) may come from vocabulary, source question and matched KB. Accordingly, our model use three correlative output layer: shortlist prediction layer, question location copying layer and candidate-facts location retrieving layer, respectively. And we use the sof tmax classifier of the above three cascaded output layers to pick SUs. We assume a vocabulary",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Answer Words Prediction",
"sec_num": "3.4.1"
},
{
"text": "V = {v 1 , ..., v N } \u222a {UNK},",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Answer Words Prediction",
"sec_num": "3.4.1"
},
{
"text": "where UNK indicates any out-of-vocabulary (OOV) words. Therefore, we have adopted another two set of SUs X Q and X KB which cover words/entities in the source question and the partial KB. That is, we have adopted the instance-specific vocabulary V \u222a X Q \u222a X KB for each question. It's important to note that these three vocabularies V, X Q and X KB may overlap.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Answer Words Prediction",
"sec_num": "3.4.1"
},
{
"text": "At each time step t in the decoding process, given the RNN state s t together with M Q and M KB , the probabilistic function for generating any target SU y t is a \"mixture\" model as follow",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Answer Words Prediction",
"sec_num": "3.4.1"
},
{
"text": "p(y t |s t , y t\u22121 , M Q , M KB ) = p pr (y t |s t , y t\u22121 , c t ) \u2022 p m (pr|s t , y t\u22121 )+ p co (y t |s t , y t\u22121 , M Q ) \u2022 p m (co|s t , y t\u22121 )+ p re (y t |s t , y t\u22121 , M KB ) \u2022 p m (re|s t , y t\u22121 ) (2)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Answer Words Prediction",
"sec_num": "3.4.1"
},
{
"text": "where pr, co and re stand for the predict-mode, the copy-mode and the retrieve-mode, respectively, p m (\u2022|\u2022) indicates the probability model for choosing different modes (we use a sof tmax classifier with two-layer MLP). The probability of the three modes are given by",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Answer Words Prediction",
"sec_num": "3.4.1"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "p pr (y t |\u2022) = 1 Z e \u03c8pr(yt) p co (y t |\u2022) = 1 Z j:Q j =yt e \u03c8co(yt) p re (y t |\u2022) = 1 Z j:KB j =yt e \u03c8re(yt)",
"eq_num": "(3)"
}
],
"section": "Answer Words Prediction",
"sec_num": "3.4.1"
},
{
"text": "where \u03c8 pr (\u2022), \u03c8 co (\u2022) and \u03c8 re (\u2022) are score functions for choosing SUs in predict-mode (from V), copy-mode (from X Q ) and retrieve-mode (from X KB ), respectively. And Z is the normalization term shared by the three modes, Z = e \u03c8pr(v) + j:Q j =v e \u03c8co(v) + j:KB j =v e \u03c8re (v) . And the three modes could compete with each other through a sof tmax function in generating target SUs with the shared normalization term (as shown in Figure 2 . Specifically, the scoring functions of each mode are defined as follows: Predict-mode: Some generated words need reasoning (e.g. \"He\" in Figure 1 ) and morphological transformation (e.g. \"Singaporean\" in Figure 1 ). Therefore, we modify the function as \u03c8 pr (y t = ",
"cite_spans": [
{
"start": 279,
"end": 282,
"text": "(v)",
"ref_id": null
}
],
"ref_spans": [
{
"start": 436,
"end": 444,
"text": "Figure 2",
"ref_id": "FIGREF1"
},
{
"start": 584,
"end": 592,
"text": "Figure 1",
"ref_id": "FIGREF0"
},
{
"start": 651,
"end": 659,
"text": "Figure 1",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Answer Words Prediction",
"sec_num": "3.4.1"
},
{
"text": "v i ) = v T i W pr [s t , c qt , c kbt ] , where v i \u2208 R do is",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Answer Words Prediction",
"sec_num": "3.4.1"
},
{
"text": "= x j ) = DN N 2 (h j , s t , hist Q )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Answer Words Prediction",
"sec_num": "3.4.1"
},
{
"text": ", where DN N 2 is a neural network function with a two-layer MLP and hist Q \u2208 R L X is an accumulated vector which record the attentive history for each word in question (similar with the coverage vector in (Tu et al., 2016) ). Retrieve-mode: The score for \"retrieving\" the entity word v j from retrieval facts (\"Object\" part) is calculated as \u03c8 re (y",
"cite_spans": [
{
"start": 207,
"end": 224,
"text": "(Tu et al., 2016)",
"ref_id": "BIBREF21"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Answer Words Prediction",
"sec_num": "3.4.1"
},
{
"text": "t = v j ) = DN N 3 (f j , s t , hist KB )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Answer Words Prediction",
"sec_num": "3.4.1"
},
{
"text": ", where DN N 3 is also a neural network function and hist KB \u2208 R L F is an accumulated vector which record the attentive history for each fact in candidate facts.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Answer Words Prediction",
"sec_num": "3.4.1"
},
{
"text": "In the generic decoding process, each RNN hidden state s t is updated with the previous state s t\u22121 , the word embedding of previous predicted symbol y t\u22121 , and an optional context vector c t (with attention mechanism). However, y t\u22121 may not come from vocabulary V and not owns a word vector. Therefore, we modify the state update process in COREQA. More specifically, y t\u22121 will be represented as concatenated vector of [e(y t\u22121 ), r q t\u22121 , r kb t\u22121 ], where e(y t\u22121 ) is the word embedding associated with y t\u22121 , r q t\u22121 and r kb t\u22121 are the weighted sum of hidden states in M Q and M KB corresponding to y t\u22121 respectively.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "State Update",
"sec_num": "3.4.2"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "r qt = L X j=1 \u03c1 tj h j , r kbt = L F j=1 \u03b4 tj f j \u03c1 tj = \uf8f1 \uf8f2 \uf8f3 1 K 1 p co (x j |\u2022), x j = y t 0 otherwise \u03b4 tj = \uf8f1 \uf8f2 \uf8f3 1 K 2 p re (f j |\u2022), object(f j ) = y t 0 otherwise",
"eq_num": "(4)"
}
],
"section": "State Update",
"sec_num": "3.4.2"
},
{
"text": "where object(f ) indicate the \"object\" part of fact f (see Figure 2) , and K 1 and K 2 are the normalization terms which equal j :",
"cite_spans": [],
"ref_spans": [
{
"start": 59,
"end": 68,
"text": "Figure 2)",
"ref_id": "FIGREF1"
}
],
"eq_spans": [],
"section": "State Update",
"sec_num": "3.4.2"
},
{
"text": "x j =yt p co (x j |\u2022)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "State Update",
"sec_num": "3.4.2"
},
{
"text": "and j :object(f j )=yt p re (f j |\u2022), respectively, and it could consider the multiple positions matching y t in source question and KB.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "State Update",
"sec_num": "3.4.2"
},
{
"text": "COREQA employ the attention mechanism at decoding process. At each decoder time t, we selective read the context vector c qt and c kbt from the short-term memory of question M Q and retrieval facts M KB (alike to Formula 1). In addition, the accumulated attentive vectors hist Q and hist KB are able to record the positional information of SUs in the source question and retrieved facts.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Reading short-Memory M Q and M KB",
"sec_num": "3.4.3"
},
{
"text": "Although some target SUs in answer are copied and retrieved from the source question and the external KB respectively, COREQA is fully differential and can be optimized in an end-to-end manner using back-propagation. Given the batches of the source questions {X} M and target answers {Y } M both expressed with natural language (symbolic sequences), the objective function is to minimize the negative log-likelihood:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Training",
"sec_num": "3.5"
},
{
"text": "L = \u2212 1 N M k=1 L Y t=1 log[p(y (k) t |y (k) <t , X (k) ] (5)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Training",
"sec_num": "3.5"
},
{
"text": "where the superscript (k) indicates the index of one question-answer (Q-A) pair. The network is no need for any additional labels for training models, because the three modes sharing the same sof tmax classifier for predicting target words, they can learn to coordinate with each other by maximizing the likelihood of observed Q-A pairs.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Training",
"sec_num": "3.5"
},
{
"text": "In this section, we present our main experimental results in two datasets. The first one is a small synthetic dataset in a restricted domain (only involving four properties of persons) (Section 4.1). The second one is a big dataset in open domain, where the Q-A pairs are extracted from community QA website and grounded against a KB with an Integer Linear Programming (ILP) method (Section 4.2). COREQA and all baseline models are trained on a NVIDIA TITAN X GPU using TensorFlow 3 tools, where we used the Adam (Kingma and Ba, 2014) learning rule to update gradients in all experimental configures. The sources codes and data will be released at the personal homepage of the first author 4 .",
"cite_spans": [
{
"start": 513,
"end": 534,
"text": "(Kingma and Ba, 2014)",
"ref_id": "BIBREF10"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Experiments",
"sec_num": "4"
},
{
"text": "Task: The QA systems need to answer questions involving 4 concrete properties of birthdate (including year, month and day) and gender).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Natural QA in Restricted Domain",
"sec_num": "4.1"
},
{
"text": "Through merely involving 4 properties, there are plenty of QA patterns which focus on different aspects of birthdate, for example, \"What year were you born?\" touches on \"year\", but \"When is your birthday?\" touches on \"month and day\". Dataset:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Natural QA in Restricted Domain",
"sec_num": "4.1"
},
{
"text": "Firstly, 108 different Q-A patterns have been constructed by two annotators, one in charge of raising question patterns and another one is responsible for generating corresponding suitable answer patterns, e.g. When is %e birthday? \u2192 She was born in %m %dth. where the variables %e, %y, %m, %d and %g (deciding she or he) indicates the person's name, birth year, birth month, birth day and gender, respectively. Then we randomly generate a KB which contains 80,000 person entities, and each entity including four facts. Given KB facts, we can finally obtain specific Q-A pairs. And the sampling KB, patterns, and the generated Q-A pairs are shown in Table 1 . In order to maintain the diversity, we randomly select 6 patterns for each person. Finally, we totally obtain 239,934 sequences pairs (half patterns may be unmatched because of \"gender\" property).",
"cite_spans": [],
"ref_spans": [
{
"start": 650,
"end": 657,
"text": "Table 1",
"ref_id": "TABREF3"
}
],
"eq_spans": [],
"section": "Natural QA in Restricted Domain",
"sec_num": "4.1"
},
{
"text": "Examples (e.g. KB facts (e2,year,1987);(e2,month,6); (e2,day,20);(e2,gender,male)) When is %e birthday?",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Q-A Patterns",
"sec_num": null
},
{
"text": "When is e2 birthday? He was born in %m %dth.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Q-A Patterns",
"sec_num": null
},
{
"text": "He was born in June 20th. What year were %e born?",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Q-A Patterns",
"sec_num": null
},
{
"text": "What year were e2 born? %e is born in %y year. e2 is born in 1987 year. RNN) , 2) Seq2Seq with attention (marked as RNN+atten), 3) Copy-Net, and 4) GenQA. For a fair comparison, we use bi-directional LSTM for encoder and another LST-M for decoder for all Seq2Seq models, with hidden layer size = 600 and word embedding dimen-sion = 200. We set L F as 5. Metrics: We adopt (automatic evaluation (AE) to test the effects of different models. AE considers the precisions of the entire predicted answers and four specific properties, and the answer is complete correct only when all predicted properties' values is right. To measure the performance of the proposed method, we select following metrics, including P g 5 , P y , P m and P d which denote the precisions for 'gender', 'year', 'month' and 'day' properties, respectively. And P A , R A and F 1 A indicate the precision, recall and F1 in the complete way. Experimental Results: The AE experimental results are shown in Table 2 . It is very clear from Table 2 that COREQA significantly outperforms all other compared methods. The reason of the Gen-QA's poor performance is that all synthetic questions need multiple facts, and GenQA will \"safely\" choose the most frequent property (\"gender\") for all questions. We also found the performances on \"year\" and \"day\" have a little worse than other properties such as \"gender\", it may because there have more ways to answer questions about \"year\" and \"day\". Discussion: Because of the feature of directly \"hard\" copy and retrieve SUs from question and KB, COREQA could answer questions about unseen entities.To evaluate the effects of answering questions about unseen entities, we re-construct 2,000 new person entities and their corresponding facts about four known properties, and obtain 6,081 Q-A pairs through matching the sampling patterns mentioned above. The experimental results are shown in Table 3 , it can be seen that the performance did not fall too much. Table 3 : The AE (%) for seen and unseen entities. 5 The \"gender\" is right when the entity name (e.g. 'e2') or the personal pronoun (e.g. 'She') in answer is correct.",
"cite_spans": [
{
"start": 2018,
"end": 2019,
"text": "5",
"ref_id": null
}
],
"ref_spans": [
{
"start": 72,
"end": 76,
"text": "RNN)",
"ref_id": null
},
{
"start": 974,
"end": 981,
"text": "Table 2",
"ref_id": "TABREF5"
},
{
"start": 1898,
"end": 1905,
"text": "Table 3",
"ref_id": null
},
{
"start": 1967,
"end": 1974,
"text": "Table 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Q-A Patterns",
"sec_num": null
},
{
"text": "Task: To test the performance of the proposed approach in open domains, we modify the task of GenQA (Yin et al., 2016) for supporting multifacts (a typical example is shown in Figure 1) . That is, a natural QA system should generate a sequence of SUs as the natural answer for a given natural language question through interacting with a KB. Dataset: GenQA have released a corpus 6 , which contains a crawling KB and a set of ground Q-A pairs. However, the original Q-A pairs only matched with just one single fact. In fact, we found that a lot of questions need more than one fact (about 20% based on sampling inspection). Therefore, we crawl more Q-A pairs from Chinese community QA website (Baidu Zhidao 7 ). Combined with the originally published corpus, we create a lager and better-quality data for natural question answering. Specifically, an Integral Linear Programming (ILP) based method is employed to automatically construct \"grounding\" Q-A pairs with the facts in KB (inspired by the work of adopting ILP to parse questions (Yahya et al., 2012) ). In ILP, the main constraints and considered factors are listed below: 1) the \"subject\" entity and \"object\" entity of a triple have to match with question words/phrases (marked as subject mention) and answer words/phrases (marked as object mention) respectively; 2) any two subject mentions or object mentions should not overlap; 3) a mention can match at most one entity; 4) the edit distance between the Q-A pair and the matched candidate fact (use a space to joint three parts) is smaller, they are more relevant. Finally, we totally obtain 619,199 instances (an instance contains a question, an answer, and multiple facts), and the number of instances that can match one and multiple facts in KB are 499,809 and 119,390, respectively. Through the evaluation of 200 sampling instances, we estimate that approximate 81% matched facts are helpful for the generating answers. However, strictly speaking, only 44% instances are truly correct grounding. In fact, grounding the Q-A pairs from community QA website is a very challenge problem, we will leave it in the future work. Experimental Setting: The dataset is split into training (90%) and testing set (10%). The sen-tences in Chinese are segmented into word sequences with Jieba 8 tool. And we use the words with the frequency larger than 3, which covering 98.4% of the word in the corpus. For a fair comparison, we use bi-directional LSTM for the encoder and another LSTM for decoder for all Seq2Seq models, with hidden layer size = 1024 and word embedding dimension = 300. We select CopyNet (more advanced Seq2Seq model) and GenQA for comparison. We set L F as 10. Metrics: Besides adopting the AE as a metric (same as GenQA (Yin et al., 2016 )), we additionally use manual evaluation (ME) as another metric. ME considers three aspects about the quality of the generated answer (refer to (Asghar et al., 2016) ): 1) correctness; 2) syntactical fluency; 3) coherence with the question. We employ two annotators to rate such three aspects of Copy-Net, GenQA and COREQA. Specifically, we sample 100 questions, and conduct C 2 3 = 3 pair-wise comparisons for each question and count the winning times of each model (comparisons may both win or both lose). Experimental Results: The AE and ME results are shown in Table 4 and Table 5 , respectively. Meanwhile, we separately present the results according to the number of the facts which a question needs in KB, including just one single fact (marked as Single), multiple facts (marked as Multi) and all (marked as Mixed). In fact, we train two separate models for Single and Multi questions for the unbalanced data . From Table 4 and Table 5 , we can clearly observe that CORE-QA significantly outperforms all other baseline models. And COREQA could generate a better natural answer in three aspects: correctness, fluency and coherence. CopyNet cannot interact with KB which is important to generate correct answers. For example, for \"Who is the director of The Little Chinese Seamstress?\", if without the fact (The Little Chinese Seamstress, director, Dai Siji), QA systems cannot generate a correct answer. Case Study and Error Analysis: Table 6 gives some examples of generated by COREQA and the gold answers to the questions in test set. It is very clearly seen that the parts of generating SUs are predicted from the vocabulary, and other SUs are copied from the given question (marked as bold) and retrieved from the KB (marked as underline).",
"cite_spans": [
{
"start": 100,
"end": 118,
"text": "(Yin et al., 2016)",
"ref_id": "BIBREF31"
},
{
"start": 1036,
"end": 1056,
"text": "(Yahya et al., 2012)",
"ref_id": "BIBREF27"
},
{
"start": 2741,
"end": 2758,
"text": "(Yin et al., 2016",
"ref_id": "BIBREF31"
},
{
"start": 2904,
"end": 2925,
"text": "(Asghar et al., 2016)",
"ref_id": "BIBREF0"
}
],
"ref_spans": [
{
"start": 176,
"end": 185,
"text": "Figure 1)",
"ref_id": "FIGREF0"
},
{
"start": 3325,
"end": 3344,
"text": "Table 4 and Table 5",
"ref_id": "TABREF8"
},
{
"start": 3684,
"end": 3691,
"text": "Table 4",
"ref_id": "TABREF8"
},
{
"start": 3696,
"end": 3703,
"text": "Table 5",
"ref_id": "TABREF9"
},
{
"start": 4202,
"end": 4209,
"text": "Table 6",
"ref_id": null
}
],
"eq_spans": [],
"section": "Natural QA in Open Domain",
"sec_num": "4.2"
},
{
"text": "And we analyze sampled examples and believe that there are several major causes of errors: 1) did not match the right facts (ID 6); 2) the generated answers contain some repetition of meaningless words (ID 7); 3) the generated answers are not coherence natural language sentences (ID 8).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Natural QA in Open Domain",
"sec_num": "4.2"
},
{
"text": "Seq2Seq learning is to maximize the likelihood of predicting the target sequence Y conditioned on the observed source sequence X (Sutskever et al., 2014) , which has been applied successfully to a large number of NLP tasks such as Machine Translation (Wu et al., 2016) and Dialogue (Vinyals and Le, 2015) . Our work is partially inspired by the recent work of QA and Dialogue which have adopted Seq2Seq learning. CopyNet (Gu et al., 2016) and Pointer Networks Gulcehre et al., 2016) which could incorporate copying mechanism in conventional Seq2Seq learning. Different from our application which deals with knowledge inquired questions and generates natural answers, CopyNet (Gu et al., 2016) and Pointer Networks (Gulcehre et al., 2016) can only copy words from the original input sequence. In contrast, COREQA is able to retrieve SUs from external memory. And GenQA (Yin et al., 2016) can only deal with the simple questions which could be answered by one fact, and it also did not incorporate the copying mechanism in Seq2Seq learning. Moreover, our work is also inspired by Neural Abstract Machine (Graves et al., 2016; Yin et al., 2015; Liang et al., 2016) which could retrieve facts from KBs with neural models. Unlike natural answer, Neural Abstract Machine (Mou et al., 2016) is concentrating on obtaining concrete answer en-",
"cite_spans": [
{
"start": 129,
"end": 153,
"text": "(Sutskever et al., 2014)",
"ref_id": "BIBREF20"
},
{
"start": 251,
"end": 268,
"text": "(Wu et al., 2016)",
"ref_id": "BIBREF26"
},
{
"start": 282,
"end": 304,
"text": "(Vinyals and Le, 2015)",
"ref_id": "BIBREF23"
},
{
"start": 421,
"end": 438,
"text": "(Gu et al., 2016)",
"ref_id": "BIBREF7"
},
{
"start": 460,
"end": 482,
"text": "Gulcehre et al., 2016)",
"ref_id": "BIBREF8"
},
{
"start": 675,
"end": 692,
"text": "(Gu et al., 2016)",
"ref_id": "BIBREF7"
},
{
"start": 714,
"end": 737,
"text": "(Gulcehre et al., 2016)",
"ref_id": "BIBREF8"
},
{
"start": 868,
"end": 886,
"text": "(Yin et al., 2016)",
"ref_id": "BIBREF31"
},
{
"start": 1102,
"end": 1123,
"text": "(Graves et al., 2016;",
"ref_id": "BIBREF6"
},
{
"start": 1124,
"end": 1141,
"text": "Yin et al., 2015;",
"ref_id": "BIBREF32"
},
{
"start": 1142,
"end": 1161,
"text": "Liang et al., 2016)",
"ref_id": "BIBREF13"
},
{
"start": 1265,
"end": 1283,
"text": "(Mou et al., 2016)",
"ref_id": "BIBREF16"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "5"
},
{
"text": "http://www.apple.com/ios/siri/ 2 In this pattern, %entity indicates the placeholder of the topic entity, %property indicates the property value of the topic entity.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "COREQATo generate natural answers for information inquired questions, we should first recognize key topics in the question, then extract related facts from KB, and finally fusion those instance-level knowledge with some global-level \"smooth\" and \"glue\" words to generate a coherent reply. In this section, we present COREQA, a differentiable Se-q2Seq model to generate natural answers, which is able to analyze the question, retrieve relevant facts and predict SUs in an end-to-end fashion, and the predicted SUs may be predicted from the vo-",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "https://www.tensorflow.org/",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "http://www.nlpr.ia.ac.cn/cip/shizhuhe/publications.html",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "https://github.com/jxfeb/Generative QA 7 https://zhidao.baidu.com/",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [
{
"text": "The authors are grateful to anonymous reviewers for their constructive comments. ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgments",
"sec_num": null
},
{
"text": "Gold Answer Generated Natural Answer",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Question",
"sec_num": null
},
{
"text": "In this paper, we propose an end-to-end system to generate natural answers through incorporating copying and retrieving mechanisms in sequenceto-sequence learning. Specifically, the sequences of SUs in the generated answer may be predicted from the vocabulary, copied from the given question and retrieved from the corresponding K-B. And the future work includes: a) lots of questions cannot be answered directly by facts in a KB (e.g. \"Who is Jet Li's father-in-law?\"), we plan to learn QA system with latent knowledge (e.g. K-B embedding (Bordes et al., 2013) ); b) we plan to adopt memory networks (Sukhbaatar et al., 2015) to encode the temporary KB for each question.",
"cite_spans": [
{
"start": 540,
"end": 561,
"text": "(Bordes et al., 2013)",
"ref_id": "BIBREF2"
},
{
"start": 601,
"end": 626,
"text": "(Sukhbaatar et al., 2015)",
"ref_id": "BIBREF19"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion and Future Work",
"sec_num": "6"
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Online sequence-to-sequence reinforcement learning for open-domain conversational agents",
"authors": [
{
"first": "Nabiha",
"middle": [],
"last": "Asghar",
"suffix": ""
},
{
"first": "Pascal",
"middle": [],
"last": "Poupart",
"suffix": ""
},
{
"first": "Jiang",
"middle": [],
"last": "Xin",
"suffix": ""
},
{
"first": "Hang",
"middle": [],
"last": "Li",
"suffix": ""
}
],
"year": 2016,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1612.03929"
]
},
"num": null,
"urls": [],
"raw_text": "Nabiha Asghar, Pascal Poupart, Jiang Xin, and Hang Li. 2016. Online sequence-to-sequence reinforce- ment learning for open-domain conversational a- gents. arXiv preprint arXiv:1612.03929 .",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Neural machine translation by jointly learning to align and translate",
"authors": [
{
"first": "Dzmitry",
"middle": [],
"last": "Bahdanau",
"suffix": ""
},
{
"first": "Kyunghyun",
"middle": [],
"last": "Cho",
"suffix": ""
},
{
"first": "Yoshua",
"middle": [],
"last": "Bengio",
"suffix": ""
}
],
"year": 2014,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dzmitry Bahdanau, Kyunghyun Cho, and Yoshua Ben- gio. 2014. Neural machine translation by jointly learning to align and translate. arXiv preprint arX- iv:1409.0473 .",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Translating embeddings for modeling multirelational data",
"authors": [
{
"first": "Antoine",
"middle": [],
"last": "Bordes",
"suffix": ""
},
{
"first": "Nicolas",
"middle": [],
"last": "Usunier",
"suffix": ""
},
{
"first": "Alberto",
"middle": [],
"last": "Garcia-Duran",
"suffix": ""
},
{
"first": "Jason",
"middle": [],
"last": "Weston",
"suffix": ""
},
{
"first": "Oksana",
"middle": [],
"last": "Yakhnenko",
"suffix": ""
}
],
"year": 2013,
"venue": "Advances in neural information processing systems",
"volume": "",
"issue": "",
"pages": "2787--2795",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Antoine Bordes, Nicolas Usunier, Alberto Garcia- Duran, Jason Weston, and Oksana Yakhnenko. 2013. Translating embeddings for modeling multi- relational data. In Advances in neural information processing systems. pages 2787-2795.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Learning phrase representations using rnn encoder-decoder for statistical machine translation",
"authors": [
{
"first": "Kyunghyun",
"middle": [],
"last": "Cho",
"suffix": ""
},
{
"first": "Bart",
"middle": [],
"last": "Van Merri\u00ebnboer",
"suffix": ""
},
{
"first": "Caglar",
"middle": [],
"last": "Gulcehre",
"suffix": ""
},
{
"first": "Dzmitry",
"middle": [],
"last": "Bahdanau",
"suffix": ""
},
{
"first": "Fethi",
"middle": [],
"last": "Bougares",
"suffix": ""
},
{
"first": "Holger",
"middle": [],
"last": "Schwenk",
"suffix": ""
},
{
"first": "Yoshua",
"middle": [],
"last": "Bengio",
"suffix": ""
}
],
"year": 2014,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1406.1078"
]
},
"num": null,
"urls": [],
"raw_text": "Kyunghyun Cho, Bart Van Merri\u00ebnboer, Caglar Gul- cehre, Dzmitry Bahdanau, Fethi Bougares, Holger Schwenk, and Yoshua Bengio. 2014. Learning phrase representations using rnn encoder-decoder for statistical machine translation. arXiv preprint arXiv:1406.1078 .",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Empirical evaluation of gated recurrent neural networks on sequence modeling",
"authors": [
{
"first": "Junyoung",
"middle": [],
"last": "Chung",
"suffix": ""
},
{
"first": "Caglar",
"middle": [],
"last": "Gulcehre",
"suffix": ""
},
{
"first": "Kyunghyun",
"middle": [],
"last": "Cho",
"suffix": ""
},
{
"first": "Yoshua",
"middle": [],
"last": "Bengio",
"suffix": ""
}
],
"year": 2014,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1412.3555"
]
},
"num": null,
"urls": [],
"raw_text": "Junyoung Chung, Caglar Gulcehre, KyungHyun Cho, and Yoshua Bengio. 2014. Empirical evaluation of gated recurrent neural networks on sequence model- ing. arXiv preprint arXiv:1412.3555 .",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Building watson: An overview of the deepqa project",
"authors": [
{
"first": "David",
"middle": [],
"last": "Ferrucci",
"suffix": ""
},
{
"first": "Eric",
"middle": [],
"last": "Brown",
"suffix": ""
},
{
"first": "Jennifer",
"middle": [],
"last": "Chu-Carroll",
"suffix": ""
},
{
"first": "James",
"middle": [],
"last": "Fan",
"suffix": ""
},
{
"first": "David",
"middle": [],
"last": "Gondek",
"suffix": ""
},
{
"first": "Aditya",
"middle": [
"A"
],
"last": "Kalyanpur",
"suffix": ""
},
{
"first": "Adam",
"middle": [],
"last": "Lally",
"suffix": ""
},
{
"first": "William",
"middle": [],
"last": "Murdock",
"suffix": ""
},
{
"first": "Eric",
"middle": [],
"last": "Nyberg",
"suffix": ""
},
{
"first": "John",
"middle": [],
"last": "Prager",
"suffix": ""
}
],
"year": 2010,
"venue": "AI magazine",
"volume": "31",
"issue": "3",
"pages": "59--79",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "David Ferrucci, Eric Brown, Jennifer Chu-Carroll, James Fan, David Gondek, Aditya A Kalyanpur, Adam Lally, J William Murdock, Eric Nyberg, John Prager, et al. 2010. Building watson: An overview of the deepqa project. AI magazine 31(3):59-79.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Hybrid computing using a neural network with dynamic external memory",
"authors": [
{
"first": "Alex",
"middle": [],
"last": "Graves",
"suffix": ""
},
{
"first": "Greg",
"middle": [],
"last": "Wayne",
"suffix": ""
},
{
"first": "Malcolm",
"middle": [],
"last": "Reynolds",
"suffix": ""
},
{
"first": "Tim",
"middle": [],
"last": "Harley",
"suffix": ""
},
{
"first": "Ivo",
"middle": [],
"last": "Danihelka",
"suffix": ""
},
{
"first": "Agnieszka",
"middle": [],
"last": "Grabska-Barwi\u0144ska",
"suffix": ""
},
{
"first": "Sergio",
"middle": [
"G\u00f3mez"
],
"last": "Colmenarejo",
"suffix": ""
},
{
"first": "Edward",
"middle": [],
"last": "Grefenstette",
"suffix": ""
},
{
"first": "Tiago",
"middle": [],
"last": "Ramalho",
"suffix": ""
},
{
"first": "John",
"middle": [],
"last": "Agapiou",
"suffix": ""
}
],
"year": 2016,
"venue": "Nature",
"volume": "538",
"issue": "7626",
"pages": "471--476",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Alex Graves, Greg Wayne, Malcolm Reynolds, Tim Harley, Ivo Danihelka, Agnieszka Grabska- Barwi\u0144ska, Sergio G\u00f3mez Colmenarejo, Edward Grefenstette, Tiago Ramalho, John Agapiou, et al. 2016. Hybrid computing using a neural net- work with dynamic external memory. Nature 538(7626):471-476.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Incorporating copying mechanism in sequence-to-sequence learning",
"authors": [
{
"first": "Jiatao",
"middle": [],
"last": "Gu",
"suffix": ""
},
{
"first": "Zhengdong",
"middle": [],
"last": "Lu",
"suffix": ""
},
{
"first": "Hang",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "O",
"middle": [
"K"
],
"last": "Victor",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Li",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics",
"volume": "1",
"issue": "",
"pages": "1631--1640",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jiatao Gu, Zhengdong Lu, Hang Li, and O.K. Vic- tor Li. 2016. Incorporating copying mechanism in sequence-to-sequence learning. In Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Paper- s). Association for Computational Linguistics, pages 1631-1640.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Pointing the unknown words",
"authors": [
{
"first": "Caglar",
"middle": [],
"last": "Gulcehre",
"suffix": ""
},
{
"first": "Sungjin",
"middle": [],
"last": "Ahn",
"suffix": ""
},
{
"first": "Ramesh",
"middle": [],
"last": "Nallapati",
"suffix": ""
},
{
"first": "Bowen",
"middle": [],
"last": "Zhou",
"suffix": ""
},
{
"first": "Yoshua",
"middle": [],
"last": "Bengio",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics",
"volume": "1",
"issue": "",
"pages": "140--149",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Caglar Gulcehre, Sungjin Ahn, Ramesh Nallapati, Bowen Zhou, and Yoshua Bengio. 2016. Pointing the unknown words. In Proceedings of the 54th An- nual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). Association for Computational Linguistics, pages 140-149.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Long short-term memory",
"authors": [
{
"first": "Sepp",
"middle": [],
"last": "Hochreiter",
"suffix": ""
},
{
"first": "J\u00fcrgen",
"middle": [],
"last": "Schmidhuber",
"suffix": ""
}
],
"year": 1997,
"venue": "Neural computation",
"volume": "9",
"issue": "8",
"pages": "1735--1780",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sepp Hochreiter and J\u00fcrgen Schmidhuber. 1997. Long short-term memory. Neural computation 9(8):1735-1780.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Adam: A method for stochastic optimization",
"authors": [
{
"first": "Diederik",
"middle": [],
"last": "Kingma",
"suffix": ""
},
{
"first": "Jimmy",
"middle": [],
"last": "Ba",
"suffix": ""
}
],
"year": 2014,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1412.6980"
]
},
"num": null,
"urls": [],
"raw_text": "Diederik Kingma and Jimmy Ba. 2014. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 .",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Scaling question answering to the web",
"authors": [
{
"first": "Cody",
"middle": [],
"last": "Kwok",
"suffix": ""
},
{
"first": "Oren",
"middle": [],
"last": "Etzioni",
"suffix": ""
},
{
"first": "Daniel",
"middle": [
"S"
],
"last": "Weld",
"suffix": ""
}
],
"year": 2001,
"venue": "ACM Transactions on Information Systems (TOIS)",
"volume": "19",
"issue": "3",
"pages": "242--262",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Cody Kwok, Oren Etzioni, and Daniel S Weld. 2001. Scaling question answering to the web. ACM Trans- actions on Information Systems (TOIS) 19(3):242- 262.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Deep reinforcement learning for dialogue generation",
"authors": [
{
"first": "Jiwei",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Will",
"middle": [],
"last": "Monroe",
"suffix": ""
},
{
"first": "Alan",
"middle": [],
"last": "Ritter",
"suffix": ""
},
{
"first": "Dan",
"middle": [],
"last": "Jurafsky",
"suffix": ""
},
{
"first": "Michel",
"middle": [],
"last": "Galley",
"suffix": ""
},
{
"first": "Jianfeng",
"middle": [],
"last": "Gao",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "1192--1202",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jiwei Li, Will Monroe, Alan Ritter, Dan Jurafsky, Michel Galley, and Jianfeng Gao. 2016. Deep rein- forcement learning for dialogue generation. In Pro- ceedings of the 2016 Conference on Empirical Meth- ods in Natural Language Processing. Association for Computational Linguistics, pages 1192-1202.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Neural symbolic machines: Learning semantic parsers on freebase with weak supervision",
"authors": [
{
"first": "Chen",
"middle": [],
"last": "Liang",
"suffix": ""
},
{
"first": "Jonathan",
"middle": [],
"last": "Berant",
"suffix": ""
},
{
"first": "Quoc",
"middle": [],
"last": "Le",
"suffix": ""
},
{
"first": "D",
"middle": [],
"last": "Kenneth",
"suffix": ""
},
{
"first": "Ni",
"middle": [],
"last": "Forbus",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Lao",
"suffix": ""
}
],
"year": 2016,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1611.00020"
]
},
"num": null,
"urls": [],
"raw_text": "Chen Liang, Jonathan Berant, Quoc Le, Kenneth D Forbus, and Ni Lao. 2016. Neural symbolic ma- chines: Learning semantic parsers on freebase with weak supervision. arXiv preprint arXiv:1611.00020 .",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Is question answering fit for the semantic web?: a survey",
"authors": [
{
"first": "Vanessa",
"middle": [],
"last": "Lopez",
"suffix": ""
},
{
"first": "Victoria",
"middle": [],
"last": "Uren",
"suffix": ""
},
{
"first": "Marta",
"middle": [],
"last": "Sabou",
"suffix": ""
},
{
"first": "Enrico",
"middle": [],
"last": "Motta",
"suffix": ""
}
],
"year": 2011,
"venue": "Semantic Web",
"volume": "2",
"issue": "2",
"pages": "125--155",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Vanessa Lopez, Victoria Uren, Marta Sabou, and En- rico Motta. 2011. Is question answering fit for the semantic web?: a survey. Semantic Web 2(2):125- 155.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "The Conversational Interface: Talking to Smart Devices",
"authors": [
{
"first": "Michael",
"middle": [],
"last": "Mctear",
"suffix": ""
},
{
"first": "Zoraida",
"middle": [],
"last": "Callejas",
"suffix": ""
},
{
"first": "David",
"middle": [],
"last": "Griol",
"suffix": ""
}
],
"year": 2016,
"venue": "Incorporated",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Michael McTear, Zoraida Callejas, and David Griol. 2016. The Conversational Interface: Talking to S- mart Devices. Springer Publishing Company, Incor- porated, 1st edition.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Coupling distributed and symbolic execution for natural language queries",
"authors": [
{
"first": "Lili",
"middle": [],
"last": "Mou",
"suffix": ""
},
{
"first": "Zhengdong",
"middle": [],
"last": "Lu",
"suffix": ""
},
{
"first": "Hang",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Zhi",
"middle": [],
"last": "Jin",
"suffix": ""
}
],
"year": 2016,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Lili Mou, Zhengdong Lu, Hang Li, and Zhi Jin. 2016. Coupling distributed and symbolic execution for natural language queries. arXiv preprint arX- iv:1612.02741 .",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Bidirectional recurrent neural networks",
"authors": [
{
"first": "Mike",
"middle": [],
"last": "Schuster",
"suffix": ""
},
{
"first": "K",
"middle": [],
"last": "Kuldip",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Paliwal",
"suffix": ""
}
],
"year": 1997,
"venue": "IEEE Transactions on Signal Processing",
"volume": "45",
"issue": "11",
"pages": "2673--2681",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Mike Schuster and Kuldip K Paliwal. 1997. Bidirec- tional recurrent neural networks. IEEE Transactions on Signal Processing 45(11):2673-2681.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Building end-to-end dialogue systems using generative hierarchical neural network models",
"authors": [
{
"first": "Alessandro",
"middle": [],
"last": "Iulian V Serban",
"suffix": ""
},
{
"first": "Yoshua",
"middle": [],
"last": "Sordoni",
"suffix": ""
},
{
"first": "Aaron",
"middle": [],
"last": "Bengio",
"suffix": ""
},
{
"first": "Joelle",
"middle": [],
"last": "Courville",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Pineau",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the 30th AAAI Conference on Artificial Intelligence (AAAI-16)",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Iulian V Serban, Alessandro Sordoni, Yoshua Bengio, Aaron Courville, and Joelle Pineau. 2016. Building end-to-end dialogue systems using generative hier- archical neural network models. In Proceedings of the 30th AAAI Conference on Artificial Intelligence (AAAI-16).",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "End-to-end memory networks",
"authors": [
{
"first": "Sainbayar",
"middle": [],
"last": "Sukhbaatar",
"suffix": ""
},
{
"first": "Jason",
"middle": [],
"last": "Weston",
"suffix": ""
},
{
"first": "Rob",
"middle": [],
"last": "Fergus",
"suffix": ""
}
],
"year": 2015,
"venue": "Advances in neural information processing systems",
"volume": "",
"issue": "",
"pages": "2440--2448",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sainbayar Sukhbaatar, Jason Weston, Rob Fergus, et al. 2015. End-to-end memory networks. In Advances in neural information processing systems. pages 2440-2448.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Sequence to sequence learning with neural networks",
"authors": [
{
"first": "Ilya",
"middle": [],
"last": "Sutskever",
"suffix": ""
},
{
"first": "Oriol",
"middle": [],
"last": "Vinyals",
"suffix": ""
},
{
"first": "Quoc V",
"middle": [],
"last": "Le",
"suffix": ""
}
],
"year": 2014,
"venue": "Advances in neural information processing systems",
"volume": "",
"issue": "",
"pages": "3104--3112",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ilya Sutskever, Oriol Vinyals, and Quoc V Le. 2014. Sequence to sequence learning with neural network- s. In Advances in neural information processing sys- tems. pages 3104-3112.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Coverage-based neural machine translation",
"authors": [
{
"first": "Zhaopeng",
"middle": [],
"last": "Tu",
"suffix": ""
},
{
"first": "Zhengdong",
"middle": [],
"last": "Lu",
"suffix": ""
},
{
"first": "Yang",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Xiaohua",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Hang",
"middle": [],
"last": "Li",
"suffix": ""
}
],
"year": 2016,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1601.04811"
]
},
"num": null,
"urls": [],
"raw_text": "Zhaopeng Tu, Zhengdong Lu, Yang Liu, Xiaohua Liu, and Hang Li. 2016. Coverage-based neural machine translation. arXiv preprint arXiv:1601.04811 .",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Pointer networks",
"authors": [
{
"first": "Oriol",
"middle": [],
"last": "Vinyals",
"suffix": ""
},
{
"first": "Meire",
"middle": [],
"last": "Fortunato",
"suffix": ""
},
{
"first": "Navdeep",
"middle": [],
"last": "Jaitly",
"suffix": ""
}
],
"year": 2015,
"venue": "Advances in Neural Information Processing Systems",
"volume": "",
"issue": "",
"pages": "2692--2700",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Oriol Vinyals, Meire Fortunato, and Navdeep Jaitly. 2015. Pointer networks. In Advances in Neural In- formation Processing Systems. pages 2692-2700.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "A neural conversational model",
"authors": [
{
"first": "Oriol",
"middle": [],
"last": "Vinyals",
"suffix": ""
},
{
"first": "Quoc",
"middle": [],
"last": "Le",
"suffix": ""
}
],
"year": 2015,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1506.05869"
]
},
"num": null,
"urls": [],
"raw_text": "Oriol Vinyals and Quoc Le. 2015. A neural conversa- tional model. arXiv preprint arXiv:1506.05869 .",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "Lunar rocks in natural english: Explorations in natural language question answering",
"authors": [
{
"first": "A",
"middle": [],
"last": "William",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Woods",
"suffix": ""
}
],
"year": 1977,
"venue": "Linguistic structures processing",
"volume": "",
"issue": "",
"pages": "521--569",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "William A Woods. 1977. Lunar rocks in natural en- glish: Explorations in natural language question an- swering. In Linguistic structures processing. pages 521-569.",
"links": null
},
"BIBREF26": {
"ref_id": "b26",
"title": "Google's neural machine translation system: Bridging the gap between human and machine translation",
"authors": [
{
"first": "Yonghui",
"middle": [],
"last": "Wu",
"suffix": ""
},
{
"first": "Mike",
"middle": [],
"last": "Schuster",
"suffix": ""
},
{
"first": "Zhifeng",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "V",
"middle": [],
"last": "Quoc",
"suffix": ""
},
{
"first": "Mohammad",
"middle": [],
"last": "Le",
"suffix": ""
},
{
"first": "Wolfgang",
"middle": [],
"last": "Norouzi",
"suffix": ""
},
{
"first": "Maxim",
"middle": [],
"last": "Macherey",
"suffix": ""
},
{
"first": "Yuan",
"middle": [],
"last": "Krikun",
"suffix": ""
},
{
"first": "Qin",
"middle": [],
"last": "Cao",
"suffix": ""
},
{
"first": "Klaus",
"middle": [],
"last": "Gao",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Macherey",
"suffix": ""
}
],
"year": 2016,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yonghui Wu, Mike Schuster, Zhifeng Chen, Quoc V Le, Mohammad Norouzi, Wolfgang Macherey, Maxim Krikun, Yuan Cao, Qin Gao, Klaus Macherey, et al. 2016. Google's neural machine translation system: Bridging the gap between hu- man and machine translation. arXiv preprint arX- iv:1609.08144 .",
"links": null
},
"BIBREF27": {
"ref_id": "b27",
"title": "Natural language questions for the web of data",
"authors": [
{
"first": "Mohamed",
"middle": [],
"last": "Yahya",
"suffix": ""
},
{
"first": "Klaus",
"middle": [],
"last": "Berberich",
"suffix": ""
},
{
"first": "Shady",
"middle": [],
"last": "Elbassuoni",
"suffix": ""
},
{
"first": "Maya",
"middle": [],
"last": "Ramanath",
"suffix": ""
},
{
"first": "Gerhard",
"middle": [],
"last": "Volker Tresp",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Weikum",
"suffix": ""
}
],
"year": 2012,
"venue": "Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning. Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "379--390",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Mohamed Yahya, Klaus Berberich, Shady Elbas- suoni, Maya Ramanath, Volker Tresp, and Gerhard Weikum. 2012. Natural language questions for the web of data. In Proceedings of the 2012 Joint Con- ference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning. Association for Computational Linguis- tics, pages 379-390.",
"links": null
},
"BIBREF28": {
"ref_id": "b28",
"title": "Information extraction over structured data: Question answering with freebase",
"authors": [
{
"first": "Xuchen",
"middle": [],
"last": "Yao",
"suffix": ""
},
{
"first": "Benjamin",
"middle": [],
"last": "Van Durme",
"suffix": ""
}
],
"year": 2014,
"venue": "Proceedings of the 52nd",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Xuchen Yao and Benjamin Van Durme. 2014. Infor- mation extraction over structured data: Question an- swering with freebase. In Proceedings of the 52nd",
"links": null
},
"BIBREF29": {
"ref_id": "b29",
"title": "Annual Meeting of the Association for Computational Linguistics",
"authors": [],
"year": null,
"venue": "",
"volume": "1",
"issue": "",
"pages": "956--966",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Annual Meeting of the Association for Computation- al Linguistics (Volume 1: Long Papers). Association for Computational Linguistics, pages 956-966.",
"links": null
},
"BIBREF30": {
"ref_id": "b30",
"title": "Semantic parsing via staged query graph generation: Question answering with knowledge base",
"authors": [
{
"first": "Ming-Wei",
"middle": [],
"last": "Wen-Tau Yih",
"suffix": ""
},
{
"first": "Xiaodong",
"middle": [],
"last": "Chang",
"suffix": ""
},
{
"first": "Jianfeng",
"middle": [],
"last": "He",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Gao",
"suffix": ""
}
],
"year": 2015,
"venue": "Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing",
"volume": "1",
"issue": "",
"pages": "1321--1331",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Wen-tau Yih, Ming-Wei Chang, Xiaodong He, and Jianfeng Gao. 2015. Semantic parsing via staged query graph generation: Question answering with knowledge base. In Proceedings of the 53rd Annual Meeting of the Association for Computational Lin- guistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers). Association for Computational Linguistics, pages 1321-1331.",
"links": null
},
"BIBREF31": {
"ref_id": "b31",
"title": "Neural generative question answering",
"authors": [
{
"first": "Jun",
"middle": [],
"last": "Yin",
"suffix": ""
},
{
"first": "Xin",
"middle": [],
"last": "Jiang",
"suffix": ""
},
{
"first": "Zhengdong",
"middle": [],
"last": "Lu",
"suffix": ""
},
{
"first": "Lifeng",
"middle": [],
"last": "Shang",
"suffix": ""
},
{
"first": "Hang",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Xiaoming",
"middle": [],
"last": "Li",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the International Joint Conference on Artificial Intelligence (I-JCAI)",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jun Yin, Xin Jiang, Zhengdong Lu, Lifeng Shang, Hang Li, and Xiaoming Li. 2016. Neural generative question answering. In Proceedings of the Interna- tional Joint Conference on Artificial Intelligence (I- JCAI).",
"links": null
},
"BIBREF32": {
"ref_id": "b32",
"title": "Neural enquirer: Learning to query tables",
"authors": [
{
"first": "Pengcheng",
"middle": [],
"last": "Yin",
"suffix": ""
},
{
"first": "Zhengdong",
"middle": [],
"last": "Lu",
"suffix": ""
},
{
"first": "Hang",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Ben",
"middle": [],
"last": "Kao",
"suffix": ""
}
],
"year": 2015,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1512.00965"
]
},
"num": null,
"urls": [],
"raw_text": "Pengcheng Yin, Zhengdong Lu, Hang Li, and Ben Kao. 2015. Neural enquirer: Learning to query tables. arXiv preprint arXiv:1512.00965 .",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"text": "Incorporating copying and retrieving mechanisms in generating a natural answer.",
"type_str": "figure",
"uris": null,
"num": null
},
"FIGREF1": {
"text": "The overall diagram of COREQA.",
"type_str": "figure",
"uris": null,
"num": null
},
"TABREF2": {
"html": null,
"text": "the word vector at the output layer (not the input word embedding), W pr \u2208 R (d h +d i +d f )\u00d7do (d i , d h and d f indicate the size of input word vector, RNN decoder hidden state and fact representation respectively), and c qt and c kbt are the temporary memory of reading M Q and M KB at time t (see Section 3.4.3). Copy-mode: The score for \"copying\" the word x j from question Q is calculated as \u03c8 co (y t",
"type_str": "table",
"content": "<table/>",
"num": null
},
"TABREF3": {
"html": null,
"text": "Sample KB facts, patterns and their generated Q-A pairs.",
"type_str": "table",
"content": "<table><tr><td>Experimental Setting: The total 239,934 Q-A pairs are split into training (90%) and testing set</td></tr><tr><td>(10%). The baseline includes 1) generic RNN</td></tr><tr><td>Encoder-Decoder (marked as</td></tr></table>",
"num": null
},
"TABREF5": {
"html": null,
"text": "The AE results (%) on synthetic test data.",
"type_str": "table",
"content": "<table/>",
"num": null
},
"TABREF8": {
"html": null,
"text": "The AE accuracies (%) on real world test data.",
"type_str": "table",
"content": "<table><tr><td colspan=\"4\">Models Correctness Fluency Coherence</td></tr><tr><td>CopyNet</td><td>0</td><td>13.3</td><td>3.3</td></tr><tr><td>GenQA</td><td>26.7</td><td>33.3</td><td>20</td></tr><tr><td>COREQA</td><td>46.7</td><td>50</td><td>60</td></tr></table>",
"num": null
},
"TABREF9": {
"html": null,
"text": "The ME results (%) on sampled mixed test data.",
"type_str": "table",
"content": "<table/>",
"num": null
}
}
}
} |