File size: 61,094 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 | {
"paper_id": "P86-1019",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T09:13:10.363319Z"
},
"title": "COMPUTER METHODS FOR MORPHOLOGICAL ANALYSIS",
"authors": [
{
"first": "Roy",
"middle": [
"J"
],
"last": "Byrd",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Research Center Yorktown Heights",
"location": {
"addrLine": "10598 Mark Aronoff",
"postCode": "11794",
"region": "New York, New York"
}
},
"email": ""
},
{
"first": "Judith",
"middle": [
"L"
],
"last": "Klavans",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Research Center Yorktown Heights",
"location": {
"addrLine": "10598 Mark Aronoff",
"postCode": "11794",
"region": "New York, New York"
}
},
"email": ""
},
{
"first": "I",
"middle": [
"B M"
],
"last": "Thomas",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Research Center Yorktown Heights",
"location": {
"addrLine": "10598 Mark Aronoff",
"postCode": "11794",
"region": "New York, New York"
}
},
"email": ""
},
{
"first": "J",
"middle": [],
"last": "Watson",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Research Center Yorktown Heights",
"location": {
"addrLine": "10598 Mark Aronoff",
"postCode": "11794",
"region": "New York, New York"
}
},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "",
"pdf_parse": {
"paper_id": "P86-1019",
"_pdf_hash": "",
"abstract": [],
"body_text": [
{
"text": "This paper describes our current research on the properties of derivational affixation in English. Our research arises from a more general research project, the Lexical Systems project at the IBM Thomas J. Watson Research laboratories, the goal for which is to build a variety of computerized dictionary systems for use both by people and by computer programs. An important sub-goal is to build reliable and robust word recognition mechanisms for these dictionaries. One of the more important issues in word recognition for all morphologically complex languages involves mechanisms for dealing with affixes.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1."
},
{
"text": "Two complementary motivations underlie our research on derivational morphology. On the one hand, our goal is to discover linguistically significant generalizations and principles governing the attachment of affixes to English words to form other words. If we can find such generalizations, then we can use them to build our ~mproved word recognizer. We will be better able to correctly recognize and analyse well-formed words and, on the other hand, to reject ill-formed words. On the other hand, we want to use our existing word-recognition and analysis programs as tools for gathering further information about English affixation. This circular process allows us to test and refine our emerging word recognition logic while at the same time providing a large amount of data for linguistic analysis.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1."
},
{
"text": "It is important to note that, while doing derivational morphology is not the only way to deal with complex words in a computerized dictionary, it offers certain advantages. It allows systems to deal with coinages, a possibility which is not open to most systems. Systems which do no morphology and even those which handle primarily inflectional affixation (such as Winograd (1971) and Koskenniemi (1983) Morphological analysis also provides an additional source of lexical information about words, since a word's properties can often be predicted from its structure. In this respect, our dictionaries are distinguished from those of Allen (1976) where complex words are merely analysed as concatenations of word-parts and Cercone (1974) where word structure is not exploited, even though derivational affixes are analysed. Our morphological analysis system was conceived within the linguistic framework of word-based morphology, as described in Aronoff (1976) . In our dictionaries, we store a large number of words, together with associated idiosyncratic information. The retrieval mechanism contains a grammar of derivational (and inflectional) affixation which is used to analyse input strings in terms of the stored words. The mechanism handles both prefixes and suffixes. The framework and mechanism are described in Byrd (1983a) . Crucially, in our system, the attachment of an affix to a base word is conditioned on the properties of the base word. The purpose of our research is to determine the precise nature of those conditions. These conditions may refer to syntactic, semantic, etymological, morphological or phonological properties.",
"cite_spans": [
{
"start": 365,
"end": 380,
"text": "Winograd (1971)",
"ref_id": "BIBREF14"
},
{
"start": 385,
"end": 403,
"text": "Koskenniemi (1983)",
"ref_id": "BIBREF9"
},
{
"start": 633,
"end": 645,
"text": "Allen (1976)",
"ref_id": "BIBREF0"
},
{
"start": 730,
"end": 736,
"text": "(1974)",
"ref_id": null
},
{
"start": 945,
"end": 959,
"text": "Aronoff (1976)",
"ref_id": "BIBREF1"
},
{
"start": 1128,
"end": 1146,
"text": "(and inflectional)",
"ref_id": null
},
{
"start": 1322,
"end": 1334,
"text": "Byrd (1983a)",
"ref_id": "BIBREF2"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1."
},
{
"text": "(See Byrd (1983b) ).",
"cite_spans": [
{
"start": 5,
"end": 17,
"text": "Byrd (1983b)",
"ref_id": "BIBREF3"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1."
},
{
"text": "Our research is of interest to two related audiences: both computational linguists and theoretical linguists. Computational linguists will find here a powerful set of pro-grams for processing natural language material. Furthermore, they should welcome the improvements to those programs' capabilities offered by our linguistic resuits. Theoretical linguists, on the other hand, will find a novel set of tools and data sources for morphological research. The generalizations that result from our analyses should be welcome additions to linguistic theory.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1."
},
{
"text": "Our approach to computer-aided morphological research is to analyse a large number of English words in terms of a somewhat smaller list of monomorphemic base words. For each morphologically complex word on the original list which can be analysed down to one of our bases, we obtain a structure which shows the affixes and marks the parts-of-speech of the components.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Approach and Tools",
"sec_num": "2."
},
{
"text": "Thus, for beautification, we obtain the structure <<<beauty>N +ify>V +ion>N.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Approach and Tools",
"sec_num": "2."
},
{
"text": "In this structure, the noun beauty is the ultimate base and +ify and +ion are the affixes.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Approach and Tools",
"sec_num": "2."
},
{
"text": "After analysis, we obtain, for each base, a list of all words derived from it, together with their morphological structures. We then study these lists and the patterns of affixation they exemplify, seeking generalizations. Section 3 will give an expanded description of the approach together with a detailed account of one of the studies.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Approach and Tools",
"sec_num": "2."
},
{
"text": "We have two classes of tools: word lists and computer programs. There are basically four word lists.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Approach and Tools",
"sec_num": "2."
},
{
"text": "1. The Kucera and Francis (K&F) word list, from Kucera and Francis (1967) , contains 50,000 words listed in order of frequency of occurrence.",
"cite_spans": [
{
"start": 48,
"end": 73,
"text": "Kucera and Francis (1967)",
"ref_id": "BIBREF10"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Approach and Tools",
"sec_num": "2."
},
{
"text": "2. The BASE WORD LIST consists of approximately 3,000 monomorphemic words. It was drawn from the top of the K&F list by the GETBASES procedure described below.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Approach and Tools",
"sec_num": "2."
},
{
"text": "3. The UDICT word list consists of about 63,000 words, drawn mainly from Merriam (1963) . The UDICT program, described below, uses this list in conjunction with our word grammar to produce morphological analyses of input words. The UDICT word list is a superset of the base word list; for each word, it contains the major category as well as other grammatical information. 4. The \"complete\" word list consists of approximately one quarter million words drawn from an international-sized dictionary. Each entry on this list is a single orthographic word, with no additional information. These are the words which are morphologically analysed down to the bases on our base list. 5. We have prepared reverse spelling word lists based on each of the other lists. A particularly useful tool has been a group of reverse lists derived from Merriam(1963) and separated by major category. These lists provide ready access to sets of words having the same suffix.",
"cite_spans": [
{
"start": 73,
"end": 87,
"text": "Merriam (1963)",
"ref_id": "BIBREF12"
},
{
"start": 833,
"end": 846,
"text": "Merriam(1963)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Approach and Tools",
"sec_num": "2."
},
{
"text": "Our computer programs include the following.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Approach and Tools",
"sec_num": "2."
},
{
"text": "1. UDICT. This is a general purpose dictionary access system intended for use by computer programs. (The UDICT program was originally developed for the EPISTLE text-critiquing system, as described in Heidorn, et al. (1982) .) It contains, among other things, the morphological analysis logic and the word grammar that we use to produce the word structures previously described.",
"cite_spans": [
{
"start": 200,
"end": 222,
"text": "Heidorn, et al. (1982)",
"ref_id": "BIBREF8"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Approach and Tools",
"sec_num": "2."
},
{
"text": "This program produces a list of monomorphemic words from the original K&F frequency lists. Basically, it operates by invoking UDICT for each word. The output consists of words which are morphologically simple, and the bases of morphologically complex words. (Among other things, this allows us to handle the fact that the original K&F lists are not lemmatised.) The resulting list, with duplicates removed, is our \"base list\".",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "GETBASES.",
"sec_num": "2."
},
{
"text": "3. ANALYSE. ANALYSE takes each entry from the complete word list. It invokes the UDICT program to give a morphological analysis for that word. Any word whose ultimate base is in the base list is considered a derived word. For each word from the base list, the final result is a list of pairs consisting of [derived-word, structure] The data produced by ANALYSE is further processed by the next four programs. structures, an asterisk represents the ultimate base beauty.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "GETBASES.",
"sec_num": "2."
},
{
"text": "indicating which bases take which single affixes to form another word. One matrix is produced for each of the major categories: nouns, adjectives, and verbs. More detail on the contents and use of these matrices is given in Section 3.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SASDS. This program produces 3 binary matrices",
"sec_num": "5."
},
{
"text": "by SASDS to list bases that accept one or more given affixes.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "MORPH. This program uses the matrices created",
"sec_num": "6."
},
{
"text": "7. SAS. (SAS is a trademark of the SAS Institute, Inc., Cary, North Carolina.) This is a set of statistical analysis programs which can be used to analyse the matrices produced by SASDS.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "MORPH. This program uses the matrices created",
"sec_num": "6."
},
{
"text": "8. WordSmith. This is an on-line dictionary system, developed at IBM, that provides fast and convenient reference to a variety of types of dictionary information. The WordSmith functions of most use in our current research are the REVERSE dimension (for listing words that end the same way), the WEBSTER7 application (for checking the definitions of words we don't know), and the UDED application (for checking and revising the contents of the UDICT word list).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "MORPH. This program uses the matrices created",
"sec_num": "6."
},
{
"text": "Our research can be conveniently described as a two stage process. During the first stage, we endeavored to produce a list of morphologically active base words from which other English words can be derived by affixation. Despite such errors, however, most of the analyses in these matrices are correct and provide a useful basis for our analytical work. We employed a variety of techniques to examine these matrices, and the BASELIST.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Detailed Methods",
"sec_num": "3."
},
{
"text": "Our primary approach was to use SAS, MORPH, and ANALYSES to suggest hypotheses about affix attachment. We then used MORPH, WordSmith, and UDICT (via changes to the grammar) to test and verify those hypotheses. Hypotheses which have so far survived our tests and our skepticism are given in Section 4.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Detailed Methods",
"sec_num": "3."
},
{
"text": "Using the mcthods described, we have produced, results which enhance our understanding of morphological processes, and have produced improvements in the morphological analysis system. We present here some of what we have already learned. Continued research using our approach and data will yield further results.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Results",
"sec_num": "4."
},
{
"text": "It is significant that we were able to perform this research with generally available materials. With the exception of the K&F word frequency list, our word lists were obtained from commercially available dictionaries.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Methodological Results",
"sec_num": "4.1"
},
{
"text": "Lexical Systems project, reported in Chodorow, et al. (1985) , in which semantic information is extracted from commercial dictioriaries. As the morphology project identifies lexical information that is relevant, variations of the semantic extraction methods may be used to populate the dictionary with that information.",
"cite_spans": [
{
"start": 37,
"end": 60,
"text": "Chodorow, et al. (1985)",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "This work forms a natural accompaniment to another",
"sec_num": null
},
{
"text": "As has already been pointed out, our rules leave a resi- . Finally, we now have several ways to avoid the mis-analysis of maize as <<ma>N +ize>V, including the observation that +ize does not accept monosyllabic bases. We don't expect, however, to find a constraint that will deal correctly with words like artal.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "This work forms a natural accompaniment to another",
"sec_num": null
},
{
"text": "In the introduction, we pointed out that one of our goals was to build a system which can handle coinages. With respect to the 63,000-word UDICT word list, the quarter-million-word complete word list can be viewed as consisting mostly of coinages. The fact that our analyser has been largely successful at analysing the words on the complete word list means that we are close to meeting our goal. What remains is to exploit our research results in order to reduce our mis-analysed residue as much as possible.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "This work forms a natural accompaniment to another",
"sec_num": null
},
{
"text": "Linguistically significant generalizations that have resulted so far can be encoded in the form of conditions and assertions in our word formation rule grammar (see Byrd (1983a) ). They typically constrain interactions between specific affixes and particular groups of words.",
"cite_spans": [
{
"start": 165,
"end": 177,
"text": "Byrd (1983a)",
"ref_id": "BIBREF2"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "2 Linguistic Results",
"sec_num": "4."
},
{
"text": "The linguistic constraints fall into at least three categories: (1) syllabic structure of the base word; 2phonemic nature of the final segment of the base word;",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "2 Linguistic Results",
"sec_num": "4."
},
{
"text": "and 3 that it is less likely to occur, and in fact did not occur in a list like Merriam (1963) .",
"cite_spans": [
{
"start": 80,
"end": 94,
"text": "Merriam (1963)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "2 Linguistic Results",
"sec_num": "4."
},
{
"text": "Two other suffixes also appear to select for number of syllables in the base word. In this case the denominal verb suffixes +ize and +ify are nearly in complementary distribution. Our data show that of the approximately 200 bases which take +ize, only seven are monosyllabic. Compare this with the suffix +tfy which selects for about 100 bases, of which only one is trisyllabic and 17 are disyllabic. Thus, +t.\u00a3v tends to select for [+short] bases while +ize tends to select for [+long] ones. As with #ish, there appears to be motivation for syllabic structure constraints on morphological rules.",
"cite_spans": [
{
"start": 433,
"end": 441,
"text": "[+short]",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "2 Linguistic Results",
"sec_num": "4."
},
{
"text": "In the case of +ize and +ify it appears that the syllabic structure of the suffix interacts with the syllabic structure of the base. Informally, the longer suffix selects for a [+short] base, and the shorter suffix selects for a",
"cite_spans": [
{
"start": 177,
"end": 185,
"text": "[+short]",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "2 Linguistic Results",
"sec_num": "4."
},
{
"text": "[+long] base. Our speculation is that this may be related to the notion of optimal target metrical structure as discussed in Hayes (1984) . This notion, however, is the subject of future research. phonemes, then it is not likely to be able to serve as the base of +ary. We have also found that the ual spelling of the +al suffix prefers a preceding alveolar, such as gradual, sexual, habitual.",
"cite_spans": [
{
"start": 125,
"end": 137,
"text": "Hayes (1984)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "2 Linguistic Results",
"sec_num": "4."
},
{
"text": "Another result related to the alveolar requirement is an even more stringent requirement of the nominalizing suffix +ity. Of the approximately 150 nouns taking +ity, only three end in the phoneme /t/ (chastity, sacrosanctity, and vastity) . In addition the adjectivizer +cy seems also to attach primarily to bases ending in /t/. The exceptions are normalcy and supremacy.",
"cite_spans": [
{
"start": 200,
"end": 238,
"text": "(chastity, sacrosanctity, and vastity)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "2 Linguistic Results",
"sec_num": "4."
},
{
"text": "Etymology of the Base Word. The feature [+Germanic] is said to be of critical importance in the analysis of English morphology (Chomsky and Halle 1968, Marchand 1969 ). In two cases our data show this to be true. The suffix +en, which creates verbs from adjectives, as in moist~moisten, yielded a total of fifty-five correct analyses. Of these, forty-three appear in Merriam (1963) , and of these forty-one are of Germanic origin. The remaining two are quieten and neaten. The former is found only in some dialects. It is clear that +en verbs aI'e:oyerwhelmingly formed on [+Germanic] bases.",
"cite_spans": [
{
"start": 40,
"end": 51,
"text": "[+Germanic]",
"ref_id": null
},
{
"start": 127,
"end": 139,
"text": "(Chomsky and",
"ref_id": "BIBREF6"
},
{
"start": 140,
"end": 165,
"text": "Halle 1968, Marchand 1969",
"ref_id": null
},
{
"start": 367,
"end": 381,
"text": "Merriam (1963)",
"ref_id": "BIBREF12"
},
{
"start": 573,
"end": 584,
"text": "[+Germanic]",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "2 Linguistic Results",
"sec_num": "4."
},
{
"text": "The feature [Germanic] is also significant with +al adjectives. In contrast to the +en stfffix, +al selects for the feature [-Germanic] . In our data, there were some two hundred and seventy two words analysed as adjectives derived from nouns by +al suffixation. Of the base words which appear in Merriam (1963) , only one, bridal, is of Germanic origin. However, interestingly, it turns out that the analysis <<bride>N +al >A is spurious, since bridal is the reflex of an Old English form brydealu, a noun referring to the wedding feast. The adjective bridal is not derived from bride. Rather it was zero-derived historically from the nominal form.",
"cite_spans": [
{
"start": 124,
"end": 135,
"text": "[-Germanic]",
"ref_id": null
},
{
"start": 297,
"end": 311,
"text": "Merriam (1963)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "2 Linguistic Results",
"sec_num": "4."
},
{
"text": "Finally, other findings from our analysis show that no words formed with the Anglo-Saxon prefixes a+, be+ or for+ will negate with the Latinate prefixes non# or in#. This supports the findings of Marchand (1969) .",
"cite_spans": [
{
"start": 196,
"end": 211,
"text": "Marchand (1969)",
"ref_id": "BIBREF11"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "2 Linguistic Results",
"sec_num": "4."
},
{
"text": "Observe that in these examples, the constraint applies between affixes, rather than between an affix and a base. The addition of an affix thus creates a new complex lexical item, complete with additional properties which can constrain further affixation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "2 Linguistic Results",
"sec_num": "4."
},
{
"text": "In sum, our sample findings suggest a number of new constraints on morphological rules. In addition we provide evidence and support for the observations of others.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "2 Linguistic Results",
"sec_num": "4."
},
{
"text": "In addition to using our linguistic results to change the grammar, we have also made a variety of improvements to UDICT's morphological analyser which interprets that grammar. Some have been for our own convenience, such as streamlining the procedures for changing and compiling the grammar. Two of the improvements, however, result directly from the analysis of our word lists and files. These improvements represent generalizations over classes of affixes.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Improvements to the Implementation",
"sec_num": "4.3"
},
{
"text": "First, we observed that, with the exception of be, do, and go, no base spelled with fewer than three characters ever takes an affix. Adding code to the analyser to restrict the size of bases has had an important effect in avoiding spurious analyses.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Improvements to the Implementation",
"sec_num": "4.3"
},
{
"text": "A more substantial result is that we have added to UDICT a comprehensive set of English spelling rules which make the right spelling adjustments to the base of a suffix virtually all of the time. These rules, for example, know when and when not to double final consonants, when to retain silent e preceding a suffix beginning with a vowel, and when to add k to a base ending in c. These rules are a critical aspect Of UDICT's ability to robustly handle normal English input and to avoid misanalyses.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Improvements to the Implementation",
"sec_num": "4.3"
},
{
"text": "When we have modified our grammar to incorporate resuits we have obtained, and added the necessary supporting features and attributes to the words in UDICT's word list, we will re-run our programs to produce files based on the corrected analyses that we will obtain.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Further Analyses and Plans",
"sec_num": "5."
},
{
"text": "These files will, in turn, be used for further analysis in the Lexical Systems project, and by other researchers.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Further Analyses and Plans",
"sec_num": "5."
},
{
"text": "We plan to continue our work by looking for more constraints on affixation. A reasonable, if ambitious, goal is to achieve a word formation rule grammar which is \"tight\" enough to allow us to reliably generate words using derivational affixation. Such a capability would be important, for example, in a translation application where idiomaticness often requires that a translated concept appear with a different part-of-speech than in the source language.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Further Analyses and Plans",
"sec_num": "5."
},
{
"text": "Further research will investigate patterns of multiple affixation. Are there any interdependencies among affixes when more than one appear in a given word? If so, what are they? One important question in this area has to do with violations of the Affix Ordering Generalization (Siegel (1974) ), sometimes known as \"bracketing paradoxes\".",
"cite_spans": [
{
"start": 277,
"end": 291,
"text": "(Siegel (1974)",
"ref_id": "BIBREF13"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Further Analyses and Plans",
"sec_num": "5."
},
{
"text": "A related issue which emerged during our work concerns prefixes, such as pre# and over#, which apparently ignore the category of their bases. It may be that recursive application of prefixes and suffixes is not the best way to account for such prefixes. We would like to use our data to address this question.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Further Analyses and Plans",
"sec_num": "5."
},
{
"text": "Our data can also be used to investigate the morphological behavior of words which are \"zeroderived\" or \"drifted\" from a different major category.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Further Analyses and Plans",
"sec_num": "5."
},
{
"text": "Such words are the nouns considerable, accused, and beyond listed in Merriam(1967) . Contrary to our goal for GETBASES (to produce a list of morphologically active bases), these words never served as the base for derivational affixation in our data. We conjecture that some mechanism in the grammar prevents them from doing so, and plan to investigate the nature of that mechanism.",
"cite_spans": [
{
"start": 69,
"end": 82,
"text": "Merriam(1967)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Further Analyses and Plans",
"sec_num": "5."
},
{
"text": "Obtaining results from investigations of this type will not only be important for producing a robust word analysis system, it will also significantly contribute to our theoretical understanding of morphological phenomena.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Further Analyses and Plans",
"sec_num": "5."
}
],
"back_matter": [
{
"text": "We are grateful to Mary Neff and Martin Chodorow, both members of the Lexical Systems project, for ongoing comments on this research. We also thank Paul Cohen for advice on general lexicographic matters and Paul Tukey for advice on statistical analysis methods.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgments",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Synthesis of Speech from Unrestricted Text",
"authors": [
{
"first": "J",
"middle": [],
"last": "Allen",
"suffix": ""
}
],
"year": 1976,
"venue": "Proceedings of the IEEE",
"volume": "64",
"issue": "",
"pages": "433--442",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Allen, J. (1976) \"Synthesis of Speech from Unrestricted Text,\" Proceedings of the IEEE 64, 433-442.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Word Formation in Generative Grammar",
"authors": [
{
"first": "M",
"middle": [],
"last": "Aronoff",
"suffix": ""
}
],
"year": 1976,
"venue": "Linguistic Inquiry Monograph",
"volume": "1",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Aronoff, M, (1976) Word Formation in Generative Grammar, Linguistic Inquiry Monograph 1, MIT Press, Cambridge, Massachusetts.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Word formation in natural language processing systems",
"authors": [
{
"first": "R",
"middle": [
"J"
],
"last": "Byrd",
"suffix": ""
}
],
"year": 1983,
"venue": "Proceedings of IJCA1-VIII",
"volume": "",
"issue": "",
"pages": "704--706",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Byrd, R. J. (1983a) \"Word formation in natural lan- guage processing systems,\" Proceedings of IJCA1-VIII, 704-706.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "On Restricting Word Formation Rules",
"authors": [
{
"first": "R",
"middle": [
"J"
],
"last": "Byrd",
"suffix": ""
}
],
"year": 1983,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Byrd, R. J. (1983b) \"On Restricting Word Formation Rules,\" unpublished paper, New York University.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Computer Analysis of English Word Formation",
"authors": [
{
"first": "N",
"middle": [],
"last": "Cercone",
"suffix": ""
}
],
"year": 1974,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Cercone, N. (1974) \"Computer Analysis of English Word Formation,\" Technical Report TR74-6, Depart- ment of Computing Science, University of Alberta, Edmonton, Alberta, Canada.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Extracting Semantic Hierarchies from a Large On-line Dictionary",
"authors": [
{
"first": "M",
"middle": [
"S"
],
"last": "Chodorow",
"suffix": ""
},
{
"first": "R",
"middle": [
"J"
],
"last": "Byrd",
"suffix": ""
},
{
"first": "G",
"middle": [
"E"
],
"last": "Heidorn",
"suffix": ""
}
],
"year": 1985,
"venue": "Proceedings of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "299--304",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Chodorow, M. S., R. J. Byrd, and G. E. Heidorn (1985) \"Extracting Semantic Hierarchies from a Large On-line Dictionary,\" Proceedings of the Association for Compu- tational Linguistics, 299-304.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "The Sound Pattern of English",
"authors": [
{
"first": "N",
"middle": [],
"last": "Chomsky",
"suffix": ""
},
{
"first": "M",
"middle": [],
"last": "Halle",
"suffix": ""
}
],
"year": 1968,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Chomsky, N. and M. Halle (1968) The Sound Pattern of English, MIT Press. Cambridge, Massachusetts.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "A Grid-based Theory of English Meter",
"authors": [
{
"first": "B",
"middle": [],
"last": "Hayes",
"suffix": ""
}
],
"year": 1983,
"venue": "Linguistic Inquiry",
"volume": "14",
"issue": "",
"pages": "357--393",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Hayes, B. (1983) \"A Grid-based Theory of English Meter,\" Linguistic Inquiry 14:3:357-393.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "The EPISTLE Text-Critiquing System",
"authors": [
{
"first": "G",
"middle": [
"E"
],
"last": "Heidorn",
"suffix": ""
},
{
"first": "K",
"middle": [],
"last": "Jensen",
"suffix": ""
},
{
"first": "L",
"middle": [
"A"
],
"last": "Miller",
"suffix": ""
},
{
"first": "R",
"middle": [
"J"
],
"last": "Byrd",
"suffix": ""
},
{
"first": "M",
"middle": [
"S"
],
"last": "Chodorow",
"suffix": ""
}
],
"year": 1982,
"venue": "IBM Systems Journal",
"volume": "21",
"issue": "",
"pages": "305--326",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Heidorn, G. E., K. Jensen, L. A. Miller, R. J. Byrd, and M. S. Chodorow (1982) \"The EPISTLE Text- Critiquing System,\" IBM Systems Journal 21,305-326.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Two-level Morphology: A General Computational Model .for Word-form Recognition and Produclion",
"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: A Gen- eral Computational Model .for Word-form Recognition and Produclion, University of Helsinki, Department of General Linguistics.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Computational Analysis of Present-Day American English",
"authors": [
{
"first": "H",
"middle": [],
"last": "Kucera",
"suffix": ""
},
{
"first": "W",
"middle": [
"N"
],
"last": "Francis",
"suffix": ""
}
],
"year": 1967,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kucera, H. and W. N. Francis (1967) Computational Analysis of Present-Day American English, Brown Uni- versity Press, Providence, Rhode Island.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "The Categories and Types of Present-Day English Word-Formation",
"authors": [
{
"first": "H",
"middle": [],
"last": "Marchand",
"suffix": ""
}
],
"year": 1969,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Marchand, H. (1969) The Categories and Types of Present-Day English Word-Formation, C.H.Beck'sche Verlagsbuchhandlung, Munich.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Websters Seventh New Collegiate Dictionary",
"authors": [
{
"first": "",
"middle": [],
"last": "Merriam",
"suffix": ""
}
],
"year": 1963,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Merriam (1963) Websters Seventh New Collegiate Dic- tionary, Merriam, Springfield, Massachusetts.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Topics in English Morphology, Doctoral Dissertation",
"authors": [
{
"first": "D",
"middle": [],
"last": "Siegel",
"suffix": ""
}
],
"year": 1974,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Siegel, D. (1974) Topics in English Morphology, Doc- toral Dissertation, MIT, Cambridge, Massachusetts.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "An A. I. Approach to English Morphemic Analysis",
"authors": [
{
"first": "T",
"middle": [],
"last": "Winograd",
"suffix": ""
}
],
"year": 1971,
"venue": "A. I. Laboratory",
"volume": "",
"issue": "241",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Winograd, T. (1971) \"An A. I. Approach to English Morphemic Analysis,\" A. I. Memo No. 241, A. I. Lab- oratory, MIT, Cambridge, Massachusetts.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"type_str": "figure",
"num": null,
"text": ") are limited by the fixed size of their lists of stored words. Koskenniemi claims that his two-level morphology framework can handle derivational affixation, although his examples are all of inflectional processes. It is not clear how that framework accounts for the variety of phenomena that we observe in English derivational morphology.",
"uris": null
},
"FIGREF1": {
"type_str": "figure",
"num": null,
"text": "ANALYSES Output.",
"uris": null
},
"FIGREF2": {
"type_str": "figure",
"num": null,
"text": "Final Segment of the Base Word. The phonemic nature of the final segment appears to affect the propensity of a base to take an affix. Consider the fact that there occurred some 48 +ary adjectives derived from nouns in our data. Of these, 46 are formed from bases ending with alveolars. The category alveolar includes the phonemes /t/, /d/, /n/, /s/, /z/, and/1/. The two exceptions are customary and palmary. Again, in a word recognizer, if a base does not end in one of these",
"uris": null
},
"TABREF1": {
"num": null,
"type_str": "table",
"html": null,
"text": "The term \"morphologically active\" means that a word can potentially serve as the base of a large number of affixed derivatives. Having such words is important for stage two, where patterns of affixation become more obvious when we have more instances of bases that exhibit them. We conjectured that words which were freforms of irregular words. (For example, the past participle done does not take affixes, although its lemma do will accept #able as in doable)GETBASES next considered the ultimate bases of the morphologically complex words. Any base which did not also appear in the K&F word list was discarded. The remaining bases were added to the original list of The NOUNS, ADJECTIVES, and VERBS matrices froln SASDS.Our first in-depth study of this material involved the process of adding a single affix to a base word to form another word. By applying SASDS to BASELIST, we obtained 3 matrices showing for each base which affixes it did and did not accept. The noun matrix contained",
"content": "<table><tr><td>NOUNS</td><td/><td/><td>#</td><td>###a</td><td>o</td></tr><tr><td>+</td><td>+</td><td>++++#h</td><td/><td>##11smnv</td></tr><tr><td>+++a+++e+i</td><td/><td colspan=\"2\">i oo fo</td><td>iieihboe</td></tr><tr><td colspan=\"3\">aaarceerifzruuo</td><td/><td>ssskiinr</td></tr><tr><td>1 n ryyd</td><td colspan=\"2\">nycyeys</td><td>Id</td><td>hmsep###</td></tr><tr><td colspan=\"5\">quent in the language have a higher likelihood of participating in word-formation processes, so we began our search with the 6,000 most frequent words in the K&F word list. The GETBASES program segregated these words into two categories: morphologically simple words (i.e., those for which UDICT produced a structure containing no affixes) and morphologically complex words. At the same time, GETBASES discarded words that were not morphologically interesting; these included proper nouns, words not belonging to the major categories, and non-lemma morphologically simple words. After removing dupli-cates, we obtained a list of approximately 3,000 very frequent bases which we conjectured were morphologically active. Development of the GETBASES program was an itera-tive process. The primary type of change made at each iteration was to correct and improve the UDICT gram-mar and morphological analysis mechanism. Because the constraints on the output of GETBASES were clear (and because it was obvious when we failed to meet them), the creation of GETBASES proved to be a very effective way to guide improvements to UDICT. The more important of these improvements are discussed in Section 4.3. For stage two of our project, we used ANALYSE to process the \"complete\" word list, as described in Section 2. That is, for each word, UDICT was asked to produce a morphological analysis. Whenever the ultimate base for one of the (morphologically complex) words ap-peared on our list of 3,000 bases, the derived word and its structure were added to the list of such pairs'associ-000001000000000 000010000000000 000000001010000 010000001010000 000000000010000 100000001010000 000000000000100 000000000000000 000000000000000 lO0000000000000 000000000000001 00110000 01000000 00010000 11000010 00000000 00000000 00000000 00100011 O0OOOO01 00000000 O0OO1O0O i U # n o n +++#n tnvps d ++iiiieieoeruue ceftzssnrnrebnr ynyye h s # # ## ## ## 000001100010010 000001100000010 000000010010001 000000100100010 000110110011010 000001001100100 000000010010010 010000000000000 010001100110000 000000000101010 000010100101010 000000100000011 010000100000000 000000000000011 000110100000010 000000000001010 i U + # n o n + a + ++++ #m tmv p s d ana++iiou#iedeeierruue bc neeovu ren nan r s ree bn r 1 etdenesergt###+###### 1001000001000000111001 0001000001100000101011 0000000000000000001100 1001011000000000011010 0000000001000000000000 0100010001000000011000 1001011001100000011000 1000000001100000001000 1000000001100100001000 1100000001100000011000 0001000001001000000000 1000011001110000011000 1000000000100000001011 and the verb matrix contained 1600 bases. (Since the anchor ancient angel animal annual anode anonym answer anxiety apartment apprentice ADJECTIVES faint fair fall false familiar family fancy fast fat favorite federal feeling fell fellow female festival VERBS study stuff style subject submarine submit substitute succeed sue suffer sugar suggest suit original list of bases contained words belonging to mul-tiple major categories, these counts add up to more than 3,000. The ANALYSE program used the part-of-speech assignments from UDICT to disambiguate such homographs.) Figure 2 contains samples taken from the noun, adjec-tive, and verb matrices. For each matrix, the horizontal axis shows the complete list of affixes (for that part-of-speech) covered in our study. The vertical axes give Figure 2. 1900 bases; the adjective matrix contained 850 bases; contiguous samples of our ultimate bases.</td></tr></table>"
}
}
}
} |