File size: 192,567 Bytes
6fa4bc9 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 2407 2408 2409 2410 2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480 2481 2482 2483 2484 2485 2486 2487 2488 2489 2490 2491 2492 2493 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 2504 2505 2506 2507 2508 2509 2510 2511 2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531 2532 2533 2534 2535 2536 2537 2538 2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549 2550 2551 2552 2553 2554 2555 2556 2557 2558 2559 2560 2561 2562 2563 2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588 2589 2590 2591 2592 2593 2594 2595 2596 2597 2598 2599 2600 2601 2602 2603 2604 2605 2606 2607 2608 2609 2610 2611 2612 2613 2614 2615 2616 2617 2618 2619 2620 2621 2622 2623 2624 2625 2626 2627 2628 2629 2630 2631 2632 2633 2634 2635 2636 2637 2638 2639 2640 2641 2642 2643 2644 2645 2646 2647 2648 2649 2650 2651 2652 2653 2654 2655 2656 2657 2658 2659 2660 2661 2662 2663 2664 2665 2666 2667 2668 2669 2670 2671 2672 2673 2674 2675 2676 2677 2678 2679 2680 2681 2682 2683 2684 2685 2686 2687 2688 2689 2690 2691 2692 2693 2694 2695 2696 2697 2698 2699 2700 2701 2702 2703 2704 2705 2706 2707 2708 2709 2710 2711 2712 2713 2714 2715 2716 2717 2718 2719 2720 2721 2722 2723 2724 2725 2726 2727 2728 2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740 2741 2742 2743 2744 2745 2746 2747 2748 2749 2750 2751 2752 2753 2754 2755 2756 2757 2758 2759 2760 2761 2762 2763 2764 2765 2766 2767 2768 2769 2770 2771 2772 2773 2774 2775 2776 2777 2778 2779 2780 2781 2782 2783 2784 2785 2786 2787 2788 2789 2790 2791 2792 2793 2794 2795 2796 2797 2798 2799 2800 2801 2802 2803 2804 2805 2806 2807 2808 2809 2810 2811 2812 2813 2814 2815 2816 2817 2818 2819 2820 2821 2822 2823 2824 2825 2826 2827 2828 2829 2830 2831 2832 2833 2834 2835 2836 2837 2838 2839 2840 2841 2842 2843 2844 2845 2846 2847 2848 2849 2850 2851 2852 2853 2854 2855 2856 2857 2858 2859 2860 2861 2862 2863 2864 2865 2866 2867 2868 2869 2870 2871 2872 2873 2874 2875 2876 2877 2878 2879 2880 2881 2882 2883 2884 2885 2886 2887 2888 2889 2890 2891 2892 2893 2894 2895 2896 2897 2898 2899 2900 2901 2902 2903 2904 2905 2906 2907 2908 2909 2910 2911 2912 2913 2914 2915 2916 2917 2918 2919 2920 2921 2922 2923 2924 2925 2926 2927 2928 2929 2930 2931 2932 2933 2934 2935 2936 2937 2938 2939 2940 2941 2942 2943 2944 2945 2946 2947 2948 2949 2950 2951 2952 2953 2954 2955 2956 2957 2958 2959 2960 2961 2962 2963 2964 2965 2966 2967 2968 2969 2970 2971 2972 2973 2974 2975 2976 2977 2978 2979 2980 2981 2982 2983 2984 2985 2986 2987 2988 2989 2990 2991 2992 2993 2994 2995 2996 2997 2998 2999 3000 3001 3002 3003 3004 3005 3006 3007 3008 3009 3010 3011 3012 3013 3014 3015 3016 3017 3018 3019 3020 3021 3022 3023 3024 3025 3026 3027 3028 3029 3030 3031 3032 3033 3034 3035 3036 3037 3038 3039 3040 3041 3042 3043 3044 3045 3046 3047 3048 3049 3050 3051 3052 3053 3054 3055 3056 3057 3058 3059 3060 3061 3062 3063 3064 3065 3066 3067 3068 3069 3070 3071 3072 3073 3074 3075 3076 3077 3078 3079 3080 3081 3082 3083 3084 3085 3086 3087 3088 3089 3090 3091 3092 3093 3094 3095 3096 3097 3098 3099 3100 3101 3102 3103 3104 3105 3106 3107 3108 3109 3110 3111 3112 3113 3114 3115 3116 3117 3118 3119 3120 3121 3122 3123 3124 3125 3126 3127 3128 3129 3130 3131 3132 3133 3134 3135 3136 3137 3138 3139 3140 3141 3142 3143 3144 3145 3146 3147 3148 3149 3150 3151 3152 3153 3154 3155 3156 3157 3158 3159 3160 3161 3162 3163 3164 3165 3166 3167 3168 3169 3170 3171 3172 3173 3174 3175 3176 3177 3178 3179 3180 3181 3182 3183 3184 3185 3186 3187 3188 3189 3190 3191 3192 3193 3194 3195 3196 3197 3198 3199 3200 3201 3202 3203 3204 3205 3206 3207 3208 3209 3210 3211 3212 3213 3214 3215 3216 3217 3218 3219 3220 3221 3222 3223 3224 3225 3226 3227 3228 3229 3230 3231 3232 3233 3234 3235 3236 3237 3238 3239 3240 3241 3242 3243 3244 3245 3246 3247 3248 3249 3250 3251 3252 3253 3254 3255 3256 3257 3258 3259 3260 3261 3262 3263 3264 3265 3266 3267 3268 3269 3270 3271 3272 3273 3274 3275 3276 3277 3278 3279 3280 3281 3282 3283 3284 3285 3286 3287 3288 3289 3290 3291 3292 3293 3294 3295 3296 3297 3298 3299 3300 3301 3302 3303 3304 3305 3306 3307 3308 3309 3310 3311 3312 3313 3314 3315 3316 3317 3318 3319 3320 3321 3322 3323 3324 3325 3326 3327 3328 3329 3330 3331 3332 3333 3334 3335 3336 3337 3338 3339 3340 3341 3342 3343 3344 3345 3346 3347 3348 3349 3350 3351 3352 3353 3354 3355 3356 3357 3358 3359 3360 3361 3362 3363 3364 3365 3366 3367 3368 3369 3370 3371 3372 3373 3374 3375 3376 3377 3378 3379 3380 3381 3382 3383 3384 3385 3386 3387 3388 3389 3390 3391 3392 3393 3394 3395 3396 3397 3398 3399 3400 3401 3402 3403 3404 3405 3406 3407 3408 3409 3410 3411 3412 3413 3414 3415 3416 3417 3418 3419 3420 3421 3422 3423 3424 3425 3426 3427 3428 3429 3430 3431 3432 3433 3434 3435 3436 3437 3438 3439 3440 3441 3442 3443 3444 3445 3446 3447 3448 3449 3450 3451 3452 3453 3454 3455 3456 3457 3458 3459 3460 3461 3462 3463 3464 3465 3466 3467 3468 3469 3470 3471 3472 3473 3474 3475 3476 3477 3478 3479 3480 3481 3482 3483 3484 3485 3486 3487 3488 3489 3490 3491 3492 3493 3494 3495 3496 3497 3498 3499 3500 3501 3502 3503 3504 3505 3506 3507 3508 3509 3510 3511 3512 3513 3514 3515 3516 3517 3518 3519 3520 3521 3522 3523 3524 3525 3526 3527 3528 3529 3530 3531 3532 3533 3534 3535 3536 3537 3538 3539 3540 3541 3542 3543 3544 3545 3546 3547 3548 3549 3550 3551 3552 3553 3554 3555 3556 3557 3558 3559 3560 3561 3562 3563 3564 3565 3566 3567 3568 3569 3570 3571 3572 3573 3574 3575 3576 3577 3578 3579 3580 3581 3582 3583 3584 3585 3586 3587 3588 3589 3590 3591 3592 3593 3594 3595 3596 3597 3598 3599 3600 3601 3602 3603 3604 3605 3606 3607 3608 3609 3610 3611 3612 3613 3614 3615 3616 3617 3618 3619 3620 3621 3622 3623 3624 3625 3626 3627 3628 3629 3630 3631 3632 3633 3634 3635 3636 3637 3638 3639 3640 3641 3642 3643 3644 3645 3646 3647 3648 3649 3650 3651 3652 3653 3654 3655 3656 3657 3658 3659 3660 3661 3662 3663 3664 3665 3666 3667 3668 3669 3670 3671 3672 3673 3674 3675 3676 3677 3678 3679 3680 3681 3682 3683 3684 3685 3686 3687 3688 3689 3690 3691 3692 3693 3694 3695 3696 3697 3698 3699 3700 3701 3702 3703 3704 3705 3706 3707 3708 3709 3710 3711 3712 3713 3714 3715 3716 3717 3718 3719 3720 3721 3722 3723 3724 3725 3726 3727 3728 3729 3730 3731 3732 3733 3734 3735 3736 3737 3738 3739 3740 3741 3742 3743 3744 3745 3746 3747 3748 3749 3750 3751 3752 3753 3754 3755 3756 3757 3758 3759 3760 3761 3762 3763 3764 3765 3766 3767 3768 3769 3770 3771 3772 3773 3774 3775 3776 3777 3778 3779 3780 3781 3782 3783 3784 3785 3786 3787 3788 3789 3790 3791 3792 3793 3794 3795 3796 3797 3798 3799 3800 3801 3802 3803 3804 3805 3806 3807 3808 3809 3810 3811 3812 3813 3814 3815 3816 3817 3818 3819 3820 3821 3822 3823 3824 3825 3826 3827 3828 3829 3830 3831 3832 3833 3834 3835 3836 3837 3838 3839 3840 3841 3842 3843 3844 3845 3846 3847 3848 3849 3850 3851 3852 3853 3854 3855 3856 3857 3858 3859 3860 3861 3862 3863 3864 3865 3866 3867 3868 3869 3870 3871 3872 3873 3874 3875 3876 3877 3878 3879 3880 3881 3882 3883 3884 3885 3886 3887 3888 3889 3890 3891 3892 3893 3894 3895 3896 3897 3898 3899 3900 3901 3902 3903 3904 3905 3906 3907 3908 3909 3910 3911 3912 3913 3914 3915 3916 3917 3918 3919 3920 3921 3922 3923 3924 3925 3926 3927 3928 3929 3930 3931 3932 3933 3934 3935 3936 3937 3938 3939 3940 3941 3942 3943 3944 3945 3946 3947 3948 3949 3950 3951 3952 3953 3954 3955 3956 3957 3958 3959 3960 3961 3962 3963 3964 3965 3966 3967 3968 3969 3970 3971 3972 3973 3974 3975 3976 3977 3978 3979 3980 3981 3982 3983 3984 3985 3986 3987 3988 3989 3990 3991 3992 3993 3994 3995 3996 3997 3998 3999 4000 4001 4002 4003 4004 4005 4006 4007 4008 4009 4010 4011 4012 4013 | {
"paper_id": "P85-1013",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T09:39:27.102093Z"
},
"title": "MODULAR LOGIC GRAMMARS",
"authors": [
{
"first": "Michael",
"middle": [
"C"
],
"last": "Mccord",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "IBM Thomas J. Watson Research Center",
"location": {
"postBox": "P. O. Box 218",
"postCode": "10598",
"settlement": "Yorktown Heights",
"region": "NY"
}
},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "",
"pdf_parse": {
"paper_id": "P85-1013",
"_pdf_hash": "",
"abstract": [],
"body_text": [
{
"text": "Modular Logic Grammars, exhibiting a high degree of modularity between syntax and semantics.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "There is a syntax rule compiler (compiling into Prolog) which takes care of the building of analysis structures and the interface to a clearly separated semantic interpretation component dealing with scoping and the construction of logical forms.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "The whole system can work in either a one-pass mode or a two-pass mode.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "[n the one-pass mode, logical forms are built directly during parsing through interleaved calls to semantics, added automatically by the rule compiler.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "[n the two-pass mode, syntactic analysis trees are built automatically in the first pass, and then given to the (one-pass) semantic component.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "The grammar formalism includes two devices which cause the automatically built syntactic structures to differ from derivation trees in two ways:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "[I) There is a shift operator, for dealing with left-embedding constructions such as English possessive noun phrases while using rightrezursive rules (which are appropriate for Prolog parsing).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "(2) There is a distinction in the syntactic formalism between strong non-terminals and weak non-terminals, which is important for distinguishing major levels of grammar.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "l'he term logic grammar will be used here, in the context of natural language processing, to mean a logic programming system (implemented normally in P\u00a3olog), which associates semantic representations Cnormally in some version of preaicate logic) with natural language text.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I. INTRODUCTION",
"sec_num": null
},
{
"text": "Logic grammars may have varying degrees on modularity in their treatments of syntax and semantics.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I. INTRODUCTION",
"sec_num": null
},
{
"text": "Th, ere may or may not be an isolatable syntactic component.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I. INTRODUCTION",
"sec_num": null
},
{
"text": "In writing metamorpilosis grammars (Colmerauer, 1978) , or definite clause grammars, DCG's, (a special case of metamorphosis grammars, Pereira and Warren. 1980) , it is possible to build logical forms directly in the syntax rules by letting nonterminals have arguments that represent partial logical forms being manipulated.",
"cite_spans": [
{
"start": 35,
"end": 53,
"text": "(Colmerauer, 1978)",
"ref_id": "BIBREF3"
},
{
"start": 135,
"end": 160,
"text": "Pereira and Warren. 1980)",
"ref_id": "BIBREF17"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "I. INTRODUCTION",
"sec_num": null
},
{
"text": "Some of the ear-ties= logic grammars (e.g., Dahl, 1977 ) used this approach.",
"cite_spans": [
{
"start": 44,
"end": 54,
"text": "Dahl, 1977",
"ref_id": "BIBREF4"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "I. INTRODUCTION",
"sec_num": null
},
{
"text": "There is certainly an appeal in being dicect, but there are some disadvantages in this lack of modularity.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I. INTRODUCTION",
"sec_num": null
},
{
"text": "One disadvantage is that it seems difficulZ to get an adequate treatment of the scoping of quantifiers (and more generally focalizers, McCord, 1981) when the building of logical forms is too closely bonded to syntax. Another disadvantage is just a general result of lack of modularity: it can be harder to develop and understand syntax rules when too much is going on in them.",
"cite_spans": [
{
"start": 135,
"end": 148,
"text": "McCord, 1981)",
"ref_id": "BIBREF13"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "I. INTRODUCTION",
"sec_num": null
},
{
"text": "The logic grammars described in McCord (1982 McCord ( , 1981 were three-pass systems, where one of the main points of the modularity was a good treatment of scoping.",
"cite_spans": [
{
"start": 32,
"end": 44,
"text": "McCord (1982",
"ref_id": "BIBREF12"
},
{
"start": 45,
"end": 60,
"text": "McCord ( , 1981",
"ref_id": "BIBREF13"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "I. INTRODUCTION",
"sec_num": null
},
{
"text": "The first pass was the syntactic component, written as a definite clause grammar, where syntactic structures were explicitly built up in the arguments of the non-terminals.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I. INTRODUCTION",
"sec_num": null
},
{
"text": "Word sense selection and slot-filling were done in this first pass, so that the output analysis trees were actually partially semantic.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I. INTRODUCTION",
"sec_num": null
},
{
"text": "The second pass was a preliminary stage of semantic interpretation in which the syntactic analysis tree was reshaped to reflect proper scoping of modifiers.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I. INTRODUCTION",
"sec_num": null
},
{
"text": "The third pass took the reshaped tree and produced logical forms in a straightforward way by carrying out modification of nodes by their daughters using a modular system of rules that manipulate semantic items --consisting of logical forms together with terms that determine how they can combine.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I. INTRODUCTION",
"sec_num": null
},
{
"text": "The CHAT-80 system Warren, 1982, Pereira, 1983 ) is a three-pass system.",
"cite_spans": [
{
"start": 19,
"end": 46,
"text": "Warren, 1982, Pereira, 1983",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "I. INTRODUCTION",
"sec_num": null
},
{
"text": "The first pass is a purely syntactic component using an extrapositJon grammar (Pereira, 1981) and producing syntactic analyses in righ~ost normal form. The second pass handles word sense selection and slotfilling, and =he third pass handles some scoping phenomena and the final semantic interpretation. One gets a great deal of modularity between syntax and semantics in that the first component has no elements of semantic interpretation at all.",
"cite_spans": [
{
"start": 78,
"end": 93,
"text": "(Pereira, 1981)",
"ref_id": "BIBREF15"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "I. INTRODUCTION",
"sec_num": null
},
{
"text": "In McCocd (1984) a one-pass semantic interpretation component, SEM, for the EPISTLE system {Miller, Heidorn and Jensen, 1981) was described. SEM has been interfaced both to the EPISTLE NLP grammar (Heidorn, 1972, Jensen and Heidorn, 1983) , as well as to a logic grammar, SYNT, written as a DCG by the author.",
"cite_spans": [
{
"start": 3,
"end": 16,
"text": "McCocd (1984)",
"ref_id": null
},
{
"start": 100,
"end": 125,
"text": "Heidorn and Jensen, 1981)",
"ref_id": "BIBREF14"
},
{
"start": 197,
"end": 223,
"text": "(Heidorn, 1972, Jensen and",
"ref_id": null
},
{
"start": 224,
"end": 238,
"text": "Heidorn, 1983)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "I. INTRODUCTION",
"sec_num": null
},
{
"text": "These grammars are purely syntactic and use the EPISTLE notion (op. cir.) of approximate parse, which is similar to Pereira's notzon of righ~s~ normal form, but was developed independently.",
"cite_spans": [
{
"start": 63,
"end": 73,
"text": "(op. cir.)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "I. INTRODUCTION",
"sec_num": null
},
{
"text": "Thus SYNT/SEM is a two-pass system with a clear modularity between syntax and semantics.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I. INTRODUCTION",
"sec_num": null
},
{
"text": "In DCG's and extraposition grammars, the building of analysis structures .(either logical forms or syntactic trees) must be specified explicitly in the syntax rules.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I. INTRODUCTION",
"sec_num": null
},
{
"text": "A certain amoun~ of modularity is then lost, because the grammar writer must be aware of manipulating these structures, and the possibility of using the grammar in different ways is reduced. [n Dahl and McCord (1983) , a logic grammar formalism was described, modifier structure grammars (HSG's), in which structure-building (of annotated derivation trees) is implicit in the formalism.",
"cite_spans": [
{
"start": 194,
"end": 216,
"text": "Dahl and McCord (1983)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "I. INTRODUCTION",
"sec_num": null
},
{
"text": "MSG's look formally like extraposition grammars, with the additional ingredient that semantic items (of the type used in McCord (1981) ) can be indicated on the left-hand sides of rules, and contribute automatically to the construction of a syntactico-semantic tree much like that in HcCord (1981) . These MSG's were used interpretively in parsing, and then (essentially) the two-pass semantic interpretation system of McCord (1981) was used to get logical forms.",
"cite_spans": [
{
"start": 121,
"end": 134,
"text": "McCord (1981)",
"ref_id": "BIBREF13"
},
{
"start": 284,
"end": 297,
"text": "HcCord (1981)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "I. INTRODUCTION",
"sec_num": null
},
{
"text": "So, totally there were three passes in this system.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I. INTRODUCTION",
"sec_num": null
},
{
"text": "[n this report, [ wish to describe a logic grammar system, modular logic grammars (MLG's), with the following features:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I. INTRODUCTION",
"sec_num": null
},
{
"text": "There is a syntax rule compiler which takes care of the building of analysis structures and the interface to semantic interpretation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I. INTRODUCTION",
"sec_num": null
},
{
"text": "There is a clearly separated semantic interpretation component dealing with scoping and the construction of logical forms.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I. INTRODUCTION",
"sec_num": null
},
{
"text": "The whole system (syntax and semantics) can work optionally in either a one-pass mode or a twopass mode.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I. INTRODUCTION",
"sec_num": null
},
{
"text": "In the one-pass mode, no syntactic structures are built, but logical forms are built directly during parsing through interleaved calls to the semantic interpretation component, added automatically by the rule compiler.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I. INTRODUCTION",
"sec_num": null
},
{
"text": "in the two-pass mode, the calls to the semantic interpretation component are not interleaved, but are made in a second pass, operating on syntactic analysis trees produced (automatically) in the first pass.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I. INTRODUCTION",
"sec_num": null
},
{
"text": "The syntactic formalism includes a t device, called the shift operator, for dealing with left-embedding constructions such as English possessive noun phrases (\"my wife's brother's friend's car\") and Japanese relative clauses. ~ne shift operator instructs the rule compiler to build the structures appropriate for leftembedding. These structures are not derivation trees, because the syntax rules are right-recursive, because of the top-down parsing associated with Prolo E.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I. INTRODUCTION",
"sec_num": null
},
{
"text": "There is a distinction in the syntactic formalism between strong non-terminals and weak non-terminals, which is important for distinguishing major levels of grammar and which simplifies the. working of semantic interpretation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I. INTRODUCTION",
"sec_num": null
},
{
"text": "This distinction also makes the (auto-matically produced) syntactic analysis trees much more readable and natural linguistically.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I. INTRODUCTION",
"sec_num": null
},
{
"text": "In the absence of shift constructions, these trees are like derivation trees, but only with nodes corresponding to strong non-terminals.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I. INTRODUCTION",
"sec_num": null
},
{
"text": "[n an experimental MLG, the semantic component handles all the scoping phenomena handled by that in McCord (1981) and more than the semantic component in McCord (1984) . The logical form language is improved over that in the previous systems.",
"cite_spans": [
{
"start": 100,
"end": 113,
"text": "McCord (1981)",
"ref_id": "BIBREF13"
},
{
"start": 154,
"end": 167,
"text": "McCord (1984)",
"ref_id": "BIBREF14"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "I. INTRODUCTION",
"sec_num": null
},
{
"text": "The MLG formalism allows for a great deal of modularity in natural language grammars, because the syntax rules can be written with very little awareness of semantics or the building of analysis structures, and the very same syntactic component can be used in either the one-pass or the two-pass mode described above.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I. INTRODUCTION",
"sec_num": null
},
{
"text": "Three other logic grammar systems designed with modularity in mind are Hirschman and Puder (1982) , Abramson (1984) and Porto and Filgueiras (198&) . These will be compared with MLG's in Section 6.",
"cite_spans": [
{
"start": 71,
"end": 97,
"text": "Hirschman and Puder (1982)",
"ref_id": "BIBREF8"
},
{
"start": 100,
"end": 115,
"text": "Abramson (1984)",
"ref_id": "BIBREF0"
},
{
"start": 120,
"end": 147,
"text": "Porto and Filgueiras (198&)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "I. INTRODUCTION",
"sec_num": null
},
{
"text": "The syntactic component for an MLG consists of a declaration of the strong non-terminals, followed by a sequence of MLG syntax rules.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "THE MLG SYNTACTIC FORMALISM",
"sec_num": "2."
},
{
"text": "The dec-[aration of strong non-terminals is of the form strongnonterminals(NTI.NT2 ..... NTn.nil).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "THE MLG SYNTACTIC FORMALISM",
"sec_num": "2."
},
{
"text": "where the NTi are the desired strong non-terminals (only their principal functors are indicated). Non-terminals that are not declared strong are called weak.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "THE MLG SYNTACTIC FORMALISM",
"sec_num": "2."
},
{
"text": "The significance of the strong/weak distinction will be explained below.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "THE MLG SYNTACTIC FORMALISM",
"sec_num": "2."
},
{
"text": "rules are of the form",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "MLG syntax",
"sec_num": null
},
{
"text": "A ~---> B",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "MLG syntax",
"sec_num": null
},
{
"text": "where A is a non-terminal and B is a rule body. A rule body is any combination of surlCace terminals, logical terminals, goals, shifted non-terminals, non-tprminals, the symbol 'nil', and the cut symbol '/', using the sequencing operator ':' and the 'or' symbol 'l'",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "MLG syntax",
"sec_num": null
},
{
"text": "(We represent left-to-right sequencing with a colon instead of a comma, as is often done in logic grammars.)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "MLG syntax",
"sec_num": null
},
{
"text": "These rule body elements are Prolog terms (normally with arguments), and they are distinguished formally as follows.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "MLG syntax",
"sec_num": null
},
{
"text": "terminal is of the form +A, where A is any Prolog term.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A su~e",
"sec_num": null
},
{
"text": "Surface terminals correspond to ordinary terminals in DCG's (they match elements of the surface word string), and the notation is often [A] in DCG's.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A su~e",
"sec_num": null
},
{
"text": "Op is a modification operator and LF is a logical form.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "Logical terminals are special cases of semantic items, the significance of which will be explained below. Formally, the rule compiler recognizes them as being terms of the form A-B. There can be any number of them in a rule body.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "A goal is of the form $A, where A is a term representing a Prolog goal.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "(This is the usual provision for Prolog procedure calls, which are often indicated by enclosure in braces in DCG's.)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "A shifted non-terminal is either of the form%A, or of the form F%A, where A is a weak nonterminal and F is any ~erm.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "(In practice, F will be a list of features.)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "As indicated in the introduction, the shift operator '~' is used to handle left-embedding constructions in a right-recursive ~ule system. Any rule body element not of the above four forms and not 'nil' or the cut symbol is taken to be a non-terminal.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "A terminal is either a surface terminal or a logical ~erminal.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "Surface ~erminals are building blocks for the word string being analyzed, and logical terminals are building blocks for the amalysis structures.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "A syntax rule is called strong or weak, .,ucording as the non-terminal on its left-hand side is strong or weak.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "It can be seen that on a purely formal level, the only differences between HLG syntax rules and DCG's are (1) the appearance of logical terminals in rule bodies of MLG's, (2) the use of ~he shift operator, and (3) the distinction between strong and weak non-terminals.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "However, for a given linguistic coverage, the syntactic component of an MLG will normally be more compact than the corresponding DCG because structure-building must be ,~xplicit in DCG's.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "In this report, the arrow '-->' (as opposed to ':>') will be used for for DCG rules, and the same notation for sequencing, terminals, etc.. will be used for DCG's as for MLG's.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "What is the significance of the strong/weak distinction for non-terminals and rules?",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "Roughly, a strong rule should be thought of as introducing a new l\u00aevel of grammar, whe[eas a weak rule defines analysis within a level.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "Major categories like sentence and noun phrase are expanded by strong rules, but auxiliary rules like the reoursive rules that find the postmodifiers of a verb are weak rules.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "An analogy with ATN's (Woods, 1970) is t~at strong non-tecminals are like the start categories of subnetworks (with structure-building POP arcs for termination), whereas weak non-terminals are llke internal nodes.",
"cite_spans": [
{
"start": 22,
"end": 35,
"text": "(Woods, 1970)",
"ref_id": "BIBREF21"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "In the one-pass mode, the HLG rule compiler makes the following distinction for strong and weak rules.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "In the Horn clause ~ranslatiDn of a strong ~11e, a call to the semantic interpretation component is compiled in at the end of the clause. The non-terminals appearing in rules (both strong and weak) are given extra arguments which manipu!aKe semantic structures used in the call to semantic interpretation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "No such call to semantics is compiled in for weak rules.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "Weak rules only gather information to be used in the call to semantics made by the next higher strong rule. (Also, a shift generates a call to semantics.)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "In the two-pass mode, where syntactic analysis trees are built during the first pass, the rule compiler builds in the construction of a tree node corresponding to every strong rule. The node is labeled essentially by the non-terminal appearing on the left-hand side of the strong rule.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "(A shift also generates the construction of a tree node.) Details of rule compilation will be given in the next section.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "As indicated above, logical terminals, and more generally semantic items, are of the form",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "Operator-LogicalForm.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "The Operator is a term which determines how the semantic item can combine with other semantic items during semantic interpretation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "(In this combination, new semantic items are formed which ;ire no longer logical terminals.)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "Logical terminals are most typically associated with lexical items, although they ar~ also used to produc~, certain nonlexical ingredients in logical form analysis.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "An example for the lexical item \"each\" might be Q/Peach(P,Q).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "Here the operator Q/P is such that when the \"each\" item modifies, say, an item having logical form man(X), P gets unified with man(X), and the re-",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "sulting semantic item is @Q -each(~.an(X),Q)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "where @q is an operator which causes Q to get unified wi~h the logical form of a further modificand. Details ,Jr the dse of semantic items will be given in Section A.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "Now let us look at the syntactic component of a sample HLG which covers the same ground as a welt-known DCG.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "The following DCG is taken essentially from Pereira and Warren (1980) . It is the sort of DCG that builds logical forms directly Dy manipulating partial logical forms in arguments of the grammar symbols. sentfP) --> np(X,PI,P): vp(X,Pl). np(X,P~,P) --~ detfP2,PI,P): noun(X,P3): relclause(X,P3,P2). np(X,P,P) --> name(X). vp(X,P) --> transverbfX,Y,Pl): np(Y,Pl,P). vpfX,P~ --> intransverb(X,P). relcbtuse(X,Pl,Pl&P2) --> +that: vp(X,P2). relc~ause(*,P,P) --> nil. det(PI,P2,P) --> +D: $dt~D,PI,P2,P). nounfX,P) --> +N: SnfN,X,P). name(X) --> +X: $nm(X). transverb(X,Y,P) --> +V: $tv(V,X,Y,P). intransverb(X,P) --> +V: $iv(V,X,P).",
"cite_spans": [
{
"start": 44,
"end": 69,
"text": "Pereira and Warren (1980)",
"ref_id": "BIBREF17"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "/~ Lexicon */ n(maa,X,man(X) ). n(woman, X,woman (X)). ~(john). nm(mary).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "dt(every,P1,P2,all(P1,P2)). dt(a,PI,P2,ex(Pl,P2)). tv(loves,X,Y,love(X,Y)). iv(lives,X,live(X)).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "The syntactic component of an analogous HLG is as follows.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "The lexicon is exactly the same as that of the preceding DCG.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "For reference below, this grammar will be called MLGRAH. strongnonterminals(sent.np.relclause.det.nil). sent ~> np(X): vp(X). np(X) => dec: noun(X): relclause(X). np(X) ~> name(X). vp(X) ~> transverb(X,Y): np(Y). vp(X) ~> intransverb(X). relclause(X) ~> +that: vp(X). relclause(*) ~> nil. det ~> +O: Sdt(D,P1,P2,P):",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "PZ/PI-P. noun(X) ----> +N: Sn(N,X,P): I-P. name(X) ~> +X: Snm(X). transverb(X,Y) :> +V: $tv(V,X,Y,P): I-P. intransverb(X) => +V: $iv(V,X,P): l-P This small grammar illustrates all the ingredients of HLG syntax rules except the shift operator. The shift will be illustrated below.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "Note that 'sent' and 'np' are strong categories but 'vp' is weak. A result is that there will be no call to semantics at the end of the 'vp' rule.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "Instead, the semantic structures associated with the verb and object are passed up to the 'sent' level, so that the subject and object are \"thrown into the same pot\" for semantic combination.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "(However, their surface order is not forgotten.)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "There are only two types of modification operators appearing in the semantic items of this MLG: 'I' and P2/PI. The operator 'i' means 'leftconlotn .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "Its effect is to left-conjoin its associated logical form to the logical form of the modificand (although its use in this small grammar is almost trivial).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "The operator P2/PI is associated with determiners, and its effect has been illustrated above.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "The semantic component will be given below in Section &.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "A sa~_ple semantic analysis for the sentence \"Every man that lives loves a woman\" is all(man(Xl)&live(Xl),ex(woman(X2),love(Xl,X2))). This is the same as for the above DCG. We will also show a sample parse in the next section.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "A fragment of an MLG illustrating the use of the shift in the treatment of possessive noun phrases is as follows:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "np ~---> deC: npl. npl => premods: noun: np2. vp2 ~> postmods. np2 ~> poss: %npl.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "_The idea of this fragment can be described in a rough procedural way, as follows.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "In parsing an np, one reads an ordinary determiner (deC), then goes to npl. In npl, one reads several premodifiers (premods), say adjectives, then a head noun, then goes to np2.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "[n np2, one may either finish by reading postmodifiers (postmods), OR one may read an apostrophe-s (poss) and then SHIFT back to npl. (in the two-pass mode) are manipulated (in the compiled rules) so that the initial np (\"the old man\") becomes a left-embedded sub-structure of the larger np (whose head is \"hat\").",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "But if no apostrophe-s is encountered, then the structure for \"the old man\" remains on the top level.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A logical terminal is of the form 0p-L~, where",
"sec_num": null
},
{
"text": "In describing rule compilation, we will first look at the two-pass mode, where syntactic structures are built in the first pass, because the relationship of the analysis structures to the syntax rules is more direct in this case.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "The syntactic structures manipulated by the compiled rules are represented as syntactic items, which are terms of the form syn (Features,Oaughters) where Features is a feature list (to be defined), and Daughters is a list consisting of syntactic items and terminals.",
"cite_spans": [
{
"start": 127,
"end": 147,
"text": "(Features,Oaughters)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "Both types of terminal (surface and logical) are included in Daughters, but the displaying procedures for syntactic structures can optionally filter out one or the other of the two types.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "A feature list is of the form nt:Argl, where nt is the principal fun=tot of a strong non-terminal and Argl is its first argument.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "(If nt has no arguments, we take Argl=nil.)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "It is convenient, in large grammars, to use this first argument Argl to hold a list (based on the operator ':') of grammatical features of the phrase analyzed by the non-terminal (like number and person for noun phrases).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "[n compiling DCG rules into Prolog clauses, each non-terminal gets two extra arguments treated as a difference list representing the word string analyzed by the non-terminal.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "In compiling MLG rules, exactly the same thing is done to handle word strings.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "For handling syntactic structures, the MLG rule compiler adds additional arguments which manipulate 'syn' structures.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "The number of additional arguments and the way they are used depend on whether :he non-terminal is strong or weak.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "If the original non-terminal is strong and has the form nt (Xl .... , Xn) then in the compiled version we will have",
"cite_spans": [
{
"start": 59,
"end": 73,
"text": "(Xl .... , Xn)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "nt(Xl ..... Xn, Syn, Strl,Str2).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "Here there is a single syntactic structure argument, Syn, representing the syntactic structure of the phrase associated by nt with the word string given by the difference list (Strl, Sir2).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "On the other hand, when the non-terminal nt is weak, four syntactic structure arguments are added, producing a compiled predication of the form nt (Xl, .... Xn, SynO, Syn, Hodsl, Hods2, Strl, Str2) .",
"cite_spans": [
{
"start": 147,
"end": 151,
"text": "(Xl,",
"ref_id": null
},
{
"start": 152,
"end": 160,
"text": ".... Xn,",
"ref_id": null
},
{
"start": 161,
"end": 166,
"text": "SynO,",
"ref_id": null
},
{
"start": 167,
"end": 171,
"text": "Syn,",
"ref_id": null
},
{
"start": 172,
"end": 178,
"text": "Hodsl,",
"ref_id": null
},
{
"start": 179,
"end": 185,
"text": "Hods2,",
"ref_id": null
},
{
"start": 186,
"end": 191,
"text": "Strl,",
"ref_id": null
},
{
"start": 192,
"end": 197,
"text": "Str2)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "Here the pair (Hodsl, Hods2) holds a difference list for the sequence of structures analyzed by the weak non-terminal nt.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "These structures could be 'syn' structures or terminals, and they will be daughters (modifiers) for a 'syn' structure associated with the closest higher call to a strong non-terminal --let us call this higher 'syn structure the matrix 'syn' structure.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "The other pair (SynO, Syn) represents the changing view of what the matrix 'syn' structure actually should be, a view that may change because a shift is encountered while satisfying nt.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "SynO represents the version before satisfying nt, and Syn represents the version after satisfying nt.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "If no shift is encountered while satisfying nt, then Syn will just equal SynO.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "But if a shift is encountered, the old version SynO will become a daughter node in the new version Syn.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "In compiling a rule with several non-terminals in the rule body, linked by the sequencing operator ':', the argument pairs (SynO, Syn) and (Hodsl, Hods2) for weak non-terminals are linked, respectively, across adjacent non-terminals in a manner similar to the linking of the difference lists for word-string arguments. Calls to strong nonterminals associate 'syn' structure elements with the modifier lists, just as surface terminals are associated with elements of the word-string lists.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "Let us look now at the compilation of a set of rules.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "We will take the noun phrase grammar fragment illustrating the shift and shown above in Section 2, and repeated for convenience here, together with declarations of strong non-terminals. In the first compiled rule, the structure Syn to be associated with the call to 'np' appears again in the second matrix structure argument of 'npl' The first matrix structure argument of 'npl' is syn(np:nil,Mod:Hods).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "and this will turn out to be the value of Syn if no shifts are encountered.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "Here Hod is the 'syn' structure associated with the determiner 'det', and Hods is the list of modifiers determined further by 'npi'.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "The feature list np:nil is constructed from the leading non-terminal 'np' of this strong rule.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "(It would have been np:Argl if np had a (first) argument Argl.)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "[n the second and third compiled rules, the matrix structure pairs (first two arguments) and the modifier difference list pairs are linked in a straightforward way to reflect sequencing.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "]'be fourth rule shows the effect of the shift. Here syn(Feas,HodsO), the previous \"conjecture\" for the matrix structure, is now made simply the first modifier in the larger structure syn(Feas,syn(Feas,HodsO):Hods2) which becomes the new \"conjecture\" by being placed in the first argument of the further call to 'npl'. If the shift operator had been used in its binary form FO%npl, then the new conjecture would be syn(NT:F,syn(NT:FO,Mods0):Hods2)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "where the old conjecture was syn(NT:F,HodsO).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "[n larger grammars, this allows one to have a completely correct feature list NT:FO for the leftembedded modifier.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "To illustrate the compilation of terminal symbols, let us look at the rule det => +O: Sdt(D,PI,P2,P): P2/Pt-P. from the grammar HLGRAM in Section 2. The compiled rule is det(syn(det:nil,+D:P2/PI-P:nil), D.Str,Str) <dt(D,PI,P2,P).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "Note that both the surface terminal +D and the logical terminal P2/PI-P are entered as modifiers of the 'det' node.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "The semantic interpretation component looks only at the logical terminals, but in certain applications it is useful to be able to see the surface terminals in the syntactic structures.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "As mentioned above, the display procedures for syntac=i\u00a2 structures can optionally show only one type of terminal.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "The display of the syntactic structure of the sentence \"Every man loves a woman\" produced by MLGRAM is as follows. l-woman(X&)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "Note that no 'vp' node is shown in the parse tree; 'vp' is a weak non-terminal. The logical form produced for this tree by the semantic component given in the next section is all(man(Xl), ex(woman(X2),love(XI,X2))). Now let us look at the compilation of syntax rules for the one-pass mode.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "In this mode, syntactic structures are not built, but semantic structures are built up directly.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "The rule compiler adds extra arguments to non-terminals for manipulation of semantic structures, and adds calls to the top-level semantic interpretation procedure, 'semant'.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "The procedure 'semant' builds complex semantic structures out of simpler ones, where the original building blocks are the logical terminals appearing in the MLG syntax rules.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "In this process of construction, it would be possible to work with semantic items (and in fact a subsystem of the rules do work directly with semantic items), but it appears to be more efficient to work with slightly more elaborate structures which we call augmented semantic items.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "These' are terms of the form sem(Feas,Op,LP),",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "where Op and [2 are such that Op-LF is an ordinary semantic item, and Fees is either a feature list or the list terminal:nil.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "The latter form is used for the initial augmented semantic items associated with logical terminals.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "As in the two-pass mode, the number of analysis structure arguments added to a non-terminal by the compiler depends on whether the non-terminal is strong or weak.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "If the original non-terminal is strong and has the form nt (Xl, ..., Xn) then in the compiled version we will have nt (Xl, ..., Xn, Semsl, Sems2, Strl, Str2) .",
"cite_spans": [
{
"start": 59,
"end": 72,
"text": "(Xl, ..., Xn)",
"ref_id": null
},
{
"start": 118,
"end": 122,
"text": "(Xl,",
"ref_id": null
},
{
"start": 123,
"end": 127,
"text": "...,",
"ref_id": null
},
{
"start": 128,
"end": 131,
"text": "Xn,",
"ref_id": null
},
{
"start": 132,
"end": 138,
"text": "Semsl,",
"ref_id": null
},
{
"start": 139,
"end": 145,
"text": "Sems2,",
"ref_id": null
},
{
"start": 146,
"end": 151,
"text": "Strl,",
"ref_id": null
},
{
"start": 152,
"end": 157,
"text": "Str2)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "Here (Semsl, Sems2) is a difference list of augmented semantic items representing the list of semantic s~ruotures for the phrase associated by n~ with the word s~ring given by the difference list (Strl, Sir2).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "In the syntactic (two-pass) mode, only one argument (for a 'syn') is needed here, but now we need a list of structures because of a raising phenomenon necessary for proper scoping, which we will discuss in Sections A and 5.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "When the non-terminal nt is weak, five extra arguments are added, producing a compiled predication of the form nt (Xl, ..., Xn, Fees, SemsO, Sems, Semsl, Sems2, Strl, Str2) .",
"cite_spans": [
{
"start": 114,
"end": 118,
"text": "(Xl,",
"ref_id": null
},
{
"start": 119,
"end": 123,
"text": "...,",
"ref_id": null
},
{
"start": 124,
"end": 127,
"text": "Xn,",
"ref_id": null
},
{
"start": 128,
"end": 133,
"text": "Fees,",
"ref_id": null
},
{
"start": 134,
"end": 140,
"text": "SemsO,",
"ref_id": null
},
{
"start": 141,
"end": 146,
"text": "Sems,",
"ref_id": null
},
{
"start": 147,
"end": 153,
"text": "Semsl,",
"ref_id": null
},
{
"start": 154,
"end": 160,
"text": "Sems2,",
"ref_id": null
},
{
"start": 161,
"end": 166,
"text": "Strl,",
"ref_id": null
},
{
"start": 167,
"end": 172,
"text": "Str2)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "Here Fees is the feature list for the matrix strong non-terminal. The pair (SemsO, Sems) represents the changing \"conjecture\" for the complete list of. daughter (augmented) semantic items for the matrix node, and is analogous to first extra argument pair in the two-pass mode. The pair (Semsl, Sems2) holds a difference list for the sequence of semantic items analyzed by the weak non-terminal nt.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "Semsl will be a final sublist of SemsO, and Sems2 will of course be a final sub|ist of Semsl.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "For each strong rule, a cal-i to 'semant' is added at the end of the compiled form of the rule. The form of the call is semant(Feas, Sems, Semsl,Sems2).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "Here teas is the feature list for the non-terminal on the left-hand side of the rule. Sems is the final version of the list of daughter semantic items (after all adjustments for shifts) and (SemsL, Sems2)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "is the difference list of semantic items resulting from the semantic interpretation for this level.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "(Think of Fees and Sems as input to 'semant', and (Semsl, Sems2) as output.) CSemsl, Sems2) will be the structure arguments for the non-terminal on the left-hand side of the strong rule.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "A call to 'semant' is also generated when a shift is encountered, as we will see below.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "The actual working of 'semant' is the topic of the next section.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "For the shift grammar fragment shown above, the compiled rules are as follows.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "np(Sems,Sems0, Strl,Str3) <- det(Semsl,Sems2, Strl,Str2) & npl(np:nil, Semsl,Sems3, Sems2,nil, Str2,Scr3) a semant(np:nil, Sems3, Sems,SemsO). npl(Feas, Semsl,Sems3, Semsa,Sems7, Strl,St[~) <- premods(Feas, Semsl,Sems2, SemsA,Sems5, Strl,Str2) & noun(Sems5,Sems6, Str2,Str3) & np2(Feas, Sems2,Sems3, Sems6,SemsT, Str3,StrA). np2(Feas, Semsl,Sems2, Sems3,Semsd, Strl,Str2) <- postmods(Feas, Semsl,Sems2, Sems3,SemsA, Strl,Str2). npE(Feas, Semsl.SemsA, SemsS,Sems6, Strl,Str3) <- poss(SemsS,Sems6, Strl,Str2) & semant(Feas, Semsl, Sems2,Sems3) & npl(Feas, Sems2,Sems~, Sems3,nil, Str2,Str3).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "In the first compiled rule (a strong rule), the pair (Seres, SemsO) is a difference list of the semantic items analyzing the noun phrase.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "(Typically there will just be one element in this list, but there can be more when modifiers of the noun phrases contain quantifiers that cause the modifiers to get promoted semantically to be sisters of the noun phrase.)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "This difference list is the output of the call to 'semant' compiled in at the end of the first rule.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "The input to this call is the list Sems3 (along with the feature list np:nil).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "We arrive at Sems3 as follows.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "The list Semsl is started by , ! the call to det ; its first element is the determiner (if there is one), and the list is continued in the list Sems2 of modifiers determined further by the call to 'npl'. In this call to 'npl', the initial list Semsl is given in the second argument of 'npl' as the \"initial verslon for the final list of modifiers of the noun phrase.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "Sems3, being in the next argument of 'npl', is the \"final version\" of the np modifier list, and this is the list given as input to 'semant'.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "[f the processing of 'npl' encounters no shifts, then Sems3 will just equal 5ems I.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "[n the second compiled rule (for 'npl'), the \"versions\" of the total list of modifiers are [inked in a chain (Semsl, 5ems2, Sems3) in the second and third arguments of the weak nonterminals.",
"cite_spans": [
{
"start": 109,
"end": 116,
"text": "(Semsl,",
"ref_id": null
},
{
"start": 117,
"end": 123,
"text": "5ems2,",
"ref_id": null
},
{
"start": 124,
"end": 130,
"text": "Sems3)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "The actual modifiers produced by this rule are linked in a chain (SemsA, Sems51 Sems6, SemsT) in the fourth and fifth arguments of the weak nonterminals and the first and second arguments of the strong non-terminals.",
"cite_spans": [
{
"start": 65,
"end": 72,
"text": "(SemsA,",
"ref_id": null
},
{
"start": 73,
"end": 86,
"text": "Sems51 Sems6,",
"ref_id": null
},
{
"start": 87,
"end": 93,
"text": "SemsT)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "A similar situation holds for the first of the 'np2' rules.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "[n the second 'npZ' rule, a shift is encountered, so a call to 'semant' is generated. This is necessary because of the shift of levels; the modifiers produced so far represent all the modifiers in an np, and these must be combined by 'semant' to get the analysis of this np.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "As input to this call to 'semant', we take the list Semsl, which is the current version of the modifiers of the matrix np.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "The output is the difference list .(Sems2, gems3).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "Sems2 is given to the succeeding call to 'npl' as the new current version of the matrix modifier list.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "The tail Sems3 of the difference list output by 'semant' is given to 'npl' in its fourth argument to receive further modifiers.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "SemsA is the f~.nal uersion of the matrix modifier list, determined by 'npi I , and this information is also put in the third a,'gument of 'np2'. The difference list (Sems5, Semsb) contains the single element produced by 'poss', and this list tails off the list Semsl.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPILATION OF MLG SYNTAX RULES",
"sec_num": "3."
},
{
"text": "item Op-LF occurs in a rule body, the rule compiler inserts the augmented semantic item sem(terminal:nil,Op,LF).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "When a semantic",
"sec_num": null
},
{
"text": "As an example, the weak rule transverb(X,Y) ~> +V: $tv(V,X,Y,P): I-P. ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "When a semantic",
"sec_num": null
},
{
"text": "The semantic interpretation schemes for both the one-pass mode and the two-pass mode share a large core of common procedures; they differ only at the top level.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTIC INTERPRETATION FOR MLG'S",
"sec_num": "4."
},
{
"text": "In both schemes, augmented semantic items are combined with one another, forming more and more complex items, until a single item is constructed which represents the structure of the whole sentence.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTIC INTERPRETATION FOR MLG'S",
"sec_num": "4."
},
{
"text": "In this final structure, only the logical form component is of interest; the other two components are discarded. We will describe the top levels for both modes, then describe the common core.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTIC INTERPRETATION FOR MLG'S",
"sec_num": "4."
},
{
"text": "The top level for the one-pass mode is simpler, because semantic interpretation works in tandem with the parser, and does not itself have to go through the parse tree.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTIC INTERPRETATION FOR MLG'S",
"sec_num": "4."
},
{
"text": "The procedure 'semant', which has interleaved calls in the compiled syntax rules, essentially is the top-level procedure, but there is some minor cleaning up that has to be done. If the top-level non-terminal is 'sentence' (with no arguments), then the top-level analysis procedure for the one-pass mode can be Normally, the first argument, Sems, of 'sentence' will be a list containing a single augmented semantic item, and its logical form component will be the desired logical form.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTIC INTERPRETATION FOR MLG'S",
"sec_num": "4."
},
{
"text": "However, for some grammars, the ~dditional call to 'semant' is needed to complete the modification process.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTIC INTERPRETATION FOR MLG'S",
"sec_num": "4."
},
{
"text": "The procedure 'outlogform' simplifies the logical form and outputs it.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTIC INTERPRETATION FOR MLG'S",
"sec_num": "4."
},
{
"text": "~ne definition of 'semant' itself is given in a single clause:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTIC INTERPRETATION FOR MLG'S",
"sec_num": "4."
},
{
"text": "semant(Feas,Sems,Sems2,Sems3) <- reorder(Sems,Semsl) & modlist(Semsl,sem(Feas,id,t),",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTIC INTERPRETATION FOR MLG'S",
"sec_num": "4."
},
{
"text": "Sem,Sems2,Sem:Sems3).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTIC INTERPRETATION FOR MLG'S",
"sec_num": "4."
},
{
"text": "Here, the procedure 'reorder' takes the list Sems of augmented semantic items to be combined and re-orders it (permutes it), to obtain proper (or most likely) scoping. This procedure belongs to the common core of the two methods of semantic interpretation, and will be discussed further below.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTIC INTERPRETATION FOR MLG'S",
"sec_num": "4."
},
{
"text": "The procedure 'modlist' does the following. A call modlist(Sems,SemO,Sem,Semsl,Sems2) takes a list Sems of (augmented) semantic items and combines them with (lets them modify) the item SemO, producing an item Sem (as the combination), along with a difference list (Semsl, Sems2) of items which are promoted to be sisters of gem. The leftmost member of Sems acts as the outermost modifier. Thus, in the definition of 'semant', the result list Semsl of reordering acts on the trivial item sem(Feas,id,t) to form a difference list (gems2, Sem:Sems3) where the result Sem is right-appended to its sisters.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTIC INTERPRETATION FOR MLG'S",
"sec_num": "4."
},
{
"text": "'modlist' also belongs to the common core, and will be defined below.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTIC INTERPRETATION FOR MLG'S",
"sec_num": "4."
},
{
"text": "The top level for the two-pass system can be defined as follows. The first clause calls 'synsem' recursively when the daughter is another 'syn' structure. The second clause replaces a logical terminal by an augmented semantic item whose feature list is terminal:nil. The next clause ignores any other type of daughter (this would normally be a surface terminal). Now we can proceed to the common core of the two semantic interpretation systems. The procedure 'modlist' is defined recursively in a straightforward way: modlist(Sem:Sems, Sem0, Sem2, Semsl,Sems3) <modlist(Sems, SemO, Seml, Sems2,Sems3) & modify(Sem, Seml, Sem2, Semsl,Sems2). modlist(nil, Sem, gem, Sems,Sems).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTIC INTERPRETATION FOR MLG'S",
"sec_num": "4."
},
{
"text": "Here 'modify' takes a single item Sem and lets it operate on Seml, giving Sem2 and a difference list (Semsl, Sems2) of sister items.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTIC INTERPRETATION FOR MLG'S",
"sec_num": "4."
},
{
"text": "Its definltion is modify(Sem, Seml, Seml, Sem2:Sems,Sems~ <raise(Sem,Seml,Sem2) &/. modify(sem(*,Op,LF), sem(Feas,Opl,LFI), sem(Feas,Op2,LF2), Sems,Sems) <mod(Op-LF, OpI-LFI, Op2-LF2).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTIC INTERPRETATION FOR MLG'S",
"sec_num": "4."
},
{
"text": "Here 'raise' is responsible for raising the item Seml so that it becomes a sister of the item Seml; gem2 is a new version of Seml after the raising, although in most cases, gem2 equals geml. Raising occurs for a noun phrase like \"a chicken in every pot\", where the quantifier \"every\" has higher scope than the quantifier \"a\". The semantic item for \"every pot\" gets promoted to a left sister of that for \"a chicken\". 'raise' is defined basically by a system of unit clauses which look at specific types of phrases.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTIC INTERPRETATION FOR MLG'S",
"sec_num": "4."
},
{
"text": "For the small grammar MLGRAM of Section 2, no raising is necessary, and the definition of 'raise' can just be omitted.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTIC INTERPRETATION FOR MLG'S",
"sec_num": "4."
},
{
"text": "The procedures 'raise' and 'reorder' are two key ingredients of reshaping (the movement of semantic items to handle scoping problems), which was discussed extensively in McCord (1982 McCord ( , 1981 .",
"cite_spans": [
{
"start": 170,
"end": 182,
"text": "McCord (1982",
"ref_id": "BIBREF12"
},
{
"start": 183,
"end": 198,
"text": "McCord ( , 1981",
"ref_id": "BIBREF13"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTIC INTERPRETATION FOR MLG'S",
"sec_num": "4."
},
{
"text": "[n those two systems, reshaping was a separate pass of semantic interpretation, but },ere, as in McCord (198&) , reshaping is interleaved with the rest of semantic interpretation.",
"cite_spans": [
{
"start": 97,
"end": 110,
"text": "McCord (198&)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTIC INTERPRETATION FOR MLG'S",
"sec_num": "4."
},
{
"text": "In spite of the new toplevel organization for semantic interpretation of MLG's, the low-level procedures for raising and reordering are basically the same as in the previous systems, and we refer to the previous reports for further discussion.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTIC INTERPRETATION FOR MLG'S",
"sec_num": "4."
},
{
"text": "The procedure 'mod', used in the second clause for 'modify', is the heart of semantic interpretation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTIC INTERPRETATION FOR MLG'S",
"sec_num": "4."
},
{
"text": "mod (Sem, Seml, Sem2) means that the (non-augmented) semantic item Sem modifies (combines with) the item Semi to give the item Sem2. 'mod' is defined by a system consisting basically of unit clauses which key off the modification operators appearing in the semantic items. In the experimental MLG described in the next section, there are 22 such clauses.",
"cite_spans": [
{
"start": 4,
"end": 9,
"text": "(Sem,",
"ref_id": null
},
{
"start": 10,
"end": 15,
"text": "Seml,",
"ref_id": null
},
{
"start": 16,
"end": 21,
"text": "Sem2)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTIC INTERPRETATION FOR MLG'S",
"sec_num": "4."
},
{
"text": "For the grammar MLGRAM of Section 2, the following set of clauses suffices. mod(id -~, Sem, Sem) <-/. mod(Sem, id -~, Sem) <-/. mod(l-P, Op-Q, Op-R) <-and(P,Q,R). mod(P/Q-R, Op-Q, @P-R). mod(@P-Q, Op-P, Op-Q).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTIC INTERPRETATION FOR MLG'S",
"sec_num": "4."
},
{
"text": "The first two clauses say that the operator 'id' acts like an identity.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTIC INTERPRETATION FOR MLG'S",
"sec_num": "4."
},
{
"text": "The second clause defines 'i' as a left-conjoining operator (its corresponding logical form gets left-conjoined to that of the modificand).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTIC INTERPRETATION FOR MLG'S",
"sec_num": "4."
},
{
"text": "The call and(P,Q,R) makes R=P&Q, except that it treats 't' ('true') as an identity. The next clause for 'mod' allows a quantifier semantic item like P/Q-each(Q,P) to operate on an item like I-man(X) to give the item @P-each(man(X),P).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTIC INTERPRETATION FOR MLG'S",
"sec_num": "4."
},
{
"text": "The final clause then allows this item to operate on I-live(X) to give l-each(man(X),live(X)).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTIC INTERPRETATION FOR MLG'S",
"sec_num": "4."
},
{
"text": "The low-level procedure 'mod' is the same (in purpose) as the procedure 'trans' in HcCord (1981) , amd has close similarities to 'trans' in McCord (1982) and 'mod' in McCord (198&) , so we refer to this previous work for more illustrations of this approach to modification.",
"cite_spans": [
{
"start": 83,
"end": 96,
"text": "HcCord (1981)",
"ref_id": null
},
{
"start": 140,
"end": 153,
"text": "McCord (1982)",
"ref_id": "BIBREF12"
},
{
"start": 158,
"end": 180,
"text": "'mod' in McCord (198&)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTIC INTERPRETATION FOR MLG'S",
"sec_num": "4."
},
{
"text": "For MLGRAH, the only ingredient of semantic interpretation remaining to be defined is 'reorder'. We can define it in a way that is somewhat more general than is necessary for this small grammar, but which employs a technique useful for larger grammars.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTIC INTERPRETATION FOR MLG'S",
"sec_num": "4."
},
{
"text": "Each augmented semantic item is assigned a precedence number, and the reordering (sorting) is done so that wh@n item B has higher precedence number than item A, then B is ordered to the left of A; otherwise items are kept in their original order.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTIC INTERPRETATION FOR MLG'S",
"sec_num": "4."
},
{
"text": "The following clauses then define 'reorder' in a way suitable for MLGRAM. In particular, the subject and object of a sentence are ordered before the verb (~ terminal in the sentence), and this allows the ssraightforward process of modification in :mod' to scope the quantifiers of the subject and object over the material of the verb.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTIC INTERPRETATION FOR MLG'S",
"sec_num": "4."
},
{
"text": "One can alter the definition of 'prec' to get finer distinctions in ~coping, and for this we refer to McCord (1982 McCord ( , 1981 .",
"cite_spans": [
{
"start": 102,
"end": 114,
"text": "McCord (1982",
"ref_id": "BIBREF12"
},
{
"start": 115,
"end": 130,
"text": "McCord ( , 1981",
"ref_id": "BIBREF13"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTIC INTERPRETATION FOR MLG'S",
"sec_num": "4."
},
{
"text": "For a grammar as small as MLGRAM, which has no treatment of scoping phenomena, the total tom-plexity of the MLG, including the semantic interpretation component we have given in this Section, is certainly greater than that of the comparable DCG in Section 2.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTIC INTERPRETATION FOR MLG'S",
"sec_num": "4."
},
{
"text": "However, for larger grammars, the modularity is definitely worthwhile --conceptually, and probably in the total size of the system.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTIC INTERPRETATION FOR MLG'S",
"sec_num": "4."
},
{
"text": "This section describes briefly an experimental MLG, called HODL, which covers the same linguistic ground as the grammar (called HOD) in HcCord (198l) . The syntactic component of HOD, a DCG, is essentially the same as that in HcCord (1982) . One feature of these syntactic components is a systematic use of slot-filling to treat complements of verbs and nouns.",
"cite_spans": [
{
"start": 136,
"end": 149,
"text": "HcCord (198l)",
"ref_id": null
},
{
"start": 226,
"end": 239,
"text": "HcCord (1982)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "AN EXPERIMENTAL MLG",
"sec_num": "5."
},
{
"text": "This method increases modularity between syntax and lexicon, and is described in detail in McCord (1982) .",
"cite_spans": [
{
"start": 91,
"end": 104,
"text": "McCord (1982)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "AN EXPERIMENTAL MLG",
"sec_num": "5."
},
{
"text": "One purpose of HOD, which is carried over to MODL, is a good treatment of scoping of modifiers and a good specification of logical form. The logical form language used by >IODL as the target of semantic interpretation has been improved somewhat over that used for HOD.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "AN EXPERIMENTAL MLG",
"sec_num": "5."
},
{
"text": "We describe here some of the characteristics of the new logical form language, called LFL, and give sample LFL analyses obtained by MODL, but we defer a more detailed description of LFL to a later report.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "AN EXPERIMENTAL MLG",
"sec_num": "5."
},
{
"text": "The main predicates of LFL are word-senses for words in the natural language being analyzed, for' example, believel(X,Y) in the sense \"X believes that Y holds\".",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "AN EXPERIMENTAL MLG",
"sec_num": "5."
},
{
"text": "Quantifiers, like 'each', are special cases of word-senses.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "AN EXPERIMENTAL MLG",
"sec_num": "5."
},
{
"text": "There are also a small number of non-lexJcal predicates in LFL, some of which are associated with inflections of words, like 'past' for past tense, or syntactic constructions, like 'yesno' for yes-no questions, or have significance at discourse level, dealing for instance with topic/comment.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "AN EXPERIMENTAL MLG",
"sec_num": "5."
},
{
"text": "The arguments for predicates of LFL can be constants, variables, or other logical forms (expressions of LFL).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "AN EXPERIMENTAL MLG",
"sec_num": "5."
},
{
"text": "Expressions of LFL are either predications (in the sense just indicated) or combinations of LFL expressions using the conjunction '&' and the indexing operator ':'. Specifically, if P is a logical form and E is a variable, then P:E (read \"P indexed by E\"~ is also a logical form. When an indexed logical form P:E appears as part of a larger logical form Q, and the index variable E is used elsewhere in Q. then E can be thought of roughly as standing for P together with its \"context\". Contexts include references to time and place which are normally left implicit in natural language. When P specifies an event, as in see(john,mary), writing P:E and subsequently using E will guarantee that E refers to the same event.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "AN EXPERIMENTAL MLG",
"sec_num": "5."
},
{
"text": "In the logical form language used in McCord (1981) , event variables (as arguments of verb and noun senses) were used for indexing.",
"cite_spans": [
{
"start": 37,
"end": 50,
"text": "McCord (1981)",
"ref_id": "BIBREF13"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "AN EXPERIMENTAL MLG",
"sec_num": "5."
},
{
"text": "But the indexing operator is more powerful because it can index complex logical forms. For some applications, it is sufficient to ignore contexts, and in such cases we just think of P:E as verifying P and binding E to an instantiation of P.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "AN EXPERIMENTAL MLG",
"sec_num": "5."
},
{
"text": "In fact, for PROLOG execution of logical forms without contexts, ':' can be defined by the single clause: P:P <-F.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "AN EXPERIMENTAL MLG",
"sec_num": "5."
},
{
"text": "A specific purpose of the MOD system in McCord (1981) was to point out the importance of a class of predicates called focaiizers, and to offer a method for dealing with them in semantic interpretation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "AN EXPERIMENTAL MLG",
"sec_num": "5."
},
{
"text": "Focalizers include many determiners, adverbs, and adjectives (or their word-senses), as well as certain non-lexical predicates like 'yesno'. Focalizers take two logical form arguments called the base and the fOCUS:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "AN EXPERIMENTAL MLG",
"sec_num": "5."
},
{
"text": "focalizer(Base,Focus).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "AN EXPERIMENTAL MLG",
"sec_num": "5."
},
{
"text": "The Focus is often associated with sentence stress, hence the name.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "AN EXPERIMENTAL MLG",
"sec_num": "5."
},
{
"text": "The pair (Base, Focus) is called the SCOpe of the focalizer.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "AN EXPERIMENTAL MLG",
"sec_num": "5."
},
{
"text": "The adverbs 'only' and 'even' are focalizers which most clearly exhibit the connection with stress.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "AN EXPERIMENTAL MLG",
"sec_num": "5."
},
{
"text": "The predication only(P,Q) reads \"the only case where P holds is when Q also holds\".",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "AN EXPERIMENTAL MLG",
"sec_num": "5."
},
{
"text": "We get different analyses depending on focus.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "AN EXPERIMENTAL MLG",
"sec_num": "5."
},
{
"text": "John only buys books at Smith's. only(at(smith,buy(john,X1)), book(X1)).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "AN EXPERIMENTAL MLG",
"sec_num": "5."
},
{
"text": "John only buys books at Smith's. only(book(Xl)&at(X2,buy(john,Xl)), X2=smith). quantificational adverbs like 'always' and 'seldom', studied by David Lewis (1975) , are also focalizers.",
"cite_spans": [
{
"start": 149,
"end": 161,
"text": "Lewis (1975)",
"ref_id": "BIBREF11"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "AN EXPERIMENTAL MLG",
"sec_num": "5."
},
{
"text": "Lewis made the point that these quantifiers are properly considered unseJKtJve, in the sense that they quantify over all the free variables in (what we call) their bases. For example, in John always buys books at Smith's. always(book(Xl)&at(X2,buy(john,Xl)), X2=smith) \u2022 the quantification is over both X1 and X2.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "AN EXPERIMENTAL MLG",
"sec_num": "5."
},
{
"text": "(A paraphrase is \"Always, if X1 is a book and John buys X1 at X2, then X2 is Smith's\".)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "AN EXPERIMENTAL MLG",
"sec_num": "5."
},
{
"text": "determiners are also focalizers (and are unselective quantifiers); they correspond closely in meaning to the quantificational adverbs ('all' -'always', 'many' 'often', 'few' -'seldom', etc.).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "We have the paraphrases:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "Leopards often attack monkeys in trees.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "often(leopard(Xl)&tree(X2)&in(X2,attack(Xl,X3)), monkey(X3)).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "Many leopard attacks in trees are (attacks) on monkeys. many(leopard(Xl)&tree(X2)&in(X2,attack(Xi,X3)), monkey(X3)).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "Adverbs and adjectives involving comparison or degree along some scale of evaluation (a wide class) are also focalizers. The base specifies the base of comparison, and the focus singles out what is being compared to the base.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "This shows up most clearly in the superlative forms.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "Consider the adverb \"fastest\": John ran fastest yesterday. fastest(run(john):E, yesterday(E)).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "John ran fastest yesterday. fastest(yesterday(run(X)), X=john).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "In the first sentence, with focus on \"yesterday\", the meaning is that, among all the events of John's running (this is the base), John's running yesterday was fastest.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "The logical form illustrates the indexing operator.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "[n the second sentence, with focus on \"John\", the meaning is that among all the events of running yesterday (there is an implicit location for these events), John's running was fastest.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "As an example of a non-lexical focalizer, we have yesno(P,q), which presupposes that a case of P holds, and asks whether P & Q holds.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "(The pair (P, Q) is like Topic/Comment for yes-no questions.) Example:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "Did John see M@ry yesterday? yesno(yesterday(see(john,X)), X=mary).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "It is possible to give Prolog definitions for most of the focalizers discussed above which are suitable for extensional evaluation and which amount to model-theoretic definitions of them.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "This will be discussed in a later report on LFL.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "A point of the grammar HODL is to be able to produce LFL analyses of sentences using the modular semantic interpretation system outlined in the preceding section, and to arrive at the right (or most likely) scopes for focalizers and other modifiers.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "The decision on scoping can depend on heuristics involving precedences, on very reliable cues from the syntactic position, and even on the specification of loci by explicit underlining in ~he input string (which is most relevant for adverbial focalizers).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "Although written text does not often use such explici~ specification of adverbial loci, it is important that the system can get the right logical form after having some specification of the adverbial focus, because this specification might be obtained from prosody in spoken language, or might come from the use of discourse information.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "[t also is an indication of the modularity of the system that it can use the same syntactic rules and parse path no matter where the adverbial focus happens to lie.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "Most of the specific linguistic information for semantic interpretation is encoded in the procedures 'mod', 'reorder', and 'raise', which manipulate semantic items.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "In MODL there are 22 clauses for the procedure 'mod', most of which are unit clauses.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "These involve ten different modification operators, four of which were illustrated in the preceding section.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "The definition of 'mo<l' in MODL is taken fairly directly from the corresponding procedure 'trans' in HOD (McCord, 1981) , although there are some changes involved in handling the new version of the logical form language (LFL), especially the indexing operator.",
"cite_spans": [
{
"start": 102,
"end": 120,
"text": "HOD (McCord, 1981)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "The definitions of 'reorder' and 'raise' are essentially the same as for procedures in HOD.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "An illustration of analysis in the two-pass mode in HODL is now given.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "For the sentence \"Leopards only attack monkeys in trees\", the syntactic analysis tree is as follows. sent nounph l-leopard(X) avp (P<Q)-only(P,Q) l-attack(X,Y) nounph l-monkey(Y) prepph @@R-in(Z,R) nounph l-tree(Z)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "Here we display complete logical terminals in the leaf nodes of the tree. An indicat[on of the meanings of the operators (P<Q) and @@R will be given below.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "[n the semantic interpretation of the prepositional phrase, the 'tree' item gets promoted (by 'raise') to be a left-sister of the the 'in' item, and the list of daughter items (augmented semantic items) of the 'sent' node is the following. nounph i leopard(X) avp P<Q only(P,Q) terminal I attack(X,Y) nounph 1 monkey(Y) nounph I tree(Z) prepph @@R in(Z,R).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "Here we di~:play each augmented semantic item sem(nt:Feas,Op,LF) simply in the form nt Op LF. The material in the first field of the 'monkey' item actually shows that it is stressed.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "The reshaping p~ocedure 'reorder' rearran6es these items into the order: nounph I leopard(X) nounph 1 tree(Z) prepph @@R in(Z,R) terminal I attack(X,Y) avp P<Q only(P,Q) nounph 1 monkey(Y) Next, these items successively modify (according to the rules for 'mod') the matrix item, sent id t, with the rightmost daughter acting as innermost oodifier.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "The rules for 'mod' involving the operator (P<Q) associated with only(P,Q) are designed so that the logical form material to the right of 'only' goes into the focus Q of 'only' and the material to the left goes into the base P.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "The material to the right is just monkey(Y).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "The items on the left ('leopard', 'tree', 'in', 'attack') are allowed to combine (through 'mod') in an independent way before being put into the base of 'only'. The operator ~@R associated with in(Z,R) causes R to be botmd to the logical form of the modificand --attack(X,Y).",
"cite_spans": [
{
"start": 22,
"end": 57,
"text": "('leopard', 'tree', 'in', 'attack')",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "The combination of items on the left of 'only' is leopard(X)&tree(Z)&in (Z,attack(X,Y)) This goes into the base, so the whole logical form is only(leopard(X)&tree(Z)&in(Z,attack(X,Y)), monkey(Y)).",
"cite_spans": [
{
"start": 72,
"end": 87,
"text": "(Z,attack(X,Y))",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "For detailed traces of logical form construction by this method, see McCord (1981) .",
"cite_spans": [
{
"start": 69,
"end": 82,
"text": "McCord (1981)",
"ref_id": "BIBREF13"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "An illustration of the treatment of leftembedding in HODL in a two-pass analysis of the sentence \"John sees each boy's brother's teacher\" is as follows. The MODL noun phrase rules include the shift (in a way that is an elaboration of the shift grammar fragment in Section 2), as well as rules for slotfilling for nouns like 'brother' and 'teacher' which have more than one argument in logical form. Exactly the same logical form is obtained by MODL for the sentence \"John sees the teacher of the brother of each boy\".",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "Both of these analyses involve raising.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "[n =he first, the 'poss' node resulting from the apostrophe-s is raised to become a definite article.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "In the second, the prepositional phrases (their semantic structures) are promoted to be sisters of the \"teacher\" node, and the order of the quantlfiers ts (correctly) reversed.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "The syntactic component of MODL was adapted as closely as possible from that of HOD (a DCG) in order to get an idea of the efficiency of HLG's. The fact that the MLG rule compiler produces more structure-building arguments than are in the DCG would tend to |engthen analysis times, but it is hard to predic~ the effect of the different organization of the semantic interpreter (from a threepass system to a one-pass and a two-pass version of MODL).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "7\"no followin E five sentences were used for timing tests.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "Who did John say that the man introduced Mary to? Each book Mary said was given to Bill was written by a woman. Leopards only attack monkeys in trees. John saw each boy's brother's teacher. Does anyone wanting to see the teacher know whether there are any hooks left in this room?",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "Using Waterloo Prolog (an interpreter) on an IBM 3081, the following average times to get the logical forms for the five sentences were obtained (not including ~ime for [/0 and initial word separation):",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "MODL, one-pass mode -40 milliseconds. MODL, two-pass mode -42 milliseconds. MOD -35 milliseconds.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "So there was a loss of speed, but not a significant one. MODL has also been implemented in PSC Prolog (on a 3081).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "Here the average one-pass analysis time for the five sentences was improved to 30 milliseconds per sentence.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "On the other hand, the MLG grammar (in source form) ls more compact and easier to understand. The syntactic components for MOD and MODL were compared numerically by a Prolog program that totals up the sizes of all the grammar rules, where the size of a compound term is defined to be I plus the sum of the sizes of its arguments, and the size of any other term is I. The total for MODL was l&33, and for MOD was 1807, for a ratio of 79%.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "So far, nothing has been said in this report about semantic constraints in HODL.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "Currently, MODL exercises constraints by unification of semantic types.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "Prolog terms representing type requirements on slot-fillers must be unified with types of actual fillers.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "The types used in MODL are t%/pe trees. A type tr~ is either a variable {unspecified type) or a term whose principal functor is an atomic type (like 'human'), and whose arguments are subordinate type trees.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "A type tree T1 is subordinate to a type tree T2 if either T1 is a variable or the principal functor of T1 is a subtype (ako) of the principal functor of T2.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "Type trees are a generalization of the type lists used by Dahl (1981) , which are lists of the form TI:T2:T3:..., where T1 is a supertype of T2, T2 is a supertype of TS, ..., and the tail of the list may be a variable.",
"cite_spans": [
{
"start": 58,
"end": 69,
"text": "Dahl (1981)",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "The point of the generalization is to allow cross-classification. Multiple daughters of a type node cross-classify it.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "The lexicon in MODL includes a preprocessor for lexical entries which allows the original lexical entries to specify type constraints in a compact, non-redundant way. There is a Pro|o K representation for type-hierarchies, and the [exical preprocessor manufactures full type trees from a specification of their leaf nodes.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "[n the one-pass mode for analysis with MLG's, logical forms get built up during parsing, so logical forms are available for examination by semantic checking procedures of the sort outlined in McCord (198&) .",
"cite_spans": [
{
"start": 192,
"end": 205,
"text": "McCord (198&)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "If such methods are arguably best, then there may be more argument for a one-pass system (with interleaving of semantics). The general question of the number of passes in a natural language understander is an interesting one.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "The MLG formalism makes this easier to investigate, because the same syntactic component can he used with onepass or two-pass interpretation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "In MODL, there is a small dictionary stored directly in Prolog, but MODL is also interfaced to a large dictionary/morphology system (Byrd, 1983 (Byrd, , 1984 which produces syntactic and morphological information for words based on over 70,000 lemmata. There are plans to include enough semantic information in this dictionary to provide semantic constraints for a large MLG.",
"cite_spans": [
{
"start": 132,
"end": 143,
"text": "(Byrd, 1983",
"ref_id": "BIBREF1"
},
{
"start": 144,
"end": 157,
"text": "(Byrd, , 1984",
"ref_id": "BIBREF2"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "Alexa HcCray is working on the syntactic component for an MLG with very wide coverage.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "I wish to thank her for useful conversations about the nature of the system.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Quantificational",
"sec_num": null
},
{
"text": "The Restriction Grammars (RG's) of HLrschman and Puder (1982) are logic grammars that were designed with modularity [n mind.",
"cite_spans": [
{
"start": 35,
"end": 61,
"text": "HLrschman and Puder (1982)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "COMPARISON WITH OTHER SYSTEMS",
"sec_num": "6."
},
{
"text": "Restriction Grammars derive from the Linguistic String Project {Sager, 1981).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPARISON WITH OTHER SYSTEMS",
"sec_num": "6."
},
{
"text": "An RG consists of conLexE-free phrase structure rules to which restrictions are appended.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPARISON WITH OTHER SYSTEMS",
"sec_num": "6."
},
{
"text": "The rule compiler {written in ProIo K and compiling into Prolog), sees to it that derivation trees are constructed automatically during parsing. The restrictions appended to the rules are basically Prolog procedures which can walk around, during the parse, in the partially constructed parse tree, and can look at the words remaining in the input stream. Thus there is a modularity between the phrasestructure parts of the syntax rules and the restrictions.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPARISON WITH OTHER SYSTEMS",
"sec_num": "6."
},
{
"text": "The paper contains an interesting discussion of Prolog representations of parse trees that make it easy to walk around in them.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPARISON WITH OTHER SYSTEMS",
"sec_num": "6."
},
{
"text": "A disadvantage of RG's is that the automatically constructed analysis tree is just a derivation tree.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPARISON WITH OTHER SYSTEMS",
"sec_num": "6."
},
{
"text": "With MLG's, the shift operator and the declaration of strong non-terminals produce analysis structures which are more appropriate semantically and are easier to read for large grammars.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPARISON WITH OTHER SYSTEMS",
"sec_num": "6."
},
{
"text": "[n addition, MLG analysis trees contain logical terminals as building blocks for a modular semantic interpretation system.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPARISON WITH OTHER SYSTEMS",
"sec_num": "6."
},
{
"text": "The method of walking about in the partially constructed parse tree is powerful and is worth exploring further; but the more common way of exercising constraints in logic grammars by parameter passing and unification seems to be adequate linguistically and notationally more compact, as well as more efficient for the compiled Prolog program.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPARISON WITH OTHER SYSTEMS",
"sec_num": "6."
},
{
"text": "Another type of logic grammar developed with modularity in mind is the Definite Clause Translation Grammars (DCTG's) of Abramson (1984) . These were inspired partially by RG's (Hirschman and Puder, 1982) , by MSG's {Dahl and McCord, 1983) , and by Attribute Grammars (Knuth, 1968) .",
"cite_spans": [
{
"start": 120,
"end": 135,
"text": "Abramson (1984)",
"ref_id": "BIBREF0"
},
{
"start": 176,
"end": 203,
"text": "(Hirschman and Puder, 1982)",
"ref_id": "BIBREF8"
},
{
"start": 209,
"end": 238,
"text": "MSG's {Dahl and McCord, 1983)",
"ref_id": null
},
{
"start": 267,
"end": 280,
"text": "(Knuth, 1968)",
"ref_id": "BIBREF10"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "COMPARISON WITH OTHER SYSTEMS",
"sec_num": "6."
},
{
"text": "A DCTG rule is like a DCG rule with an appended list of clauses which compute the semantics of the node resulting from use of the rule.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPARISON WITH OTHER SYSTEMS",
"sec_num": "6."
},
{
"text": "The non-terminals on the right-hand side of the syntactic portion of the rule can be indexed by variables, and these index variables can be used in the semantic portion to link to the syntactic portion.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPARISON WITH OTHER SYSTEMS",
"sec_num": "6."
},
{
"text": "For exa~le, the DCG rule sent(P) --> np(X,P1,P): vp(X,Pl).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPARISON WITH OTHER SYSTEMS",
"sec_num": "6."
},
{
"text": "from the DCG in Section 2 has the DCTG equivalent: sent ::= np@N: vp@V <:> logic(P) ::-N@Iogic(X,PI,P) & V@logic(X,Pl).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPARISON WITH OTHER SYSTEMS",
"sec_num": "6."
},
{
"text": "(Our notation is slightly different from Abramson's and is designed to fit the Prolog syntax of this report.) Here the indexing operator is '@'. The syntactic portion is separated from the semantic portion by the operator '<:>'.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPARISON WITH OTHER SYSTEMS",
"sec_num": "6."
},
{
"text": "The non-terminals in DCTG's can have arguments, as in DCG's, which could be used to exercise constraints (restrictions), but it is possible to do everything by referring to the indexing variables.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPARISON WITH OTHER SYSTEMS",
"sec_num": "6."
},
{
"text": "The DCTG rule compiler sees to the automatic construction of a derivation tree, where each node is labeled not only by the expanded non-terminal but also by the list of clauses in the semantic portion of the expanding rule.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPARISON WITH OTHER SYSTEMS",
"sec_num": "6."
},
{
"text": "These clauses can then be used in computing the semantics of the node.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPARISON WITH OTHER SYSTEMS",
"sec_num": "6."
},
{
"text": "When an indexed non-terminal NT@X appears on the right-hand side of a rule, the indexing variable X gets iastantiated to the tree node corresponding to the expansion of NT.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPARISON WITH OTHER SYSTEMS",
"sec_num": "6."
},
{
"text": "There is a definite separation of DCTG rules into a syntactic portion and a semantic portion, with a resulting increase of modularity.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPARISON WITH OTHER SYSTEMS",
"sec_num": "6."
},
{
"text": "Procedures involving different sorts of constraints can be separated from one another, because of the device of referring to the indexing variables.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPARISON WITH OTHER SYSTEMS",
"sec_num": "6."
},
{
"text": "However, it seems that once the reader (or writer) knows that certain variables in the DCG rule deal with the construction of logical forms, the original DCG rule is just as easy (if not easier) to read.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPARISON WITH OTHER SYSTEMS",
"sec_num": "6."
},
{
"text": "The DCTG rule is definitely longer than the DCG rule. The corresponding MLG rule: sent :> np(X): vp(X).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPARISON WITH OTHER SYSTEMS",
"sec_num": "6."
},
{
"text": "is shorter, and does not need to mention logical forms at all. Of course, there are relevant portions of the semantic component that are applied in connection with this rule, but many parts of the semantic component are relevant to several syntax rules, thus reducing the total size of the system.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPARISON WITH OTHER SYSTEMS",
"sec_num": "6."
},
{
"text": "for DCTG's is that the semantics for each rule is listed locally with each rule. There is certainly an appeal in that, because with MLG's (as well as the methods in McCord (1982, lq81) ), the semantics seems to float off more on its own.",
"cite_spans": [
{
"start": 165,
"end": 184,
"text": "McCord (1982, lq81)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "A claimed advantage",
"sec_num": null
},
{
"text": "Semantic items do have a life of their own, and they can move about in the tree (implicitly, in some versions of the semantic interpreter) because of raising and reordering. This is not as neat theoretically, but it seems more appropriate fur capturing actual natural language.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A claimed advantage",
"sec_num": null
},
{
"text": "Another disadvantage of DCTG's (as with RG~s) is that the analysis trees that are constructed automatically are derivation trees.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A claimed advantage",
"sec_num": null
},
{
"text": "The last system to be discussed here, that in Porto and Filgueiras (198&) , does not involve a new grammar formalism, but a methodology for writing DCG's.",
"cite_spans": [
{
"start": 46,
"end": 73,
"text": "Porto and Filgueiras (198&)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "A claimed advantage",
"sec_num": null
},
{
"text": "The authors define a notion of intermediate semantic representation (ISR) including entities and predications, where the predications can be viewed as logical forms.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A claimed advantage",
"sec_num": null
},
{
"text": "In writing DCG rules, one systematically includes at the end of the rule a call to a semantic procedure (specific to the given rule) which combines ISR's obtained in arguments of the non-terminals on the right-hand side of the rule. Two DCG rules in this style (given by the authors) are as follows: Here 'ssv' and 'svo' are semantic procedures that are specific to the 'sent' rule and the 'vp' rule, respectively.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A claimed advantage",
"sec_num": null
},
{
"text": "The rules that define 'ssv' and 'svo' can include some general rules, but also a mass of very specific rules tied to specific words. Two specific rules given by the authors for analyzing \"All Viennese composers wrote ~ waltz\" are as follows.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A claimed advantage",
"sec_num": null
},
{
"text": "svo(wrote,M:X,wrote(X)) <-is_a(M,music). ssv(P:X,wrote(Y),author_of(Y,X)) <-is_a(P,person).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A claimed advantage",
"sec_num": null
},
{
"text": "Note that the verb 'wrote' changes from the surface form 'wrote', to the intermediate form wrote(X), then to the form author of(Y,X).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A claimed advantage",
"sec_num": null
},
{
"text": "[n most logic grammar systems (including MOD and MODL), some form of argument filling is done for predicates; information is added by binding argument variables, rather than changing the whole form of the predication.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A claimed advantage",
"sec_num": null
},
{
"text": "The authors claim that it is less efficient to do argument filling, because one can make an early choice of a word sense which may lead to failure and backtracking.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A claimed advantage",
"sec_num": null
},
{
"text": "An intermediate form like wrote(X) above may only make a partial decision about the sense.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A claimed advantage",
"sec_num": null
},
{
"text": "The value of the \"changing\" method over the \"adding\" method would appear to hinge a lot on the question of parse-time efficiency, because the \"changing\" method seems more complicated conceptually.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A claimed advantage",
"sec_num": null
},
{
"text": "It. seems simpler to have the notion that there are word-senses which are predicates with a certain number of arguments, and to deal only with these, rather than inventing intermediate forms that help in discrimination during the parse.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A claimed advantage",
"sec_num": null
},
{
"text": "So it is partly an empirical question which would be decided after logic grammars dealing semantically with massive dictionaries are developed.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A claimed advantage",
"sec_num": null
},
{
"text": ".There is modularity in rules written in the style of Porto and Filgueiras, because all the semantic structure-building is concentrated in the semantic procedures added (by the grammar writer) at the ends of the rules, in MLG's, in the one-pass mode, the same semantic procedure call, to 'semant', is added at the ends of strong rules, automatically by the compiler.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A claimed advantage",
"sec_num": null
},
{
"text": "The diversity comes in the anciliary procedures for 'semant', especially 'mod'. In fact, 'mod ' (or 'trans' in McCord, 1981) has something in common with the Porto-Filgueiras procedures in that it takes two intermediate representations (semantic items) in its first two arguments and produces a new intermediate representation in its third argument. However, the",
"cite_spans": [
{
"start": 94,
"end": 107,
"text": "' (or 'trans'",
"ref_id": null
},
{
"start": 111,
"end": 124,
"text": "McCord, 1981)",
"ref_id": "BIBREF13"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "A claimed advantage",
"sec_num": null
}
],
"back_matter": [
{
"text": "'mod' makes all involve the modification-operator components of semantic items, rather than the logical-form components.It might be interesting and worthwhile to look at a combination of the two approaches.Both a strength and a weakness of the Porco-Filgueiras semantic procedures (compared with 'mod') is that there are many of them, associated with specific syntactic rules. The strength is that a specific procedure knows that it is looking at the \"results\" of a specific rule.But a weakness is that generalizations are missed.For example, modification by a quantified noun phrase (after slot-filling or the equivalent) is often the same, no matter where it comes from. The method in MLG's allows semantic items to move about and then act by one 'mod' rule.The reshaping procedures are free to look at specific syntactic information, even specific words when necessary, because they work with augmented semantic items.Of course, another disadvantage of the diversity of the Porto-Filgueiras procedures is that they must be explicitly added by the writer of syntax rules, so that there is not as much modularity as in MLG's.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "changes that",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Definite clause translation grammars",
"authors": [
{
"first": "H",
"middle": [],
"last": "Abramson",
"suffix": ""
}
],
"year": 1984,
"venue": "Proc. 1984 International Symposium on Logic Prograem, ing",
"volume": "",
"issue": "",
"pages": "233--240",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Abramson, H. (1984) \"Definite clause translation grammars,\" Proc. 1984 International Symposium on Logic Prograem, ing, pp. 233-240, Atlantic City.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Word formation in natural language processing systems",
"authors": [
{
"first": "R",
"middle": [
"J"
],
"last": "Byrd",
"suffix": ""
}
],
"year": 1983,
"venue": "Proc. 8th International Joint Conference on Artificial",
"volume": "",
"issue": "",
"pages": "704--706",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Byrd, R. J. (1983) \"Word formation in natural lan- guage processing systems,\" Proc. 8th International Joint Conference on Artificial [ntelli~ence, pp. 704-706, Karlsruhe.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "The Ultimate Dictionary Users' Guide",
"authors": [
{
"first": "R",
"middle": [
"J"
],
"last": "Byrd",
"suffix": ""
}
],
"year": 1984,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Byrd, R. J. (1984) \"The Ultimate Dictionary Users' Guide,\" IBM Research Internal Report.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Metamorphosis grammars",
"authors": [
{
"first": "A",
"middle": [],
"last": "Colmerauer",
"suffix": ""
}
],
"year": 1978,
"venue": "Natural Language Communication with Computers",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Colmerauer, A. (1978) \"Metamorphosis grammars,\" in L. Bolt (Ed.), Natural Language Communication with Computers, Springer-Verlag.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Un systeme deductif d'interrogation de banques de donnees en espagnol",
"authors": [
{
"first": "V",
"middle": [],
"last": "Dahl",
"suffix": ""
}
],
"year": 1977,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dahl, V. (1977) \"Un systeme deductif d'interrogation de banques de donnees en espagnol,\" Groupe d'Intelligence Artificielle, Univ. d'Aix-Marseille.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Translating Spanish into logic through logic",
"authors": [
{
"first": "V",
"middle": [],
"last": "Dahl",
"suffix": ""
}
],
"year": 1981,
"venue": "American Journal of Computational Linguistics",
"volume": "7",
"issue": "",
"pages": "149--164",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dahl, V. (1981) \"Translating Spanish into logic through logic,\" American Journal of Computational Linguistics, vol. 7, pp. 149-164.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Treating coordination in logic grammars",
"authors": [
{
"first": "V",
"middle": [],
"last": "Dahl",
"suffix": ""
},
{
"first": "M",
"middle": [
"C"
],
"last": "Hccord",
"suffix": ""
}
],
"year": 1983,
"venue": "American Journal of Computational Linguistics",
"volume": "9",
"issue": "",
"pages": "69--91",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dahl, V, and HcCord, M. C. (1983) \"Treating coor- dination in logic grammars,\" American Journal of Computational Linguistics , vol. 9, pp. 69-91.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Natural Language Inputs to a Simulation Programming System",
"authors": [
{
"first": "G",
"middle": [
"E"
],
"last": "Heidorn",
"suffix": ""
}
],
"year": 1972,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Heidorn, G. E. (1972) Natural Language Inputs to a Simulation Programming System, Naval Postgraduate School Technical Report No. NPS-55HD7210IA.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Restriction grammar in Prolog",
"authors": [
{
"first": "~",
"middle": [],
"last": "Hirschman",
"suffix": ""
},
{
"first": "K",
"middle": [],
"last": "Puder",
"suffix": ""
}
],
"year": 1982,
"venue": "Proc. First International Logic Programming Conference",
"volume": "",
"issue": "",
"pages": "85--90",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Hirschman, ~. and Puder, K. (1982) \"Restriction grammar in Prolog,\" Proc. First International Logic Programming Conference, pp. 85-90, Marseille.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "The fitted parse: 100% parsing capability in a syntactic grammar of English",
"authors": [
{
"first": "K",
"middle": [],
"last": "Jensen",
"suffix": ""
},
{
"first": "G",
"middle": [
"E"
],
"last": "Heidorn",
"suffix": ""
}
],
"year": 1983,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jensen, K. and Heidorn, G. E. (1983) \"The fitted parse: 100% parsing capability in a syntactic grammar of English,\" IBM Research Report RC 9729.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Semantics of context-free languages",
"authors": [
{
"first": "D",
"middle": [
"E"
],
"last": "Knuth",
"suffix": ""
}
],
"year": 1968,
"venue": "Mathematical Systems Theory",
"volume": "2",
"issue": "",
"pages": "127--145",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Knuth, D. E. (1968) \"Semantics of context-free languages,\" Mathematical Systems Theory, vol. 2, pp. 127-145.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Adverbs of quantification",
"authors": [
{
"first": "D",
"middle": [],
"last": "Lewis",
"suffix": ""
}
],
"year": 1975,
"venue": "Formal Semantics of Natural Language",
"volume": "",
"issue": "",
"pages": "3--15",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Lewis, D. (1975) \"Adverbs of quantification,\" In E.L. Keenan (Ed.), Formal Semantics of Natural Language, pp. 3-15, Cambridge University Press.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Using slots and modifiers in logic grammars for natural language",
"authors": [
{
"first": "M",
"middle": [
"C"
],
"last": "Mccord",
"suffix": ""
}
],
"year": 1982,
"venue": "Artificial Intelli~ence",
"volume": "18",
"issue": "",
"pages": "327--367",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "McCord, M. C. (1982) \"Using slots and modifiers in logic grammars for natural language,\" Artificial Intelli~ence, vol 18, pp. 327-367. (Appeared first as 1980 Technical Report, University of Kentucky.)",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Focalizers, the scoping problem, and semantic interpretation rules in logic grammars",
"authors": [
{
"first": "M",
"middle": [
"C"
],
"last": "Mccord",
"suffix": ""
}
],
"year": 1981,
"venue": "Logic Programming and its Applications",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "McCord, M. C. (1981) \"Focalizers, the scoping problem, and semantic interpretation rules in logic grammars,\" Technical Report, University of Kentucky. To appear in Logic Programming and its Applications, D. Warren and M: van Caneghem, Eds.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Text-critiquing with the EPISTLE system: an author's aid to better syntax",
"authors": [
{
"first": "M",
"middle": [
"C"
],
"last": "Mccord",
"suffix": ""
},
{
"first": "L",
"middle": [
"A"
],
"last": "Miller",
"suffix": ""
},
{
"first": "G",
"middle": [
"E"
],
"last": "Heidorn",
"suffix": ""
},
{
"first": "K",
"middle": [],
"last": "Jensen",
"suffix": ""
}
],
"year": 1981,
"venue": "Proc. Second International Logic Programming Conference",
"volume": "50",
"issue": "",
"pages": "649--655",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "McCord, M. C. (1984) \"Semantic interpretation for the EPISTLE system,\" Proc. Second International Logic Programming Conference, pp. 65-76, Uppsala. Miller, L. A., Heidorn, G. E., and Jensen, K. (1981) \"Text-critiquing with the EPISTLE system: an author's aid to better syntax,\" AFIPS Conference Proceedings, vol. 50, pp. 649-655.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Extraposition grammars",
"authors": [
{
"first": "F",
"middle": [],
"last": "Pereira",
"suffix": ""
}
],
"year": 1981,
"venue": "American Journal of Computational Linguistics",
"volume": "7",
"issue": "",
"pages": "243--256",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Pereira, F. (1981) \"Extraposition grammars,\" Amer- ican Journal of Computational Linguistics, vol. 7, pp. 243-256.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Logic for natural language analysis",
"authors": [
{
"first": "F",
"middle": [],
"last": "Pereira",
"suffix": ""
}
],
"year": 1983,
"venue": "SRI International",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Pereira, F. (1983) \"Logic for natural language analysis,\" SRI International, Technical Note 275.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Definite clause grammars for language analysis -a survey of the formalism and a comparison with transition networks",
"authors": [
{
"first": "F",
"middle": [],
"last": "Pereira",
"suffix": ""
},
{
"first": "D",
"middle": [],
"last": "Warren",
"suffix": ""
}
],
"year": 1980,
"venue": "Artificial Intelligence",
"volume": "13",
"issue": "",
"pages": "231--278",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Pereira, F. and Warren, D. (1980) \"Definite clause grammars for language analysis -a survey of the formalism and a comparison with transition net- works,\" Artificial Intelligence , vol. 13, pp. 231-278.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "An efficient easily adaptable system for interpreting natural language queries",
"authors": [
{
"first": "F",
"middle": [],
"last": "Pereira",
"suffix": ""
},
{
"first": "D",
"middle": [],
"last": "Warren",
"suffix": ""
}
],
"year": 1982,
"venue": "American Journal of Computational Linguistics",
"volume": "8",
"issue": "",
"pages": "110--119",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Pereira, F. and Warren, D. (1982) \"An efficient easily adaptable system for interpreting natural language queries,\" American Journal of Computa- tional Linguistics, vol. 8, pp. 110-119.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Natural language semantics: A logic programming approach",
"authors": [
{
"first": "A",
"middle": [],
"last": "Porto",
"suffix": ""
},
{
"first": "M",
"middle": [],
"last": "Filgueiras",
"suffix": ""
}
],
"year": 1984,
"venue": "Proc. 198A International Symposium on Logid Programming",
"volume": "",
"issue": "",
"pages": "228--232",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Porto, A. and Filgueiras, M. (1984) \"Natural lan- guage semantics: A logic programming approach,\" Proc. 198A International Symposium on Logid Pro- gramming, pp. 228-232, Atlantic City.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Natural Language Information Processing: A Computer Grammar of English and Its Applications",
"authors": [
{
"first": "N",
"middle": [],
"last": "Sager",
"suffix": ""
}
],
"year": 1981,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sager, N. (1981) Natural Language Information Processing: A Computer Grammar of English and Its Applications, Addison-Wesley.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Transition network grammars for natural language analysis",
"authors": [
{
"first": "W",
"middle": [
"A"
],
"last": "Woods",
"suffix": ""
}
],
"year": 1970,
"venue": "C. ACM",
"volume": "13",
"issue": "",
"pages": "591--606",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Woods, W. A. (1970) \"Transition network grammars for natural language analysis,\" C. ACM, vol. 13, pp. 591-606.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"num": null,
"text": "compiles into the clause transverb(X,Y, Feas, Semsl,Semsl, sem(terminal:nil,l,P):Sems2,Sems2, V.Str,Str) <tv(V,X,Y,P). The strong rule det -----> +D: Sdt(D,PI,P2,P): P2/PI-P. compiles into the clause det(Semsl,Sems2, D.SemsA,Sems&)<dt(D,P1,P2,P) & semant(det:nil, sem(terminal:nil,P2/PI,P):nil, Semsl,Sems2).",
"uris": null,
"type_str": "figure"
},
"FIGREF1": {
"num": null,
"text": "reorder(A:L,H) <reorder(L,Ll) & insert(A,Li,M). reordef(nit,n\u00a31). insert(A,B:L,S:Ll) <prec(A,PA) & prec(B,PB) & gt(PB,PA) &/& insert(A,L,Li). insert(A,L,a:L~.prec(sem(term~nal:*,e,~),2) <-/. pruc(sem(relc!ause:e,e,e),l) <-/. prec(e,3). ~nus terminals are ordered to the end, except not after relative clauses.",
"uris": null,
"type_str": "figure"
},
"FIGREF2": {
"num": null,
"text": "(Y),the(brother(Z,Y), the(teacher(W,Z),see(john,W)))).",
"uris": null,
"type_str": "figure"
},
"FIGREF3": {
"num": null,
"text": "sent(S) --> np(N): vp(V): $ssv(N,V,S). vp(S) --> verb(V,trans): np(N): Ssvo(V,N,S).",
"uris": null,
"type_str": "figure"
},
"TABREF1": {
"html": null,
"text": "strongnon~erminals(np.det.noun.poss.nil).",
"type_str": "table",
"num": null,
"content": "<table><tr><td colspan=\"2\">postmods(Synl,Syn2, Hodsl,Hods2, Strl,Str2).</td></tr><tr><td>np2(syn(Feas,HodsO),Syn,</td><td>Hod:Hodsl,Hodsl,</td></tr><tr><td>Strl,Str3) <-</td><td/></tr><tr><td>poss(Mod, Strl,Str2) &</td><td/></tr><tr><td colspan=\"2\">npl(syn(Feas,syn(Feas,HodsO):Hods2),Syn,</td></tr><tr><td colspan=\"2\">Hods2,nil, Str2,Str3).</td></tr><tr><td>np => det: npl.</td><td/></tr><tr><td>npl => premods: noun: np2.</td><td/></tr><tr><td>np2 ----~-> postmods.</td><td/></tr><tr><td>rip2 => poss: %npl.</td><td/></tr><tr><td>The compiled rules are as follows:</td><td/></tr><tr><td>np[Syn, Strl,Str3) <-</td><td/></tr><tr><td>det(Hod, Strl,Str2) &</td><td/></tr><tr><td>npl(syn(np:nil,Hod:Hods),Syn,</td><td/></tr><tr><td>Hods,nil, Str2,Str3).</td><td/></tr><tr><td>npl(Synl,Syn3, Hodsl,Hods3, Strl,Str4) <-</td><td/></tr><tr><td>premods(Synl,Syn2, Hodsl,Hod:Hods2,</td><td/></tr><tr><td>Strl,Str2) &</td><td/></tr><tr><td>noun(Hod, Str2,Str3) &</td><td/></tr><tr><td>np2(Syn2,Syn3, Hods2,Hods3, Str3,Str4).</td><td/></tr><tr><td>np2(Synl,Syn2, Hodsl,Hods2, Strl,Str2) <-</td><td/></tr></table>"
}
}
}
} |