File size: 86,065 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 | {
"paper_id": "P96-1022",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T09:03:09.539937Z"
},
"title": "S. EMH. E: A Generalised Two-Level System",
"authors": [
{
"first": "George",
"middle": [
"Anton"
],
"last": "Kiraz",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Computer Laboratory University of Cambridge",
"location": {}
},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "This paper presents a generalised twolevel implementation which can handle linear and non-linear morphological operations. An algorithm for the interpretation of multi-tape two-level rules is described. In addition, a number of issues which arise when developing non-linear grammars are discussed with examples from Syriac.",
"pdf_parse": {
"paper_id": "P96-1022",
"_pdf_hash": "",
"abstract": [
{
"text": "This paper presents a generalised twolevel implementation which can handle linear and non-linear morphological operations. An algorithm for the interpretation of multi-tape two-level rules is described. In addition, a number of issues which arise when developing non-linear grammars are discussed with examples from Syriac.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "The introduction of two-level morphology (Koskenniemi, 1983) and subsequent developments has made implementing computational-morphology models a feasible task. Yet, two-level formalisms fell short from providing elegant means for the description of non-linear operations such as infixation, circumfixation and root-and-pattern morphology} As a result, two-level implementations -e.g. (Antworth, 1990; Karttunen, 1983; Karttunen and Beesley, 1992; Ritchie et al., 1992) -have always been biased towards linear morphology. The past decade has seen a number of proposals for handling non-linear morphology; 2 however, none * Supported by a Benefactor Studentship from St John's College\u2022 This research was done under the supervision of Dr Stephen G. Pulman. Thanks to the anonymous reviewers for their comments. All mistakes remain mine.",
"cite_spans": [
{
"start": 41,
"end": 60,
"text": "(Koskenniemi, 1983)",
"ref_id": "BIBREF24"
},
{
"start": 384,
"end": 400,
"text": "(Antworth, 1990;",
"ref_id": "BIBREF1"
},
{
"start": 401,
"end": 417,
"text": "Karttunen, 1983;",
"ref_id": null
},
{
"start": 418,
"end": 446,
"text": "Karttunen and Beesley, 1992;",
"ref_id": "BIBREF14"
},
{
"start": 447,
"end": 468,
"text": "Ritchie et al., 1992)",
"ref_id": "BIBREF29"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "1Although it is possible to express some classes of non-linear rules using standard two-level formalisms by means of ad hoc diacritics, e.g., infixation in (Antworth, 1990, p. 156) , there are no means for expressing other classes as root-and-pattern phenomena.",
"cite_spans": [
{
"start": 156,
"end": 180,
"text": "(Antworth, 1990, p. 156)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "2 (Kay, 1987) , (Kataja and Koskenniemi, 1988) , (Beesley et al., 1989) , (Lavie et al., 1990) , (Beesley, 1990) , (Beesley, 1991) , (Kornai, 1991) , (Wiebe, 1992) , (Pulman and Hepple, 1993) , (Narayanan and Hashem, 1993) , and (Bird and Ellison, 1994) . See (Kiraz, 1996) for a review.",
"cite_spans": [
{
"start": 2,
"end": 13,
"text": "(Kay, 1987)",
"ref_id": "BIBREF16"
},
{
"start": 16,
"end": 46,
"text": "(Kataja and Koskenniemi, 1988)",
"ref_id": "BIBREF15"
},
{
"start": 49,
"end": 71,
"text": "(Beesley et al., 1989)",
"ref_id": "BIBREF5"
},
{
"start": 74,
"end": 94,
"text": "(Lavie et al., 1990)",
"ref_id": "BIBREF25"
},
{
"start": 97,
"end": 112,
"text": "(Beesley, 1990)",
"ref_id": "BIBREF3"
},
{
"start": 115,
"end": 130,
"text": "(Beesley, 1991)",
"ref_id": "BIBREF4"
},
{
"start": 133,
"end": 147,
"text": "(Kornai, 1991)",
"ref_id": "BIBREF23"
},
{
"start": 150,
"end": 163,
"text": "(Wiebe, 1992)",
"ref_id": "BIBREF33"
},
{
"start": 166,
"end": 191,
"text": "(Pulman and Hepple, 1993)",
"ref_id": "BIBREF28"
},
{
"start": 194,
"end": 222,
"text": "(Narayanan and Hashem, 1993)",
"ref_id": "BIBREF27"
},
{
"start": 229,
"end": 253,
"text": "(Bird and Ellison, 1994)",
"ref_id": "BIBREF6"
},
{
"start": 260,
"end": 273,
"text": "(Kiraz, 1996)",
"ref_id": "BIBREF21"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "(apart from Beesley's work) seem to have been implemented over large descriptions, nor have they provided means by which the grammarian can develop non-linear descriptions using higher level notation\u2022",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "To test the validity of one's proposal or formalism, minimally a medium-scale description is a desideratum. SemHe 3 fulfils this requirement\u2022 It is a generalised multi-tape two-level system which is being used in developing non-linear grammars.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "This paper (1) presents the algorithms behind SemHe; (2) discusses the issues involved in compiling non-linear descriptions; and (3) proposes extension/solutions to make writing non-linear rules easier and more elegant. The paper assumes knowledge of multi-tape two-level morphology (Kay, 1987; Kiraz, 1994c ).",
"cite_spans": [
{
"start": 283,
"end": 294,
"text": "(Kay, 1987;",
"ref_id": "BIBREF16"
},
{
"start": 295,
"end": 307,
"text": "Kiraz, 1994c",
"ref_id": "BIBREF19"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The linguist provides SemHe with three pieces of data: a lexicon, two-level rules and word formation grammar\u2022 All entries take the form of Prolog terms. 4 (Identifiers starting with an uppercase letter denote variables, otherwise they are instantiated symbols\u2022) A lexical entry is described by the term synword( <morpheme>, (category)).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Linguistic Descriptions",
"sec_num": "2"
},
{
"text": "Categories are of the form (category_symbol) : [(f eature_attrl = value1>, <] ",
"cite_spans": [
{
"start": 47,
"end": 77,
"text": "[(f eature_attrl = value1>, <]",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Linguistic Descriptions",
"sec_num": "2"
},
{
"text": "a notational variant of the PATR-II category formalism (Shieber, 1986) . aWe describe here the terms which are relevant to this paper. For a full description, see (Kiraz, 1996) . tl_alphabet(0, [k, t,b, a, el ) . % surface alphabet tl_alphabet (1, [cl, c2, c3,v, ~] ). tl_alphabet (2, [k, t,b, ~] ). tl_alphabet (3, [a, e,~] ). % lexical alphabets tl_set (radical, [k,t,b] ). tl_set (vowel, [a, el) . tl_set(clc3, [cl, c3] [3,[[3,[3,[] ",
"cite_spans": [
{
"start": 55,
"end": 70,
"text": "(Shieber, 1986)",
"ref_id": "BIBREF31"
},
{
"start": 163,
"end": 176,
"text": "(Kiraz, 1996)",
"ref_id": "BIBREF21"
},
{
"start": 179,
"end": 210,
"text": "tl_alphabet(0, [k, t,b, a, el )",
"ref_id": null
},
{
"start": 244,
"end": 265,
"text": "(1, [cl, c2, c3,v, ~]",
"ref_id": null
},
{
"start": 281,
"end": 296,
"text": "(2, [k, t,b, ~]",
"ref_id": null
},
{
"start": 312,
"end": 324,
"text": "(3, [a, e,~]",
"ref_id": null
},
{
"start": 355,
"end": 372,
"text": "(radical, [k,t,b]",
"ref_id": null
},
{
"start": 383,
"end": 398,
"text": "(vowel, [a, el)",
"ref_id": null
},
{
"start": 414,
"end": 422,
"text": "[cl, c3]",
"ref_id": null
},
{
"start": 423,
"end": 435,
"text": "[3,[[3,[3,[]",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "eature_attrn = wlu n) ]",
"sec_num": null
},
{
"text": "]). tl_rule(R2, [[], [], [3], [[P], [C], []3, [[1, [], []3, =>, [], [C], [3, [clc3(P) ,radical(C)1, [[], [1, []]). tl_rule(R3, [[], [], []1, [[v], [1, IV]l, [[], [1, []1, =>, [], IV], [1, [vowel(V)], [[], [], [3]). tl_rule(R4, [[], [1, [1], [[v], [1, IV]l, [[c2,v], [], []], <=>, [1, [1, [], [vowel(V)], [[], [], []]",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "eature_attrn = wlu n) ]",
"sec_num": null
},
{
"text": "). tLrule (Rb, [[1, [1, []1, [[c21, [C] A two-level rule is described using a syntactic variant of the formalism described by (Ruessink, 1989; Pulman and Hepple, 1993) , including the extensions by (Kiraz, 1994c) , tl_rule( <id),<LLC>, (Lex}, (RLC}, COp>, <LSC>, <RSC>, (variables>, (features) [(daughter1},..., (daughtern}l) . ",
"cite_spans": [
{
"start": 10,
"end": 14,
"text": "(Rb,",
"ref_id": null
},
{
"start": 15,
"end": 19,
"text": "[[1,",
"ref_id": null
},
{
"start": 20,
"end": 23,
"text": "[1,",
"ref_id": null
},
{
"start": 24,
"end": 28,
"text": "[]1,",
"ref_id": null
},
{
"start": 29,
"end": 35,
"text": "[[c21,",
"ref_id": null
},
{
"start": 36,
"end": 39,
"text": "[C]",
"ref_id": null
},
{
"start": 126,
"end": 142,
"text": "(Ruessink, 1989;",
"ref_id": "BIBREF30"
},
{
"start": 143,
"end": 167,
"text": "Pulman and Hepple, 1993)",
"ref_id": "BIBREF28"
},
{
"start": 198,
"end": 212,
"text": "(Kiraz, 1994c)",
"ref_id": "BIBREF19"
},
{
"start": 236,
"end": 293,
"text": "(Lex}, (RLC}, COp>, <LSC>, <RSC>, (variables>, (features)",
"ref_id": null
},
{
"start": 294,
"end": 325,
"text": "[(daughter1},..., (daughtern}l)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "eature_attrn = wlu n) ]",
"sec_num": null
},
{
"text": "~'~ */katab/~ /ktab/ (1) c v c v c = I I L k t b",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "eature_attrn = wlu n) ]",
"sec_num": null
},
{
"text": "The pa \"el measure of the same verb, viz./katteb/, is derived by the gemination of the middle consonant (i.e. t) and applying the appropriate vocalism {ae}. The two-level grammar (Listing 1) assumes three lexical tapes. Uninstantiated contexts are denoted by an empty list. R1 is the morpheme boundary (= ~) rule. R2 and R3 sanction stem consonants and vowels, respectively. R4 is the obligatory vowel deletion rule. R5 and R6 map the second radical,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "eature_attrn = wlu n) ]",
"sec_num": null
},
{
"text": "[t], for p'al and pa\"el forms, respectively. In this example, the lexicon contains the entries in (2). 8 (2) synword(clvc2vca,pattern : 0)synword(ktb, root: [measure = M]). synword (aa, vocalism : [measure = p'al] ). synword(ae, vocalism : [measure = pa\"el]).",
"cite_spans": [
{
"start": 181,
"end": 213,
"text": "(aa, vocalism : [measure = p'al]",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "eature_attrn = wlu n) ]",
"sec_num": null
},
{
"text": "Note that the value of 'measure' in the root entry is SSpirantization is ignored here; for a discussion on Syriac spirantization, see (Kiraz, 1995) .",
"cite_spans": [
{
"start": 134,
"end": 147,
"text": "(Kiraz, 1995)",
"ref_id": "BIBREF20"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "eature_attrn = wlu n) ]",
"sec_num": null
},
{
"text": "6Syriac verbs are classified under various measures (forms). The basic ones are: p'al, pa \"el and 'a]'el.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "eature_attrn = wlu n) ]",
"sec_num": null
},
{
"text": "7This analysis is along the lines of (McCarthy, 1981) -based on autosegmental phonology (Goldsmith, 1976) .",
"cite_spans": [
{
"start": 88,
"end": 105,
"text": "(Goldsmith, 1976)",
"ref_id": "BIBREF8"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "eature_attrn = wlu n) ]",
"sec_num": null
},
{
"text": "SSpreading is ignored here; for a discussion, see (Kiraz, 1994c ). uninstantiated; it is determined from the feature values in R5, R6 and/or the word grammar (see infra,",
"cite_spans": [
{
"start": 50,
"end": 63,
"text": "(Kiraz, 1994c",
"ref_id": "BIBREF19"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "eature_attrn = wlu n) ]",
"sec_num": null
},
{
"text": "\u00a74.3).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "eature_attrn = wlu n) ]",
"sec_num": null
},
{
"text": "There are two current methods for implementing two-level rules (both implemented in Semi{e):",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Implementation",
"sec_num": "3"
},
{
"text": "(1) compiling rules into finite-state automata (multitape transducers in our case), and (2) interpreting rules directly. The former provides better performance, while the latter facilitates the debugging of grammars (by tracing and by providing debugging utilities along the lines of (Carter, 1995) ). Additionally, the interpreter facilitates the incremental compilation of rules by simply allowing the user to toggle rules on and off. The compilation of the above formalism into automata is described by (Grimley-Evans et al., 1996) . The following is a description of the interpreter.",
"cite_spans": [
{
"start": 284,
"end": 298,
"text": "(Carter, 1995)",
"ref_id": "BIBREF7"
},
{
"start": 506,
"end": 534,
"text": "(Grimley-Evans et al., 1996)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Implementation",
"sec_num": "3"
},
{
"text": "The word grammar is compiled into a shift-reduce parser. In addition, a first-and-follow algorithm, based on (Aho and Ullman, 1977) , is applied to compute the feasible follow categories for each category type. The set of feasible follow categories, NextCats, of a particular category Cat is returned by the predicate FOLLOW(+Cat, -NextCats). Additionally, FOLLOW(bos, NextCats) returns the set of category symbols at the beginning of strings, and cos E NextCats indicates that Cat may occur at the end of strings.",
"cite_spans": [
{
"start": 109,
"end": 131,
"text": "(Aho and Ullman, 1977)",
"ref_id": "BIBREF0"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Internal Representation",
"sec_num": "3.1"
},
{
"text": "The lexical component is implemented as character tries (Knuth, 1973) , one per tape. Given a list of lexical strings, Lex, and a list of lexical pointers, LexPtrs, the predicate LEXICAL-TRANSITIONS( q-Lex, +LexPtrs, -New Lex Ptrs, -LexC ats ) succeeds iff there are transitions on Lex from LexPtrs; it returns NewLexPtrs, and the categories, Lex-Cats, at the end of morphemes, if any. Two-level predicates are converted into an internal representation: (1) every left-context expression is reversed and appended to an uninstantiated tail;",
"cite_spans": [
{
"start": 56,
"end": 69,
"text": "(Knuth, 1973)",
"ref_id": "BIBREF22"
},
{
"start": 179,
"end": 243,
"text": "LEXICAL-TRANSITIONS( q-Lex, +LexPtrs, -New Lex Ptrs, -LexC ats )",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Internal Representation",
"sec_num": "3.1"
},
{
"text": "(2) every right-context expression is appended to an uninstantiated tail; and (3) each rule is assigned a 6-bit 'precedence value' where every bit represents one of the six lexical and surface expressions. If an expression is not an empty list (i.e. context is specified), the relevant bit is set. In analysis, surface expressions are assigned the most significant bits, while lexical expressions are assigned the least significant ones. In generation, the opposite state of affairs holds. Rules are then reasserted in the order of their precedence value. This ensures that rules which contain the most specified expressions are tested first resulting in better performance.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Internal Representation",
"sec_num": "3.1"
},
{
"text": "The algorithms presented below are given in terms of prolog-like non-deterministic operations. A clause is satisfied iff all the conditions under it are satisfied. The predicates are depicted top-down in (3). (SemHe makes use of an earlier implementation by (Pulman and Hepple, 1993) .)",
"cite_spans": [
{
"start": 258,
"end": 283,
"text": "(Pulman and Hepple, 1993)",
"ref_id": "BIBREF28"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "The Interpreter Algorithm",
"sec_num": "3.2"
},
{
"text": "(3) Two-Level-Analysis l i I 1 l Invalid-partition )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Interpreter Algorithm",
"sec_num": "3.2"
},
{
"text": "In order to minimise accumulator-passing arguments, we assume the following initially-empty stacks: ParseStack accumulates the category structures of the morphemes identified, and FeatureStack maintains the rule features encountered so far. ('+' indicates concatenation.) PARTITION partitions a two-level analysis into sequences of lexical-surface pairs, each licenced by a rule. The base case of the predicate is given in Listing 2, 9 and the recursive case in Listing 3.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Interpreter Algorithm",
"sec_num": "3.2"
},
{
"text": "The recursive COERCE predicate ensures that no partition is violated by an obligatory rule. It takes three arguments: Result is the output of PARTITION (usually reversed by the calling predicate, hence, COERCE deals with the last partition first), PrevCats is a register which keeps track of the last morpheme category encountered, and Partition returns selected elements from Result. The base case of the predicate is simply COERCE([], _, []) -i.e., no more partitions. The recursive case is shown in Listing 4. CurrentCats keeps track of the category of the morpheme which occures in the current partition. The invalidity of a partition is determined by INVALID-PARTITION (Listing 5).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Interpreter Algorithm",
"sec_num": "3.2"
},
{
"text": "TwO-LEVEL-ANALYSIS (Listing 6) is the main predicate.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Interpreter Algorithm",
"sec_num": "3.2"
},
{
"text": "It takes a surface string or lexical string(s) and returns a list of partitions and a 9For efficiency, variables appearing in left-context and centre expressions are evaluated after LEXICAL-TRANSITIONS since they will be fully instantiated then; only right-contexts are evaluated after the recursion. PARTITION(SurfDone, SurfToDo, LexDone, LexToDo, LexPtrs, NextCats (-Surf, +Lex, -Partition, -Parse) .",
"cite_spans": [
{
"start": 301,
"end": 366,
"text": "PARTITION(SurfDone, SurfToDo, LexDone, LexToDo, LexPtrs, NextCats",
"ref_id": null
},
{
"start": 367,
"end": 400,
"text": "(-Surf, +Lex, -Partition, -Parse)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "The Interpreter Algorithm",
"sec_num": "3.2"
},
{
"text": "When developing Semitic grammars, one comes across various issues and problems which normally do not arise with linear grammars. Some can be solved by known methods or 'tricks'; others require extensions in order to make developing grammars easier and more elegant. This section discuss issues which normally do not arise when compiling linear grammars.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Developing Non-Linear Grammars",
"sec_num": "4"
},
{
"text": "In Semitic languages, non-linearity occurs only in stems. Hence, lexical descriptions of stems make use of three lexical tapes (pattern, root & vocalism) , while those of prefixes and suffixes use the first lexical tape. This requires duplicating rules when stating lexical constraints. Consider rule R4 (Listing 1). It allows the deletion of the first stem vowel by the virtue of RLC (even if c2 was not indexed); hence /katab/--+ /ktab/. Now consider adding the suffix {eh} 'him/it': /katab/+{eh} ~/katbeh/, where the second stem vowel is deleted since deletion applies right-to-left; however, RLC can only cope with stem vowels. Rule R7 (Listing 7) is required. One might suggest placing constraints on surface expressions instead. However, doing so causes surface expressions to be dependent on other rules.",
"cite_spans": [
{
"start": 127,
"end": 153,
"text": "(pattern, root & vocalism)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Linearity vs. Non-Linearity",
"sec_num": "4.1"
},
{
"text": "Additionally, Lex in R4 and R7 deletes stem vowels. Consider adding the prefix {wa} 'and': {wa} + /katab/ + {eh} --+ /wkatbeh/, where the prefix vowel is also deleted. To cope with this, two additional rules like R4 and R7 are required, but with",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Linearity vs. Non-Linearity",
"sec_num": "4.1"
},
{
"text": "Lex = [[V], [], [1].",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Linearity vs. Non-Linearity",
"sec_num": "4.1"
},
{
"text": "We resolve this by allowing the user to write expansion rules of the from expand( (symbol), (expansion), (variables)).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Linearity vs. Non-Linearity",
"sec_num": "4.1"
},
{
"text": "In our example, the expansion rules in (4) are needed. [11, [vowel (V) ",
"cite_spans": [
{
"start": 55,
"end": 70,
"text": "[11, [vowel (V)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Linearity vs. Non-Linearity",
"sec_num": "4.1"
},
{
"text": "]). expand(V, [[v], [], IV]l, [vowel(V)]).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Linearity vs. Non-Linearity",
"sec_num": "4.1"
},
{
"text": "The linguist can then rewrite R4 as R8 (Listing 7), and expand it with the command expand(RS). This produces four rules of the form of R4, but with the following expressions for Lex and RLC: 1\u00b0",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Linearity vs. Non-Linearity",
"sec_num": "4.1"
},
{
"text": "Lex [[vl],[],[]] [[vl],[],[]] [ [v], [], [vl] ] [ [v], [], [vi]] 4.2 Vocalisation RLC [ [C,V2], [], [] ] [ [c, v], [C], [V2] ] [[C,V2],[], []] [ [c, v], [C], [V21 ]",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Linearity vs. Non-Linearity",
"sec_num": "4.1"
},
{
"text": "Orthographically, Semitic texts are written without short vowels. It was suggested by (Beesley et al., 1989, et. seq.) and (Kiraz, 1994c) to allow short vowels to be optionally deleted. This, however, puts a constraint on the grammar: no surface expression can contain a vowel, lest the vowel is optionally deleted. We assume full vocalisation in writing rules. A second set of rules can allow the deletion of vowels. The whole grammar can be taken as the composition of the two grammars: e.g. {cvcvc},{ktb},{aa} --+ /ktab/-~ [ktab, ktb].",
"cite_spans": [
{
"start": 86,
"end": 118,
"text": "(Beesley et al., 1989, et. seq.)",
"ref_id": null
},
{
"start": 123,
"end": 137,
"text": "(Kiraz, 1994c)",
"ref_id": "BIBREF19"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Linearity vs. Non-Linearity",
"sec_num": "4.1"
},
{
"text": "Finite-state models of two-level morphology implement morphotactics in two ways: using 'continuation patterns/classes' (Koskenniemi, 1983; Antworth, 1990; Karttunen, 1993) or unificationbased grammars (Bear, 1986; Ritchie et al., 1992) . The former fails to provide elegant morphosyntactic parsing for Semitic languages, as will be illustrated in this section.",
"cite_spans": [
{
"start": 119,
"end": 138,
"text": "(Koskenniemi, 1983;",
"ref_id": "BIBREF24"
},
{
"start": 139,
"end": 154,
"text": "Antworth, 1990;",
"ref_id": "BIBREF1"
},
{
"start": 155,
"end": 171,
"text": "Karttunen, 1993)",
"ref_id": "BIBREF13"
},
{
"start": 201,
"end": 213,
"text": "(Bear, 1986;",
"ref_id": "BIBREF2"
},
{
"start": 214,
"end": 235,
"text": "Ritchie et al., 1992)",
"ref_id": "BIBREF29"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Morphosyntactic Issues",
"sec_num": "4.3"
},
{
"text": "A pattern, a root and a vocalism do not alway produce a free stem which can stand on its own. In Syriac, for example, some verbal forms are bound: they require a stem morpheme which indicates the measure in question, e.g. the prefix {~a} for a/'el 1\u00b0Note, however, that the expand command does not insert [~ randomly in context expressions. [[c3,b,e] This structure of stems can be handled hierarchically using X-theory. A stem whose stem morpheme is known is assigned X=-2 (Rules 1-2 in Listing 8). Rules which indicate mood can apply only to stems whose measure has been identified (i.e. they have X=-2). The resulting stems are assigned X=-I (Rules 3-4 in Listing 8). The parsing of Syriac /~etkteb/ (from {~et}+/kateb/after the deletion of/a/by R4) appears in (5). n Now free stems which may stand on their own can be assigned X=0. However, some stems require nIn the remaining examples, it is assumed that the lexicon and two-level rules are expanded to cater for the new material. verbal inflectional markers.",
"cite_spans": [
{
"start": 341,
"end": 350,
"text": "[[c3,b,e]",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Stems and X-Theory",
"sec_num": "4.3.1"
},
{
"text": "tl_rule(RT, [[], [], []], [[v], [], [V]],",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Stems and X-Theory",
"sec_num": "4.3.1"
},
{
"text": "With respect to verbal inflexional markers (VIMs), there are various types of Semitic verbs: those which do not require a VIM (e.g. sing. 3rd masc.), and those which require a VIM in the form of a prefix (e.g. perfect), suffix (e.g. some imperfect forms), or circumfix (e.g. other imperfect forms).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Verbal Inflectional Markers",
"sec_num": "4.3.2"
},
{
"text": "Each VIM is lexically marked inter alia with two features: 'type' which states whether it is a prefix or a suffix, and 'circum' which denotes whether it is a circumfix. Rules 5-8 (Listing 8) handle this.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Verbal Inflectional Markers",
"sec_num": "4.3.2"
},
{
"text": "The parsing of Syriac /netkatbun/ (from {ne}+ {~et)+/katab/+{un}) appears in (6). (Beesley et al., 1989) handle this problem by finding a logical expression for the prefix and suffix portions of circumfix morphemes, and use unification to generate only the correct forms -see (Sproat, 1992, p. 158) . This approach, however, cannot be used here since, unlike Arabic, not all Syriac VIMs are in the form of circumfixes.",
"cite_spans": [
{
"start": 82,
"end": 104,
"text": "(Beesley et al., 1989)",
"ref_id": "BIBREF5"
},
{
"start": 276,
"end": 298,
"text": "(Sproat, 1992, p. 158)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Verbal Inflectional Markers",
"sec_num": "4.3.2"
},
{
"text": "A Semitic 'word' (string separated by word boundary) may in fact be a clause or a sentence. Therefore, a morphosyntactic parsing of a 'word' may be a (partial) syntactic parsing of a sentence in the form of a (partial) tree. The output of a morphological analyser can be structured in a manner suitable for syntactic processing. Using tree-adjoining grammars (Joshi, 1985) might be a possibility.",
"cite_spans": [
{
"start": 359,
"end": 372,
"text": "(Joshi, 1985)",
"ref_id": "BIBREF10"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Interfacing with a Syntactic Parser",
"sec_num": "4.3.3"
},
{
"text": "To test the integrity, robustness and performance of the implementation, a two-level grammar of the most frequent words in the Syriac New Testament was compiled based on the data in (Kiraz, 1994b) . The grammar covers most classes of verbal and nominal forms, in addition to prepositions, proper nouns and words of Greek origin. A wider coverage would involve enlarging the lexicon (currently there are 165 entries) and might triple the number of two-level rules (currently there are c. 50 rules). Table 1 provides the results of analysing verbal classes. The test for each class represents analysing most of its inflexions. The test was executed on a Sparc ELC computer.",
"cite_spans": [
{
"start": 182,
"end": 196,
"text": "(Kiraz, 1994b)",
"ref_id": "BIBREF18"
}
],
"ref_spans": [
{
"start": 498,
"end": 505,
"text": "Table 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Performance",
"sec_num": "5"
},
{
"text": "By constructing a corpus which consists only of the most frequent words, one can estimate the performance of analysing the corpus as follows, n 4 p _-5.324n + ~i=1 0.05 (fi -1) sec/word ~i~=l fi",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Performance",
"sec_num": "5"
},
{
"text": "where n is the number of distinct words in the corpus and fi is the frequency of occurrence of the ith word.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Performance",
"sec_num": "5"
},
{
"text": "The SEDRA database (Kiraz, 1994a) provides such data. All occurrences of the 100 most frequent lexemes in their various inflections (a total of 72,240 occurrences) can be analysed at the rate of 16.35 words/sec. (Performance will be less if additional rules are added for larger coverage.)",
"cite_spans": [
{
"start": 19,
"end": 33,
"text": "(Kiraz, 1994a)",
"ref_id": "BIBREF17"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Performance",
"sec_num": "5"
},
{
"text": "The results may not seem satisfactory when compared with other prolog implementations of the same formalism (cf. 50 words/sec, in (Carter, 1995) ). One should, however, keep in mind the complexity of Syriac morphology. In addition to morphological nonlinearity, phonological conditional changes -consonantal and vocalic -occur in all stems, and it is not unusual to have more than five such changes per word. Once developed, a grammar is usually compiled into automata which provides better performance.",
"cite_spans": [
{
"start": 130,
"end": 144,
"text": "(Carter, 1995)",
"ref_id": "BIBREF7"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Performance",
"sec_num": "5"
},
{
"text": "This paper has presented a computational morphology system which is adequate for handling non-linear grammars. We are currently expanding the grammar to cover the whole of New Testament Syriac. One of our future goals is to optimise the prolog implementation for speedy processing and to add debugging facilities along the lines of (Carter, 1995) . For useful results, a Semitic morphological analyser needs to interact with a syntactic parser in order to resolve ambiguities. Most non-vocalised strings give more than one solution, and some inflectional forms are homographs even if fully vocalised (e.g. in Syriac imperfect verbs: sing. 3rd masc. = plural 1st common, and sing. 3rd fern. = sing. 2nd masc.). We mentioned earlier the possibility of using TAGs.",
"cite_spans": [
{
"start": 332,
"end": 346,
"text": "(Carter, 1995)",
"ref_id": "BIBREF7"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "6"
}
],
"back_matter": [],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Principles of Compiler Design",
"authors": [
{
"first": "A",
"middle": [],
"last": "Aho",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Ullman",
"suffix": ""
}
],
"year": 1977,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Aho, A. and Ullman, J. (1977). Principles of Com- piler Design. Addison-Wesley.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "PC-KIMMO: A two-Level Processor for Morphological Analysis. Occasional Publications in Academic Computing 16",
"authors": [
{
"first": "E",
"middle": [],
"last": "Antworth",
"suffix": ""
}
],
"year": 1990,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Antworth, E. (1990). PC-KIMMO: A two-Level Processor for Morphological Analysis. Occasional Publications in Academic Computing 16. Summer Institute of Linguistics, Dallas.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "A morphological recognizer with syntactic and phonological rules",
"authors": [
{
"first": "J",
"middle": [],
"last": "Bear",
"suffix": ""
}
],
"year": 1986,
"venue": "COLING-86",
"volume": "",
"issue": "",
"pages": "272--278",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Bear, J. (1986). A morphological recognizer with syntactic and phonological rules. In COLING-86, pages 272-6.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Finite-state description of Arabic morphology",
"authors": [
{
"first": "K",
"middle": [],
"last": "Beesley",
"suffix": ""
}
],
"year": 1990,
"venue": "Proceedings of the Second Cambridge Conference: Bilingual Computing in Arabic and English",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Beesley, K. (1990). Finite-state description of Ara- bic morphology. In Proceedings of the Second Cambridge Conference: Bilingual Computing in Arabic and English.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Computer analysis of Arabic morphology",
"authors": [
{
"first": "K",
"middle": [],
"last": "Beesley",
"suffix": ""
}
],
"year": 1991,
"venue": "Perspectives on Arabic Linguistics III: Papers from the Third Annual Symposium on Arabic Linguistics. Benjamins",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Beesley, K. (1991). Computer analysis of Arabic morphology. In Comrie, B. and Eid, M., edi- tors, Perspectives on Arabic Linguistics III: Pa- pers from the Third Annual Symposium on Arabic Linguistics. Benjamins, Amsterdam.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Two-level finite-state analysis of Arabic morphology",
"authors": [
{
"first": "K",
"middle": [],
"last": "Beesley",
"suffix": ""
},
{
"first": "T",
"middle": [],
"last": "Buckwalter",
"suffix": ""
},
{
"first": "Newton",
"middle": [],
"last": "",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "",
"suffix": ""
}
],
"year": 1989,
"venue": "Proceedings of the Seminar on Bilingual Computing in Arabic and English. The Literary and Linguistic Computing Centre",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Beesley, K., Buckwalter, T., and Newton, S. (1989). Two-level finite-state analysis of Arabic morphol- ogy. In Proceedings of the Seminar on Bilingual Computing in Arabic and English. The Literary and Linguistic Computing Centre, Cambridge.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "One-level phonology",
"authors": [
{
"first": "S",
"middle": [],
"last": "Bird",
"suffix": ""
},
{
"first": "T",
"middle": [],
"last": "Ellison",
"suffix": ""
}
],
"year": 1994,
"venue": "Computational Linguistics",
"volume": "20",
"issue": "1",
"pages": "55--90",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Bird, S. and Ellison, T. (1994). One-level phonology. Computational Linguistics, 20(1):55-90.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Rapid development of morphological descriptions for full language processing systems",
"authors": [
{
"first": "D",
"middle": [],
"last": "Carter",
"suffix": ""
}
],
"year": 1995,
"venue": "EACL-95",
"volume": "",
"issue": "",
"pages": "202--211",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Carter, D. (1995). Rapid development of morpho- logical descriptions for full language processing systems. In EACL-95, pages 202-9.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Autosegmental Phonology. PhD thesis, MIT. Published as Autosegmental and Metrical Phonology",
"authors": [
{
"first": "J",
"middle": [],
"last": "Goldsmith",
"suffix": ""
}
],
"year": 1976,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Goldsmith, J. (1976). Autosegmental Phonology. PhD thesis, MIT. Published as Autosegmental and Metrical Phonology, Oxford 1990.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Compiling a partition-based two-level formalism",
"authors": [
{
"first": "E",
"middle": [],
"last": "Grimley-Evans",
"suffix": ""
},
{
"first": "G",
"middle": [],
"last": "Kiraz",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Pulman",
"suffix": ""
}
],
"year": 1996,
"venue": "COLING-96. Forthcoming",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Grimley-Evans, E., Kiraz, G., and Pulman, S. (1996). Compiling a partition-based two-level for- malism. In COLING-96. Forthcoming.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Tree-adjoining grammars: How much context sensitivity is required to provide reasonable structural descriptions",
"authors": [
{
"first": "A",
"middle": [],
"last": "Joshi",
"suffix": ""
}
],
"year": 1985,
"venue": "Natural Language Parsing",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Joshi, A. (1985). Tree-adjoining grammars: How much context sensitivity is required to provide reasonable structural descriptions. In Dowty, D., Karttunen, L., and Zwicky, A., editors, Natural Language Parsing. Cambridge University Press.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "general mor-Texas Linguistic Forum",
"authors": [],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kimmo: A general mor- Texas Linguistic Forum,",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Finite-state lexicon compiler",
"authors": [
{
"first": "L",
"middle": [],
"last": "Karttunen",
"suffix": ""
}
],
"year": 1993,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Karttunen, L. (1993). Finite-state lexicon compiler. Technical report, Palo Alto Research Center, Xe- rox Corporation.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Two-level rule compiler",
"authors": [
{
"first": "L",
"middle": [],
"last": "Karttunen",
"suffix": ""
},
{
"first": "K",
"middle": [],
"last": "Beesley",
"suffix": ""
}
],
"year": 1992,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Karttunen, L. and Beesley, K. (1992). Two-level rule compiler. Technical report, Palo Alto Research Center, Xerox Corporation.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Finite state description of Semitic morphology",
"authors": [
{
"first": "L",
"middle": [],
"last": "Kataja",
"suffix": ""
},
{
"first": "K",
"middle": [],
"last": "Koskenniemi",
"suffix": ""
}
],
"year": 1988,
"venue": "COLING-88",
"volume": "1",
"issue": "",
"pages": "313--328",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kataja, L. and Koskenniemi, K. (1988). Finite state description of Semitic morphology. In COLING- 88, volume 1, pages 313-15.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Nonconcatenative finite-state morphology",
"authors": [
{
"first": "M",
"middle": [],
"last": "Kay",
"suffix": ""
}
],
"year": 1987,
"venue": "EACL-87",
"volume": "",
"issue": "",
"pages": "2--10",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kay, M. (1987). Nonconcatenative finite-state mor- phology. In EACL-87, pages 2-10.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Automatic concordance generation of Syriac texts",
"authors": [
{
"first": "G",
"middle": [],
"last": "Kiraz",
"suffix": ""
}
],
"year": 1992,
"venue": "VI Symposium Syriaeum",
"volume": "247",
"issue": "",
"pages": "461--75",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kiraz, G. (1994a). Automatic concordance genera- tion of Syriac texts. In Lavenant, R., editor, VI Symposium Syriaeum 1992, Orientalia Christiana Analecta 247, pages 461-75. Pontificio Institutum Studiorum Orientalium.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Lexical Tools to the Syriac New Testament. JSOT Manuals 7",
"authors": [
{
"first": "G",
"middle": [],
"last": "Kiraz",
"suffix": ""
}
],
"year": 1994,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kiraz, G. (1994b). Lexical Tools to the Syriac New Testament. JSOT Manuals 7. Sheffield Academic Press.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Multi-tape two-level morphology: a case study in Semitic non-linear morphology",
"authors": [
{
"first": "G",
"middle": [],
"last": "Kiraz",
"suffix": ""
}
],
"year": 1994,
"venue": "COLING-94",
"volume": "1",
"issue": "",
"pages": "180--186",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kiraz, G. (1994c). Multi-tape two-level morphology: a case study in Semitic non-linear morphology. In COLING-94, volume 1, pages 180-6.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Introduction to Syriae Spirantization",
"authors": [
{
"first": "G",
"middle": [],
"last": "Kiraz",
"suffix": ""
}
],
"year": 1995,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kiraz, G. (1995). Introduction to Syriae Spirantiza- tion. Bar Hebraeus Verlag, The Netherlands.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Computational Approach to Non-Linear Morphology",
"authors": [
{
"first": "G",
"middle": [],
"last": "Kiraz",
"suffix": ""
}
],
"year": 1996,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kiraz, G. (1996). Computational Approach to Non- Linear Morphology. PhD thesis, University of Cambridge.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "The Art of Computer Programming",
"authors": [
{
"first": "D",
"middle": [],
"last": "Knuth",
"suffix": ""
}
],
"year": 1973,
"venue": "",
"volume": "3",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Knuth, D. (1973). The Art of Computer Program- ming, volume 3. Addison-Wesley.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "Formal Phonology",
"authors": [
{
"first": "A",
"middle": [],
"last": "Kornai",
"suffix": ""
}
],
"year": 1991,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kornai, A. (1991). Formal Phonology. PhD thesis, Stanford University.",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "Two-Level Morphology",
"authors": [
{
"first": "K",
"middle": [],
"last": "Koskenniemi",
"suffix": ""
}
],
"year": 1983,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Koskenniemi, K. (1983). Two-Level Morphology. PhD thesis, University of Helsinki.",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "On the applicability of two level morphology to the inflection of Hebrew verbs",
"authors": [
{
"first": "A",
"middle": [],
"last": "Lavie",
"suffix": ""
},
{
"first": "A",
"middle": [],
"last": "Itai",
"suffix": ""
},
{
"first": "U",
"middle": [],
"last": "Ornan",
"suffix": ""
}
],
"year": 1990,
"venue": "Literary and Linguistic Computing 1988: Proceedings of the 15th International Conference",
"volume": "",
"issue": "",
"pages": "246--60",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Lavie, A., Itai, A., and Ornan, U. (1990). On the applicability of two level morphology to the in- flection of Hebrew verbs. In Choueka, Y., editor, Literary and Linguistic Computing 1988: Proceed- ings of the 15th International Conference, pages 246-60.",
"links": null
},
"BIBREF26": {
"ref_id": "b26",
"title": "A prosodic theory of nonconcatenative morphology",
"authors": [
{
"first": "J",
"middle": [],
"last": "Mccarthy",
"suffix": ""
}
],
"year": 1981,
"venue": "Linguistic Inquiry",
"volume": "12",
"issue": "3",
"pages": "373--418",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "McCarthy, J. (1981). A prosodic theory of non- concatenative morphology. Linguistic Inquiry, 12(3):373-418.",
"links": null
},
"BIBREF27": {
"ref_id": "b27",
"title": "On abstract finite-state morphology",
"authors": [
{
"first": "A",
"middle": [],
"last": "Narayanan",
"suffix": ""
},
{
"first": "L",
"middle": [],
"last": "Hashem",
"suffix": ""
}
],
"year": 1993,
"venue": "EACL-93",
"volume": "",
"issue": "",
"pages": "297--304",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Narayanan, A. and Hashem, L. (1993). On abstract finite-state morphology. In EACL-93, pages 297- 304.",
"links": null
},
"BIBREF28": {
"ref_id": "b28",
"title": "A feature-based formalism for two-level phonology: a description and implementation",
"authors": [
{
"first": "S",
"middle": [],
"last": "Pulman",
"suffix": ""
},
{
"first": "M",
"middle": [],
"last": "Hepple",
"suffix": ""
}
],
"year": 1993,
"venue": "Computer Speech and Language",
"volume": "7",
"issue": "",
"pages": "333--58",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Pulman, S. and Hepple, M. (1993). A feature-based formalism for two-level phonology: a description and implementation. Computer Speech and Lan- guage, 7:333-58.",
"links": null
},
"BIBREF29": {
"ref_id": "b29",
"title": "Computational Morphology: Practical Mechanisms for the English Lexicon",
"authors": [
{
"first": "G",
"middle": [],
"last": "Ritchie",
"suffix": ""
},
{
"first": "A",
"middle": [],
"last": "Black",
"suffix": ""
},
{
"first": "G",
"middle": [],
"last": "Russell",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Pulman",
"suffix": ""
}
],
"year": 1992,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ritchie, G., Black, A., Russell, G., and Pulman, S. (1992). Computational Morphology: Practical Mechanisms for the English Lexicon. MIT Press, Cambridge Mass.",
"links": null
},
"BIBREF30": {
"ref_id": "b30",
"title": "Two level formalisms",
"authors": [
{
"first": "H",
"middle": [],
"last": "Ruessink",
"suffix": ""
}
],
"year": 1989,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ruessink, H. (1989). Two level formalisms. Techni- cal Report 5, Utrecht Working Papers in NLP.",
"links": null
},
"BIBREF31": {
"ref_id": "b31",
"title": "An Introduction to Unification-Based Approaches to Grammar",
"authors": [
{
"first": "S",
"middle": [],
"last": "Shieber",
"suffix": ""
}
],
"year": 1986,
"venue": "CSLI Lecture Notes Number 4. Center for the Study of Language and Information",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Shieber, S. (1986). An Introduction to Unification- Based Approaches to Grammar. CSLI Lecture Notes Number 4. Center for the Study of Lan- guage and Information, Stanford.",
"links": null
},
"BIBREF32": {
"ref_id": "b32",
"title": "Morphology and Computation",
"authors": [
{
"first": "R",
"middle": [],
"last": "Sproat",
"suffix": ""
}
],
"year": 1992,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sproat, R. (1992). Morphology and Computation. MIT Press, Cambridge Mass.",
"links": null
},
"BIBREF33": {
"ref_id": "b33",
"title": "Modelling autosegmental phonology with multi-tape finite state transducers. Master's thesis",
"authors": [
{
"first": "B",
"middle": [],
"last": "Wiebe",
"suffix": ""
}
],
"year": 1992,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Wiebe, B. (1992). Modelling autosegmental phonol- ogy with multi-tape finite state transducers. Mas- ter's thesis, Simon Fraser University.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"text": "3The name SemHe (Syriac .semh~ 'rays') is not an acronym, but the title of a grammatical treatise written by the Syriac polymath (inter alia mathematician and grammarian) Bar 'EbrSy5 (1225-1286), viz. k tSb5 d.semh.~ 'The Book of Rays'.",
"uris": null,
"num": null,
"type_str": "figure"
},
"FIGREF1": {
"text": "expand(C, [[C], [], []], [radical(C)]). expand(C, [[c], [C], []], [radical(C)]). expand(V, [ [V], [],",
"uris": null,
"num": null,
"type_str": "figure"
},
"TABREF2": {
"type_str": "table",
"html": null,
"content": "<table><tr><td colspan=\"5\">The arguments are: (1) a rule identifier, id; (2) the</td></tr><tr><td colspan=\"5\">left-lexical-context, LLC, the lexical center, Lex, and</td></tr><tr><td colspan=\"5\">the right-lexical-context, RLC, each in the form of a</td></tr><tr><td colspan=\"5\">list-of-lists, where the ith list represents the /th lex-</td></tr><tr><td colspan=\"5\">ical tape; (3) an operator, => for optional rules or</td></tr><tr><td colspan=\"5\"><=> for obligatory rules; (4) the left-surface-context,</td></tr><tr><td colspan=\"5\">LSC, the surface center, Sur], and the right-surface-</td></tr><tr><td colspan=\"5\">context, RSC, each in the form of a list; (5) a list</td></tr><tr><td colspan=\"5\">of the variables used in the lexical and surface ex-</td></tr><tr><td colspan=\"5\">pressions, each member in the form of a predicate</td></tr><tr><td colspan=\"5\">indicating the set identifier (see in]ra) and an argu-</td></tr><tr><td colspan=\"5\">ment indicating the variable in question; and (6) a</td></tr><tr><td colspan=\"5\">set of features (i.e. category forms) in the form of a</td></tr><tr><td colspan=\"5\">list-of-lists, where the ith item must unify with the</td></tr><tr><td colspan=\"5\">feature-structure of the morpheme affected by the</td></tr><tr><td colspan=\"2\">rule on the ith lexical tape.</td><td/><td/><td/></tr><tr><td colspan=\"5\">A lexical string maps to a surface string iff (1)</td></tr><tr><td colspan=\"5\">they can be partitioned into pairs of lexical-surface</td></tr><tr><td colspan=\"5\">subsequences, where each pair is licenced by a rule,</td></tr><tr><td colspan=\"5\">and (2) no partition violates an obligatory rule.</td></tr><tr><td>Alphabet</td><td>declarations</td><td>take</td><td>the</td><td>form</td></tr><tr><td colspan=\"5\">tl_alphabet( ( tape> , <symbol_list)), and variable</td></tr><tr><td colspan=\"5\">sets are described by the predicate tl_set({id),</td></tr><tr><td colspan=\"5\">{symbol_list}). Word formation rules take the form of</td></tr><tr><td colspan=\"5\">unification-based CFG rules, synrule(<identifier),</td></tr><tr><td>(mother),</td><td/><td/><td/><td/></tr></table>",
"text": ").",
"num": null
},
"TABREF4": {
"type_str": "table",
"html": null,
"content": "<table><tr><td/><td/><td>, Result)</td></tr><tr><td>SurfToDo ----[J &</td><td colspan=\"2\">% surface string exhausted</td></tr><tr><td>eos E NextCats ~ Result = [].</td><td colspan=\"2\">% end-of-string % output: no more results Listing 6</td></tr><tr><td/><td>Listing 2</td></tr><tr><td colspan=\"2\">morphosyntactic parse tree. To analyse a sur-</td></tr><tr><td colspan=\"3\">PARTITION( SurfDone, SurfToDo, LexDone, LexToDo, LexPtrs, NextCats, face form, one calls TwO-LEVEL-ANALYSIS(+Surf,</td></tr><tr><td colspan=\"2\">[ ResultHead I Resuit Tai~) -Lex, -Partition, -Parse). To generate a surface</td></tr><tr><td colspan=\"3\">there is tl_rule(Id, LLC, Lex, RLC, Op, LSC, Surf, RSC, Variables, Features) such that form, one calls TwO-LEVEL-ANALYSIS</td></tr><tr><td colspan=\"3\">( Op = (=> or <=>), LexDone = LLC, SurfDone -= LSC,</td></tr><tr><td colspan=\"3\">SurfToDo = Surf + RSC and LexToDo = Lex + RLC) &</td></tr><tr><td colspan=\"3\">LEXICAL-TRANSITIONS(Lex, LexPtrs, NewLexPtrs, LexCats) &</td></tr><tr><td>push Features onto FeatureStack ~z</td><td/><td>% keep track of rule features</td></tr><tr><td>if LexCats \u00a2 nil then</td><td/><td>% found a morpheme boundary?</td></tr><tr><td colspan=\"2\">while FeatureStaek is not empty</td><td>% unify rule and lexical features</td></tr><tr><td colspan=\"3\">unify LexCats with (pop FeatureStaek) &</td></tr><tr><td colspan=\"2\">push LexCats onto ParseStack ~z</td><td>% update the parse stack</td></tr><tr><td>if LexCats E NextCats then</td><td/><td>% get next category</td></tr><tr><td colspan=\"2\">FOLLOW( LexCats, NewNextCats)</td></tr><tr><td>end if</td><td/></tr><tr><td colspan=\"2\">ResultHead = Id/SurfDone/Surf/RSC/</td></tr><tr><td colspan=\"2\">LexDone/Lex/RL C/LexCats</td></tr><tr><td colspan=\"2\">NewSurfDone = SurfDone + reverse Surf &</td><td>% make new arguments ...</td></tr><tr><td>NewSurfToDo = RSC &</td><td/><td>% ... and recurse</td></tr><tr><td colspan=\"2\">NewLexDone = LexDone \u00f7 reverse Lex &</td></tr><tr><td>NewLexToDo =-RLC &</td><td/></tr><tr><td colspan=\"2\">PARTITION( NewSurfDone, NewSurfToDo,</td></tr><tr><td colspan=\"2\">NewLexDone, NewLex To Do,</td></tr><tr><td colspan=\"3\">NewLexPtrs, NewNextCats, ResultTail) &</td></tr><tr><td>for all SetId(Var) e Variables</td><td/><td>% check variables</td></tr><tr><td colspan=\"3\">there is tLset(SetId, Set) such that Vat E Set.</td></tr><tr><td/><td>Listing 3</td></tr><tr><td colspan=\"3\">CoERcF~([Id/LSC/Surf/RSC/LLC//Lex//RLC//LexCats l ResultTai~, PrevCats,</td></tr><tr><td colspan=\"2\">[Id/Surf//Lex l Partition Tai~)</td></tr><tr><td>if LexCats yt nil then</td><td/></tr><tr><td>CurrentCats = LexCats</td><td/></tr><tr><td>else</td><td/></tr><tr><td colspan=\"2\">CurrentCats = PrevCats &:</td></tr><tr><td colspan=\"3\">not INVALID-PARTITION(LSC~ Surf, RSC, LLC, Lex, RLC, CurrentCats) &</td></tr><tr><td colspan=\"3\">CoERCE( Result Tail, CurrentCats, Partition TaiO.</td></tr><tr><td/><td>Listing 4</td></tr><tr><td colspan=\"3\">INVALID-PARTITION(LSC, Surf, RSC, LLC, Lex, RLC, Cats)</td></tr><tr><td colspan=\"3\">there is tl_rule(Id, LLC, Lex, RLC, <=>, LSC, NotSur~, RSC, Variables, Features) such that</td></tr><tr><td>NotSurf \u00a2 Surf</td><td/></tr><tr><td>for all Setld(Var) e Variables</td><td colspan=\"2\">% check variables</td></tr><tr><td colspan=\"3\">there is tl_set(SetId, Set) such that Vat E Set &</td></tr><tr><td>unify Cats with Features &</td><td/></tr><tr><td>fail.</td><td/></tr><tr><td/><td>Listing 5</td></tr></table>",
"text": "LexToDo = [ [], [] ,..-, [] ] & % all lexical strings exhausted LexPtrs = [rz,rt,-..,rt] & % all lexical pointers are at the root node TwO-LEVEL-ANALYSIS(?Surf, ? Lex, -Partition, -Parse) FOLLOW(bos, NextCats) &: PARTITION([], Surf,[[1, [] , [11, Lex, [rt,rt,...,rt], NextCats, Result) CoERcE(reverse Result, nil, Partition) &:SHIFT-REDUCE( ParseStack, Parse).",
"num": null
}
}
}
} |