File size: 178,584 Bytes
6fa4bc9 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 2407 2408 2409 2410 2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480 2481 2482 2483 2484 2485 2486 2487 2488 2489 2490 2491 2492 2493 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 2504 2505 2506 2507 2508 2509 2510 2511 2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531 2532 2533 2534 2535 2536 2537 2538 2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549 2550 2551 2552 2553 2554 2555 2556 2557 2558 2559 2560 2561 2562 2563 2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588 2589 2590 2591 2592 2593 2594 2595 2596 2597 2598 2599 2600 2601 2602 2603 2604 2605 2606 2607 2608 2609 2610 2611 2612 2613 2614 2615 2616 2617 2618 2619 2620 2621 2622 2623 2624 2625 2626 2627 2628 2629 2630 2631 2632 2633 2634 2635 2636 2637 2638 2639 2640 2641 2642 2643 2644 2645 2646 2647 2648 2649 2650 2651 2652 2653 2654 2655 2656 2657 2658 2659 2660 2661 2662 2663 2664 2665 2666 2667 2668 2669 2670 2671 2672 2673 2674 2675 2676 2677 2678 2679 2680 2681 2682 2683 2684 2685 2686 2687 2688 2689 2690 2691 2692 2693 2694 2695 2696 2697 2698 2699 2700 2701 2702 2703 2704 2705 2706 2707 2708 2709 2710 2711 2712 2713 2714 2715 2716 2717 2718 2719 2720 2721 2722 2723 2724 2725 2726 2727 2728 2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740 2741 2742 2743 2744 2745 2746 2747 2748 2749 2750 2751 2752 2753 2754 2755 2756 2757 2758 2759 2760 2761 2762 2763 2764 2765 2766 2767 2768 2769 2770 2771 2772 2773 2774 2775 2776 2777 2778 2779 2780 2781 2782 2783 2784 2785 2786 2787 2788 2789 2790 2791 2792 2793 2794 2795 2796 2797 2798 2799 2800 2801 2802 2803 2804 2805 2806 2807 2808 2809 2810 2811 2812 2813 2814 2815 2816 2817 2818 2819 2820 2821 2822 2823 2824 2825 2826 2827 2828 2829 2830 2831 2832 2833 2834 2835 2836 2837 2838 2839 2840 2841 2842 2843 2844 2845 2846 2847 2848 2849 2850 2851 2852 2853 2854 2855 2856 2857 2858 2859 2860 2861 2862 2863 2864 2865 2866 2867 2868 2869 2870 2871 2872 2873 2874 2875 2876 2877 2878 2879 2880 2881 2882 2883 2884 2885 2886 2887 2888 2889 2890 2891 2892 2893 2894 2895 2896 2897 2898 2899 2900 2901 2902 2903 2904 2905 2906 2907 2908 2909 2910 2911 2912 2913 2914 2915 2916 2917 2918 2919 2920 2921 2922 2923 2924 2925 2926 2927 2928 2929 2930 2931 2932 2933 2934 2935 2936 2937 2938 2939 2940 2941 2942 2943 2944 2945 2946 2947 2948 2949 2950 2951 2952 2953 2954 2955 2956 2957 2958 2959 2960 2961 2962 2963 2964 2965 2966 2967 2968 2969 2970 2971 2972 2973 2974 2975 2976 2977 2978 2979 2980 2981 2982 2983 2984 2985 2986 2987 2988 2989 2990 2991 2992 2993 2994 2995 2996 2997 2998 2999 3000 3001 3002 3003 3004 3005 3006 3007 3008 3009 3010 3011 3012 3013 3014 3015 3016 3017 3018 3019 3020 3021 3022 3023 3024 3025 3026 3027 3028 3029 3030 3031 3032 3033 3034 3035 3036 3037 3038 3039 3040 3041 3042 3043 3044 3045 3046 3047 3048 3049 3050 3051 3052 3053 3054 3055 3056 3057 3058 3059 3060 3061 3062 3063 3064 3065 3066 3067 3068 3069 3070 3071 3072 3073 3074 3075 3076 3077 3078 3079 3080 3081 3082 3083 3084 3085 3086 3087 3088 3089 3090 3091 3092 3093 3094 3095 3096 3097 3098 3099 3100 3101 3102 3103 3104 3105 3106 3107 3108 3109 3110 3111 3112 3113 3114 3115 3116 3117 3118 3119 3120 3121 3122 3123 3124 3125 3126 3127 3128 3129 3130 3131 3132 3133 3134 3135 3136 3137 3138 3139 3140 3141 3142 3143 3144 3145 3146 3147 3148 3149 3150 3151 3152 3153 3154 3155 3156 3157 3158 3159 3160 3161 3162 3163 3164 3165 3166 3167 3168 3169 3170 3171 3172 3173 3174 3175 3176 3177 3178 3179 3180 3181 3182 3183 3184 3185 3186 3187 3188 3189 3190 3191 3192 3193 3194 3195 3196 3197 3198 3199 3200 3201 3202 3203 3204 3205 3206 3207 3208 3209 3210 3211 3212 3213 3214 3215 3216 3217 3218 3219 3220 3221 3222 3223 3224 3225 3226 3227 3228 3229 3230 3231 3232 3233 3234 3235 3236 3237 3238 3239 3240 3241 3242 3243 3244 3245 3246 3247 3248 3249 3250 3251 3252 3253 3254 3255 3256 3257 3258 3259 3260 3261 3262 3263 3264 3265 3266 3267 3268 3269 3270 3271 3272 3273 3274 3275 3276 3277 3278 3279 3280 3281 3282 3283 3284 3285 3286 3287 3288 3289 3290 3291 3292 3293 3294 3295 3296 3297 3298 3299 3300 3301 3302 3303 3304 3305 3306 3307 3308 3309 3310 3311 3312 3313 3314 3315 3316 3317 3318 3319 3320 3321 3322 3323 3324 3325 3326 3327 3328 3329 3330 3331 3332 3333 3334 3335 3336 3337 3338 3339 3340 3341 3342 3343 3344 3345 3346 3347 3348 3349 3350 3351 3352 3353 3354 3355 3356 3357 3358 3359 3360 3361 3362 3363 3364 3365 3366 3367 3368 3369 3370 3371 3372 3373 3374 3375 3376 3377 3378 3379 3380 3381 3382 3383 3384 3385 3386 3387 3388 3389 3390 3391 3392 3393 3394 3395 3396 3397 3398 3399 3400 3401 3402 3403 3404 3405 3406 3407 3408 3409 3410 3411 3412 3413 3414 3415 3416 3417 3418 3419 3420 3421 3422 3423 3424 3425 3426 3427 3428 3429 3430 3431 3432 3433 3434 3435 3436 3437 3438 3439 3440 3441 3442 3443 3444 3445 3446 3447 3448 3449 3450 3451 3452 3453 3454 3455 3456 3457 3458 3459 3460 3461 3462 3463 3464 3465 3466 3467 3468 3469 3470 3471 3472 3473 3474 3475 3476 3477 3478 3479 3480 3481 3482 3483 3484 3485 3486 3487 3488 3489 3490 3491 3492 3493 3494 3495 3496 3497 3498 3499 3500 3501 3502 3503 3504 3505 3506 3507 3508 3509 3510 3511 3512 3513 3514 3515 3516 3517 3518 3519 3520 3521 3522 3523 3524 3525 3526 3527 3528 3529 3530 3531 3532 3533 3534 3535 3536 3537 3538 3539 3540 3541 3542 3543 3544 3545 3546 3547 3548 3549 3550 3551 3552 3553 3554 3555 3556 3557 3558 3559 3560 3561 3562 3563 3564 3565 3566 3567 3568 3569 3570 3571 3572 3573 3574 3575 3576 3577 3578 3579 3580 3581 3582 3583 3584 3585 3586 3587 3588 3589 3590 3591 3592 3593 3594 3595 3596 3597 3598 3599 3600 3601 3602 3603 3604 3605 3606 3607 3608 3609 3610 3611 3612 3613 3614 3615 3616 3617 3618 3619 3620 3621 3622 3623 3624 3625 3626 3627 3628 3629 3630 3631 3632 3633 3634 3635 3636 3637 3638 3639 3640 3641 3642 3643 3644 3645 3646 3647 3648 3649 3650 3651 3652 3653 3654 3655 3656 3657 3658 3659 3660 3661 3662 3663 3664 3665 3666 3667 3668 3669 3670 3671 3672 3673 3674 3675 3676 3677 3678 3679 3680 3681 3682 3683 3684 3685 3686 3687 3688 3689 3690 3691 3692 3693 3694 3695 3696 3697 3698 3699 3700 3701 3702 3703 3704 3705 3706 3707 3708 3709 3710 3711 3712 3713 3714 3715 3716 3717 3718 3719 3720 3721 3722 3723 3724 3725 3726 3727 3728 3729 3730 3731 3732 3733 3734 3735 3736 3737 3738 3739 3740 3741 3742 3743 3744 3745 3746 3747 3748 3749 3750 3751 3752 3753 3754 3755 3756 3757 3758 3759 3760 3761 3762 3763 3764 3765 3766 3767 3768 3769 3770 3771 3772 3773 3774 3775 3776 3777 3778 3779 3780 3781 3782 3783 3784 3785 3786 3787 3788 3789 3790 3791 3792 3793 3794 3795 3796 3797 3798 3799 3800 3801 3802 3803 3804 3805 3806 3807 3808 3809 3810 3811 3812 3813 3814 3815 3816 3817 3818 3819 3820 3821 3822 3823 3824 3825 3826 3827 3828 3829 3830 3831 3832 3833 3834 3835 3836 3837 3838 3839 3840 3841 3842 3843 3844 3845 3846 3847 3848 3849 3850 3851 3852 3853 3854 3855 3856 3857 3858 3859 3860 3861 3862 3863 3864 3865 3866 3867 3868 3869 3870 3871 3872 3873 3874 3875 3876 3877 3878 3879 3880 3881 3882 3883 3884 3885 3886 3887 3888 3889 3890 3891 3892 3893 3894 3895 3896 3897 3898 3899 3900 3901 3902 3903 3904 3905 3906 3907 3908 3909 3910 3911 3912 3913 3914 3915 3916 3917 3918 3919 3920 3921 3922 3923 3924 3925 3926 3927 3928 3929 3930 | {
"paper_id": "P19-1010",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T08:30:01.373413Z"
},
"title": "Generating Logical Forms from Graph Representations of Text and Entities",
"authors": [
{
"first": "Peter",
"middle": [],
"last": "Shaw",
"suffix": "",
"affiliation": {},
"email": "petershaw@google.com"
},
{
"first": "Philip",
"middle": [],
"last": "Massey",
"suffix": "",
"affiliation": {},
"email": "pmassey@google.com"
},
{
"first": "Angelica",
"middle": [],
"last": "Chen",
"suffix": "",
"affiliation": {},
"email": "angelicachen@google.com"
},
{
"first": "Francesco",
"middle": [],
"last": "Piccinno",
"suffix": "",
"affiliation": {},
"email": "piccinno@google.com"
},
{
"first": "Yasemin",
"middle": [],
"last": "Altun",
"suffix": "",
"affiliation": {},
"email": "altun@google.com"
},
{
"first": "",
"middle": [],
"last": "Google",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Google",
"middle": [],
"last": "Research",
"suffix": "",
"affiliation": {},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "Structured information about entities is critical for many semantic parsing tasks. We present an approach that uses a Graph Neural Network (GNN) architecture to incorporate information about relevant entities and their relations during parsing. Combined with a decoder copy mechanism, this approach provides a conceptually simple mechanism to generate logical forms with entities. We demonstrate that this approach is competitive with the stateof-the-art across several tasks without pretraining, and outperforms existing approaches when combined with BERT pre-training.",
"pdf_parse": {
"paper_id": "P19-1010",
"_pdf_hash": "",
"abstract": [
{
"text": "Structured information about entities is critical for many semantic parsing tasks. We present an approach that uses a Graph Neural Network (GNN) architecture to incorporate information about relevant entities and their relations during parsing. Combined with a decoder copy mechanism, this approach provides a conceptually simple mechanism to generate logical forms with entities. We demonstrate that this approach is competitive with the stateof-the-art across several tasks without pretraining, and outperforms existing approaches when combined with BERT pre-training.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Semantic parsing maps natural language utterances into structured meaning representations. The representation languages vary between tasks, but typically provide a precise, machine interpretable logical form suitable for applications such as question answering (Zelle and Mooney, 1996; Zettlemoyer and Collins, 2007; Berant et al., 2013) . The logical forms typically consist of two types of symbols: a vocabulary of operators and domain-specific predicates or functions, and entities grounded to some knowledge base or domain.",
"cite_spans": [
{
"start": 261,
"end": 285,
"text": "(Zelle and Mooney, 1996;",
"ref_id": "BIBREF50"
},
{
"start": 286,
"end": 316,
"text": "Zettlemoyer and Collins, 2007;",
"ref_id": "BIBREF52"
},
{
"start": 317,
"end": 337,
"text": "Berant et al., 2013)",
"ref_id": "BIBREF7"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Recent approaches to semantic parsing have cast it as a sequence-to-sequence task (Dong and Lapata, 2016; Jia and Liang, 2016; Ling et al., 2016) , employing methods similar to those developed for neural machine translation (Bahdanau et al., 2014) , with strong results. However, special consideration is typically given to handling of entities. This is important to improve generalization and computational efficiency, as most tasks require handling entities unseen during training, and the set of unique entities can be large.",
"cite_spans": [
{
"start": 82,
"end": 105,
"text": "(Dong and Lapata, 2016;",
"ref_id": "BIBREF10"
},
{
"start": 106,
"end": 126,
"text": "Jia and Liang, 2016;",
"ref_id": "BIBREF18"
},
{
"start": 127,
"end": 145,
"text": "Ling et al., 2016)",
"ref_id": "BIBREF27"
},
{
"start": 224,
"end": 247,
"text": "(Bahdanau et al., 2014)",
"ref_id": "BIBREF3"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Some recent approaches have replaced surface forms of entities in the utterance with placehold-ers (Dong and Lapata, 2016) . This requires a preprocessing step to completely disambiguate entities and replace their spans in the utterance. Additionally, for some tasks it may be beneficial to leverage relations between entities, multiple entity candidates per span, or entity candidates without a corresponding span in the utterance, while generating logical forms.",
"cite_spans": [
{
"start": 99,
"end": 122,
"text": "(Dong and Lapata, 2016)",
"ref_id": "BIBREF10"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Other approaches identify only types and surface forms of entities while constructing the logical form (Jia and Liang, 2016) , using a separate post-processing step to generate the final logical form with grounded entities. This ignores potentially useful knowledge about relevant entities.",
"cite_spans": [
{
"start": 103,
"end": 124,
"text": "(Jia and Liang, 2016)",
"ref_id": "BIBREF18"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Meanwhile, there has been considerable recent interest in Graph Neural Networks (GNNs) (Scarselli et al., 2009; Li et al., 2016; Kipf and Welling, 2017; Gilmer et al., 2017; Veli\u010dkovi\u0107 et al., 2018) for effectively learning representations for graph structures. We propose a GNN architecture based on extending the self-attention mechanism of the Transformer (Vaswani et al., 2017) to make use of relations between input elements.",
"cite_spans": [
{
"start": 87,
"end": 111,
"text": "(Scarselli et al., 2009;",
"ref_id": "BIBREF31"
},
{
"start": 112,
"end": 128,
"text": "Li et al., 2016;",
"ref_id": "BIBREF10"
},
{
"start": 129,
"end": 152,
"text": "Kipf and Welling, 2017;",
"ref_id": "BIBREF21"
},
{
"start": 153,
"end": 173,
"text": "Gilmer et al., 2017;",
"ref_id": "BIBREF12"
},
{
"start": 174,
"end": 198,
"text": "Veli\u010dkovi\u0107 et al., 2018)",
"ref_id": "BIBREF36"
},
{
"start": 359,
"end": 381,
"text": "(Vaswani et al., 2017)",
"ref_id": "BIBREF35"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "We present an application of this GNN architecture to semantic parsing, conditioning on a graph representation of the given natural language utterance and potentially relevant entities. This approach is capable of handling ambiguous and potentially conflicting entity candidates jointly with a natural language utterance, relaxing the need for completely disambiguating a set of linked entities before parsing. This graph formulation also enables us to incorporate knowledge about the relations between entities where available. Combined with a copy mechanism while decoding, this approach also provides a conceptually simple method for generating logical forms with grounded entities.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "We demonstrate the capability of the pro-",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "x : which states does the mississippi run through ? y : answer ( state ( traverse 1( riverid ( mississippi ) ) ) )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "GEO",
"sec_num": null
},
{
"text": "x : in denver what kind of ground transportation is there from the airport to downtown y : ( _lambda $0 e ( _and ( _ground_transport $0 ) ( _to_city $0 denver : ci ) ( _from_airport $0 den : ap ) ) ) SPIDER x : how many games has each stadium held ? y : SELECT T1 . id , count ( * ) FROM stadium AS T1 JOIN game AS T2 ON T1 . id = T2 . stadium id GROUP BY T1 . id Table 1 : Example input utterances, x, and meaning representations, y, with entities underlined.",
"cite_spans": [],
"ref_spans": [
{
"start": 364,
"end": 371,
"text": "Table 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "ATIS",
"sec_num": null
},
{
"text": "posed architecture by achieving competitive results across 3 semantic parsing tasks. Further improvements are possible by incorporating a pretrained BERT (Devlin et al., 2018) encoder within the architecture.",
"cite_spans": [
{
"start": 154,
"end": 175,
"text": "(Devlin et al., 2018)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "ATIS",
"sec_num": null
},
{
"text": "Our goal is to learn a model for semantic parsing from pairs of natural language utterances and structured meaning representations. Let the natural language utterance be represented as a sequence x = (x 1 , . . . , x |x| ) of |x| tokens, and the meaning representation be represented as a sequence y = (y 1 , . . . , y |y| ) of |y| elements. The goal is to estimate p(y | x), the conditional probability of the meaning representation y given utterance x, which is augmented by a set of potentially relevant entities.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Task Formulation",
"sec_num": "2"
},
{
"text": "Each token x i \u2208 V in is from a vocabulary of input tokens.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Input Utterance",
"sec_num": null
},
{
"text": "Entity Candidates Given the input utterance x, we retrieve a set, e = {e 1 , . . . , e |e| }, of potentially relevant entity candidates, with e \u2286 V e , where V e is in the set of all entities for a given domain. We assume the availability of an entity candidate generator for each task to generate e given x, with details given in \u00a7 5.2.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Input Utterance",
"sec_num": null
},
{
"text": "For each entity candidate, e \u2208 V e , we require a set of task-specific attributes containing one or more elements from V a . These attributes can be NER types or other characteristics of the entity, such as \"city\" or \"river\" for some of the entities listed in Table 1 . Whereas V e can be quite large for open domains, or even infinite if it includes sets such as the natural numbers, V a is typically much smaller. Therefore, we can effectively learn representations for entities given their set of attributes, from our set of example pairs.",
"cite_spans": [],
"ref_spans": [
{
"start": 260,
"end": 267,
"text": "Table 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Input Utterance",
"sec_num": null
},
{
"text": "Edge Labels In addition to x and e for a particular example, we also consider the (|x|+|e|) 2 pairwise relations between all tokens and entity candidates, represented as edge labels.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Input Utterance",
"sec_num": null
},
{
"text": "The edge label between tokens x i and x j corresponds to the relative sequential position, j \u2212 i, of the tokens, clipped to within some range.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Input Utterance",
"sec_num": null
},
{
"text": "The edge label between token x i and entity e j , and vice versa, corresponds to whether x i is within the span of the entity candidate e j , or not.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Input Utterance",
"sec_num": null
},
{
"text": "The edge label between entities e i and e j captures the relationship between the entities. These edge labels can have domain-specific interpretations, such as relations in a knowledge base, or any other type of entity interaction features. For tasks where this information is not available or useful, a single generic label between entity candidates can be used.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Input Utterance",
"sec_num": null
},
{
"text": "Output We consider the logical form, y, to be a linear sequence (Vinyals et al., 2015b) . We tokenize based on the syntax of each domain. Our formulation allows each element of y to be either an element of the output vocabulary, V out , or an entity copied from the set of entity candidates e. Therefore, y i \u2208 V out \u222a V e . Some experiments in \u00a75.2 also allow elements of y to be tokens \u2208 V in from x that are copied from the input.",
"cite_spans": [
{
"start": 64,
"end": 87,
"text": "(Vinyals et al., 2015b)",
"ref_id": "BIBREF38"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Input Utterance",
"sec_num": null
},
{
"text": "Our model architecture is based on the Transformer (Vaswani et al., 2017) , with the selfattention sub-layer extended to incorporate relations between input elements, and the decoder extended with a copy mechanism. We use an example from SPIDER to illustrate the model inputs: tokens from the given utterance, x, a set of potentially relevant entities, e, and their relations. We selected two edge label types to highlight: edges denoting that an entity spans a token, and edges between entities that, for SPIDER, indicate a foreign key relationship between columns, or an ownership relationship between columns and tables.",
"cite_spans": [
{
"start": 51,
"end": 73,
"text": "(Vaswani et al., 2017)",
"ref_id": "BIBREF35"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Model Architecture",
"sec_num": "3"
},
{
"text": "We extend the Transformer's self-attention mechanism to form a Graph Neural Network (GNN) sublayer that incorporates a fully connected, directed graph with edge labels. The sub-layer maps an ordered sequence of node representations, u = (u 1 , . . . , u |u| ), to a new sequence of node representations, u = (u 1 , . . . , u |u| ), where each node is represented \u2208 R d . We use r ij to denote the edge label corresponding to u i and u j .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "GNN Sub-layer",
"sec_num": "3.1"
},
{
"text": "We implement this sub-layer in terms of a function f (m, l) over a node representation m \u2208 R d and an edge label l that computes a vector representation in R d . We use n heads parallel attention heads, with d = d/n heads . For each head k, the new representation for the node u i is computed by",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "GNN Sub-layer",
"sec_num": "3.1"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "u k i = |u| j=1 \u03b1 ij f (u j , r ij ),",
"eq_num": "(1)"
}
],
"section": "GNN Sub-layer",
"sec_num": "3.1"
},
{
"text": "where each coefficient \u03b1 ij is a softmax over the scaled dot products s ij ,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "GNN Sub-layer",
"sec_num": "3.1"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "s ij = (W q u i ) f (u j , r ij ) \u221a d ,",
"eq_num": "(2)"
}
],
"section": "GNN Sub-layer",
"sec_num": "3.1"
},
{
"text": "and W q is a learned matrix. Finally, we concatenate representations from each head,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "GNN Sub-layer",
"sec_num": "3.1"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "u i = W h u 1 i | \u2022 \u2022 \u2022 | u n heads i ,",
"eq_num": "(3)"
}
],
"section": "GNN Sub-layer",
"sec_num": "3.1"
},
{
"text": "where W h is another learned matrix and",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "GNN Sub-layer",
"sec_num": "3.1"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "[ \u2022 \u2022 \u2022 ] denotes concatenation. If we implement f as, f (m, l) = W r m,",
"eq_num": "(4)"
}
],
"section": "GNN Sub-layer",
"sec_num": "3.1"
},
{
"text": "where W r \u2208 R d \u00d7d is a learned matrix, then the sub-layer would be effectively identical to self-attention as initially proposed in the Transformer (Vaswani et al., 2017) . We focus on two alternative formulations of f that represent edge labels as learned matrices and learned vectors.",
"cite_spans": [
{
"start": 149,
"end": 171,
"text": "(Vaswani et al., 2017)",
"ref_id": "BIBREF35"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "GNN Sub-layer",
"sec_num": "3.1"
},
{
"text": "Edge Matrices The first formulation represents edge labels as linear transformations, a common parameterization for GNNs (Li et al., 2016) ,",
"cite_spans": [
{
"start": 121,
"end": 138,
"text": "(Li et al., 2016)",
"ref_id": "BIBREF10"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "GNN Sub-layer",
"sec_num": "3.1"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "f (m, l) = W l m,",
"eq_num": "(5)"
}
],
"section": "GNN Sub-layer",
"sec_num": "3.1"
},
{
"text": "where W l \u2208 R d \u00d7d is a learned embedding matrix per edge label.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "GNN Sub-layer",
"sec_num": "3.1"
},
{
"text": "Edge Vectors The second formulation represents edge labels as additive vectors using the same formulation as Shaw et al. (2018) ,",
"cite_spans": [
{
"start": 109,
"end": 127,
"text": "Shaw et al. (2018)",
"ref_id": "BIBREF32"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "GNN Sub-layer",
"sec_num": "3.1"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "f (m, l) = W r m + w l ,",
"eq_num": "(6)"
}
],
"section": "GNN Sub-layer",
"sec_num": "3.1"
},
{
"text": "where W r \u2208 R d \u00d7d is a learned matrix shared by all edge labels, and w l \u2208 R d is a learned embedding vector per edge label l.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "GNN Sub-layer",
"sec_num": "3.1"
},
{
"text": "Input Representations Before the initial encoder layer, tokens are mapped to initial representations using either a learned embedding Figure 2 : Our model architecture is based on the Transformer (Vaswani et al., 2017) , with two modifications. First, the self-attention sub-layer has been extended to be a GNN that incorporates edge representations. In the encoder, the GNN sub-layer is conditioned on tokens, entities, and their relations. Second, the decoder has been extended to include a copy mechanism (Vinyals et al., 2015a) . We can optionally incorporate a pre-trained model such as BERT to generate contextual token representations.",
"cite_spans": [
{
"start": 196,
"end": 218,
"text": "(Vaswani et al., 2017)",
"ref_id": "BIBREF35"
},
{
"start": 508,
"end": 531,
"text": "(Vinyals et al., 2015a)",
"ref_id": "BIBREF37"
}
],
"ref_spans": [
{
"start": 134,
"end": 142,
"text": "Figure 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Encoder",
"sec_num": "3.2"
},
{
"text": "V a . We also concatenate an embedding representing the node type, token or entity, to each input representation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Encoder",
"sec_num": "3.2"
},
{
"text": "We assume some arbitrary ordering for entity candidates, generating a combined sequence of initial node representations for tokens and entities. We have edge labels between every pair of nodes as described in \u00a7 2.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Encoder",
"sec_num": "3.2"
},
{
"text": "Encoder Layers Our encoder layers are essentially identical to the Transformer, except with the proposed extension to self-attention to incorporate edge labels. Therefore, each encoder layer consists of two sub-layers. The first is the GNN sub-layer, which yields new sets of token and entity representations. The second sub-layer is an element-wise feed-forward network. Each sublayer is followed by a residual connection and layer normalization (Ba et al., 2016) . We stack N enc encoder layers, yielding a final set of token representations, w x (Nenc) , and entity representations, w e (Nenc) .",
"cite_spans": [
{
"start": 447,
"end": 464,
"text": "(Ba et al., 2016)",
"ref_id": null
},
{
"start": 549,
"end": 555,
"text": "(Nenc)",
"ref_id": null
},
{
"start": 590,
"end": 596,
"text": "(Nenc)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Encoder",
"sec_num": "3.2"
},
{
"text": "The decoder auto-regressively generates output symbols, y 1 , . . . , y |y| . It is similarly based on the Transformer (Vaswani et al., 2017) , with the self-attention sub-layer replaced by the GNN sublayer. Decoder edge labels are based only on the relative timesteps of the previous outputs. The encoder-decoder attention layer considers both encoder outputs w x (Nenc) and w e (Nenc) , jointly normalizing attention weights over tokens and entity candidates. We stack N dec decoder layers to produce an output vector representation at each output step, z j \u2208 R dz , for j \u2208 {1, . . . , |y|}.",
"cite_spans": [
{
"start": 119,
"end": 141,
"text": "(Vaswani et al., 2017)",
"ref_id": "BIBREF35"
},
{
"start": 365,
"end": 371,
"text": "(Nenc)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Decoder",
"sec_num": "3.3"
},
{
"text": "We allow the decoder to copy tokens or entity candidates from the input, effectively combining a Pointer Network (Vinyals et al., 2015a ) with a standard softmax output layer for selecting symbols from an output vocabulary (Gu et al., 2016; Gulcehre et al., 2016; Jia and Liang, 2016) . We define a latent action at each output step, a j for j \u2208 {1, . . . , |y|}, using similar notation as Jia et al. (2016) . We normalize action probabilities with a softmax over all possible actions.",
"cite_spans": [
{
"start": 113,
"end": 135,
"text": "(Vinyals et al., 2015a",
"ref_id": "BIBREF37"
},
{
"start": 223,
"end": 240,
"text": "(Gu et al., 2016;",
"ref_id": "BIBREF14"
},
{
"start": 241,
"end": 263,
"text": "Gulcehre et al., 2016;",
"ref_id": "BIBREF15"
},
{
"start": 264,
"end": 284,
"text": "Jia and Liang, 2016)",
"ref_id": "BIBREF18"
},
{
"start": 390,
"end": 407,
"text": "Jia et al. (2016)",
"ref_id": "BIBREF18"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Decoder",
"sec_num": "3.3"
},
{
"text": "We can generate a symbol, denoted",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Generating Symbols",
"sec_num": null
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "Generate[i], P (a j =Generate[i] | x, y 1:j\u22121 ) \u221d exp(z j w out i ),",
"eq_num": "(7)"
}
],
"section": "Generating Symbols",
"sec_num": null
},
{
"text": "where w out i is a learned embedding vector for the element \u2208 V out with index i. If a j = Generate[i], then y j will be the element \u2208 V out with index i.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Generating Symbols",
"sec_num": null
},
{
"text": "Copying Entities We can also copy an entity candidate, denoted",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Generating Symbols",
"sec_num": null
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "CopyEntity[i], P (a j = CopyEntity[i] | x, y 1:j\u22121 ) \u221d exp((z j W e ) w (Nenc) e i ),",
"eq_num": "(8)"
}
],
"section": "Generating Symbols",
"sec_num": null
},
{
"text": "where W e is a learned matrix, and i \u2208 {1, . . . , |e|}. If a j = CopyEntity[i], then y j = e i .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Generating Symbols",
"sec_num": null
},
{
"text": "Various approaches to learning semantic parsers from pairs of utterances and logical forms have been developed over the years (Tang and Mooney, 2000; Zettlemoyer and Collins, 2007; Kwiatkowski et al., 2011; Andreas et al., 2013) . More recently, encoder-decoder architectures have been applied with strong results (Dong and Lapata, 2016; Jia and Liang, 2016) . Even for tasks with relatively small domains of entities, such as GEO and ATIS, it has been shown that some special consideration of entities within an encoder-decoder architecture is important to improve generalization. This has included extending decoders with copy mechanisms (Jia and Liang, 2016) and/or identifying entities in the input as a pre-processing step (Dong and Lapata, 2016) .",
"cite_spans": [
{
"start": 126,
"end": 149,
"text": "(Tang and Mooney, 2000;",
"ref_id": "BIBREF34"
},
{
"start": 150,
"end": 180,
"text": "Zettlemoyer and Collins, 2007;",
"ref_id": "BIBREF52"
},
{
"start": 181,
"end": 206,
"text": "Kwiatkowski et al., 2011;",
"ref_id": "BIBREF24"
},
{
"start": 207,
"end": 228,
"text": "Andreas et al., 2013)",
"ref_id": "BIBREF1"
},
{
"start": 314,
"end": 337,
"text": "(Dong and Lapata, 2016;",
"ref_id": "BIBREF10"
},
{
"start": 338,
"end": 358,
"text": "Jia and Liang, 2016)",
"ref_id": "BIBREF18"
},
{
"start": 640,
"end": 661,
"text": "(Jia and Liang, 2016)",
"ref_id": "BIBREF18"
},
{
"start": 728,
"end": 751,
"text": "(Dong and Lapata, 2016)",
"ref_id": "BIBREF10"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "4"
},
{
"text": "Other work has considered open domain tasks, such as WEBQUESTIONSSP (Yih et al., 2016) . Recent approaches have typically relied on a separate entity linking model, such as S-MART (Yang and Chang, 2015) , to provide a single disambiguated set of entities to consider. In principle, a learned entity linker could also serve as an entity candidate generator within our framework, although we do not explore such tasks in this work.",
"cite_spans": [
{
"start": 68,
"end": 86,
"text": "(Yih et al., 2016)",
"ref_id": "BIBREF45"
},
{
"start": 180,
"end": 202,
"text": "(Yang and Chang, 2015)",
"ref_id": "BIBREF44"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "4"
},
{
"text": "Considerable recent work has focused on constrained decoding of various forms within an encoder-decoder architecture to leverage the known structure of the logical forms. This has led to approaches that leverage this structure during decoding, such as using tree decoders (Dong and Lapata, 2016; Alvarez-Melis and Jaakkola, 2017) or other mechanisms (Dong and Lapata, 2018; Goldman et al., 2017) . Other approaches use grammar rules to constrain decoding (Xiao et al., 2016; Yin and Neubig, 2017; Krishnamurthy et al., 2017; Yu et al., 2018b) . We leave investigation of such decoder constraints to future work.",
"cite_spans": [
{
"start": 272,
"end": 295,
"text": "(Dong and Lapata, 2016;",
"ref_id": "BIBREF10"
},
{
"start": 296,
"end": 329,
"text": "Alvarez-Melis and Jaakkola, 2017)",
"ref_id": "BIBREF0"
},
{
"start": 350,
"end": 373,
"text": "(Dong and Lapata, 2018;",
"ref_id": "BIBREF11"
},
{
"start": 374,
"end": 395,
"text": "Goldman et al., 2017)",
"ref_id": "BIBREF13"
},
{
"start": 455,
"end": 474,
"text": "(Xiao et al., 2016;",
"ref_id": "BIBREF41"
},
{
"start": 475,
"end": 496,
"text": "Yin and Neubig, 2017;",
"ref_id": "BIBREF46"
},
{
"start": 497,
"end": 524,
"text": "Krishnamurthy et al., 2017;",
"ref_id": "BIBREF22"
},
{
"start": 525,
"end": 542,
"text": "Yu et al., 2018b)",
"ref_id": "BIBREF48"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "4"
},
{
"text": "Many formulations of Graph Neural Networks (GNNs) that propagate information over local neighborhoods have recently been proposed (Li et al., 2016; Kipf and Welling, 2017; Gilmer et al., 2017; Veli\u010dkovi\u0107 et al., 2018) . Recent work has often focused on large graphs (Hamilton et al., 2017) and effectively propagating information over multiple graph steps (Xu et al., 2018) . The graphs we consider are relatively small and are fullyconnected, avoiding some of the challenges posed by learning representations for large, sparsely con-nected graphs.",
"cite_spans": [
{
"start": 130,
"end": 147,
"text": "(Li et al., 2016;",
"ref_id": "BIBREF10"
},
{
"start": 148,
"end": 171,
"text": "Kipf and Welling, 2017;",
"ref_id": "BIBREF21"
},
{
"start": 172,
"end": 192,
"text": "Gilmer et al., 2017;",
"ref_id": "BIBREF12"
},
{
"start": 193,
"end": 217,
"text": "Veli\u010dkovi\u0107 et al., 2018)",
"ref_id": "BIBREF36"
},
{
"start": 266,
"end": 289,
"text": "(Hamilton et al., 2017)",
"ref_id": "BIBREF16"
},
{
"start": 356,
"end": 373,
"text": "(Xu et al., 2018)",
"ref_id": "BIBREF42"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "4"
},
{
"text": "Other recent work related to ours has considered GNNs for natural language tasks, such as combining structured and unstructured data for question answering (Sun et al., 2018) , or for representing dependencies in tasks such as AMR parsing and machine translation (Beck et al., 2018; Bastings et al., 2017) . The approach of Krishnamurthy et al. (2017) similarly considers ambiguous entity mentions jointly with query tokens for semantic parsing, although does not directly consider a GNN.",
"cite_spans": [
{
"start": 156,
"end": 174,
"text": "(Sun et al., 2018)",
"ref_id": "BIBREF33"
},
{
"start": 263,
"end": 282,
"text": "(Beck et al., 2018;",
"ref_id": "BIBREF6"
},
{
"start": 283,
"end": 305,
"text": "Bastings et al., 2017)",
"ref_id": "BIBREF4"
},
{
"start": 324,
"end": 351,
"text": "Krishnamurthy et al. (2017)",
"ref_id": "BIBREF22"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "4"
},
{
"text": "Previous work has interpreted the Transformer's self-attention mechanism as a GNN (Veli\u010dkovi\u0107 et al., 2018; Battaglia et al., 2018) , and extended it to consider relative positions as edge representations (Shaw et al., 2018) . Previous work has also similarly represented edge labels as vectors, as opposed to matrices, in order to avoid over-parameterizing the model .",
"cite_spans": [
{
"start": 82,
"end": 107,
"text": "(Veli\u010dkovi\u0107 et al., 2018;",
"ref_id": "BIBREF36"
},
{
"start": 108,
"end": 131,
"text": "Battaglia et al., 2018)",
"ref_id": "BIBREF5"
},
{
"start": 205,
"end": 224,
"text": "(Shaw et al., 2018)",
"ref_id": "BIBREF32"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "4"
},
{
"text": "We consider three semantic parsing datasets, with examples given in Table 1. GEO The GeoQuery dataset consists of natural language questions about US geography along with corresponding logical forms (Zelle and Mooney, 1996) . We follow the convention of Zettlemoyer and Collins (2005) and use 600 training examples and 280 test examples. We use logical forms based on Functional Query Language (FunQL) (Kate et al., 2005) .",
"cite_spans": [
{
"start": 199,
"end": 223,
"text": "(Zelle and Mooney, 1996)",
"ref_id": "BIBREF50"
},
{
"start": 402,
"end": 421,
"text": "(Kate et al., 2005)",
"ref_id": "BIBREF19"
}
],
"ref_spans": [
{
"start": 68,
"end": 76,
"text": "Table 1.",
"ref_id": null
}
],
"eq_spans": [],
"section": "Semantic Parsing Datasets",
"sec_num": "5.1"
},
{
"text": "ATIS The Air Travel Information System (ATIS) dataset consists of natural language queries about travel planning (Dahl et al., 1994) . We follow Zettlemoyer and Collins (2007) and use 4473 training examples, 448 test examples, and represent the logical forms as lambda expressions.",
"cite_spans": [
{
"start": 113,
"end": 132,
"text": "(Dahl et al., 1994)",
"ref_id": "BIBREF8"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Semantic Parsing Datasets",
"sec_num": "5.1"
},
{
"text": "SPIDER This is a large-scale text-to-SQL dataset that consists of 10,181 questions and 5,693 unique complex SQL queries across 200 database tables spanning 138 domains (Yu et al., 2018c) . We use the standard training set of 8,659 training example and development set of 1,034 examples, split across different tables.",
"cite_spans": [
{
"start": 168,
"end": 186,
"text": "(Yu et al., 2018c)",
"ref_id": "BIBREF49"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Semantic Parsing Datasets",
"sec_num": "5.1"
},
{
"text": "Model Configuration We configured hyperparameters based on performance on the validation set for each task, if provided, otherwise crossvalidated on the training set.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Setup",
"sec_num": "5.2"
},
{
"text": "For the encoder and decoder, we selected the number of layers from {1, 2, 3, 4} and embedding and hidden dimensions from {64, 128, 256}, setting the feed forward layer hidden dimensions 4\u00d7 higher.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Setup",
"sec_num": "5.2"
},
{
"text": "We employed dropout at training time with P dropout selected from {0.1, 0.2, 0.3, 0.4, 0.5, 0.6}. We used 8 attention heads for each task. We used a clipping distance of 8 for relative position representations (Shaw et al., 2018) .",
"cite_spans": [
{
"start": 210,
"end": 229,
"text": "(Shaw et al., 2018)",
"ref_id": "BIBREF32"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Setup",
"sec_num": "5.2"
},
{
"text": "We used the Adam optimizer (Kingma and Ba, 2015) with \u03b2 1 = 0.9, \u03b2 2 = 0.98, and = 10 \u22129 , and tuned the learning rate for each task. We used the same warmup and decay strategy for learning rate as Vaswani et al. (2017) , selecting a number of warmup steps up to a maximum of 3000. Early stopping was used to determine the total training steps for each task. We used the final checkpoint for evaluation. We batched training examples together, and selected batch size from {32, 64, 128, 256, 512}. During training we used masked self-attention (Vaswani et al., 2017) to enable parallel decoding of output sequences. For evaluation, we used greedy search.",
"cite_spans": [
{
"start": 27,
"end": 48,
"text": "(Kingma and Ba, 2015)",
"ref_id": "BIBREF20"
},
{
"start": 198,
"end": 219,
"text": "Vaswani et al. (2017)",
"ref_id": "BIBREF35"
},
{
"start": 543,
"end": 565,
"text": "(Vaswani et al., 2017)",
"ref_id": "BIBREF35"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Setup",
"sec_num": "5.2"
},
{
"text": "We used a simple strategy of splitting each input utterance on spaces to generate a sequence of tokens. We mapped any token that didn't occur at least 2 times in the training dataset to a special outof-vocabulary token. For experiments that used BERT, we instead used the same wordpiece (Wu et al., 2016) tokenization as used for pre-training.",
"cite_spans": [
{
"start": 287,
"end": 304,
"text": "(Wu et al., 2016)",
"ref_id": "BIBREF40"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Setup",
"sec_num": "5.2"
},
{
"text": "BERT For some of our experiments, we evaluated incorporating a pre-trained BERT (Devlin et al., 2018) encoder by effectively using the output of the BERT encoder in place of a learned token embedding table. We then continue to use graph encoder and decoder layers with randomly initialized parameters in addition to BERT, so there are many parameters that are not pre-trained. The additional encoder layers are still necessary to condition on entities and relations.",
"cite_spans": [
{
"start": 80,
"end": 101,
"text": "(Devlin et al., 2018)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Setup",
"sec_num": "5.2"
},
{
"text": "We achieved best results by freezing the pretrained parameters for an initial number of steps, and then jointly fine-tuning all parameters, similar to existing approaches for gradual unfreezing (Howard and Ruder, 2018) . When unfreezing the pre-trained parameters, we restart the learning rate schedule. We found this to perform better than keeping pre-trained parameters either entirely frozen or entirely unfrozen during fine-tuning.",
"cite_spans": [
{
"start": 194,
"end": 218,
"text": "(Howard and Ruder, 2018)",
"ref_id": "BIBREF17"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Setup",
"sec_num": "5.2"
},
{
"text": "We used BERT LARGE (Devlin et al., 2018) , which has 24 layers. For fine tuning we used the same Adam optimizer with weight decay and learning rate decay as used for BERT pre-training. We reduced batch sizes to accommodate the significantly larger model size, and tuned learning rate, warm up steps, and number of frozen steps for pre-trained parameters.",
"cite_spans": [
{
"start": 19,
"end": 40,
"text": "(Devlin et al., 2018)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Setup",
"sec_num": "5.2"
},
{
"text": "Entity Candidate Generator We use an entity candidate generator that, given x, can retrieve a set of potentially relevant entities, e, for the given domain. Although all generators share a common interface, their implementation varies across tasks.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Setup",
"sec_num": "5.2"
},
{
"text": "For GEO and ATIS we use a lexicon of entity aliases in the dataset and attempt to match with ngrams in the query. Each entity has a single attribute corresponding to the entity's type. We used binary valued relations between entity candidates based on whether entity candidate spans overlap, but experiments did not show significant improvements from incorporating these relations.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Setup",
"sec_num": "5.2"
},
{
"text": "For SPIDER, we generalize our notion of entities to include tables and table columns. We include all relevant tables and columns as entity candidates, but make use of Levenshtein distance between query ngrams and table and column names to determine edges between tokens and entity candidates. We use attributes based on the types and names of tables and columns. Edges between entity candidates capture relations between columns and the table they belong to, and foreign key relations.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Setup",
"sec_num": "5.2"
},
{
"text": "For GEO, ATIS, and SPIDER, this leads to 19.5%, 32.7%, and 74.6% of examples containing at least one span associated with multiple entity candidates, respectively, indicating some entity ambiguity.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Setup",
"sec_num": "5.2"
},
{
"text": "Further details on how entity candidate generators were constructed are provided in \u00a7 A.1.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Setup",
"sec_num": "5.2"
},
{
"text": "We pre-processed output sequences to identify entity argument values, and replaced those elements with references to entity candidates in the input. In cases where our entity candidate generator did not retrieve an entity that was used as an argument, we dropped the example from the training data set or considered it incorrect Method GEO ATIS Kwiatkowski et al. (2013) 89.0 - 87.9 -Wang et al. 2014-91.3 Zhao and Huang (2015) 88.9 84.2 Jia and Liang (2016) 89 Xu et al. (2017) 10.9 Yu et al. (2018a) 8.0 Yu et al. (2018b) 24.8 \u2212 data augmentation 18.9",
"cite_spans": [
{
"start": 345,
"end": 370,
"text": "Kwiatkowski et al. (2013)",
"ref_id": "BIBREF23"
},
{
"start": 406,
"end": 427,
"text": "Zhao and Huang (2015)",
"ref_id": "BIBREF53"
},
{
"start": 438,
"end": 458,
"text": "Jia and Liang (2016)",
"ref_id": "BIBREF18"
},
{
"start": 462,
"end": 478,
"text": "Xu et al. (2017)",
"ref_id": "BIBREF43"
},
{
"start": 484,
"end": 501,
"text": "Yu et al. (2018a)",
"ref_id": "BIBREF47"
},
{
"start": 506,
"end": 523,
"text": "Yu et al. (2018b)",
"ref_id": "BIBREF48"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Output Sequences",
"sec_num": null
},
{
"text": "Ours GNN w/ edge matrices 29.3 GNN w/ edge vectors 32.1 GNN w/ edge vectors + BERT 23.5 Table 2 : We report accuracies on GEO, ATIS, and SPIDER for various implementations of our GNN sub-layer. For GEO and ATIS, we use \u2020 to denote neural approaches that disambiguate and replace entities in the utterance as a pre-processing step. For SPIDER, the evaluation set consists of examples for databases unseen during training.",
"cite_spans": [],
"ref_spans": [
{
"start": 88,
"end": 95,
"text": "Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Output Sequences",
"sec_num": null
},
{
"text": "if in the test set.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Output Sequences",
"sec_num": null
},
{
"text": "Evaluation To evaluate accuracy, we use exact match accuracy relative to gold logical forms. For GEO we directly compare output symbols. For ATIS, we compare normalized logical forms using canonical variable naming and sorting for unordered arguments (Jia and Liang, 2016) . For SPI-DER we use the provided evaluation script, which decomposes each SQL query and conducts set comparison within each clause without values. All accuracies are reported on the test set, except for SPIDER where we report and compare accuracies on the development set.",
"cite_spans": [
{
"start": 251,
"end": 272,
"text": "(Jia and Liang, 2016)",
"ref_id": "BIBREF18"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Output Sequences",
"sec_num": null
},
{
"text": "Copying Tokens To better understand the effect of conditioning on entities and their relations, we also conducted experiments that considered an alternative method for selecting and disambiguating entities similar to Jia et al. (2016) . In this approach we use our model's copy mechanism to copy tokens corresponding to the surface forms of entity arguments, rather than copying entities directly.",
"cite_spans": [
{
"start": 217,
"end": 234,
"text": "Jia et al. (2016)",
"ref_id": "BIBREF18"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Output Sequences",
"sec_num": null
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "P (a j = CopyToken[i] | x, y 1:j\u22121 ) \u221d exp((z j W x ) w (Nenc) x i ),",
"eq_num": "(9)"
}
],
"section": "Output Sequences",
"sec_num": null
},
{
"text": "where W x is a learned matrix, and where i \u2208 {1, . . . , |x|} refers to the index of token",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Output Sequences",
"sec_num": null
},
{
"text": "x i \u2208 V in . If a j = CopyToken[i]",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Output Sequences",
"sec_num": null
},
{
"text": ", then y j = x i . This allows us to ablate entity information in the input while still generating logical forms. When copying tokens, the decoder determines the type of the entity using an additional output symbol. For GEO, the actual entity can then be identified as a post-processing step, as a type and surface form is sufficient. For other tasks this could require a more complicated post-processing step to disambiguate entities given a surface form and type.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Output Sequences",
"sec_num": null
},
{
"text": "Method GEO",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Output Sequences",
"sec_num": null
},
{
"text": "GNN w/ edge vectors + BERT 92.5 GNN w/ edge vectors 89.3",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Copying Entities",
"sec_num": null
},
{
"text": "GNN w/ edge vectors 87.9 \u2212 entity candidates, e 84.3 BERT 89.6 Table 3 : Experimental results for copying tokens instead of entities when decoding, with and without conditioning on the set of entity candidates, e.",
"cite_spans": [],
"ref_spans": [
{
"start": 63,
"end": 70,
"text": "Table 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Copying Tokens",
"sec_num": null
},
{
"text": "Accuracies on GEO, ATIS, and SPIDER are shown in Table 2 .",
"cite_spans": [],
"ref_spans": [
{
"start": 49,
"end": 56,
"text": "Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Results and Analysis",
"sec_num": "5.3"
},
{
"text": "GEO and ATIS Without pre-training, and despite adding a bit of entity ambiguity, we achieve similar results to other recent approaches that disambiguate and replace entities in the utterance as a pre-processing step during both training and evaluating Lapata, 2016, 2018) . When incorporating BERT, we increase absolute accuracies over Dong and Lapata (2018) on GEO and ATIS by 3.2% and 2.0%, respectively. Notably, they also present techniques and results that leverage constrained decoding, which our approach would also likely further benefit from. For GEO, we find that when ablating all entity information in our model and copying tokens instead of entities, we achieve similar results as Jia and Liang (2016) when also ablating their data augmentation method, as shown in Table 3 . This is expected, since when ablating entities completely, our architecture essentially reduces to the same sequence-to-sequence task setup. These results demonstrate the impact of conditioning on the entity candidates, as it improves performance even on the token copying setup. It appears that leveraging BERT can partly compensate for not conditioning on entity candidates, but combining BERT with our GNN approach and copying entities achieves 2.9% higher accuracy than using only a BERT encoder and copying tokens.",
"cite_spans": [
{
"start": 252,
"end": 271,
"text": "Lapata, 2016, 2018)",
"ref_id": null
},
{
"start": 336,
"end": 358,
"text": "Dong and Lapata (2018)",
"ref_id": "BIBREF11"
},
{
"start": 694,
"end": 714,
"text": "Jia and Liang (2016)",
"ref_id": "BIBREF18"
}
],
"ref_spans": [
{
"start": 778,
"end": 785,
"text": "Table 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Results and Analysis",
"sec_num": "5.3"
},
{
"text": "For ATIS, our results are outperformed by Wang et al. (2014) by 1.6%. Their approach uses hand-engineered templates to build a CCG lexicon. Some of these templates attempt to handle the specific types of ungrammatical utterances in the ATIS task.",
"cite_spans": [
{
"start": 42,
"end": 60,
"text": "Wang et al. (2014)",
"ref_id": "BIBREF39"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Results and Analysis",
"sec_num": "5.3"
},
{
"text": "SPIDER For SPIDER, a relatively new dataset, there is less prior work. Competitive approaches have been specific to the text-to-SQL task (Xu et al., 2017; Yu et al., 2018a,b) , incorporating taskspecific methods to condition on table and column information, and incorporating SQL-specific structure when decoding. Our approach improves absolute accuracy by +7.3% relative to Yu et al. (2018b) without using any pre-trained language representations, or constrained decoding. Our approach could also likely benefit from some of the other aspects of Yu et al. (2018b) such as more structured decoding, data augmentation, and using pre-trained representations (they use GloVe (Pennington et al., 2014)) for tokens, columns, and tables.",
"cite_spans": [
{
"start": 137,
"end": 154,
"text": "(Xu et al., 2017;",
"ref_id": "BIBREF43"
},
{
"start": 155,
"end": 174,
"text": "Yu et al., 2018a,b)",
"ref_id": null
},
{
"start": 375,
"end": 392,
"text": "Yu et al. (2018b)",
"ref_id": "BIBREF48"
},
{
"start": 547,
"end": 564,
"text": "Yu et al. (2018b)",
"ref_id": "BIBREF48"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Results and Analysis",
"sec_num": "5.3"
},
{
"text": "Our results were surprisingly worse when attempting to incorporate BERT. Of course, successfully incorporating pre-trained representations is not always straightforward. In general, we found using BERT within our architecture to be sensitive to learning rates and learning rate schedules. Notably, the evaluation setup for SPIDER is very different than training, as examples are for tables unseen during training. Models may not generalize well to unseen tables and columns. It's likely that successfully incorporating BERT for SPIDER would require careful tuning of hyperparameters specifically for the database split configuration.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Results and Analysis",
"sec_num": "5.3"
},
{
"text": "Entity Spans and Relations Ablating span relations between entities and tokens for GEO and ATIS is shown in Table 4 . The impact is more significant for ATIS, which contains many queries with multiple entities of the same type, such as nonstop flights seattle to boston where disambiguating the origin and destination entities requires knowledge of which tokens they are associated with, given that we represent entities based only on their types for these tasks. We leave for future work consideration of edges between entity candidates that incorporate relevant domain knowledge for these tasks. For SPIDER, results ablating relations between entities and tokens, and relations between entities, are shown in Table 5 . This demonstrates the importance of entity relations, as they include useful information for disambiguating entities such as which columns belong to which tables, and which columns have foreign key relations.",
"cite_spans": [],
"ref_spans": [
{
"start": 108,
"end": 115,
"text": "Table 4",
"ref_id": "TABREF3"
},
{
"start": 711,
"end": 718,
"text": "Table 5",
"ref_id": null
}
],
"eq_spans": [],
"section": "Results and Analysis",
"sec_num": "5.3"
},
{
"text": "GNN w/ edge vectors 32.1 \u2212 entity span edges 27.8 \u2212 entity relation edges 26.3 Table 5 : Results for ablating information about relations between entity candidates and tokens for SPIDER.",
"cite_spans": [],
"ref_spans": [
{
"start": 79,
"end": 86,
"text": "Table 5",
"ref_id": null
}
],
"eq_spans": [],
"section": "Edge Ablations SPIDER",
"sec_num": null
},
{
"text": "Edge Representations Using additive edge vectors outperforms using learned edge matrix transformations for implementing f , across all tasks. While the vector formulation is less expressive, it also introduces far fewer parameters per edge type, which can be an important consideration given that our graph contains many similar edge labels, such as those representing similar relative positions between tokens. We leave further exploration of more expressive edge representations to future work. Another direction to explore is a heterogeneous formulation of the GNN sub-layer, that employs different formulations for different subsets of nodes, e.g. for tokens and entities.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Edge Ablations SPIDER",
"sec_num": null
},
{
"text": "We have presented an architecture for semantic parsing that uses a Graph Neural Network (GNN) to condition on a graph of tokens, entities, and their relations. Experimental results have demonstrated that this approach can achieve competitive results across a diverse set of tasks, while also providing a conceptually simple way to incorporate entities and their relations during parsing. For future direction, we are interested in exploring constrained decoding, better incorporating pre-trained language representations within our architecture, conditioning on additional relations between entities, and different GNN formulations.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusions",
"sec_num": "6"
},
{
"text": "More broadly, we have presented a flexible approach for conditioning on available knowledge in the form of entities and their relations, and demonstrated its effectiveness for semantic parsing.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusions",
"sec_num": "6"
},
{
"text": "In this section we provide details of how we constructed entity candidate generators for each task.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A.1 Entity Candidate Generator Details",
"sec_num": null
},
{
"text": "GEO The annotator was constructed from the geobase database, which provides a list of geographical facts. For each entry in the database, we extracted the name as the entity alias and the type (e.g., \"state\", \"city\") as its attribute. Since not all cities used in the GEO query set are listed as explicit entries, we also used cities in the state entries. Finally, geobase has no entries around countries, so we added relevant aliases for \"USA\" with a special \"country\" attribute. There was 1 example where an entity in the logical form did not appear in the input, leading to the example being dropped from the training set.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A.1 Entity Candidate Generator Details",
"sec_num": null
},
{
"text": "In lieu of task-specific edge relations, we used binary edge labels between entities that captured which annotations span the same tokens. However, experiments demonstrated that these edges did not significantly affect performance. We leave consideration of other types of entity relations for these tasks to future work.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A.1 Entity Candidate Generator Details",
"sec_num": null
},
{
"text": "ATIS We constructed a lexicon mapping natural language entity aliases in the dataset (e.g., \"newark international\", \"5pm\") to unique entity identifiers (e.g. \"ewr:ap\", \"1700:ti\"). For ATIS, this lexicon required some manual construction. Each entity identifier has a two-letter suffix (e.g., \"ap\", \"ti\") that maps it to a single attribute (e.g., \"airport\", \"time\"). We allowed overlapping entity mentions when the entities referred to different entity identifiers. For instance, in the query span \"atlanta airport\", we include both the city of Atlanta and the Atlanta airport.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A.1 Entity Candidate Generator Details",
"sec_num": null
},
{
"text": "Notably there were 9 examples where one of the entities used as an argument in the logical form did not have a corresponding mention in the input utterance. From manual inspection, many of the dropped examples appear to have incorrectly annotated logical forms. These examples were dropped from training set or marked as incorrect if they appeared in the test set.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A.1 Entity Candidate Generator Details",
"sec_num": null
},
{
"text": "We use the same binary edge labels between entities as for GEO.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A.1 Entity Candidate Generator Details",
"sec_num": null
},
{
"text": "SPIDER For SPIDER we generalize our notion of entities to consider tables and columns as entities. We attempt to determine spans for each ta-ble and column by computing normalized Levenshtein distance between table and column names and unigrams or bigrams in the utterance. The best alignment having a score > 0.75 is selected, and we use these generated alignments to populate the edges between tokens and entity candidates.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A.1 Entity Candidate Generator Details",
"sec_num": null
},
{
"text": "We generate a set of attributes for the table based on unigrams in the table name, and an attribute to identify the entity as a table. Likewise, for columns, we generate a set of attributes based on unigrams in the column name as well as an attribute to identify the value type of the column. We also include attributes indicating whether an alignment was found between the entity and the input text.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A.1 Entity Candidate Generator Details",
"sec_num": null
},
{
"text": "We include 3 task-specific edge label types between entity candidates to denote bi-directional relations between column entities and the table entity they belong to, and to denote the presence of a foreign key relationship between columns.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A.1 Entity Candidate Generator Details",
"sec_num": null
}
],
"back_matter": [
{
"text": "We would like to thank Karl Pichotta, Zuyao Li, Tom Kwiatkowski, and Dipanjan Das for helpful discussions. Thanks also to Ming-Wei Chang and Kristina Toutanova for their comments, and to all who provided feedback in draft reading sessions. Finally, we are grateful to the anonymous reviewers for their useful feedback.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgments",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Tree structured decoding with doubly recurrent neural networks",
"authors": [
{
"first": "D",
"middle": [],
"last": "Alvarez-Melis",
"suffix": ""
},
{
"first": "T",
"middle": [],
"last": "Jaakkola",
"suffix": ""
}
],
"year": 2017,
"venue": "International Conference on Learning Representations (ICLR",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "D. Alvarez-Melis and T. Jaakkola. 2017. Tree struc- tured decoding with doubly recurrent neural net- works. In International Conference on Learning Representations (ICLR).",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Semantic parsing as machine translation",
"authors": [
{
"first": "Jacob",
"middle": [],
"last": "Andreas",
"suffix": ""
},
{
"first": "Andreas",
"middle": [],
"last": "Vlachos",
"suffix": ""
},
{
"first": "Stephen",
"middle": [],
"last": "Clark",
"suffix": ""
}
],
"year": 2013,
"venue": "Proceedings of the 51st Annual Meeting of the Association for Computational Linguistics",
"volume": "2",
"issue": "",
"pages": "47--52",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jacob Andreas, Andreas Vlachos, and Stephen Clark. 2013. Semantic parsing as machine translation. In Proceedings of the 51st Annual Meeting of the As- sociation for Computational Linguistics (Volume 2: Short Papers), volume 2, pages 47-52.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"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": {
"arXiv": [
"arXiv:1409.0473"
]
},
"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 arXiv:1409.0473.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Graph convolutional encoders for syntax-aware neural machine translation",
"authors": [
{
"first": "Joost",
"middle": [],
"last": "Bastings",
"suffix": ""
},
{
"first": "Ivan",
"middle": [],
"last": "Titov",
"suffix": ""
},
{
"first": "Wilker",
"middle": [],
"last": "Aziz",
"suffix": ""
},
{
"first": "Diego",
"middle": [],
"last": "Marcheggiani",
"suffix": ""
},
{
"first": "Khalil",
"middle": [],
"last": "Simaan",
"suffix": ""
}
],
"year": 2017,
"venue": "Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "1957--1967",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Joost Bastings, Ivan Titov, Wilker Aziz, Diego Marcheggiani, and Khalil Simaan. 2017. Graph convolutional encoders for syntax-aware neural ma- chine translation. In Proceedings of the 2017 Con- ference on Empirical Methods in Natural Language Processing, pages 1957-1967.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Relational inductive biases, deep learning, and graph networks",
"authors": [
{
"first": "W",
"middle": [],
"last": "Peter",
"suffix": ""
},
{
"first": "Jessica",
"middle": [
"B"
],
"last": "Battaglia",
"suffix": ""
},
{
"first": "Victor",
"middle": [],
"last": "Hamrick",
"suffix": ""
},
{
"first": "Alvaro",
"middle": [],
"last": "Bapst",
"suffix": ""
},
{
"first": "Vinicius",
"middle": [],
"last": "Sanchez-Gonzalez",
"suffix": ""
},
{
"first": "Mateusz",
"middle": [],
"last": "Zambaldi",
"suffix": ""
},
{
"first": "Andrea",
"middle": [],
"last": "Malinowski",
"suffix": ""
},
{
"first": "David",
"middle": [],
"last": "Tacchetti",
"suffix": ""
},
{
"first": "Adam",
"middle": [],
"last": "Raposo",
"suffix": ""
},
{
"first": "Ryan",
"middle": [],
"last": "Santoro",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Faulkner",
"suffix": ""
}
],
"year": 2018,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1806.01261"
]
},
"num": null,
"urls": [],
"raw_text": "Peter W Battaglia, Jessica B Hamrick, Victor Bapst, Alvaro Sanchez-Gonzalez, Vinicius Zambaldi, Ma- teusz Malinowski, Andrea Tacchetti, David Raposo, Adam Santoro, Ryan Faulkner, et al. 2018. Rela- tional inductive biases, deep learning, and graph net- works. arXiv preprint arXiv:1806.01261.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Graph-to-sequence learning using gated graph neural networks",
"authors": [
{
"first": "Daniel",
"middle": [],
"last": "Beck",
"suffix": ""
},
{
"first": "Gholamreza",
"middle": [],
"last": "Haffari",
"suffix": ""
},
{
"first": "Trevor",
"middle": [],
"last": "Cohn",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics",
"volume": "1",
"issue": "",
"pages": "273--283",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Daniel Beck, Gholamreza Haffari, and Trevor Cohn. 2018. Graph-to-sequence learning using gated graph neural networks. In Proceedings of the 56th Annual Meeting of the Association for Computa- tional Linguistics (Volume 1: Long Papers), pages 273-283.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Semantic parsing on freebase from question-answer pairs",
"authors": [
{
"first": "Jonathan",
"middle": [],
"last": "Berant",
"suffix": ""
},
{
"first": "Andrew",
"middle": [],
"last": "Chou",
"suffix": ""
},
{
"first": "Roy",
"middle": [],
"last": "Frostig",
"suffix": ""
},
{
"first": "Percy",
"middle": [],
"last": "Liang",
"suffix": ""
}
],
"year": 2013,
"venue": "Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "1533--1544",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jonathan Berant, Andrew Chou, Roy Frostig, and Percy Liang. 2013. Semantic parsing on freebase from question-answer pairs. In Proceedings of the 2013 Conference on Empirical Methods in Natural Lan- guage Processing, pages 1533-1544.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Expanding the scope of the atis task: The atis-3 corpus",
"authors": [
{
"first": "A",
"middle": [],
"last": "Deborah",
"suffix": ""
},
{
"first": "Madeleine",
"middle": [],
"last": "Dahl",
"suffix": ""
},
{
"first": "Michael",
"middle": [],
"last": "Bates",
"suffix": ""
},
{
"first": "William",
"middle": [],
"last": "Brown",
"suffix": ""
},
{
"first": "Kate",
"middle": [],
"last": "Fisher",
"suffix": ""
},
{
"first": "David",
"middle": [],
"last": "Hunicke-Smith",
"suffix": ""
},
{
"first": "Christine",
"middle": [],
"last": "Pallett",
"suffix": ""
},
{
"first": "Alexander",
"middle": [],
"last": "Pao",
"suffix": ""
},
{
"first": "Elizabeth",
"middle": [],
"last": "Rudnicky",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Shriberg",
"suffix": ""
}
],
"year": 1994,
"venue": "Proceedings of the workshop on Human Language Technology",
"volume": "",
"issue": "",
"pages": "43--48",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Deborah A Dahl, Madeleine Bates, Michael Brown, William Fisher, Kate Hunicke-Smith, David Pallett, Christine Pao, Alexander Rudnicky, and Elizabeth Shriberg. 1994. Expanding the scope of the atis task: The atis-3 corpus. In Proceedings of the workshop on Human Language Technology, pages 43-48. As- sociation for Computational Linguistics.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Bert: Pre-training of deep bidirectional transformers for language understanding",
"authors": [
{
"first": "Jacob",
"middle": [],
"last": "Devlin",
"suffix": ""
},
{
"first": "Ming-Wei",
"middle": [],
"last": "Chang",
"suffix": ""
},
{
"first": "Kenton",
"middle": [],
"last": "Lee",
"suffix": ""
},
{
"first": "Kristina",
"middle": [],
"last": "Toutanova",
"suffix": ""
}
],
"year": 2018,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1810.04805"
]
},
"num": null,
"urls": [],
"raw_text": "Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. 2018. Bert: Pre-training of deep bidirectional transformers for language understand- ing. arXiv preprint arXiv:1810.04805.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Language to logical form with neural attention",
"authors": [
{
"first": "Li",
"middle": [],
"last": "Dong",
"suffix": ""
},
{
"first": "Mirella",
"middle": [],
"last": "Lapata",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics",
"volume": "1",
"issue": "",
"pages": "33--43",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Li Dong and Mirella Lapata. 2016. Language to logi- cal form with neural attention. In Proceedings of the 54th Annual Meeting of the Association for Compu- tational Linguistics (Volume 1: Long Papers), vol- ume 1, pages 33-43.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Coarse-to-fine decoding for neural semantic parsing",
"authors": [
{
"first": "Li",
"middle": [],
"last": "Dong",
"suffix": ""
},
{
"first": "Mirella",
"middle": [],
"last": "Lapata",
"suffix": ""
}
],
"year": 2018,
"venue": "ACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Li Dong and Mirella Lapata. 2018. Coarse-to-fine de- coding for neural semantic parsing. In ACL.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Neural message passing for quantum chemistry",
"authors": [
{
"first": "Justin",
"middle": [],
"last": "Gilmer",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Samuel",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Schoenholz",
"suffix": ""
},
{
"first": "F",
"middle": [],
"last": "Patrick",
"suffix": ""
},
{
"first": "Oriol",
"middle": [],
"last": "Riley",
"suffix": ""
},
{
"first": "George",
"middle": [
"E"
],
"last": "Vinyals",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Dahl",
"suffix": ""
}
],
"year": 2017,
"venue": "International Conference on Machine Learning",
"volume": "",
"issue": "",
"pages": "1263--1272",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Justin Gilmer, Samuel S Schoenholz, Patrick F Riley, Oriol Vinyals, and George E Dahl. 2017. Neural message passing for quantum chemistry. In Inter- national Conference on Machine Learning, pages 1263-1272.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Weaklysupervised semantic parsing with abstract examples",
"authors": [
{
"first": "Omer",
"middle": [],
"last": "Goldman",
"suffix": ""
},
{
"first": "Veronica",
"middle": [],
"last": "Latcinnik",
"suffix": ""
},
{
"first": "Udi",
"middle": [],
"last": "Naveh",
"suffix": ""
},
{
"first": "Amir",
"middle": [],
"last": "Globerson",
"suffix": ""
},
{
"first": "Jonathan",
"middle": [],
"last": "Berant",
"suffix": ""
}
],
"year": 2017,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1711.05240"
]
},
"num": null,
"urls": [],
"raw_text": "Omer Goldman, Veronica Latcinnik, Udi Naveh, Amir Globerson, and Jonathan Berant. 2017. Weakly- supervised semantic parsing with abstract examples. arXiv preprint arXiv:1711.05240.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"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 Victor OK Li. 2016. Incorporating copying mechanism in sequence-to-sequence learning. In Proceedings of the 54th Annual Meeting of the Association for Com- putational Linguistics (Volume 1: Long Papers), volume 1, pages 1631-1640.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"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), volume 1, pages 140-149.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Inductive representation learning on large graphs",
"authors": [
{
"first": "Will",
"middle": [],
"last": "Hamilton",
"suffix": ""
},
{
"first": "Zhitao",
"middle": [],
"last": "Ying",
"suffix": ""
},
{
"first": "Jure",
"middle": [],
"last": "Leskovec",
"suffix": ""
}
],
"year": 2017,
"venue": "Advances in Neural Information Processing Systems",
"volume": "",
"issue": "",
"pages": "1024--1034",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Will Hamilton, Zhitao Ying, and Jure Leskovec. 2017. Inductive representation learning on large graphs. In Advances in Neural Information Processing Sys- tems, pages 1024-1034.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Universal language model fine-tuning for text classification",
"authors": [
{
"first": "Jeremy",
"middle": [],
"last": "Howard",
"suffix": ""
},
{
"first": "Sebastian",
"middle": [],
"last": "Ruder",
"suffix": ""
}
],
"year": 2018,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1801.06146"
]
},
"num": null,
"urls": [],
"raw_text": "Jeremy Howard and Sebastian Ruder. 2018. Universal language model fine-tuning for text classification. arXiv preprint arXiv:1801.06146.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Data recombination for neural semantic parsing",
"authors": [
{
"first": "Robin",
"middle": [],
"last": "Jia",
"suffix": ""
},
{
"first": "Percy",
"middle": [],
"last": "Liang",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics",
"volume": "1",
"issue": "",
"pages": "12--22",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Robin Jia and Percy Liang. 2016. Data recombination for neural semantic parsing. In Proceedings of the 54th Annual Meeting of the Association for Compu- tational Linguistics (Volume 1: Long Papers), vol- ume 1, pages 12-22.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Learning to transform natural to formal languages",
"authors": [
{
"first": "J",
"middle": [],
"last": "Rohit",
"suffix": ""
},
{
"first": "Yuk",
"middle": [
"Wah"
],
"last": "Kate",
"suffix": ""
},
{
"first": "Raymond J",
"middle": [],
"last": "Wong",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Mooney",
"suffix": ""
}
],
"year": 1999,
"venue": "Proceedings of the National Conference on Artificial Intelligence",
"volume": "20",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Rohit J Kate, Yuk Wah Wong, and Raymond J Mooney. 2005. Learning to transform natural to formal lan- guages. In Proceedings of the National Conference on Artificial Intelligence, volume 20, page 1062. Menlo Park, CA; Cambridge, MA; London; AAAI Press; MIT Press; 1999.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Adam: A method for stochastic optimization",
"authors": [
{
"first": "Diederik",
"middle": [],
"last": "Kingma",
"suffix": ""
},
{
"first": "Jimmy",
"middle": [],
"last": "Ba",
"suffix": ""
}
],
"year": 2015,
"venue": "International Conference on Learning Representations (ICLR",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Diederik Kingma and Jimmy Ba. 2015. Adam: A method for stochastic optimization. In International Conference on Learning Representations (ICLR).",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Semisupervised classification with graph convolutional networks",
"authors": [
{
"first": "N",
"middle": [],
"last": "Thomas",
"suffix": ""
},
{
"first": "Max",
"middle": [],
"last": "Kipf",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Welling",
"suffix": ""
}
],
"year": 2017,
"venue": "International Conference on Learning Representations (ICLR",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Thomas N Kipf and Max Welling. 2017. Semi- supervised classification with graph convolutional networks. In International Conference on Learning Representations (ICLR).",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Neural semantic parsing with type constraints for semi-structured tables",
"authors": [
{
"first": "Jayant",
"middle": [],
"last": "Krishnamurthy",
"suffix": ""
},
{
"first": "Pradeep",
"middle": [],
"last": "Dasigi",
"suffix": ""
},
{
"first": "Matt",
"middle": [],
"last": "Gardner",
"suffix": ""
}
],
"year": 2017,
"venue": "Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "1516--1526",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jayant Krishnamurthy, Pradeep Dasigi, and Matt Gard- ner. 2017. Neural semantic parsing with type con- straints for semi-structured tables. In Proceedings of the 2017 Conference on Empirical Methods in Nat- ural Language Processing, pages 1516-1526.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "Scaling semantic parsers with on-the-fly ontology matching",
"authors": [
{
"first": "Tom",
"middle": [],
"last": "Kwiatkowski",
"suffix": ""
},
{
"first": "Eunsol",
"middle": [],
"last": "Choi",
"suffix": ""
},
{
"first": "Yoav",
"middle": [],
"last": "Artzi",
"suffix": ""
},
{
"first": "Luke",
"middle": [],
"last": "Zettlemoyer",
"suffix": ""
}
],
"year": 2013,
"venue": "Proceedings of the 2013 conference on empirical methods in natural language processing",
"volume": "",
"issue": "",
"pages": "1545--1556",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Tom Kwiatkowski, Eunsol Choi, Yoav Artzi, and Luke Zettlemoyer. 2013. Scaling semantic parsers with on-the-fly ontology matching. In Proceedings of the 2013 conference on empirical methods in natural language processing, pages 1545-1556.",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "Lexical generalization in ccg grammar induction for semantic parsing",
"authors": [
{
"first": "Tom",
"middle": [],
"last": "Kwiatkowski",
"suffix": ""
},
{
"first": "Luke",
"middle": [],
"last": "Zettlemoyer",
"suffix": ""
},
{
"first": "Sharon",
"middle": [],
"last": "Goldwater",
"suffix": ""
},
{
"first": "Mark",
"middle": [],
"last": "Steedman",
"suffix": ""
}
],
"year": 2011,
"venue": "Proceedings of the conference on empirical methods in natural language processing",
"volume": "",
"issue": "",
"pages": "1512--1523",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Tom Kwiatkowski, Luke Zettlemoyer, Sharon Goldwa- ter, and Mark Steedman. 2011. Lexical generaliza- tion in ccg grammar induction for semantic parsing. In Proceedings of the conference on empirical meth- ods in natural language processing, pages 1512- 1523. Association for Computational Linguistics.",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "Gated graph sequence neural networks",
"authors": [
{
"first": "Yujia",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Daniel",
"middle": [],
"last": "Tarlow",
"suffix": ""
},
{
"first": "Marc",
"middle": [],
"last": "Brockschmidt",
"suffix": ""
},
{
"first": "Richard",
"middle": [],
"last": "Zemel",
"suffix": ""
}
],
"year": 2016,
"venue": "International Conference on Learning Representations (ICLR",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yujia Li, Daniel Tarlow, Marc Brockschmidt, and Richard Zemel. 2016. Gated graph sequence neural networks. In International Conference on Learning Representations (ICLR).",
"links": null
},
"BIBREF26": {
"ref_id": "b26",
"title": "Learning dependency-based compositional semantics",
"authors": [
{
"first": "Percy",
"middle": [],
"last": "Liang",
"suffix": ""
},
{
"first": "Dan",
"middle": [],
"last": "Michael I Jordan",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Klein",
"suffix": ""
}
],
"year": 2013,
"venue": "Computational Linguistics",
"volume": "39",
"issue": "2",
"pages": "389--446",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Percy Liang, Michael I Jordan, and Dan Klein. 2013. Learning dependency-based compositional seman- tics. Computational Linguistics, 39(2):389-446.",
"links": null
},
"BIBREF27": {
"ref_id": "b27",
"title": "Latent predictor networks for code generation",
"authors": [
{
"first": "Wang",
"middle": [],
"last": "Ling",
"suffix": ""
},
{
"first": "Phil",
"middle": [],
"last": "Blunsom",
"suffix": ""
},
{
"first": "Edward",
"middle": [],
"last": "Grefenstette",
"suffix": ""
},
{
"first": "Karl",
"middle": [
"Moritz"
],
"last": "Hermann",
"suffix": ""
},
{
"first": "Tom\u00e1\u0161",
"middle": [],
"last": "Ko\u010disk\u1ef3",
"suffix": ""
},
{
"first": "Fumin",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Andrew",
"middle": [],
"last": "Senior",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics",
"volume": "1",
"issue": "",
"pages": "599--609",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Wang Ling, Phil Blunsom, Edward Grefenstette, Karl Moritz Hermann, Tom\u00e1\u0161 Ko\u010disk\u1ef3, Fumin Wang, and Andrew Senior. 2016. Latent predictor networks for code generation. In Proceedings of the 54th Annual Meeting of the Association for Compu- tational Linguistics (Volume 1: Long Papers), vol- ume 1, pages 599-609.",
"links": null
},
"BIBREF28": {
"ref_id": "b28",
"title": "Encoding sentences with graph convolutional networks for semantic role labeling",
"authors": [
{
"first": "Diego",
"middle": [],
"last": "Marcheggiani",
"suffix": ""
},
{
"first": "Ivan",
"middle": [],
"last": "Titov",
"suffix": ""
}
],
"year": 2017,
"venue": "Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "1506--1515",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Diego Marcheggiani and Ivan Titov. 2017. Encoding sentences with graph convolutional networks for se- mantic role labeling. In Proceedings of the 2017 Conference on Empirical Methods in Natural Lan- guage Processing, pages 1506-1515.",
"links": null
},
"BIBREF29": {
"ref_id": "b29",
"title": "Glove: Global vectors for word representation",
"authors": [
{
"first": "Jeffrey",
"middle": [],
"last": "Pennington",
"suffix": ""
},
{
"first": "Richard",
"middle": [],
"last": "Socher",
"suffix": ""
},
{
"first": "Christopher",
"middle": [],
"last": "Manning",
"suffix": ""
}
],
"year": 2014,
"venue": "Proceedings of the 2014 conference on empirical methods in natural language processing (EMNLP)",
"volume": "",
"issue": "",
"pages": "1532--1543",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jeffrey Pennington, Richard Socher, and Christopher Manning. 2014. Glove: Global vectors for word representation. In Proceedings of the 2014 confer- ence on empirical methods in natural language pro- cessing (EMNLP), pages 1532-1543.",
"links": null
},
"BIBREF30": {
"ref_id": "b30",
"title": "Abstract syntax networks for code generation and semantic parsing",
"authors": [
{
"first": "Maxim",
"middle": [],
"last": "Rabinovich",
"suffix": ""
},
{
"first": "Mitchell",
"middle": [],
"last": "Stern",
"suffix": ""
},
{
"first": "Dan",
"middle": [],
"last": "Klein",
"suffix": ""
}
],
"year": 2017,
"venue": "Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics",
"volume": "1",
"issue": "",
"pages": "1139--1149",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Maxim Rabinovich, Mitchell Stern, and Dan Klein. 2017. Abstract syntax networks for code genera- tion and semantic parsing. In Proceedings of the 55th Annual Meeting of the Association for Compu- tational Linguistics (Volume 1: Long Papers), vol- ume 1, pages 1139-1149.",
"links": null
},
"BIBREF31": {
"ref_id": "b31",
"title": "The graph neural network model",
"authors": [
{
"first": "Franco",
"middle": [],
"last": "Scarselli",
"suffix": ""
},
{
"first": "Marco",
"middle": [],
"last": "Gori",
"suffix": ""
},
{
"first": "Ah",
"middle": [],
"last": "Chung Tsoi",
"suffix": ""
},
{
"first": "Markus",
"middle": [],
"last": "Hagenbuchner",
"suffix": ""
},
{
"first": "Gabriele",
"middle": [],
"last": "Monfardini",
"suffix": ""
}
],
"year": 2009,
"venue": "IEEE Transactions on Neural Networks",
"volume": "20",
"issue": "1",
"pages": "61--80",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Franco Scarselli, Marco Gori, Ah Chung Tsoi, Markus Hagenbuchner, and Gabriele Monfardini. 2009. The graph neural network model. IEEE Transactions on Neural Networks, 20(1):61-80.",
"links": null
},
"BIBREF32": {
"ref_id": "b32",
"title": "Self-attention with relative position representations",
"authors": [
{
"first": "Peter",
"middle": [],
"last": "Shaw",
"suffix": ""
},
{
"first": "Jakob",
"middle": [],
"last": "Uszkoreit",
"suffix": ""
},
{
"first": "Ashish",
"middle": [],
"last": "Vaswani",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies",
"volume": "2",
"issue": "",
"pages": "464--468",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Peter Shaw, Jakob Uszkoreit, and Ashish Vaswani. 2018. Self-attention with relative position represen- tations. In Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Tech- nologies, Volume 2 (Short Papers), volume 2, pages 464-468.",
"links": null
},
"BIBREF33": {
"ref_id": "b33",
"title": "Open domain question answering using early fusion of knowledge bases and text",
"authors": [
{
"first": "Haitian",
"middle": [],
"last": "Sun",
"suffix": ""
},
{
"first": "Bhuwan",
"middle": [],
"last": "Dhingra",
"suffix": ""
},
{
"first": "Manzil",
"middle": [],
"last": "Zaheer",
"suffix": ""
},
{
"first": "Kathryn",
"middle": [],
"last": "Mazaitis",
"suffix": ""
},
{
"first": "Ruslan",
"middle": [],
"last": "Salakhutdinov",
"suffix": ""
},
{
"first": "William",
"middle": [],
"last": "Cohen",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "4231--4242",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Haitian Sun, Bhuwan Dhingra, Manzil Zaheer, Kathryn Mazaitis, Ruslan Salakhutdinov, and William Co- hen. 2018. Open domain question answering using early fusion of knowledge bases and text. In Pro- ceedings of the 2018 Conference on Empirical Meth- ods in Natural Language Processing, pages 4231- 4242.",
"links": null
},
"BIBREF34": {
"ref_id": "b34",
"title": "Automated construction of database interfaces: Integrating statistical and relational learning for semantic parsing",
"authors": [
{
"first": "R",
"middle": [],
"last": "Lappoon",
"suffix": ""
},
{
"first": "Raymond J",
"middle": [],
"last": "Tang",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Mooney",
"suffix": ""
}
],
"year": 2000,
"venue": "Proceedings of the 2000 Joint SIG-DAT conference on Empirical methods in natural language processing and very large corpora: held in conjunction with the 38th Annual Meeting of the Association for Computational Linguistics",
"volume": "13",
"issue": "",
"pages": "133--141",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Lappoon R Tang and Raymond J Mooney. 2000. Au- tomated construction of database interfaces: Inte- grating statistical and relational learning for seman- tic parsing. In Proceedings of the 2000 Joint SIG- DAT conference on Empirical methods in natural language processing and very large corpora: held in conjunction with the 38th Annual Meeting of the As- sociation for Computational Linguistics-Volume 13, pages 133-141. Association for Computational Lin- guistics.",
"links": null
},
"BIBREF35": {
"ref_id": "b35",
"title": "Attention is all you need",
"authors": [
{
"first": "Ashish",
"middle": [],
"last": "Vaswani",
"suffix": ""
},
{
"first": "Noam",
"middle": [],
"last": "Shazeer",
"suffix": ""
},
{
"first": "Niki",
"middle": [],
"last": "Parmar",
"suffix": ""
},
{
"first": "Jakob",
"middle": [],
"last": "Uszkoreit",
"suffix": ""
},
{
"first": "Llion",
"middle": [],
"last": "Jones",
"suffix": ""
},
{
"first": "Aidan",
"middle": [
"N"
],
"last": "Gomez",
"suffix": ""
},
{
"first": "\u0141ukasz",
"middle": [],
"last": "Kaiser",
"suffix": ""
},
{
"first": "Illia",
"middle": [],
"last": "Polosukhin",
"suffix": ""
}
],
"year": 2017,
"venue": "Advances in Neural Information Processing Systems",
"volume": "",
"issue": "",
"pages": "5998--6008",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, \u0141ukasz Kaiser, and Illia Polosukhin. 2017. Attention is all you need. In Advances in Neural Information Pro- cessing Systems, pages 5998-6008.",
"links": null
},
"BIBREF36": {
"ref_id": "b36",
"title": "Graph attention networks",
"authors": [
{
"first": "Petar",
"middle": [],
"last": "Veli\u010dkovi\u0107",
"suffix": ""
},
{
"first": "Guillem",
"middle": [],
"last": "Cucurull",
"suffix": ""
},
{
"first": "Arantxa",
"middle": [],
"last": "Casanova",
"suffix": ""
},
{
"first": "Adriana",
"middle": [],
"last": "Romero",
"suffix": ""
},
{
"first": "Pietro",
"middle": [],
"last": "Li\u00f2",
"suffix": ""
},
{
"first": "Yoshua",
"middle": [],
"last": "Bengio",
"suffix": ""
}
],
"year": 2018,
"venue": "International Conference on Learning Representations (ICLR",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Petar Veli\u010dkovi\u0107, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Li\u00f2, and Yoshua Bengio. 2018. Graph attention networks. In International Conference on Learning Representations (ICLR).",
"links": null
},
"BIBREF37": {
"ref_id": "b37",
"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. 2015a. Pointer networks. In Advances in Neural Information Processing Systems, pages 2692-2700.",
"links": null
},
"BIBREF38": {
"ref_id": "b38",
"title": "Grammar as a foreign language",
"authors": [
{
"first": "Oriol",
"middle": [],
"last": "Vinyals",
"suffix": ""
},
{
"first": "\u0141ukasz",
"middle": [],
"last": "Kaiser",
"suffix": ""
},
{
"first": "Terry",
"middle": [],
"last": "Koo",
"suffix": ""
},
{
"first": "Slav",
"middle": [],
"last": "Petrov",
"suffix": ""
},
{
"first": "Ilya",
"middle": [],
"last": "Sutskever",
"suffix": ""
},
{
"first": "Geoffrey",
"middle": [],
"last": "Hinton",
"suffix": ""
}
],
"year": 2015,
"venue": "Advances in Neural Information Processing Systems",
"volume": "",
"issue": "",
"pages": "2773--2781",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Oriol Vinyals, \u0141ukasz Kaiser, Terry Koo, Slav Petrov, Ilya Sutskever, and Geoffrey Hinton. 2015b. Gram- mar as a foreign language. In Advances in Neural Information Processing Systems, pages 2773-2781.",
"links": null
},
"BIBREF39": {
"ref_id": "b39",
"title": "Morpho-syntactic lexical generalization for ccg semantic parsing",
"authors": [
{
"first": "Adrienne",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Tom",
"middle": [],
"last": "Kwiatkowski",
"suffix": ""
},
{
"first": "Luke",
"middle": [],
"last": "Zettlemoyer",
"suffix": ""
}
],
"year": 2014,
"venue": "Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP)",
"volume": "",
"issue": "",
"pages": "1284--1295",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Adrienne Wang, Tom Kwiatkowski, and Luke Zettle- moyer. 2014. Morpho-syntactic lexical generaliza- tion for ccg semantic parsing. In Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP), pages 1284-1295.",
"links": null
},
"BIBREF40": {
"ref_id": "b40",
"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": {
"arXiv": [
"arXiv:1609.08144"
]
},
"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 ma- chine translation system: Bridging the gap between human and machine translation. arXiv preprint arXiv:1609.08144.",
"links": null
},
"BIBREF41": {
"ref_id": "b41",
"title": "Sequence-based structured prediction for semantic parsing",
"authors": [
{
"first": "Chunyang",
"middle": [],
"last": "Xiao",
"suffix": ""
},
{
"first": "Marc",
"middle": [],
"last": "Dymetman",
"suffix": ""
},
{
"first": "Claire",
"middle": [],
"last": "Gardent",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics",
"volume": "1",
"issue": "",
"pages": "1341--1350",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Chunyang Xiao, Marc Dymetman, and Claire Gardent. 2016. Sequence-based structured prediction for se- mantic parsing. In Proceedings of the 54th Annual Meeting of the Association for Computational Lin- guistics (Volume 1: Long Papers), volume 1, pages 1341-1350.",
"links": null
},
"BIBREF42": {
"ref_id": "b42",
"title": "Representation learning on graphs with jumping knowledge networks",
"authors": [
{
"first": "Keyulu",
"middle": [],
"last": "Xu",
"suffix": ""
},
{
"first": "Chengtao",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Yonglong",
"middle": [],
"last": "Tian",
"suffix": ""
},
{
"first": "Tomohiro",
"middle": [],
"last": "Sonobe",
"suffix": ""
},
{
"first": "Ken-Ichi",
"middle": [],
"last": "Kawarabayashi",
"suffix": ""
},
{
"first": "Stefanie",
"middle": [],
"last": "Jegelka",
"suffix": ""
}
],
"year": 2018,
"venue": "International Conference on Learning Representations",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Keyulu Xu, Chengtao Li, Yonglong Tian, Tomo- hiro Sonobe, Ken-ichi Kawarabayashi, and Stefanie Jegelka. 2018. Representation learning on graphs with jumping knowledge networks. In International Conference on Learning Representations (ICLR).",
"links": null
},
"BIBREF43": {
"ref_id": "b43",
"title": "Sqlnet: Generating structured queries from natural language without reinforcement learning",
"authors": [
{
"first": "Xiaojun",
"middle": [],
"last": "Xu",
"suffix": ""
},
{
"first": "Chang",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Dawn",
"middle": [],
"last": "Song",
"suffix": ""
}
],
"year": 2017,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1711.04436"
]
},
"num": null,
"urls": [],
"raw_text": "Xiaojun Xu, Chang Liu, and Dawn Song. 2017. Sqlnet: Generating structured queries from natural language without reinforcement learning. arXiv preprint arXiv:1711.04436.",
"links": null
},
"BIBREF44": {
"ref_id": "b44",
"title": "S-mart: Novel tree-based structured learning algorithms applied to tweet entity linking",
"authors": [
{
"first": "Yi",
"middle": [],
"last": "Yang",
"suffix": ""
},
{
"first": "Ming-Wei",
"middle": [],
"last": "Chang",
"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": "504--513",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yi Yang and Ming-Wei Chang. 2015. S-mart: Novel tree-based structured learning algorithms applied to tweet entity linking. In Proceedings of the 53rd An- nual Meeting of the Association for Computational Linguistics and the 7th International Joint Confer- ence on Natural Language Processing (Volume 1: Long Papers), volume 1, pages 504-513.",
"links": null
},
"BIBREF45": {
"ref_id": "b45",
"title": "The value of semantic parse labeling for knowledge base question answering",
"authors": [
{
"first": "Matthew",
"middle": [],
"last": "Wen-Tau Yih",
"suffix": ""
},
{
"first": "Chris",
"middle": [],
"last": "Richardson",
"suffix": ""
},
{
"first": "Ming-Wei",
"middle": [],
"last": "Meek",
"suffix": ""
},
{
"first": "Jina",
"middle": [],
"last": "Chang",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Suh",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics",
"volume": "2",
"issue": "",
"pages": "201--206",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Wen-tau Yih, Matthew Richardson, Chris Meek, Ming- Wei Chang, and Jina Suh. 2016. The value of se- mantic parse labeling for knowledge base question answering. In Proceedings of the 54th Annual Meet- ing of the Association for Computational Linguistics (Volume 2: Short Papers), volume 2, pages 201-206.",
"links": null
},
"BIBREF46": {
"ref_id": "b46",
"title": "A syntactic neural model for general-purpose code generation",
"authors": [
{
"first": "Pengcheng",
"middle": [],
"last": "Yin",
"suffix": ""
},
{
"first": "Graham",
"middle": [],
"last": "Neubig",
"suffix": ""
}
],
"year": 2017,
"venue": "Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics",
"volume": "1",
"issue": "",
"pages": "440--450",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Pengcheng Yin and Graham Neubig. 2017. A syntactic neural model for general-purpose code generation. In Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), volume 1, pages 440-450.",
"links": null
},
"BIBREF47": {
"ref_id": "b47",
"title": "Typesql: Knowledgebased type-aware neural text-to-sql generation",
"authors": [
{
"first": "Tao",
"middle": [],
"last": "Yu",
"suffix": ""
},
{
"first": "Zifan",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Zilin",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Rui",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Dragomir",
"middle": [],
"last": "Radev",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies",
"volume": "2",
"issue": "",
"pages": "588--594",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Tao Yu, Zifan Li, Zilin Zhang, Rui Zhang, and Dragomir Radev. 2018a. Typesql: Knowledge- based type-aware neural text-to-sql generation. In Proceedings of the 2018 Conference of the North American Chapter of the Association for Computa- tional Linguistics: Human Language Technologies, Volume 2 (Short Papers), volume 2, pages 588-594.",
"links": null
},
"BIBREF48": {
"ref_id": "b48",
"title": "Syntaxsqlnet: Syntax tree networks for complex and cross-domaintext-to-sql task",
"authors": [
{
"first": "Tao",
"middle": [],
"last": "Yu",
"suffix": ""
},
{
"first": "Michihiro",
"middle": [],
"last": "Yasunaga",
"suffix": ""
},
{
"first": "Kai",
"middle": [],
"last": "Yang",
"suffix": ""
},
{
"first": "Rui",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Dongxu",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Zifan",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Dragomir",
"middle": [],
"last": "Radev",
"suffix": ""
}
],
"year": 2018,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1810.05237"
]
},
"num": null,
"urls": [],
"raw_text": "Tao Yu, Michihiro Yasunaga, Kai Yang, Rui Zhang, Dongxu Wang, Zifan Li, and Dragomir Radev. 2018b. Syntaxsqlnet: Syntax tree networks for complex and cross-domaintext-to-sql task. arXiv preprint arXiv:1810.05237.",
"links": null
},
"BIBREF49": {
"ref_id": "b49",
"title": "Spider: A large-scale human-labeled dataset for complex and cross-domain semantic parsing and text-to-sql task",
"authors": [
{
"first": "Tao",
"middle": [],
"last": "Yu",
"suffix": ""
},
{
"first": "Rui",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Kai",
"middle": [],
"last": "Yang",
"suffix": ""
},
{
"first": "Michihiro",
"middle": [],
"last": "Yasunaga",
"suffix": ""
},
{
"first": "Dongxu",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Zifan",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "James",
"middle": [],
"last": "Ma",
"suffix": ""
},
{
"first": "Irene",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Qingning",
"middle": [],
"last": "Yao",
"suffix": ""
},
{
"first": "Shanelle",
"middle": [],
"last": "Roman",
"suffix": ""
}
],
"year": 2018,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1809.08887"
]
},
"num": null,
"urls": [],
"raw_text": "Tao Yu, Rui Zhang, Kai Yang, Michihiro Yasunaga, Dongxu Wang, Zifan Li, James Ma, Irene Li, Qingn- ing Yao, Shanelle Roman, et al. 2018c. Spider: A large-scale human-labeled dataset for complex and cross-domain semantic parsing and text-to-sql task. arXiv preprint arXiv:1809.08887.",
"links": null
},
"BIBREF50": {
"ref_id": "b50",
"title": "Learning to parse database queries using inductive logic programming",
"authors": [
{
"first": "M",
"middle": [],
"last": "John",
"suffix": ""
},
{
"first": "Raymond J",
"middle": [],
"last": "Zelle",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Mooney",
"suffix": ""
}
],
"year": 1996,
"venue": "Proceedings of the thirteenth national conference on Artificial intelligence",
"volume": "2",
"issue": "",
"pages": "1050--1055",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "John M Zelle and Raymond J Mooney. 1996. Learn- ing to parse database queries using inductive logic programming. In Proceedings of the thirteenth na- tional conference on Artificial intelligence-Volume 2, pages 1050-1055. AAAI Press.",
"links": null
},
"BIBREF51": {
"ref_id": "b51",
"title": "Learning to map sentences to logical form: structured classification with probabilistic categorial grammars",
"authors": [
{
"first": "S",
"middle": [],
"last": "Luke",
"suffix": ""
},
{
"first": "Michael",
"middle": [],
"last": "Zettlemoyer",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Collins",
"suffix": ""
}
],
"year": 2005,
"venue": "Proceedings of the Twenty-First Conference on Uncertainty in Artificial Intelligence",
"volume": "",
"issue": "",
"pages": "658--666",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Luke S Zettlemoyer and Michael Collins. 2005. Learn- ing to map sentences to logical form: structured classification with probabilistic categorial gram- mars. In Proceedings of the Twenty-First Confer- ence on Uncertainty in Artificial Intelligence, pages 658-666. AUAI Press.",
"links": null
},
"BIBREF52": {
"ref_id": "b52",
"title": "Online learning of relaxed ccg grammars for parsing to logical form",
"authors": [
{
"first": "S",
"middle": [],
"last": "Luke",
"suffix": ""
},
{
"first": "Michael",
"middle": [],
"last": "Zettlemoyer",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Collins",
"suffix": ""
}
],
"year": 2007,
"venue": "EMNLP-CoNLL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Luke S Zettlemoyer and Michael Collins. 2007. On- line learning of relaxed ccg grammars for parsing to logical form. EMNLP-CoNLL 2007, page 678.",
"links": null
},
"BIBREF53": {
"ref_id": "b53",
"title": "Type-driven incremental semantic parsing with polymorphism",
"authors": [
{
"first": "Kai",
"middle": [],
"last": "Zhao",
"suffix": ""
},
{
"first": "Liang",
"middle": [],
"last": "Huang",
"suffix": ""
}
],
"year": 2015,
"venue": "Proceedings of the 2015 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies",
"volume": "",
"issue": "",
"pages": "1416--1421",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kai Zhao and Liang Huang. 2015. Type-driven in- cremental semantic parsing with polymorphism. In Proceedings of the 2015 Conference of the North American Chapter of the Association for Computa- tional Linguistics: Human Language Technologies, pages 1416-1421.",
"links": null
}
},
"ref_entries": {
"FIGREF1": {
"num": null,
"uris": null,
"text": "Figure 1: We use an example from SPIDER to illustrate the model inputs: tokens from the given utterance, x, a set of potentially relevant entities, e, and their relations. We selected two edge label types to highlight: edges denoting that an entity spans a token, and edges between entities that, for SPIDER, indicate a foreign key relationship between columns, or an ownership relationship between columns and tables.",
"type_str": "figure"
},
"TABREF3": {
"num": null,
"html": null,
"content": "<table><tr><td>Edge Ablations</td><td>GEO ATIS</td></tr><tr><td>GNN w/ edge vectors</td><td>89.3 87.1</td></tr><tr><td colspan=\"2\">\u2212 entity span edges 88.6 34.2</td></tr></table>",
"text": "Results for ablating information about entity candidate spans for GEO and ATIS.",
"type_str": "table"
}
}
}
} |