File size: 140,312 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 | {
"paper_id": "Q13-1007",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T15:08:38.792946Z"
},
"title": "An HDP Model for Inducing Combinatory Categorial Grammars",
"authors": [
{
"first": "Yonatan",
"middle": [],
"last": "Bisk",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "The University of Illinois at Urbana-Champaign",
"location": {
"addrLine": "201 N Goodwin Ave Urbana",
"postCode": "61801",
"region": "IL"
}
},
"email": "bisk1@illinois.edu"
},
{
"first": "Julia",
"middle": [],
"last": "Hockenmaier",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "The University of Illinois at Urbana-Champaign",
"location": {
"addrLine": "201 N Goodwin Ave Urbana",
"postCode": "61801",
"region": "IL"
}
},
"email": "juliahmr@illinois.edu"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "We introduce a novel nonparametric Bayesian model for the induction of Combinatory Categorial Grammars from POS-tagged text. It achieves state of the art performance on a number of languages, and induces linguistically plausible lexicons.",
"pdf_parse": {
"paper_id": "Q13-1007",
"_pdf_hash": "",
"abstract": [
{
"text": "We introduce a novel nonparametric Bayesian model for the induction of Combinatory Categorial Grammars from POS-tagged text. It achieves state of the art performance on a number of languages, and induces linguistically plausible lexicons.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "What grammatical representation is appropriate for unsupervised grammar induction? Initial attempts with context-free grammars (CFGs) were not very successful (Carroll and Charniak, 1992; Charniak, 1993) . One reason may be that CFGs require the specification of a finite inventory of nonterminal categories and rewrite rules, but unless one adopts linguistic principles such as X-bar theory (Jackendoff, 1977) , these nonterminals are essentially arbitrary labels that can be combined in arbitrary ways. While further CFG-based approaches have been proposed (Clark, 2001 ; Kurihara and Sato, 2004) , most recent work has followed Klein and Manning (2004) in developing models for the induction of projective dependency grammars. It has been shown that more sophisticated probability models (Headden III et al., 2009; Gillenwater et al., 2011; Cohen and Smith, 2010) and learning regimes (Spitkovsky et al., 2010) , as well as the incorporation of prior linguistic knowledge (Cohen and Smith, 2009; Berg-Kirkpatrick and Klein, 2010; Naseem et al., 2010) can lead to significant improvement over Klein and Manning's baseline model. The use of dependency grammars circumvents the question of how to obtain an appropriate inventory of categories, since dependency parses are simply defined by unlabeled edges between the lexical items in the sentence. But dependency grammars make it also difficult to capture non-local structures, and Blunsom and Cohn (2010) show that it may be advantageous to reformulate the underlying dependency grammar in terms of a tree-substitution grammar (TSG) which pairs words with treelets that specify the number of left and right dependents they have. In this paper, we explore yet another option: instead of dependency grammars, we use Combinatory Categorial Grammar (CCG, Steedman (1996; 2000) ), a linguistically expressive formalism that pairs lexical items with rich categories that capture all language-specific information. This may seem a puzzling choice, since CCG requires a significantly larger inventory of categories than is commonly assumed for CFGs. However, unlike CFG nonterminals, CCG categories are not arbitrary symbols: they encode, and are determined by, the basic word order of the language and the number of arguments each word takes. CCG is very similar to TSG in that it also pairs lexical items with rich items that capture all language-specific information. Like TSG and projective dependency grammars, we restrict ourselves to a weakly contextfree fragment of CCG. But while TSG does not distinguish between argument and modifier dependencies, CCG makes an explicit distinction between the two. And while the elementary trees of Blunsom and Cohn (2010)'s TSG and their internal nodel labels have no obvious linguistic interpretation, the syntactic behavior of any CCG constituent can be directly inferred from its category. To see whether the algorithm has identified the basic syntactic properties of the language, it is hence sufficient to inspect the induced lexicon. Conversely, Boonkwan and Steedman (2011) show that knowledge of these basic syntactic properties makes it very easy to create a language-specific lexicon for accurate unsupervised CCG parsing. We have recently proposed an algorithm for inducing CCGs (Bisk and Hockenmaier, 2012b ) that has been shown to be competitive with other approaches even when paired with a very simple probability model (Gelling et al., 2012) . In this paper, we pair this induction algorithm with a novel nonparametric Bayesian model that is based on a different factorization of CCG derivations, and show that it outperforms our original model and many other approaches on a large number of languages. Our results indicate that the use of CCG yields grammars that are significantly more robust when dealing with longer sentences than most dependency grammar-based approaches.",
"cite_spans": [
{
"start": 159,
"end": 187,
"text": "(Carroll and Charniak, 1992;",
"ref_id": "BIBREF7"
},
{
"start": 188,
"end": 203,
"text": "Charniak, 1993)",
"ref_id": "BIBREF8"
},
{
"start": 392,
"end": 410,
"text": "(Jackendoff, 1977)",
"ref_id": "BIBREF26"
},
{
"start": 559,
"end": 571,
"text": "(Clark, 2001",
"ref_id": "BIBREF10"
},
{
"start": 574,
"end": 598,
"text": "Kurihara and Sato, 2004)",
"ref_id": "BIBREF28"
},
{
"start": 631,
"end": 655,
"text": "Klein and Manning (2004)",
"ref_id": "BIBREF27"
},
{
"start": 791,
"end": 817,
"text": "(Headden III et al., 2009;",
"ref_id": "BIBREF21"
},
{
"start": 818,
"end": 843,
"text": "Gillenwater et al., 2011;",
"ref_id": "BIBREF19"
},
{
"start": 844,
"end": 866,
"text": "Cohen and Smith, 2010)",
"ref_id": "BIBREF12"
},
{
"start": 888,
"end": 913,
"text": "(Spitkovsky et al., 2010)",
"ref_id": "BIBREF41"
},
{
"start": 975,
"end": 998,
"text": "(Cohen and Smith, 2009;",
"ref_id": "BIBREF11"
},
{
"start": 999,
"end": 1032,
"text": "Berg-Kirkpatrick and Klein, 2010;",
"ref_id": "BIBREF0"
},
{
"start": 1033,
"end": 1053,
"text": "Naseem et al., 2010)",
"ref_id": "BIBREF36"
},
{
"start": 1095,
"end": 1104,
"text": "Klein and",
"ref_id": null
},
{
"start": 1445,
"end": 1456,
"text": "Cohn (2010)",
"ref_id": "BIBREF13"
},
{
"start": 1797,
"end": 1818,
"text": "(CCG, Steedman (1996;",
"ref_id": null
},
{
"start": 1819,
"end": 1824,
"text": "2000)",
"ref_id": "BIBREF43"
},
{
"start": 3041,
"end": 3069,
"text": "Boonkwan and Steedman (2011)",
"ref_id": "BIBREF5"
},
{
"start": 3279,
"end": 3307,
"text": "(Bisk and Hockenmaier, 2012b",
"ref_id": "BIBREF3"
},
{
"start": 3424,
"end": 3446,
"text": "(Gelling et al., 2012)",
"ref_id": "BIBREF17"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Combinatory Categorial Grammar (Steedman, 2000) is a linguistically expressive, lexicalized grammar formalism that associates rich syntactic types with words and constituents. For simplicity, we restrict ourselves to the standard two atomic types S (sentences) and N (encompassing both nouns and noun phrases) from which we recursively build categories. Complex categories are of the form X/Y or X\\Y, and represent functions which return a result of type X when combined with an argument of type Y. The directionality of the slash indicates whether the argument precedes or follows the functor. We write X|Y when the direction of the slash does not matter.",
"cite_spans": [
{
"start": 31,
"end": 47,
"text": "(Steedman, 2000)",
"ref_id": "BIBREF43"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Combinatory Categorial Grammar",
"sec_num": "2"
},
{
"text": "The CCG lexicon encodes all language-specific information. It pairs every word with a set of categories that define both its specific syntactic behavior as well as the overall word order of the language: To draw a simple contrast, in Spanish we would expect adjectives to take the category N\\N because Spanish word ordering dictates that the adjective follow the noun. The lexical categories also capture word-word dependencies: head-argument relations are captured by the lexical category of the head (e.g. (S\\N)/N), whereas head-modifier relations are captured by the lexical category of the modifier, which is of the form X\\X or X/X, and may take further arguments of its own. Our goal will be to automatically learn these types of lexicons for a language. In Figure 3 , we juxtapose several such lexicons which were automatically discovered by our system.",
"cite_spans": [],
"ref_spans": [
{
"start": 763,
"end": 771,
"text": "Figure 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Combinatory Categorial Grammar",
"sec_num": "2"
},
{
"text": "N : {he, girl , lunch, ...} N/N : {good ,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Combinatory Categorial Grammar",
"sec_num": "2"
},
{
"text": "The rules of CCG are defined by a small set of of combinatory rules, which are traditionally written as schemas that define how constituents can be combined in a bottom-up fashion (although generative probability models for CCG view them in a topdown manner, akin to CFG rules). The first, and most obvious, of these rules is function application:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Combinatory Categorial Grammar",
"sec_num": "2"
},
{
"text": "X/Y Y \u21d2 X (B 0 > ) Y X\\Y \u21d2 X (B 0 < )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Combinatory Categorial Grammar",
"sec_num": "2"
},
{
"text": "Here the functor X/Y or X\\Y is applied to an argument Y resulting in X. While standard CCG has a number of additional combinatory rules (typeraising, generalized variants of composition and substitution) that increase its generative capacity beyond context-free grammars and allow an elegant treatment of non-local dependencies arising in extraction, coordination and scrambling, we follow Bisk and Hockenmaier (2012b) and use a restricted fragment, without type-raising, that allows only basic composition and is context-free:",
"cite_spans": [
{
"start": 390,
"end": 418,
"text": "Bisk and Hockenmaier (2012b)",
"ref_id": "BIBREF3"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Combinatory Categorial Grammar",
"sec_num": "2"
},
{
"text": "X/Y Y/Z \u21d2 X/Z (B 1 > ) X/Y Y\\Z \u21d2 X\\Z (B 1 X> ) Y\\Z X\\Y \u21d2 X\\Z (B 1 < ) Y/Z X\\Y \u21d2 X/Z (B 1 X< )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Combinatory Categorial Grammar",
"sec_num": "2"
},
{
"text": "The superscript 1 denotes the arity of the composition which is too low to recover non-projective dependencies, and our grammar is thus weakly equivalent to the dependency grammar representations that are commonly used for grammar induction. The main role of composition in our fragment is that it allows sentential and verb modifiers to both take categories of the form S\\S and S/S. Composition in-troduces spurious ambiguities, which we eliminate by using Eisner (1996) 's normal form. 1 Coordinating conjunctions have a special category conj, and we binarize coordination as follows (Hockenmaier and Steedman, 2007) :",
"cite_spans": [
{
"start": 458,
"end": 471,
"text": "Eisner (1996)",
"ref_id": "BIBREF16"
},
{
"start": 488,
"end": 489,
"text": "1",
"ref_id": null
},
{
"start": 586,
"end": 618,
"text": "(Hockenmaier and Steedman, 2007)",
"ref_id": "BIBREF25"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Combinatory Categorial Grammar",
"sec_num": "2"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "X X[conj] \u21d2 &1 X (&1) conj X \u21d2 &2 X[conj]",
"eq_num": "(&2)"
}
],
"section": "Combinatory Categorial Grammar",
"sec_num": "2"
},
{
"text": "3 Category induction",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Combinatory Categorial Grammar",
"sec_num": "2"
},
{
"text": "Unlike dependency grammars, CCG requires an inventory of lexical categories. Given a set of lexical categories, the combinatory rules define the set of parses for each sentence. We follow the algorithm proposed by Bisk and Hockenmaier (2012b) to automatically induce these categories. The lexicon is initialized by pairing all nominal tags (nouns, pronouns and determiners) with the category N, all verb tags with the category S, and coordinating conjunctions with the category conj:",
"cite_spans": [
{
"start": 214,
"end": 242,
"text": "Bisk and Hockenmaier (2012b)",
"ref_id": "BIBREF3"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Combinatory Categorial Grammar",
"sec_num": "2"
},
{
"text": "CONJ \u2192 conj DET, NOUN, NUM, PRON \u2192 N VERB",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Combinatory Categorial Grammar",
"sec_num": "2"
},
{
"text": "\u2192 S Although our lexicons are defined over corpusspecific POS tags, we use a slightly modified version of Petrov et al. (2012) 's Universal POS tagset to categorize them into these broad classes. The primary changes we make to their mappings are the addition of a distinction (where possible) between subordinating and coordinating conjunctions and between main and auxiliary verbs 2 .",
"cite_spans": [
{
"start": 106,
"end": 126,
"text": "Petrov et al. (2012)",
"ref_id": "BIBREF39"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Combinatory Categorial Grammar",
"sec_num": "2"
},
{
"text": "Since the initial lexicon consists only of atomic categories, it cannot parse any complex sentences:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Combinatory Categorial Grammar",
"sec_num": "2"
},
{
"text": "The man ate quickly DT NNS VBD RB - N S -",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Combinatory Categorial Grammar",
"sec_num": "2"
},
{
"text": "Complex lexical categories are induced by considering the local context in which tokens appear. Given an input sentence, and a current lexicon which assigns categories to at least some of the tokens in the sentence, we apply the following two rules to add new categories to the lexicon: The argument rule allows any lexical tokens that have categories other than N and conj to take immediately adjacent Ns as arguments. The modifier rule allows any token (other than coordinating conjunctions that appear in the middle of sentences) to modify an immediate neighbor that has the category S or N or is a modifier (S|S or N|N) itself. These rules can be applied iteratively to form more complex categories. We restrict lexical categories to a maximal arity of 2, and disallow the category (S/N)\\N, since it is equivalent to (S\\N)/N.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Combinatory Categorial Grammar",
"sec_num": "2"
},
{
"text": "The man ate quickly DT NNS VBD RB N/N, N, S/S S, N\\N, S\\S, (S/S)/(S/S)(N\\N)/(N\\N) S\\N (N\\N)\\(N\\N) (N/N)\\(N/N) (S/S)\\(S/S) (S\\S)/(S\\S)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Combinatory Categorial Grammar",
"sec_num": "2"
},
{
"text": "The resultant, overly general, lexicon is then used to parse the training data. Each complete parse has to be of category S or N, with the constraint that sentences that contain a main verb can only form parses of category S.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Combinatory Categorial Grammar",
"sec_num": "2"
},
{
"text": "Generative models define the probability of a parse tree \u03c4 as the product of individual rule probabilities. Our previous work (Bisk and Hockenmaier, 2012b) uses the most basic model of Hockenmaier and Steedman (2002) , which first generates the head direction (left, right, unary, or lexical), followed by the head category, and finally the sister category. 3 This factorization does not take advantage of the unique functional nature of CCG. We therefore introduce a new factorization we call the Argument Model. It exploits the fact that CCG imposes strong constraints on a category's left and right children, since these must combine to create the parent type via one of the combinators. In practice this means that given the parent X/Z, the choice of combinator 4 c and an argument Y we can uniquely determine the categories of the left and right children:",
"cite_spans": [
{
"start": 126,
"end": 155,
"text": "(Bisk and Hockenmaier, 2012b)",
"ref_id": "BIBREF3"
},
{
"start": 185,
"end": 216,
"text": "Hockenmaier and Steedman (2002)",
"ref_id": "BIBREF24"
},
{
"start": 358,
"end": 359,
"text": "3",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "A new probability model for CCG",
"sec_num": "4"
},
{
"text": "Parent c \u21d2 Left Right X/Z B 0 > (X/Z)/Y Y B 0 < Y (X/Z)\\Y B 1 > X/Y Y/Z B 1 < Y/Z",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A new probability model for CCG",
"sec_num": "4"
},
{
"text": "X\\Y and correspondingly for X\\Z:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A new probability model for CCG",
"sec_num": "4"
},
{
"text": "Parent c \u21d2 Left Right X\\Z B 0 > (X\\Z)/Y Y B 0 < Y (X\\Z)\\Y B 1 > X/Y Y\\Z B 1 < Y\\Z X\\Y",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A new probability model for CCG",
"sec_num": "4"
},
{
"text": "While type-changing and raising are not used in this work the model's treatment of root productions extends easily to handle these other unary cases. We simply treat the argument Y as the unary outcome so that the parent, combinator and argument uniquely specify every detail of the unary rule:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A new probability model for CCG",
"sec_num": "4"
},
{
"text": "Parent c \u21d2 Y TOP TOP \u2208 {S, N} S/(S\\N) T < N S\\(S/N) T > N",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A new probability model for CCG",
"sec_num": "4"
},
{
"text": "We still distinguish the same rule types as before (lexical, unary, binary with head left/right), leading us to the following model definition:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A new probability model for CCG",
"sec_num": "4"
},
{
"text": "Given: P := X/Z where type(t) \u2208 {Left,Right,Unary,Lex} p(t|P) \u00d7 p(w|P, t) Lex p(Y|P, t) \u00d7 p(c|P, t, Y) o.w.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A new probability model for CCG",
"sec_num": "4"
},
{
"text": "Note that this model generates only one CCG category but uniquely defines the two children of a parent node. We will see below that this greatly simplifies the development of non-parametric extensions.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Argument Combinator",
"sec_num": null
},
{
"text": "Simple generative models such as PCFGs or Bisk and Hockenmaier (2012b)'s CCG model are not robust in the face of sparsity, since they assign zero probability to any unseen event. Sparsity is a particular problem for formalisms like CCG that have a rich inventory of object types. Nonparametric Bayesian models, e.g. Dirichlet Processes (Teh, 2010) or their hierarchical variants (Teh et al., 2006) and generalizations (Teh, 2006) overcome this problem in a very elegant manner, and are used by many state-of-the-art grammar induction systems (Naseem et al., 2010; Blunsom and Cohn, 2010; Boonkwan and Steedman, 2011) . They also impose a rich-getting-richer behavior that seems to be advantageous in many modeling applications. By contrast, Bisk and Hockenmaier (2012b) propose a weighted top-k scheme to address these issues in an ad-hoc manner.",
"cite_spans": [
{
"start": 336,
"end": 347,
"text": "(Teh, 2010)",
"ref_id": "BIBREF46"
},
{
"start": 379,
"end": 397,
"text": "(Teh et al., 2006)",
"ref_id": "BIBREF45"
},
{
"start": 418,
"end": 429,
"text": "(Teh, 2006)",
"ref_id": "BIBREF45"
},
{
"start": 542,
"end": 563,
"text": "(Naseem et al., 2010;",
"ref_id": "BIBREF36"
},
{
"start": 564,
"end": 587,
"text": "Blunsom and Cohn, 2010;",
"ref_id": "BIBREF13"
},
{
"start": 588,
"end": 616,
"text": "Boonkwan and Steedman, 2011)",
"ref_id": "BIBREF5"
},
{
"start": 741,
"end": 769,
"text": "Bisk and Hockenmaier (2012b)",
"ref_id": "BIBREF3"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "HDP-CCG: a nonparametric model",
"sec_num": "5"
},
{
"text": "The argument model introduced above lends itself particularly well to nonparametric extensions such as the standard Hierarchical Dirichlet Processes (HDP). In this work the size of the grammar and the number of productions are fixed and small, but we present the formulation as infinite to allow for easy extension in the future. Specifically, this framework allows for extensions which grow the grammar during parsing/training or fully lexicalize the productions. Additionally, while our current work uses only a restricted fragment of CCG that has only a finite set of categories, the literature's generalized variants of composition make it possible to generate categories of unbounded arity. We therefore believe that this is a very natural probabilistic framework for CCG, since HDPs make it possible to consider a potentially infinite set of categories that can instantiate the Y slot, while allowing the model to capture language-specific preferences for the set of categories that can appear in this position.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "HDP-CCG: a nonparametric model",
"sec_num": "5"
},
{
"text": "The HDP-CCG model In Bayesian models, multinomials are drawn from a corresponding ndimensional Dirichlet distribution. The Dirichlet Process (DP) generalizes the Dirichlet distribution to an infinite number of possible outcomes, allowing us to deal with a potentially infinite set of categories or words. DPs are defined in terms of a base distribution H that corresponds to the mean of the DP, and a concentration or shape parameter \u03b1. In a Hierarchical Dirichlet Process , there is a hierarchy of DPs, such that the base distribution of a DP at level n is a DP at level n \u2212 1.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "HDP-CCG: a nonparametric model",
"sec_num": "5"
},
{
"text": "The HDP-CCG ( Figure 1 ) is a reformulation of the Argument Model introduced above in terms of Hierarchical Dirichlet Processes. 5 At the heart of the model is a distribution over CCG categories. By combining a stick breaking process with a multinomial over categories we can define a DP over CCG HDP-CCG 1) Draw global parameters Define MLE root parameter \u03b8 TOP Draw top-level symbol weights",
"cite_spans": [
{
"start": 129,
"end": 130,
"text": "5",
"ref_id": null
}
],
"ref_spans": [
{
"start": 14,
"end": 22,
"text": "Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "HDP-CCG: a nonparametric model",
"sec_num": "5"
},
{
"text": "\u03b2 Y \u223c GEM(\u03b1 Y ) Draw top-level lexical weights \u03b2 L \u223c GEM(\u03b1 L ) For each grammar symbol z \u2208 {1, 2, ...}:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "HDP-CCG: a nonparametric model",
"sec_num": "5"
},
{
"text": "Define MLE rule type parameters",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "HDP-CCG: a nonparametric model",
"sec_num": "5"
},
{
"text": "\u03b8 T z Draw argument parameters \u03c6 Y z \u223c DP(\u03b1 Y , \u03b2 Y ) Draw lexical emission parameters \u03c6 L z \u223c DP(\u03b1 L , \u03b2 L ) For each grammar symbol y \u2208 {1, 2, ...}:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "HDP-CCG: a nonparametric model",
"sec_num": "5"
},
{
"text": "Define MLE combinator parameters \u03b8 C z,y",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "HDP-CCG: a nonparametric model",
"sec_num": "5"
},
{
"text": "2) For each parse tree: Generate root node z TOP \u223c Binomial(\u03b8 TOP ) For each node i in the parse tree:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "HDP-CCG: a nonparametric model",
"sec_num": "5"
},
{
"text": "Choose rule type",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "HDP-CCG: a nonparametric model",
"sec_num": "5"
},
{
"text": "t i \u223c Multinomial(\u03b8 T zi ) If t i == Lex: Emit terminal symbol x i \u223c Multinomial(\u03c6 L zi ) If t i == Left/Right/Unary: Generate argument category y i \u223c Multinomial(\u03c6 Y zi ) Generate combinator c i \u223c Multinomial(\u03b8 C zi,yi ) Deterministically create z L(i) (and z R(i) if binary) z i y i c i z L(i) z R(i) x L(i) x R(i) z \u221e \u221e y \u03c6 Y \u03b8 T \u03b8 C \u03c6 L \u03b2 Y \u03b2 L",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "HDP-CCG: a nonparametric model",
"sec_num": "5"
},
{
"text": "Because we are working with CCG, the parent z i , argument y i and combinator c i uniquely define the two children categories (z L(i) , z R(i) ). The dashed arrows here represent the deterministic process used to generate these two categories. Figure 1 : The HDP-CCG has two base distributions, one over the space of categories and the other over words (or tags). For every grammar symbol, an argument distribution and emission distribution is drawn from the corresponding Dirichlet Processes. In addition, there are several MLE distributions tied to a given symbol for generating rule types, combinators and lexical tokens.",
"cite_spans": [],
"ref_spans": [
{
"start": 244,
"end": 252,
"text": "Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "HDP-CCG: a nonparametric model",
"sec_num": "5"
},
{
"text": "categories whose stick weights (\u03b2 Y ) correspond to the frequency of the category in the corpus. Next we build the hierarchical component of our model by choosing an argument distribution (\u03c6 Y ), again over the space of categories, for every parent X/Z. This argument distribution is drawn from the previously defined base DP, allowing for an important level of parameter tying across all argument distributions.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "HDP-CCG: a nonparametric model",
"sec_num": "5"
},
{
"text": "While the base DP does define the mean around which all argument distributions are drawn, we also require a notion of variance or precision which determines how similar individual draws will be. This precision is determined by the magnitude of the hyperparameter \u03b1 Y . This hierarchy is paralleled for lexical productions which are drawn from a unigram base DP over terminal symbols controlled by \u03b1 L . For simplicity we use the same scheme for setting the values for \u03b1 L as \u03b1 Y . We present experimental results in which we vary the value of \u03b1 Y as a function of the number of outcomes allowed by the grammar for argument categories or the corpus in the case of terminal symbols. Specifically, we set \u03b1 Y = n p for conditioning contexts with n outcomes. Since Liang et al. (2009) found that the ideal value for alpha appears to be superlinear but subquadratic in n, we present results where p takes the values 0, 1.0, 1.5, and 2.0 to explore the range from uniform to quadratic. This setting for \u03b1 is the only free parameter in the model. By controlling precision we can tell the model to what extent global corpus statistics should be trusted. We believe this has a similar effect to Bisk and Hockenmaier (2012b)'s top-k upweighting and smoothing scheme.",
"cite_spans": [
{
"start": 761,
"end": 780,
"text": "Liang et al. (2009)",
"ref_id": "BIBREF33"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "HDP-CCG: a nonparametric model",
"sec_num": "5"
},
{
"text": "One advantage of the argument model is that it only requires a single distribution over categories for each binary tree. In contrast to similar proposals for CFGs (Liang et al., 2007) , which impose no formal restrictions on the nonterminals X, Y, Z that can appear in a rewrite rule X \u2192 Y Z, this greatly simplifies the modeling problem (yielding effectively a model that is more akin to nonparametric HMMs), since it avoids the need to capture correlations be-tween different base distributions for Y and Z.",
"cite_spans": [
{
"start": 163,
"end": 183,
"text": "(Liang et al., 2007)",
"ref_id": "BIBREF32"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "HDP-CCG: a nonparametric model",
"sec_num": "5"
},
{
"text": "Variational Inference HDPs need to be estimated with approximate techniques. As an alternative to Gibbs sampling , which is exact, but typically very slow and has no clear convergence criteria, variational inference algorithms (Bishop, 2006; Blei and Jordan, 2004) estimate the parameters of a truncated model to maximize a lower bound of the likelihood of the actual model. This allows for factorization of the model and a training procedure analogous to the Inside-Outside algorithm (Lari and Young, 1991) , allowing training to run very quickly and in a trivially parallelizable manner.",
"cite_spans": [
{
"start": 227,
"end": 241,
"text": "(Bishop, 2006;",
"ref_id": null
},
{
"start": 242,
"end": 264,
"text": "Blei and Jordan, 2004)",
"ref_id": "BIBREF4"
},
{
"start": 485,
"end": 507,
"text": "(Lari and Young, 1991)",
"ref_id": "BIBREF31"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "HDP-CCG: a nonparametric model",
"sec_num": "5"
},
{
"text": "To initialize the base DP's stick weights, we follow the example of Kurihara et al. (2007) and use an MLE model initialized with uniform distributions to compute global counts for the categories in our grammar. When normalized these provide a better initialization than a uniform set of weights. Updates to the distributions are then performed in a coordinate descent manner which includes re-estimation of the base DPs.",
"cite_spans": [
{
"start": 68,
"end": 90,
"text": "Kurihara et al. (2007)",
"ref_id": "BIBREF29"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "HDP-CCG: a nonparametric model",
"sec_num": "5"
},
{
"text": "In variational inference, multinomial weights W take the place of probabilities. The weights for an outcome Y with conditioning variable P are computed by summing pseudocounts with a scaled mean vector from the base DP. The computation involves moving in the direction of the gradient of the Dirichlet distribution which results in the following difference of Digammas (\u03a8):",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "HDP-CCG: a nonparametric model",
"sec_num": "5"
},
{
"text": "W P (Y ) = \u03a8(C(P, Y ) + \u03b1 P \u03b2 Y ) \u2212 \u03a8(C(P, * ) + \u03b1 P )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "HDP-CCG: a nonparametric model",
"sec_num": "5"
},
{
"text": "Importantly, the Digamma and multinomial weights comprise a righ-get-richer scheme, biasing the model against rare outcomes. In addition, since variational inference is done by coordinate descent, it is trivially parallelizeable. In practice, training and testing our models on the corpora containing sentences up to length 15 used in this paper takes between one minute to at most three hours on a single 12-core machine depending on their size.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "HDP-CCG: a nonparametric model",
"sec_num": "5"
},
{
"text": "As is standard for this task, we evaluate our systems against a number of different dependency treebanks, and measure performance in terms of the accuracy of directed dependencies (i.e. the percentage of words in the test corpus that are correctly attached). We use the data from the PASCAL challenge for grammar induction (Gelling et al., 2012) , the data from the CoNLL-X shared task (Buchholz and Marsi, 2006) and Goldberg (2011) 's Hebrew corpus.",
"cite_spans": [
{
"start": 323,
"end": 345,
"text": "(Gelling et al., 2012)",
"ref_id": "BIBREF17"
},
{
"start": 386,
"end": 412,
"text": "(Buchholz and Marsi, 2006)",
"ref_id": "BIBREF6"
},
{
"start": 417,
"end": 432,
"text": "Goldberg (2011)",
"ref_id": "BIBREF20"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation",
"sec_num": "6"
},
{
"text": "Converting CCG derivations into dependencies is mostly straightforward, since the CCG derivation identifies the root word of each sentence, and headargument and head-modifier dependencies are easily read off of CCG derivations, since the lexicon defines them explicitly. Unlike dependency grammar, CCG is designed to recover non-local dependencies that arise in control and binding constructions as well as in wh-extraction and non-standard coordination, but since this requires re-entrancies, or coindexation of arguments (Hockenmaier and Steedman, 2007) , within the lexical categories that trigger these constructions, our current system returns only local dependencies. But since dependency grammars also captures only local dependencies, this has no negative influence on our current evaluation.",
"cite_spans": [
{
"start": 523,
"end": 555,
"text": "(Hockenmaier and Steedman, 2007)",
"ref_id": "BIBREF25"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation",
"sec_num": "6"
},
{
"text": "However, a direct comparison between dependency treebanks and dependencies produced by CCG is more difficult (Clark and Curran, 2007) , since dependency grammars allow considerable freedom in how to analyze specific constructions such as verb clusters (which verb is the head?) prepositional phrases and particles (is the head the noun or the preposition/particle?), subordinating conjunctions (is the conjunction a dependent of the head of the main clause and the head of the embedded clause a dependent of the conjunction, or vice versa?) and this is reflected in the fact that the treebanks we consider often apply different conventions for these cases. Although remedying this issue is beyond the scope of this work, these discrepancies very much hint at the need for a better mechanism to evaluate linguistically equivalent structures or treebank standardization.",
"cite_spans": [
{
"start": 109,
"end": 133,
"text": "(Clark and Curran, 2007)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation",
"sec_num": "6"
},
{
"text": "The most problematic construction is coordination. In standard CCG-to-dependency schemes, both conjuncts are independent, and the conjunction itself is not attached to the dependency graph, whereas dependency grammars have to stipulate that either one of the conjuncts or the conjunction itself is the head, with multiple possibilities of where the remaining constituents attach. In addition to the standard CCG scheme, we have identified five main styles of conjunction in our data (Figure 2 ), although several corpora distinguish multiple types of coordinating conjunctions which use different styles (not all shown here). Since our system has explicit rules for coordination, we transform its output into the desired target representation that is specific to each language.",
"cite_spans": [],
"ref_spans": [
{
"start": 483,
"end": 492,
"text": "(Figure 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Evaluation",
"sec_num": "6"
},
{
"text": "We evaluate our system on 13 different languages. In each case, we follow the test and training regimes that were used to obtain previously published results in order to allow a direct comparison. We compare our system to the results presented at the PAS-CAL Challenge on Grammar Induction (Gelling et al., 2012) 6 , as well as to Gillenwater et al. (2011) and Naseem et al. (2012) . We use Nivre (2006) 's Penn2Malt implementation of Collins (2003) 's head rules to translate the WSJ Penn Treebank (Marcus et al., 1993) into dependencies. Finally, when training the MLE version of our model we use a simple smoothing scheme which defines a small rule probability (e \u221215 ) to prevent any rule used during training from going to zero.",
"cite_spans": [
{
"start": 290,
"end": 314,
"text": "(Gelling et al., 2012) 6",
"ref_id": null
},
{
"start": 331,
"end": 356,
"text": "Gillenwater et al. (2011)",
"ref_id": "BIBREF19"
},
{
"start": 361,
"end": 381,
"text": "Naseem et al. (2012)",
"ref_id": "BIBREF37"
},
{
"start": 391,
"end": 403,
"text": "Nivre (2006)",
"ref_id": "BIBREF38"
},
{
"start": 435,
"end": 449,
"text": "Collins (2003)",
"ref_id": "BIBREF14"
},
{
"start": 499,
"end": 520,
"text": "(Marcus et al., 1993)",
"ref_id": "BIBREF34"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Experiments",
"sec_num": "7"
},
{
"text": "In Table 1 , we compare the performance of the basic Argument model (MLE), of our HDP model with four different settings of the hyperparameters (as explained above) and of the systems presented in the PASCAL Challenge on Grammar Induction (Gelling et al., 2012) . The systems in this competition were instructed to train over the full dataset, including the unlabelled test data, and include Bisk and Hockenmaier (2012a)'s CCG-based system (BH) to Cohn et al. (2010) 's reimplementation of Klein and Manning (2004) 's DMV model in a tree-substitution grammar framework (BC), as well as three other dependency based systems which either incorporate Naseem et al. (2010) 's rules in a deterministic fashion (S\u00f8gaard, 2012) , rely on extensive tuning on the development set (Tu, 2012) or incorporate millions of additional tokens from Wikipedia to estimate model parameters (Marecek and Zabokrtsky, 2012) . We ignore punctuation for all experiments reported in this paper, but since the training data (but not the evaluation) includes punctuation marks, participants were free to choose whether to include punctuation or ignore it. While BH is the only other system with directly interpretable linguistic output, we also include a direct comparison with BC, whose TSG representation is equally expressive to ours. Finally we present a row with the maximum performance among the other three models. As we have no knowledge of how much data was used in the training of other systems we simply present results for systems trained on length 15 (not including punctuation) sentences and then evaluated at lengths 10 and 15.",
"cite_spans": [
{
"start": 239,
"end": 261,
"text": "(Gelling et al., 2012)",
"ref_id": "BIBREF17"
},
{
"start": 448,
"end": 466,
"text": "Cohn et al. (2010)",
"ref_id": "BIBREF13"
},
{
"start": 490,
"end": 514,
"text": "Klein and Manning (2004)",
"ref_id": "BIBREF27"
},
{
"start": 648,
"end": 668,
"text": "Naseem et al. (2010)",
"ref_id": "BIBREF36"
},
{
"start": 705,
"end": 720,
"text": "(S\u00f8gaard, 2012)",
"ref_id": "BIBREF40"
},
{
"start": 771,
"end": 781,
"text": "(Tu, 2012)",
"ref_id": "BIBREF47"
},
{
"start": 871,
"end": 901,
"text": "(Marecek and Zabokrtsky, 2012)",
"ref_id": "BIBREF35"
}
],
"ref_spans": [
{
"start": 3,
"end": 10,
"text": "Table 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "PASCAL Challenge on Grammar Induction",
"sec_num": "7.1"
},
{
"text": "The MLE version of our model shows rather variable performance: although its results are particularly bad on Basque (Eu), it outperforms both BH and BC on some other settings. By contrast, the HDP system is always better than the MLE model. It outperforms all other systems on half of the corpora. On average, it outperforms BH and BC by 10.3% and 9.3% on length 10, or 9.7% and 7.8 % on length 15 respectively. The main reason why our system does not outperform BC by an even higher margin is the very obvious 11.4%/11.5% deficit on Slovene. However, the Slovene dependency treebank seems to follow a substantially different annotation scheme. In particular, the gold standard annotation of the 1,000 sentences in the Slovene development set treats many of them as consisting of independent sentences (often separated by punctuation marks that our system has no access to), so that the average number of roots per sentence is 2.7:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "PASCAL Challenge on Grammar Induction",
"sec_num": "7.1"
},
{
"text": ">> \" verjeti believe ti I , , \"",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "PASCAL Challenge on Grammar Induction",
"sec_num": "7.1"
},
{
"text": "je is mehko soft rekla said",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "PASCAL Challenge on Grammar Induction",
"sec_num": "7.1"
},
{
"text": "When our system is presented with these short components in isolation, it oftentimes analyzes them correctly, but since it has to return a tree with a single root, its performance degrades substantially.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "PASCAL Challenge on Grammar Induction",
"sec_num": "7.1"
},
{
"text": "We believe the HDP performs so well as compared to the MLE model because of the influence of the shared base distribution, which allows the +/\u2212 -0.8/-1.7 +3.8/+2.5 -11.4/-15.4 +1.7/+3.5 +6.7/+2.4 -3.1/-3.9 +5.5/+3.3 -0.5/-1.9 +12.7/+13.5 -2.5/-3.7 Table 1 : A comparison of the basic Argument model (MLE) and four hyper-parameter settings of the HDP-CCG against two syntactic formalisms that participated in the PASCAL Challenge (Gelling et al., 2012) , BH (Bisk and Hockenmaier, 2012a) and BC (Blunsom and Cohn, 2010) , in addition to a max over all other participants. We trained on length 15 data (punctuation removed), including the test data as recommended by the organizers. The last row indicates the difference between our best system and the competition.",
"cite_spans": [
{
"start": 429,
"end": 451,
"text": "(Gelling et al., 2012)",
"ref_id": "BIBREF17"
},
{
"start": 457,
"end": 486,
"text": "(Bisk and Hockenmaier, 2012a)",
"ref_id": "BIBREF2"
},
{
"start": 491,
"end": 518,
"text": "BC (Blunsom and Cohn, 2010)",
"ref_id": null
}
],
"ref_spans": [
{
"start": 248,
"end": 255,
"text": "Table 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "PASCAL Challenge on Grammar Induction",
"sec_num": "7.1"
},
{
"text": "global category distribution to influence each of the more specific distributions. Further, it provides a very simple knob in the choice of hyperparameters, which has a substantial effect on performance. A side effect of the hyperparameters is that their strength also determines the rate of convergence. This may be one of the reasons for the high variance seen in the four settings tested, although we note that since our initialization is always uniform, and not random, consecutive runs do not introduce variance in the model's performance.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "PASCAL Challenge on Grammar Induction",
"sec_num": "7.1"
},
{
"text": "Since our induction algorithm is based on the knowledge of which POS tags are nouns and verbs, we compare in Table 2 our system to Naseem et al. (2010) , who present a nonparametric dependency model that incorporates thirteen universal linguistic constraints. Three of these constraints correspond to our rules that verbs are the roots of sentences and may take nouns as dependents, but the other ten constraints (e.g. that adjectives modify nouns, adverbs modify adjectives or verbs, etc.) have no equivalent in our system. Although our system has less prior knowledge, it still performs competitively.",
"cite_spans": [
{
"start": 131,
"end": 151,
"text": "Naseem et al. (2010)",
"ref_id": "BIBREF36"
}
],
"ref_spans": [
{
"start": 109,
"end": 116,
"text": "Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Comparison with systems that capture linguistic constraints",
"sec_num": "7.2"
},
{
"text": "On the WSJ, Naseem et al. demonstrate the importance and effect of the specific choice of syntactic rules by comparing the performance of their system with hand crafted universal rules (71.9), with English specific rules (73.8), and with rules proposed by Druck et al. (2009) Table 2 : A comparison of our system with Naseem et al. (2010) , both trained and tested on the length 10 training data from the CoNLL-X Shared Task.",
"cite_spans": [
{
"start": 256,
"end": 275,
"text": "Druck et al. (2009)",
"ref_id": "BIBREF15"
},
{
"start": 318,
"end": 338,
"text": "Naseem et al. (2010)",
"ref_id": "BIBREF36"
}
],
"ref_spans": [
{
"start": 276,
"end": 283,
"text": "Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Comparison with systems that capture linguistic constraints",
"sec_num": "7.2"
},
{
"text": "increases, whereas our system shows significantly less decline, and outperforms their universal system by a significant margin. 7",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Comparison with systems that capture linguistic constraints",
"sec_num": "7.2"
},
{
"text": "\u2264 10 \u2264 20 71.9",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Comparison with systems that capture linguistic constraints",
"sec_num": "7.2"
},
{
"text": "In contrast to Spitkovsky et al. 2010, who reported that performance of their dependency based system degrades when trained on longer sentences, our performance on length 10 sentences increases to 71.9 when we train on sentences up to length 20. Another system that is also based on CCG, but captures significantly more linguistic knowledge than ours, was presented by Boonkwan and Steedman (2011) , who achieve an accuracy of 74.5 on WSJ10 section 23 (trained on sections 02-22). Using the same settings, our system achieves an accuracy of 68.4. Unlike our approach, Boonkwan and Steedman do not automatically induce an appropriate inventory of lexical category, but use an extensive questionnaire that defines prototype categories for various syntactic constructions, and requires significant manual engineering of which POS tags are mapped to what categories to generate a languagespecific lexicon. However, their performance degrades significantly when only a subset of the questions are considered. Using only the first 14 questions, covering facts about the ordering of subjects, verbs and objects, adjectives, adverbs, auxiliaries, adpositions, possessives and relative markers, they achieve an accuracy of 68.2, which is almost iden- Table 3 : A comparison of our system with Gillenwater et al. (2010) , both trained on the length 10 training data, and tested on the length 10 test data, from the CoNLL-X Shared task.",
"cite_spans": [
{
"start": 369,
"end": 397,
"text": "Boonkwan and Steedman (2011)",
"ref_id": "BIBREF5"
},
{
"start": 1284,
"end": 1309,
"text": "Gillenwater et al. (2010)",
"ref_id": "BIBREF18"
}
],
"ref_spans": [
{
"start": 1242,
"end": 1249,
"text": "Table 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Comparison with systems that capture linguistic constraints",
"sec_num": "7.2"
},
{
"text": "tical to ours, even though we use significantly less initial knowledge. However, the lexicons we present below indicate that we are in fact learning many of the very exact details that in their system are constructed by hand. The remaining 14 questions in Boonkwan and Steedman's questionnaire cover less frequent phenomena such as the order of negative markers, dative shift, and pro-drop. The obvious advantage of this approach is that this allows them to define a much more fine-grained inventory of lexical categories than our system can automatically induce. We also stipulate that for certain languages knowledge of pro-drop could play a significant role in the success of their approach: if complete sentences are allowed to be of the form S\\N or S/N, the same lexical category can be used for the verb regardless of whether the subject is present or has been dropped.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Comparison with systems that capture linguistic constraints",
"sec_num": "7.2"
},
{
"text": "In order to provide results on additional languages, we present in Table 3 a comparison to the work of Gillenwater et al. (2010) (G10), using the ConLL-X Shared Task data (Buchholz and Marsi, 2006) . Following Gillenwater et al., we train only on sentences of length 10 from the training set and evaluate on the test set. Since this is a different training regime, and these corpora differ for many languages from that of the PASCAL challenge, numbers from Table 1 cannot be compared directly with those in Table 3 . We have also applied our model to Goldberg (2011)'s Hebrew corpus, where it achieves an accuracy of 62.1 (trained and tested on all sentences length 10; 7,253) and 59.6 (length 15; 21,422 tokens).",
"cite_spans": [
{
"start": 171,
"end": 197,
"text": "(Buchholz and Marsi, 2006)",
"ref_id": "BIBREF6"
}
],
"ref_spans": [
{
"start": 67,
"end": 74,
"text": "Table 3",
"ref_id": null
},
{
"start": 457,
"end": 464,
"text": "Table 1",
"ref_id": null
},
{
"start": 507,
"end": 514,
"text": "Table 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Additional Languages",
"sec_num": "7.3"
},
{
"text": "Figure 3: Partial lexicons demonstrating language specific knowledge learned automatically for five languages. For ease of comparison between languages, we use the universal tag label (Verb, Adposition, Noun and Adjective). Shown are the most common categories and the fraction of occurrences of the tag that are assigned this category (according to the Viterbi parses).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Additional Languages",
"sec_num": "7.3"
},
{
"text": "Since our approach is based on a lexicalized formalism such as CCG, our system automatically induces lexicons that pair words (or, in our case, POStags) with language-specific categories that capture their syntactic behavior. If our approach is successful, it should learn the basic syntactic properties of each language, which will be reflected in the corresponding lexicon. In Figure 3 one sees how verbs subcategorize differently, how word ordering differs by language, and how the attachment structures of prepositions are automatically discovered and differ across languages. In Arabic, for example, the system learns that word order is variable and therefore the verb must allow for both SVO and VOS style constructions. We generally learn that adpositions (prepositions or postpositions) take nouns as arguments. In Czech, PPs can appear before and after the verb, leading to two different categories ((S\\S)/N and (S/S)/N). Japanese has postpositions that appear in preverbal position ((S/S)\\N), but when this category is assigned to nominal particles that correspond to case markers, it effectively absorbs the noun, leading to a preference for verbs that do not take any arguments (S), and to a misanalysis of adjectives as verb modifiers (S/S). Our lexicons also reflect differences in style: while Childes and the WSJ are both English, they represent very different registers. We learn that subjects are mostly absent in the informal speech and child-directed instructions contained in Childes, while effectively mandatory in the Wall Street Journal.",
"cite_spans": [],
"ref_spans": [
{
"start": 379,
"end": 387,
"text": "Figure 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "The Induced Lexicons",
"sec_num": "8"
},
{
"text": "This paper has introduced a novel factorization for CCG models and showed how when combined with non-parametric Bayesian statistics it can compete with every other grammar induction system currently available, including those that capture a significant amount of prior linguistic knowledge. The use of a powerful syntactic formalism proves beneficial both in terms of requiring very limited universal knowledge and robustness at longer sentence lengths. Unlike standard grammar induction systems that are based on dependency grammar, our system returns linguistically interpretable lexicons for each language that demonstrate it has discovered their basic word order. Of particular note is the simplicity of the model both algorithmically and in terms of implementation. By not faltering on longer sentences or requiring extensive tuning, the system can be easily and quickly deployed on a new language and return state of the art performance and easily interpretable lexicons. In this paper, we have applied this model only to a restricted fragment of CCG, but future work will address the impact of lexicalization and the inclusion of richer combinators.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusions",
"sec_num": "9"
},
{
"text": "The normal-form ofHockenmaier and Bisk (2010) is not required for this fragment of CCG.2 This distinction was suggested by the authors (p.c.)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Huang et al. (2012) present a (deficient) variant and Bayesian extension of theBisk and Hockenmaier (2012b) model without k-best smoothing that both underperform our published results.4 If X is an atomic category, only application is possible.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "An alternative HDP model for semantic parsing with CCG is proposed byKwiatkowski et al. (2012).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Numbers are from personal correspondence with the organizers. The previously published numbers are not comparable to literature due to an error in the evaluation. http://wiki. cs.ox.ac.uk/InducingLinguisticStructure/ ResultsDepComparable",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Our earlier generative model showed similar behavior, although the results inBisk and Hockenmaier (2012b) are not directly comparable due to differences in the data.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [
{
"text": "This work is supported by NSF CAREER award 1053856 (Bayesian Models for Lexicalized Grammars).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgements",
"sec_num": "10"
},
{
"text": "% Swedish % WSJ % Childes % Japanese % Czech %",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Arabic",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Phylogenetic Grammar Induction",
"authors": [
{
"first": "Taylor",
"middle": [],
"last": "Berg",
"suffix": ""
},
{
"first": "-",
"middle": [],
"last": "Kirkpatrick",
"suffix": ""
},
{
"first": "Dan",
"middle": [],
"last": "Klein",
"suffix": ""
}
],
"year": 2010,
"venue": "Proceedings of the 48th",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Taylor Berg-Kirkpatrick and Dan Klein. 2010. Phyloge- netic Grammar Induction. In Proceedings of the 48th",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Annual Meeting of the Association for Computational Linguistics",
"authors": [],
"year": 2006,
"venue": "",
"volume": "",
"issue": "",
"pages": "1288--1297",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Annual Meeting of the Association for Computational Linguistics, pages 1288-1297, Uppsala, Sweden, July. Christopher Bishop. 2006. Pattern Recognition and Ma- chine Learning. Springer-Verlag, August.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Induction of Linguistic Structure with Combinatory Categorial Grammars",
"authors": [
{
"first": "Yonatan",
"middle": [],
"last": "Bisk",
"suffix": ""
},
{
"first": "Julia",
"middle": [],
"last": "Hockenmaier",
"suffix": ""
}
],
"year": 2012,
"venue": "NAACL HLT Workshop on Induction of Linguistic Structure",
"volume": "",
"issue": "",
"pages": "90--95",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yonatan Bisk and Julia Hockenmaier. 2012a. Induction of Linguistic Structure with Combinatory Categorial Grammars. In NAACL HLT Workshop on Induction of Linguistic Structure, pages 90-95, Montr\u00e9al, Canada, June.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Simple Robust Grammar Induction with Combinatory Categorial Grammars",
"authors": [
{
"first": "Yonatan",
"middle": [],
"last": "Bisk",
"suffix": ""
},
{
"first": "Julia",
"middle": [],
"last": "Hockenmaier",
"suffix": ""
}
],
"year": 2012,
"venue": "Proceedings of the Twenty-Sixth Conference on Artificial Intelligence (AAAI-12)",
"volume": "",
"issue": "",
"pages": "1643--1649",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yonatan Bisk and Julia Hockenmaier. 2012b. Simple Robust Grammar Induction with Combinatory Cate- gorial Grammars. In Proceedings of the Twenty-Sixth Conference on Artificial Intelligence (AAAI-12), pages 1643-1649, Toronto, Canada, July.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Unsupervised Induction of Tree Substitution Grammars for Dependency Parsing",
"authors": [
{
"first": "M",
"middle": [],
"last": "David",
"suffix": ""
},
{
"first": "Michael I Jordan",
"middle": [],
"last": "Blei",
"suffix": ""
}
],
"year": 2004,
"venue": "Proceedings of the 2010 Conference on Empirical Methods of Natural Language Processing",
"volume": "",
"issue": "",
"pages": "1204--1213",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "David M Blei and Michael I Jordan. 2004. Variational Methods for the Dirichlet Process. In Proceedings of the Twenty-First International Conference on Machine Learning (ICML 2004), Banff, Alberta, Canada, July. Phil Blunsom and Trevor Cohn. 2010. Unsupervised Induction of Tree Substitution Grammars for Depen- dency Parsing. Proceedings of the 2010 Conference on Empirical Methods of Natural Language Process- ing, pages 1204-1213, October.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Grammar Induction from Text Using Small Syntactic Prototypes",
"authors": [
{
"first": "Prachya",
"middle": [],
"last": "Boonkwan",
"suffix": ""
},
{
"first": "Mark",
"middle": [],
"last": "Steedman",
"suffix": ""
}
],
"year": 2011,
"venue": "Proceedings of 5th International Joint Conference on Natural Language Processing",
"volume": "",
"issue": "",
"pages": "438--446",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Prachya Boonkwan and Mark Steedman. 2011. Gram- mar Induction from Text Using Small Syntactic Proto- types. In Proceedings of 5th International Joint Con- ference on Natural Language Processing, pages 438- 446, Chiang Mai, Thailand, November.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "CoNLL-X Shared Task on Multilingual Dependency Parsing",
"authors": [
{
"first": "Sabine",
"middle": [],
"last": "Buchholz",
"suffix": ""
},
{
"first": "Erwin",
"middle": [],
"last": "Marsi",
"suffix": ""
}
],
"year": 2006,
"venue": "Proceedings of the 10th Conference on Computational Natural Language Learning (CoNLL-X)",
"volume": "",
"issue": "",
"pages": "149--164",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sabine Buchholz and Erwin Marsi. 2006. CoNLL-X Shared Task on Multilingual Dependency Parsing. In Proceedings of the 10th Conference on Computational Natural Language Learning (CoNLL-X), pages 149- 164, New York City, June.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Two Experiments on Learning Probabilistic Dependency Grammars from Corpora. Working Notes of the Workshop Statistically-Based NLP Techniques",
"authors": [
{
"first": "Glenn",
"middle": [],
"last": "Carroll",
"suffix": ""
},
{
"first": "Eugene",
"middle": [],
"last": "Charniak",
"suffix": ""
}
],
"year": 1992,
"venue": "",
"volume": "",
"issue": "",
"pages": "1--13",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Glenn Carroll and Eugene Charniak. 1992. Two Exper- iments on Learning Probabilistic Dependency Gram- mars from Corpora. Working Notes of the Workshop Statistically-Based NLP Techniques, pages 1-13.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Statistical Language Learning",
"authors": [
{
"first": "Eugene",
"middle": [],
"last": "Charniak",
"suffix": ""
}
],
"year": 1993,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Eugene Charniak. 1993. Statistical Language Learning. The MIT Press, Cambridge, Massachusetts.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Formalism-Independent Parser Evaluation with CCG and Dep-Bank",
"authors": [
{
"first": "Stephen",
"middle": [],
"last": "Clark",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "James R Curran",
"suffix": ""
}
],
"year": 2007,
"venue": "Proceedings of the 45th Annual Meeting of the Association of Computational Linguistics",
"volume": "",
"issue": "",
"pages": "248--255",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Stephen Clark and James R Curran. 2007. Formalism- Independent Parser Evaluation with CCG and Dep- Bank. In Proceedings of the 45th Annual Meeting of the Association of Computational Linguistics, pages 248-255, Prague, Czech Republic, June.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Unsupervised Language Acquisition: Theory and Practice",
"authors": [
{
"first": "Alex",
"middle": [],
"last": "Clark",
"suffix": ""
}
],
"year": 2001,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Alex Clark. 2001. Unsupervised Language Acquisition: Theory and Practice. Ph.D. thesis, University of Sus- sex, September.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Variational Inference for Grammar Induction with Prior Knowledge",
"authors": [
{
"first": "B",
"middle": [],
"last": "Shay",
"suffix": ""
},
{
"first": "Noah A",
"middle": [],
"last": "Cohen",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Smith",
"suffix": ""
}
],
"year": 2009,
"venue": "Proceedings of the ACL-IJCNLP 2009 Conference Short Papers",
"volume": "",
"issue": "",
"pages": "1--4",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Shay B Cohen and Noah A Smith. 2009. Variational Inference for Grammar Induction with Prior Knowl- edge. Proceedings of the ACL-IJCNLP 2009 Confer- ence Short Papers, pages 1-4.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Covariance in Unsupervised Learning of Probabilistic Grammars",
"authors": [
{
"first": "B",
"middle": [],
"last": "Shay",
"suffix": ""
},
{
"first": "Noah A",
"middle": [],
"last": "Cohen",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Smith",
"suffix": ""
}
],
"year": 2010,
"venue": "The Journal of Machine Learning Research",
"volume": "",
"issue": "",
"pages": "3117--3151",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Shay B Cohen and Noah A Smith. 2010. Covariance in Unsupervised Learning of Probabilistic Grammars. The Journal of Machine Learning Research, pages 3117-3151, November.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Inducing Tree-Substitution Grammars",
"authors": [
{
"first": "Trevor",
"middle": [],
"last": "Cohn",
"suffix": ""
},
{
"first": "Phil",
"middle": [],
"last": "Blunsom",
"suffix": ""
},
{
"first": "Sharon",
"middle": [],
"last": "Goldwater",
"suffix": ""
}
],
"year": 2010,
"venue": "The Journal of Machine Learning Research",
"volume": "11",
"issue": "",
"pages": "3053--3096",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Trevor Cohn, Phil Blunsom, and Sharon Goldwater. 2010. Inducing Tree-Substitution Grammars. The Journal of Machine Learning Research, 11:3053- 3096, November.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Head-Driven Statistical Models for Natural Language Parsing",
"authors": [
{
"first": "Michael",
"middle": [],
"last": "Collins",
"suffix": ""
}
],
"year": 2003,
"venue": "Computational Linguistics",
"volume": "29",
"issue": "4",
"pages": "589--637",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Michael Collins. 2003. Head-Driven Statistical Mod- els for Natural Language Parsing. Computational Lin- guistics, 29(4):589-637, December.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Semi-supervised Learning of Dependency Parsers using Generalized Expectation Criteria",
"authors": [
{
"first": "Gregory",
"middle": [],
"last": "Druck",
"suffix": ""
},
{
"first": "Gideon",
"middle": [],
"last": "Mann",
"suffix": ""
},
{
"first": "Andrew",
"middle": [],
"last": "Mccallum",
"suffix": ""
}
],
"year": 2009,
"venue": "Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP",
"volume": "",
"issue": "",
"pages": "360--368",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Gregory Druck, Gideon Mann, and Andrew McCal- lum. 2009. Semi-supervised Learning of Dependency Parsers using Generalized Expectation Criteria. In Proceedings of the Joint Conference of the 47th An- nual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP, pages 360-368, Suntec, Singapore, Au- gust.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Efficient Normal-Form Parsing for Combinatory Categorial Grammar",
"authors": [
{
"first": "Jason",
"middle": [],
"last": "Eisner",
"suffix": ""
}
],
"year": 1996,
"venue": "Proceedings of the 34th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "79--86",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jason Eisner. 1996. Efficient Normal-Form Parsing for Combinatory Categorial Grammar. In Proceedings of the 34th Annual Meeting of the Association for Com- putational Linguistics, pages 79-86, Santa Cruz, Cali- fornia, USA, June.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "The PASCAL Challenge on Grammar Induction",
"authors": [
{
"first": "Douwe",
"middle": [],
"last": "Gelling",
"suffix": ""
},
{
"first": "Trevor",
"middle": [],
"last": "Cohn",
"suffix": ""
},
{
"first": "Phil",
"middle": [],
"last": "Blunsom",
"suffix": ""
},
{
"first": "Jo\u00e3o V",
"middle": [],
"last": "Graca",
"suffix": ""
}
],
"year": 2012,
"venue": "NAACL HLT Workshop on Induction of Linguistic Structure",
"volume": "",
"issue": "",
"pages": "64--80",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Douwe Gelling, Trevor Cohn, Phil Blunsom, and Jo\u00e3o V Graca. 2012. The PASCAL Challenge on Grammar Induction. In NAACL HLT Workshop on Induction of Linguistic Structure, pages 64-80, Montr\u00e9al, Canada, June.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Sparsity in Dependency Grammar Induction",
"authors": [
{
"first": "Jennifer",
"middle": [],
"last": "Gillenwater",
"suffix": ""
},
{
"first": "Kuzman",
"middle": [],
"last": "Ganchev",
"suffix": ""
},
{
"first": "V",
"middle": [],
"last": "Jo\u00e3o",
"suffix": ""
},
{
"first": "Fernando",
"middle": [],
"last": "Graca",
"suffix": ""
},
{
"first": "Ben",
"middle": [],
"last": "Pereira",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Taskar",
"suffix": ""
}
],
"year": 2010,
"venue": "Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "194--199",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jennifer Gillenwater, Kuzman Ganchev, Jo\u00e3o V Graca, Fernando Pereira, and Ben Taskar. 2010. Sparsity in Dependency Grammar Induction. In Proceedings of the 48th Annual Meeting of the Association for Com- putational Linguistics, pages 194-199, Uppsala, Swe- den, July.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Posterior Sparsity in Unsupervised Dependency Parsing",
"authors": [
{
"first": "Jennifer",
"middle": [],
"last": "Gillenwater",
"suffix": ""
},
{
"first": "Kuzman",
"middle": [],
"last": "Ganchev",
"suffix": ""
},
{
"first": "V",
"middle": [],
"last": "Jo\u00e3o",
"suffix": ""
},
{
"first": "Fernando",
"middle": [],
"last": "Graca",
"suffix": ""
},
{
"first": "Ben",
"middle": [],
"last": "Pereira",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Taskar",
"suffix": ""
}
],
"year": 2011,
"venue": "The Journal of Machine Learning Research",
"volume": "12",
"issue": "",
"pages": "455--490",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jennifer Gillenwater, Kuzman Ganchev, Jo\u00e3o V Graca, Fernando Pereira, and Ben Taskar. 2011. Posterior Sparsity in Unsupervised Dependency Parsing. The Journal of Machine Learning Research, 12:455-490, February.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Automatic Syntactic Processing of Modern Hebrew",
"authors": [
{
"first": "Yoav",
"middle": [],
"last": "Goldberg",
"suffix": ""
}
],
"year": 2011,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yoav Goldberg. 2011. Automatic Syntactic Processing of Modern Hebrew. Ph.D. thesis, Ben-Gurion University of the Negev, November.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Improving Unsupervised Dependency Parsing with Richer Contexts and Smoothing",
"authors": [
{
"first": "Iii",
"middle": [],
"last": "William P Headden",
"suffix": ""
},
{
"first": "Mark",
"middle": [],
"last": "Johnson",
"suffix": ""
},
{
"first": "David",
"middle": [],
"last": "Mc-Closky",
"suffix": ""
}
],
"year": 2009,
"venue": "Proceedings of Human Language Technologies",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "William P Headden III, Mark Johnson, and David Mc- Closky. 2009. Improving Unsupervised Dependency Parsing with Richer Contexts and Smoothing. In Pro- ceedings of Human Language Technologies: The 2009",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Annual Conference of the North American Chapter of the Association for Computational Linguistics",
"authors": [],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "101--109",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Annual Conference of the North American Chapter of the Association for Computational Linguistics, pages 101-109, Boulder, Colorado, June.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "Normalform parsing for Combinatory Categorial Grammars with generalized composition and type-raising",
"authors": [
{
"first": "Julia",
"middle": [],
"last": "Hockenmaier",
"suffix": ""
},
{
"first": "Yonatan",
"middle": [],
"last": "Bisk",
"suffix": ""
}
],
"year": 2010,
"venue": "Proceedings of the 23rd International Conference on Computational Linguistics",
"volume": "",
"issue": "",
"pages": "465--473",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Julia Hockenmaier and Yonatan Bisk. 2010. Normal- form parsing for Combinatory Categorial Grammars with generalized composition and type-raising. In Proceedings of the 23rd International Conference on Computational Linguistics (Coling 2010), pages 465- 473, Beijing, China, August. Coling 2010 Organizing Committee.",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "Generative Models for Statistical Parsing with Combinatory Categorial Grammar",
"authors": [
{
"first": "Julia",
"middle": [],
"last": "Hockenmaier",
"suffix": ""
},
{
"first": "Mark",
"middle": [],
"last": "Steedman",
"suffix": ""
}
],
"year": 2002,
"venue": "Proceedings of 40th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "335--342",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Julia Hockenmaier and Mark Steedman. 2002. Gener- ative Models for Statistical Parsing with Combinatory Categorial Grammar. In Proceedings of 40th Annual Meeting of the Association for Computational Lin- guistics, pages 335-342, Philadelphia, Pennsylvania, USA, July.",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "CCGbank: A Corpus of CCG Derivations and Dependency Structures Extracted from the Penn Treebank",
"authors": [
{
"first": "Julia",
"middle": [],
"last": "Hockenmaier",
"suffix": ""
},
{
"first": "Mark",
"middle": [],
"last": "Steedman",
"suffix": ""
}
],
"year": 2007,
"venue": "Proceedings of the 24rd International Conference on Computational Linguistics",
"volume": "33",
"issue": "",
"pages": "355--396",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Julia Hockenmaier and Mark Steedman. 2007. CCG- bank: A Corpus of CCG Derivations and Dependency Structures Extracted from the Penn Treebank. Com- putational Linguistics, 33(3):355-396, September. Yun Huang, Min Zhang, and Chew Lim Tan. 2012. Improved Combinatory Categorial Grammar Induc- tion with Boundary Words and Bayesian Inference. In Proceedings of the 24rd International Conference on Computational Linguistics (Coling 2012), Mumbai, India, December.",
"links": null
},
"BIBREF26": {
"ref_id": "b26",
"title": "X-Bar Syntax: A Study of Phrase Structure",
"authors": [
{
"first": "Ray",
"middle": [],
"last": "Jackendoff",
"suffix": ""
}
],
"year": 1977,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ray Jackendoff. 1977. X-Bar Syntax: A Study of Phrase Structure. The MIT Press.",
"links": null
},
"BIBREF27": {
"ref_id": "b27",
"title": "Corpus-Based Induction of Syntactic Structure: Models of Dependency and Constituency",
"authors": [
{
"first": "Dan",
"middle": [],
"last": "Klein",
"suffix": ""
},
{
"first": "D",
"middle": [],
"last": "Christopher",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Manning",
"suffix": ""
}
],
"year": 2004,
"venue": "Proceedings of the 42nd Meeting of the Association for Computational Linguistics (ACL'04), Main Volume",
"volume": "",
"issue": "",
"pages": "478--485",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dan Klein and Christopher D Manning. 2004. Corpus- Based Induction of Syntactic Structure: Models of De- pendency and Constituency. In Proceedings of the 42nd Meeting of the Association for Computational Linguistics (ACL'04), Main Volume, pages 478-485, Barcelona, Spain, July.",
"links": null
},
"BIBREF28": {
"ref_id": "b28",
"title": "An Application of the Variational Bayesian Approach to Probabilistic Context-Free Grammars",
"authors": [
{
"first": "Kenichi",
"middle": [],
"last": "Kurihara",
"suffix": ""
},
{
"first": "Taisuke",
"middle": [],
"last": "Sato",
"suffix": ""
}
],
"year": 2004,
"venue": "International Joint Conference on Natural Language Language Processing Workshop Beyond Shallow Analyses",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kenichi Kurihara and Taisuke Sato. 2004. An Appli- cation of the Variational Bayesian Approach to Prob- abilistic Context-Free Grammars. International Joint Conference on Natural Language Language Process- ing Workshop Beyond Shallow Analyses, March.",
"links": null
},
"BIBREF29": {
"ref_id": "b29",
"title": "Collapsed Variational Dirichlet Process Mixture Models",
"authors": [
{
"first": "Kenichi",
"middle": [],
"last": "Kurihara",
"suffix": ""
},
{
"first": "Max",
"middle": [],
"last": "Welling",
"suffix": ""
},
{
"first": "Yee-Whye",
"middle": [],
"last": "Teh",
"suffix": ""
}
],
"year": 2007,
"venue": "Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI07)",
"volume": "",
"issue": "",
"pages": "2796--2801",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kenichi Kurihara, Max Welling, and Yee-Whye Teh. 2007. Collapsed Variational Dirichlet Process Mix- ture Models. In Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI07), pages 2796-2801, Hyderabad, India, January.",
"links": null
},
"BIBREF30": {
"ref_id": "b30",
"title": "A probabilistic model of syntactic and semantic acquisition from child-directed utterances and their meanings",
"authors": [
{
"first": "Tom",
"middle": [],
"last": "Kwiatkowski",
"suffix": ""
},
{
"first": "Sharon",
"middle": [],
"last": "Goldwater",
"suffix": ""
},
{
"first": "Luke",
"middle": [],
"last": "Zettlemoyer",
"suffix": ""
},
{
"first": "Mark",
"middle": [],
"last": "Steedman",
"suffix": ""
}
],
"year": 2012,
"venue": "Proceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "234--244",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Tom Kwiatkowski, Sharon Goldwater, Luke Zettlemoyer, and Mark Steedman. 2012. A probabilistic model of syntactic and semantic acquisition from child-directed utterances and their meanings. In Proceedings of the 13th Conference of the European Chapter of the As- sociation for Computational Linguistics, pages 234- 244, Avignon, France, April. Association for Compu- tational Linguistics.",
"links": null
},
"BIBREF31": {
"ref_id": "b31",
"title": "Applications of stochastic context-free grammars using the Inside-Outside algorithm",
"authors": [
{
"first": "Karim",
"middle": [],
"last": "Lari",
"suffix": ""
},
{
"first": "Steve",
"middle": [
"J"
],
"last": "Young",
"suffix": ""
}
],
"year": 1991,
"venue": "Computer speech & language",
"volume": "5",
"issue": "3",
"pages": "237--257",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Karim Lari and Steve J Young. 1991. Applications of stochastic context-free grammars using the Inside- Outside algorithm. Computer speech & language, 5(3):237-257, January.",
"links": null
},
"BIBREF32": {
"ref_id": "b32",
"title": "The Infinite PCFG Using Hierarchical Dirichlet Processes",
"authors": [
{
"first": "Percy",
"middle": [],
"last": "Liang",
"suffix": ""
},
{
"first": "Slav",
"middle": [],
"last": "Petrov",
"suffix": ""
},
{
"first": "Dan",
"middle": [],
"last": "Michael I Jordan",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Klein",
"suffix": ""
}
],
"year": 2007,
"venue": "Proceedings of the 2007 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning (EMNLP-CoNLL)",
"volume": "",
"issue": "",
"pages": "688--697",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Percy Liang, Slav Petrov, Michael I Jordan, and Dan Klein. 2007. The Infinite PCFG Using Hierarchical Dirichlet Processes. In Proceedings of the 2007 Joint Conference on Empirical Methods in Natural Lan- guage Processing and Computational Natural Lan- guage Learning (EMNLP-CoNLL), pages 688-697, Prague, Czech Republic.",
"links": null
},
"BIBREF33": {
"ref_id": "b33",
"title": "Probabilistic Grammars and Hierarchical Dirichlet Processes",
"authors": [
{
"first": "Percy",
"middle": [],
"last": "Liang",
"suffix": ""
},
{
"first": "Dan",
"middle": [],
"last": "Michael I Jordan",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Klein",
"suffix": ""
}
],
"year": 2009,
"venue": "The Oxford Handbook of Applied Bayesian Analysis",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Percy Liang, Michael I Jordan, and Dan Klein. 2009. Probabilistic Grammars and Hierarchical Dirichlet Processes. In The Oxford Handbook of Applied Bayesian Analysis. Oxford University Press.",
"links": null
},
"BIBREF34": {
"ref_id": "b34",
"title": "Building a Large Annotated Corpus of English: The Penn Treebank",
"authors": [
{
"first": "P",
"middle": [],
"last": "Mitchell",
"suffix": ""
},
{
"first": "Beatrice",
"middle": [],
"last": "Marcus",
"suffix": ""
},
{
"first": "Mary",
"middle": [
"Ann"
],
"last": "Santorini",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Marcinkiewicz",
"suffix": ""
}
],
"year": 1993,
"venue": "Computational Linguistics",
"volume": "19",
"issue": "2",
"pages": "313--330",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Mitchell P Marcus, Beatrice Santorini, and Mary Ann Marcinkiewicz. 1993. Building a Large Annotated Corpus of English: The Penn Treebank. Computa- tional Linguistics, 19(2):313-330, June.",
"links": null
},
"BIBREF35": {
"ref_id": "b35",
"title": "Unsupervised Dependency Parsing using Reducibility and Fertility features",
"authors": [
{
"first": "David",
"middle": [],
"last": "Marecek",
"suffix": ""
},
{
"first": "Zdenek",
"middle": [],
"last": "Zabokrtsky",
"suffix": ""
}
],
"year": 2012,
"venue": "NAACL HLT Workshop on Induction of Linguistic Structure",
"volume": "",
"issue": "",
"pages": "84--89",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "David Marecek and Zdenek Zabokrtsky. 2012. Unsu- pervised Dependency Parsing using Reducibility and Fertility features. In NAACL HLT Workshop on Induc- tion of Linguistic Structure, pages 84-89, Montr\u00e9al, Canada, June.",
"links": null
},
"BIBREF36": {
"ref_id": "b36",
"title": "Using Universal Linguistic Knowledge to Guide Grammar Induction",
"authors": [
{
"first": "Tahira",
"middle": [],
"last": "Naseem",
"suffix": ""
},
{
"first": "Harr",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Regina",
"middle": [],
"last": "Barzilay",
"suffix": ""
},
{
"first": "Mark",
"middle": [],
"last": "Johnson",
"suffix": ""
}
],
"year": 2010,
"venue": "Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "1234--1244",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Tahira Naseem, Harr Chen, Regina Barzilay, and Mark Johnson. 2010. Using Universal Linguistic Knowl- edge to Guide Grammar Induction. In Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing, pages 1234-1244, Cambridge, MA, October.",
"links": null
},
"BIBREF37": {
"ref_id": "b37",
"title": "Selective Sharing for Multilingual Dependency Parsing",
"authors": [
{
"first": "Tahira",
"middle": [],
"last": "Naseem",
"suffix": ""
},
{
"first": "Regina",
"middle": [],
"last": "Barzilay",
"suffix": ""
},
{
"first": "Amir",
"middle": [],
"last": "Globerson",
"suffix": ""
}
],
"year": 2012,
"venue": "Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "629--637",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Tahira Naseem, Regina Barzilay, and Amir Globerson. 2012. Selective Sharing for Multilingual Dependency Parsing. In Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics (Vol- ume 1: Long Papers), pages 629-637, Jeju, Republic of Korea, July.",
"links": null
},
"BIBREF38": {
"ref_id": "b38",
"title": "Inductive Dependency Parsing",
"authors": [
{
"first": "Joakim",
"middle": [],
"last": "Nivre",
"suffix": ""
}
],
"year": 2006,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Joakim Nivre. 2006. Inductive Dependency Parsing. Springer.",
"links": null
},
"BIBREF39": {
"ref_id": "b39",
"title": "A Universal Part-of-Speech Tagset",
"authors": [
{
"first": "Slav",
"middle": [],
"last": "Petrov",
"suffix": ""
},
{
"first": "Dipanjan",
"middle": [],
"last": "Das",
"suffix": ""
},
{
"first": "Ryan",
"middle": [],
"last": "Mcdonald",
"suffix": ""
}
],
"year": 2012,
"venue": "Proceedings of the 8th International Conference on Language Resources and Evaluation (LREC-2012)",
"volume": "",
"issue": "",
"pages": "2089--2096",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Slav Petrov, Dipanjan Das, and Ryan McDonald. 2012. A Universal Part-of-Speech Tagset. In Proceedings of the 8th International Conference on Language Re- sources and Evaluation (LREC-2012), pages 2089- 2096, Istanbul, Turkey, May.",
"links": null
},
"BIBREF40": {
"ref_id": "b40",
"title": "Two baselines for unsupervised dependency parsing",
"authors": [
{
"first": "Anders",
"middle": [],
"last": "S\u00f8gaard",
"suffix": ""
}
],
"year": 2012,
"venue": "NAACL HLT Workshop on Induction of Linguistic Structure",
"volume": "",
"issue": "",
"pages": "81--83",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Anders S\u00f8gaard. 2012. Two baselines for unsuper- vised dependency parsing. In NAACL HLT Work- shop on Induction of Linguistic Structure, pages 81- 83, Montr\u00e9al, Canada, June.",
"links": null
},
"BIBREF41": {
"ref_id": "b41",
"title": "From Baby Steps to Leapfrog: How \"Less is More\" in Unsupervised Dependency Parsing",
"authors": [
{
"first": "Hiyan",
"middle": [],
"last": "Valentin I Spitkovsky",
"suffix": ""
},
{
"first": "Daniel",
"middle": [],
"last": "Alshawi",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Jurafsky",
"suffix": ""
}
],
"year": 2010,
"venue": "Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "751--759",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Valentin I Spitkovsky, Hiyan Alshawi, and Daniel Juraf- sky. 2010. From Baby Steps to Leapfrog: How \"Less is More\" in Unsupervised Dependency Parsing. In Hu- man Language Technologies: The 2010 Annual Con- ference of the North American Chapter of the Associ- ation for Computational Linguistics, pages 751-759, Los Angeles, California, June.",
"links": null
},
"BIBREF42": {
"ref_id": "b42",
"title": "Surface Structure and Interpretation",
"authors": [
{
"first": "Mark",
"middle": [],
"last": "Steedman",
"suffix": ""
}
],
"year": 1996,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Mark Steedman. 1996. Surface Structure and Interpre- tation. The MIT Press, January.",
"links": null
},
"BIBREF43": {
"ref_id": "b43",
"title": "The Syntactic Process",
"authors": [
{
"first": "Mark",
"middle": [],
"last": "Steedman",
"suffix": ""
}
],
"year": 2000,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Mark Steedman. 2000. The Syntactic Process. The MIT Press, September.",
"links": null
},
"BIBREF44": {
"ref_id": "b44",
"title": "Hierarchical Dirichlet Processes",
"authors": [
{
"first": "Yee-Whye",
"middle": [],
"last": "Teh",
"suffix": ""
},
{
"first": "Michael",
"middle": [
"I"
],
"last": "Jordan",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Matthew",
"suffix": ""
},
{
"first": "David",
"middle": [
"M"
],
"last": "Beal",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Blei",
"suffix": ""
}
],
"year": 2006,
"venue": "Journal of the American Statistical Association",
"volume": "101",
"issue": "476",
"pages": "1566--1581",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yee-Whye Teh, Michael I Jordan, Matthew J Beal, and David M Blei. 2006. Hierarchical Dirichlet Pro- cesses. Journal of the American Statistical Associa- tion, 101(476):1566-1581.",
"links": null
},
"BIBREF45": {
"ref_id": "b45",
"title": "A Hierarchical Bayesian Language Model based on Pitman-Yor Processes",
"authors": [
{
"first": "Yee-Whye",
"middle": [],
"last": "Teh",
"suffix": ""
}
],
"year": 2006,
"venue": "Proceedings of the 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "985--992",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yee-Whye Teh. 2006. A Hierarchical Bayesian Lan- guage Model based on Pitman-Yor Processes. In Pro- ceedings of the 21st International Conference on Com- putational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics, pages 985-992, Sydney, Australia, July.",
"links": null
},
"BIBREF46": {
"ref_id": "b46",
"title": "Dirichlet Process",
"authors": [
{
"first": "Yee-Whye",
"middle": [],
"last": "Teh",
"suffix": ""
}
],
"year": 2010,
"venue": "Encyclopedia of Machine Learning",
"volume": "",
"issue": "",
"pages": "280--287",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yee-Whye Teh. 2010. Dirichlet Process. In Encyclope- dia of Machine Learning, pages 280-287. Springer.",
"links": null
},
"BIBREF47": {
"ref_id": "b47",
"title": "Combining the Sparsity and Unambiguity Biases for Grammar Induction",
"authors": [
{
"first": "Kewei",
"middle": [],
"last": "Tu",
"suffix": ""
}
],
"year": 2012,
"venue": "NAACL HLT Workshop on Induction of Linguistic Structure",
"volume": "",
"issue": "",
"pages": "105--110",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kewei Tu. 2012. Combining the Sparsity and Unambi- guity Biases for Grammar Induction. In NAACL HLT Workshop on Induction of Linguistic Structure, pages 105-110, Montr\u00e9al, Canada, June.",
"links": null
}
},
"ref_entries": {
"TABREF0": {
"content": "<table/>",
"html": null,
"text": "the, eating, ...} S\\N : {sleeps, ate, eating, ...} (S\\N)/N : {sees, ate, ...}",
"num": null,
"type_str": "table"
},
"TABREF2": {
"content": "<table><tr><td/><td colspan=\"2\">Ar, Eu, Cs, Nl, WSJ, Ch, He</td><td/><td>Da, He</td><td/><td colspan=\"2\">Es, Bg, De, Pt</td><td>Sv, Sl</td><td/><td>Ja</td></tr><tr><td/><td colspan=\"3\">noun conj noun Arabic Danish</td><td>Slovene</td><td colspan=\"2\">Swedish Dutch</td><td colspan=\"3\">Basque Portuguese WSJ</td><td>Childes</td><td>Czech</td></tr><tr><td/><td colspan=\"2\"># Tokens 5,470</td><td>25,341</td><td>54,032</td><td>61,877</td><td>78,737</td><td>81,345</td><td>158,648</td><td>163,727</td><td>290,604</td><td>436,126</td></tr><tr><td/><td># Tags</td><td>20</td><td>24</td><td>36</td><td>30</td><td>304</td><td>14</td><td>23</td><td>36</td><td>69</td><td>62</td></tr><tr><td>PASCAL</td><td>BC Max BH</td><td colspan=\"7\">60.8/58.4 44.7/39.4 62.6/57.9 63.2/56.6 51.8/52.0 53.0/48.9 52.4/50.2 67.2/66.8 60.1/56.0 65.6/61.8 72.8/63.4 51.1/47.6 53.7/47.8 67.0/61.8 41.6/43.7 46.4/43.8 49.6/43.9 63.7/57.0 49.7/43.6 45.1/39.6 70.8/67.2</td><td colspan=\"3\">68.6/63.3 47.4/46.1 47.9/43.1 71.2/64.8 56.0/54.5 58.3/54.4 68.2/59.6 61.4/59.8 45.0/38.9</td></tr><tr><td/><td>MLE</td><td colspan=\"7\">41.6/42.9 43.4/39.2 46.1/41.1 70.1/59.7 52.2/47.2 29.6/26.5 62.2/59.7</td><td colspan=\"3\">59.5/52.4 53.3/51.9 50.5/45.8</td></tr><tr><td>This work</td><td colspan=\"8\">HDP0.0 48.0/50.0 63.9/58.5 44.8/39.8 67.6/62.1 45.0/33.9 41.6/39.1 71.0/66.0 HDP1.0 45.6/47.1 45.7/42.3 53.9/46.9 74.5/66.9 58.5/54.4 50.1/44.6 65.1/60.6 HDP1.5 49.6/50.4 58.7/54.4 53.2/48.2 74.3/67.1 57.4/54.5 50.6/45.0 70.0/64.7</td><td colspan=\"3\">59.8/52.9 56.3/55.2 54.0/49.0 64.3/56.5 71.5/70.3 55.8/50.7 65.5/57.2 69.6/68.6 55.6/50.3</td></tr><tr><td/><td colspan=\"8\">HDP2.0 66.4/65.1 56.5/49.5 54.2/46.4 71.6/64.1 51.7/48.3 49.4/43.3 76.3/70.5</td><td colspan=\"3\">70.7/62.9 74.1/73.3 54.4/48.5</td></tr></table>",
"html": null,
"text": "noun conj noun noun conj noun noun conj noun noun conj nounFigure 2: In the treebanks used for evaluation different standards exist for annotating coordination. While not exhaustive, this table demonstrates five of the most common schemes used in the literature. Syntactically these are identical and traditionally CCG draws arcs only to the arguments without attaching the conjunction. For the purposes of comparison with the literature we have implemented these five translation schemes.",
"num": null,
"type_str": "table"
}
}
}
} |