| { | |
| "paper_id": "C94-1035", | |
| "header": { | |
| "generated_with": "S2ORC 1.0.0", | |
| "date_generated": "2023-01-19T12:48:00.464465Z" | |
| }, | |
| "title": "SYLLABLE-IIASED MOI)EI. FOR TIIF, K()III~AN MORPIIOLOGY", | |
| "authors": [ | |
| { | |
| "first": "Seung-Shik", | |
| "middle": [], | |
| "last": "Kang", | |
| "suffix": "", | |
| "affiliation": { | |
| "laboratory": "", | |
| "institution": "IIansung University Seonl", | |
| "location": { | |
| "postCode": "136-792", | |
| "country": "Korea" | |
| } | |
| }, | |
| "email": "" | |
| } | |
| ], | |
| "year": "", | |
| "venue": null, | |
| "identifiers": {}, | |
| "abstract": "This paper describes a syllable-based computational model for the Korean morphology. In this model, morpholovical analysis is considered as a process of candidate Generation and candidate selection. In order to increase tile performance of the system, the number of candidates is highly reduced and tim system require.s small number of dictionary accesses. Idiosynchratic features of a syllable, formalized as a characteristic fnnetion, make it possible to reject implausible candklates before dictionary confirmation, instead of a letter, syllable is a basic processing unit for the practical implementation of the morphological analyzer.", | |
| "pdf_parse": { | |
| "paper_id": "C94-1035", | |
| "_pdf_hash": "", | |
| "abstract": [ | |
| { | |
| "text": "This paper describes a syllable-based computational model for the Korean morphology. In this model, morpholovical analysis is considered as a process of candidate Generation and candidate selection. In order to increase tile performance of the system, the number of candidates is highly reduced and tim system require.s small number of dictionary accesses. Idiosynchratic features of a syllable, formalized as a characteristic fnnetion, make it possible to reject implausible candklates before dictionary confirmation, instead of a letter, syllable is a basic processing unit for the practical implementation of the morphological analyzer.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Abstract", | |
| "sec_num": null | |
| } | |
| ], | |
| "body_text": [ | |
| { | |
| "text": "There are two linguistic phenomena that are interested in Ihe processing of computational morphology. They are morphological transformation and morpheme identification. Two-level model and syllable--based formalism focussed on the problem of morl)hological h'ansformntion IBear88, Cahig0, Kosk83] . Morpheme identification is an importmlt issue in some languages where two or more morphemes ave combined to make a word, a compound word, or a sentence without any delimiters between morphemes [Abe86, Chen92, Paeh92] .", | |
| "cite_spans": [ | |
| { | |
| "start": 289, | |
| "end": 296, | |
| "text": "Kosk83]", | |
| "ref_id": "BIBREF5" | |
| }, | |
| { | |
| "start": 500, | |
| "end": 507, | |
| "text": "Chen92,", | |
| "ref_id": "BIBREF1" | |
| }, | |
| { | |
| "start": 508, | |
| "end": 515, | |
| "text": "Paeh92]", | |
| "ref_id": null | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Introduction", | |
| "sec_num": "1." | |
| }, | |
| { | |
| "text": "The goal of morphological analysis is to find the base form of morphemes in a word. It consists of a generation of analysis candidates and the selection of ton'cot candidates. Analysis candidates are generated as a reverse process of word formation rules'. morpheme isolation and morphological transformation. Then, correct candidates are selected by the coherence restrictions among", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Introduction", | |
| "sec_num": "1." | |
| }, | |
| { | |
| "text": "Dept. of Computer Engineerin,q Sc~ul National University Seoul 15l-742, Korea adjacent morphelnes and dictionary confirnmtion. The morphological mmlyzer tries to generate all the possible candidates only to accept the correct candidates.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Yung Taek KiIn", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Two.-level model is widely known to be n eomputationnlly efficient method for the practical system on the condition thai the munber of rules is smnll [Bart86, Kosk88] . Howew.w, when the size of the rulebase is large it causes an exponential probleln. In case of the Korean langttage, it is common that a stenl is succeeded by I,,rammatical n~orphemes. If we use the twe-level model for a practical sys/eln, a small set of phonological rules and a large set of rnorl)helne isolation rules are required because there are several thousand colnbinalion.~ of grammatical morphemes [Zhan90] .", | |
| "cite_spans": [ | |
| { | |
| "start": 150, | |
| "end": 158, | |
| "text": "[Bart86,", | |
| "ref_id": null | |
| }, | |
| { | |
| "start": 159, | |
| "end": 166, | |
| "text": "Kosk88]", | |
| "ref_id": "BIBREF6" | |
| }, | |
| { | |
| "start": 577, | |
| "end": 585, | |
| "text": "[Zhan90]", | |
| "ref_id": "BIBREF8" | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "The l)roblem", | |
| "sec_num": "2." | |
| }, | |
| { | |
| "text": "in order to solve the problem, we can try a 2--pass algorithm. All the l)OS,~ible morl)hemes are isolated, and then do a phonological processing. It is also l~ossil)le to do a phonological processing first and morphemes are isolated at the second Imss.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "The l)roblem", | |
| "sec_num": "2." | |
| }, | |
| { | |
| "text": "[iowever, this Mad of solution causes m~olller Selious problem that o(;eut+s l'totll the conditional resh'ie{ions:", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "The l)roblem", | |
| "sec_num": "2." | |
| }, | |
| { | |
| "text": "(1) ,,:eme morphologieal transformation occurs not only at a stem but also at a functional inorpheme, (2) there are eooccurrenee restrictions between two morl)hemes, (3) morphological tl'ansfovlnat[oll OCCtll'S only for the El)e.cinl word grotlp.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "The l)roblem", | |
| "sec_num": "2." | |
| }, | |
| { | |
| "text": "The writina system for most languaffes i,~;", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Syllable-based writing system", | |
| "sec_num": "3." | |
| }, | |
| { | |
| "text": "based on tile letter set called as alphabet.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Syllable-based writing system", | |
| "sec_num": "3." | |
| }, | |
| { | |
| "text": "Instead of' a letter se, t, Chinese writing system is based on the set of characters that consists of one or more letters. Each character is a meaning unit and words are represented by the combination of characters. In case of Korean, words are represented by one or more characters as in Chinese. The difference is that Korean character is a well-formed written syllable, which is a sound unit rather than a meaning unit as in Chinese. A written syllable is a combination of two or three sound symbols, which corresponds to a spoken syllable in a one-to-one fashion [Chun90] . Korean words are constructed as follows based on the syllable unit.", | |
| "cite_spans": [ | |
| { | |
| "start": 567, | |
| "end": 575, | |
| "text": "[Chun90]", | |
| "ref_id": "BIBREF3" | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Syllable-based writing system", | |
| "sec_num": "3." | |
| }, | |
| { | |
| "text": "word ::= { syllable )\" syllable ::= open_syll I closed syll open_syll ::= initial + medial closed_syll ::= initial + medial + final", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Syllable-based writing system", | |
| "sec_num": "3." | |
| }, | |
| { | |
| "text": "There are 11,172 syllables in the modern Korean language( = 19 initials * 21 medials * 27 finals plus one for null). However, it is i,)teresting to investigate the usage of syllables to make a word. About 2,350 syllables cover more than 99.9% of the modern Korean words.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Idiosynehratic features of syllable", | |
| "sec_num": "4." | |
| }, | |
| { | |
| "text": "Furthermore, 267 syllables(11.36% of 2,350 syllables) are only used for the surface form of verbs, and grammatical morphemes are combinations of 151 syllables(6.43% of 2,350 syllables). In addition, only a very small set of syllables, 1 to 46 syllables for each type of irregular verbs, are tied to the morphological transformation [Kang93] . This ldnct of information is very useful to improve Ihe efficiency of the morphological mmlyzer. For example, if a syllable used only for the surface form of verb is found in a word, we can easily guess that the word is a verb, the string before that syllable is a stem, and the rest is a grammatical morpheme. There is no other chance for the different result except typographic errors.", | |
| "cite_spans": [ | |
| { | |
| "start": 332, | |
| "end": 340, | |
| "text": "[Kang93]", | |
| "ref_id": "BIBREF4" | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Idiosynehratic features of syllable", | |
| "sec_num": "4." | |
| }, | |
| { | |
| "text": "Suppose that X is a set of syllables that are used at the first position of grammatical morphemes. We can easily guess the syllable boundary position of grammatical morpheme in an n-syllable word at syllable .v~, where xj X and i :~ j K n. There is no the possibility at other positions. It is based on the fact that only 48 syllables are used for the first position of postl)ositions and 72 syllables for the first position of final endings in the Korean language. There are two types of candidates for a word. The first type is generated by the morpheme isolation at all the syllable boundary and tile second type is generated for each morpheme candidate by the phonological rules. We can count the number of candidates as follows. Suppose that a be the maximum number of syllables that causes an inflexion, /3 be the candidates for prefinal endings, and ?\" be the maximum number of inflexions for one syllable, in case of Korean, ct is less than n, 13 is 2, and ~' is 3. If a word consists of n syllables, then lhe maximum number of canclidates is 10n+8a+2.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Idiosynehratic features of syllable", | |
| "sec_num": "4." | |
| }, | |
| { | |
| "text": "-candidates for 1-morpheme word and (notm+postposition) It is very inefficient to look up the dictionary for all the implausible stems and grammatical morphemes. Only plausible candidates are generated using the idiosynehratie features of syllable. Now, maximum number of candidates is connted as a constant and tile number of dictionary accesses is highly reduced.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Idiosynehratic features of syllable", | |
| "sec_num": "4." | |
| }, | |
| { | |
| "text": "O @ @ @ @ @ \u00ae The previous algorithm has O(n) complexity because it tries to isolate function word at all the syllable positions. However, if syllable features are used then the worst--time complexity of the Korean morphological analysis beeoines a constant. In this case, we should use lhe fact that there is no stem that includes two successive syllables 'xy' such that 'xy' is a substring of grammaticaI morpheme.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Idiosynehratic features of syllable", | |
| "sec_num": "4." | |
| }, | |
| { | |
| "text": "Syllable-based formalism is proposed to solve the problem of morphological alternation with morpheme isolation where many candidates are generated by tile phonological rules. It improved the worst--time complexity O(n) to a constant, and tim nulnber of dictionary accesses is highly reduced using tile syllable features that are extracted froin words and formalized to be available for a morphological analyzer. They are very useftfl for the isolation of morphemes, which make it possible to guess the boundary position of a stem without accessing the dictionary. They are also useful to reject the implausible base forms from a w~rb. ", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Conclusion", | |
| "sec_num": "8." | |
| } | |
| ], | |
| "back_matter": [], | |
| "bib_entries": { | |
| "BIBREF0": { | |
| "ref_id": "b0", | |
| "title": "Syllable-based Morphology", | |
| "authors": [ | |
| { | |
| "first": "L", | |
| "middle": [ | |
| "J" | |
| ], | |
| "last": "Cahill", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1990, | |
| "venue": "Proceedings of the 13th International Conference on Computational Linguistics", | |
| "volume": "3", | |
| "issue": "", | |
| "pages": "48--53", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "L.J. Cahill, \"Syllable-based Morphology,\" Proceedings of the 13th International Conference on Computational Linguistics, vol.3, pp.48-53, 1990.", | |
| "links": null | |
| }, | |
| "BIBREF1": { | |
| "ref_id": "b1", | |
| "title": "Word Identification for Mandarin Chinese Sentences", | |
| "authors": [ | |
| { | |
| "first": "K", | |
| "middle": [ | |
| "J" | |
| ], | |
| "last": "Chen", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "S", | |
| "middle": [ | |
| "H" | |
| ], | |
| "last": "Liu", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": null, | |
| "venue": "Proceedings of the 14th", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "K.J. Chen and S.H. Liu, \"Word Identification for Mandarin Chinese Sentences,\" Proceedings of the 14th", | |
| "links": null | |
| }, | |
| "BIBREF3": { | |
| "ref_id": "b3", | |
| "title": "A Phonological Knowledge Base System Using Unification-based Formalism A Case Study of Korean Phonology", | |
| "authors": [ | |
| { | |
| "first": "H", | |
| "middle": [ | |
| "S" | |
| ], | |
| "last": "Chung", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1990, | |
| "venue": "Proceedings of the 13th International Conference on Computational Linguistics", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "76--78", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "H.S. Chung, \"A Phonological Knowledge Base System Using Unification-based Formalism A Case Study of Korean Phonology -,\" Proceedings of the 13th International Conference on Computational Linguistics, pp.76-78, 1990.", | |
| "links": null | |
| }, | |
| "BIBREF4": { | |
| "ref_id": "b4", | |
| "title": "Korean Morpholo~?fccll Analysis using Syllable Information and Multi-word unit Information", | |
| "authors": [ | |
| { | |
| "first": "S", | |
| "middle": [ | |
| "S" | |
| ], | |
| "last": "Kang", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1993, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "S.S. Kang, Korean Morpholo~?fccll Analysis using Syllable Information and Multi-word unit Information, PhD dissertation, Seoul National University, 1993.", | |
| "links": null | |
| }, | |
| "BIBREF5": { | |
| "ref_id": "b5", | |
| "title": "Two-level Model for Mo~hological Analysis", | |
| "authors": [ | |
| { | |
| "first": "K", | |
| "middle": [], | |
| "last": "Koskenniemi", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1983, | |
| "venue": "Prec. of the 8th International Joint Conference on Artificial Intelligence", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "683--685", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "K. Koskenniemi, \"Two-level Model for Mo~hological Analysis,\" Prec. of the 8th International Joint Conference on Artificial Intelligence, pp.683-685, 1983.", | |
| "links": null | |
| }, | |
| "BIBREF6": { | |
| "ref_id": "b6", | |
| "title": "Complexity, Two-Level Morphology and Finnish", | |
| "authors": [ | |
| { | |
| "first": "K", | |
| "middle": [], | |
| "last": "Koskenniemi", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1988, | |
| "venue": "Proceedings of the 12th International Conference on Computational Linguistics", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "335--339", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "K. Koskenniemi, \"Complexity, Two-Level Morphology and Finnish,\" Proceedings of the 12th International Conference on Computational Linguistics, pp.335-339, 1988.", | |
| "links": null | |
| }, | |
| "BIBREF7": { | |
| "ref_id": "b7", | |
| "title": "Broad Coverage Automatic Morphological Segmentation of German Words", | |
| "authors": [ | |
| { | |
| "first": "T", | |
| "middle": [], | |
| "last": "Paehnnke", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "O", | |
| "middle": [], | |
| "last": "Mertineit", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "K", | |
| "middle": [], | |
| "last": "Wothke", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "R", | |
| "middle": [], | |
| "last": "Schmidt", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1992, | |
| "venue": "Proceedings of the 14th Conference on Computational Linguistics", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "1219--1222", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "T. Paehnnke, O. Mertineit, K. Wothke and R. Schmidt, \"Broad Coverage Automatic Morphological Segmentation of German Words,\" Proceedings of the 14th Conference on Computational Linguistics, pp.1219-1222, 1992.", | |
| "links": null | |
| }, | |
| "BIBREF8": { | |
| "ref_id": "b8", | |
| "title": "Morphological Analysis and Synthesis by Automated Discovery and Acquisition of Linguistic Rules", | |
| "authors": [ | |
| { | |
| "first": "B", | |
| "middle": [ | |
| "T" | |
| ], | |
| "last": "Zhang", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Y", | |
| "middle": [ | |
| "T" | |
| ], | |
| "last": "Kim", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1990, | |
| "venue": "Proceedings of the 13th International Conference on Computational Linguistics", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "431--436", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "B.T. Zhang and Y.T. Kim, \"Morphological Analysis and Synthesis by Automated Discovery and Acquisition of Linguistic Rules,\" Proceedings of the 13th International Conference on Computational Linguistics, pp.431-436, 1990.", | |
| "links": null | |
| } | |
| }, | |
| "ref_entries": { | |
| "FIGREF0": { | |
| "type_str": "figure", | |
| "num": null, | |
| "text": "5. Characteristic functionIdiosynchratie features of syllables are represented using a characteristic set of syllables. Suppose that a part of speech(i), morpheme length(j), and the position of syllable in a word(k) are discriminating features of a characteristic set. I.et IPi be a set of syllables that are used for a part of speech i, ()j be q sol: of syllables Ihal are used for the morpheme length j, and ~k be a set of syllables that are used for the k-th l)osition of syllable in the word. \"['hen, a characteristic set of syllables A<i,j,k> is an intersection of Pi, {~j, and ~l{.A<i,j,k> = Pi [\"1 ~)j I\"l ~k For the characteristic set of syllables A<i,j,k>, characteristic function CA<ij,k> is defined fi'om A<i,j,k> to {0,1).[Definition] characteristic function Let X be a set of Korean syllables and A<id, k> be a characteristic set of syllables where A<ij,k> ~ X for pm't of sI)eech i, morpheme length j, and the k-th position of morpheme. by the arguments i, j, and k. However, some of them are chosen for the morpheme isolation or morphological transformation, and they are reorganized as syllable infornmtion function(/) in order to find out the characteristics of a specific syllable. The value of f(x) on a syllable, x is defined by the characteristic functionCA<i,i,k>(X). Suppose that a be the nuinber of parts of speech, /3 be the maximum number of syllables in a word, then a lriple A<i,i.l,> can be transformed into At by the following expression.t : (k--1)*a*/~ + (j--1)*ct-,-i (1 ~ i g a, t ~j~ /3, 1 ~ k .< B)Let g be a flmction from a set of syllables to a Cartesian product of characteristic functions and h be a function from a Cartesian product of characteristic flmctions to an integer. Then, function K and h are defined as follows.CA~ x CA2 x ... x (;A,~ ~(X) = (CAI(X), CA2(X) ..... CAn(X)) h:CA1 X GAg X ... X CAn----~> h(CM(x),Cm(x) ..... CA.(x)) : ~(CAi(X)*W(i)), where W(i)=2 il N Now, syllable information flmction f is defined as a combination of h and g. Domain of the flmction f is a set of syllable and the range is a bit string of integer where bit position t Ls used for the specific feature and tile wfiue of the t-th bit means whelher tile syllaNe has the corresponding feature or not. f: X ----.2> N fix) = 27 (CAi(X)*W(i)), where W(i)::function F. Tile domain of function F is a set of words and the range of F is a Cartesian l~roduct of a set of morl~hemes E(.'I Of lnOrl)hellles I,': a set of mOrl~ho--'.~y n t,qc.tic featurc, s SUI)l)OSe Ihat mi be. a root form of loxic.al inorl)hemo, fa be a con~.bination of l'eat:ures and rk be a two--level rule. Then, function F is defined as follows, FuncLion p is to check tile condition of two--level rulos, l:unction (1 go.neral(.'s a combhmtion of morl)ho-synta(;[ic feattu'e.~; of a word. I,'(word) : [ a set of (mi, Ji), if H'li ~ p(worcl, vt:) slid Ji -q(worcl) \u00a2, olherwi~e ,C;ome morl)ho-syntactic fe,~lttlI'os aI'e defined for the mori~hological analy.qis, l>arts of Slleech, irre0,ular types and o{her f(.'atttl'(2s arc.' dc'fir..~d as follows. I)O,~ = ( N, V, ADJ, AI.)V, i)1,7i', ... } irtype = ( B, 1), G, lI, l., N, I{, S, U ) prefix :-{In'efix 1, prefix '2 ..... Inefix-n) suffix = {suffix--l, suffi\u00d7-2 ..... .~uffix-n) 1)res, llat~l, ful:, Ill), hen .... :: ( -~, ) A syllable-based rule consists of loft-hand side(IA[S) and right--hand ,~,ide(l{[IS). They are described by Ihe following primitive func/ions. syllable(word, i) subsyl(word, i, j) CA<j,> (X) irreg t:ype(word) initial(x), medial(x), final(x) noun(word), verb(word), adv(word), det(word), impr(word) change(x, y, z, INITIAL/MEDIAL/FINAL) insert(x, word, i): insert syllable x at i-th position delete(word, i): delete i-th syllable 'syllable(word,i)' fetches i-th syllable of word and 'subsyl(word,i,j)' is to get j syllables starting from i-th syllable of word. C^<ia,k> is to check whether a syllable x belongs to a syllable characteristic function or not. For example, b-irregular rule in Korean is described as follows. Set 'AT' is supposed to be a characteristic set of the last syllables of b-irregul~ verbs. CAr(sill) = 1, head <--subsyl(word, 1, i-i), change(head[i-i], null, 'p(tl )', FINAL), verb(head) <--IRREG_B tail <--subsyl(word, i, n-i-l), change(tail[I], 'we(M)', 'e( q)', M~maOThe b-irregular rule is described as a syllable-based formalism and it is applied after the isolation of stem parts. So, stem and ending candidates should be identified first. analysis Overall view of the morphological analyzer is shown in the figure. The first step is to find the morpheme boundaries using characteristic function for syllables. Stem candidates are generated at the second step by the phonological rules. Phonological rules are only applied at a syllable w[i] if and only if w[i-1] is an element of a required characteristic set, and w[i+l] is the beginning syllable of other morpheme.Following algorithm is to guess the beginning position of gralnmatical morpheme. In the algorithm, GM_SET1 and GM_SET2 are characteristic sets for the fi,'st and the rest syllables of grammatical morphemes, respectively.algorithm boundary_syllable(word) syllable word[]; /* input word */ begin n : nsyl(word); for (i : 1; i < n; i = i+D ( if (word[i] E GM_SET1) ( if (word[i+1] ~ GM_SF.", | |
| "uris": null | |
| }, | |
| "FIGREF1": { | |
| "type_str": "figure", | |
| "num": null, | |
| "text": "morpheme word: 1 @ noun + postposition: n-1 @ noun + suffix + poslposition: n-2 -candidates for irregular verbs and ( verb + ending) @ verb + ending: n-l+a (D verb + prefinal_ending + ending: /3 (6) verb infiexion: ?'(n-l+a+~) Q verb + suffix + ending: (n-2+a+B) + ?'(n-2+a+/~) n-l+a+fl) + (n--2+a+/D + ?'(n-2-,a+~) = (4+D')n + (2ct+gar+2f~+217~'-37-5) = i0n + 8a + 2 <---17=2, ~'=3", | |
| "uris": null | |
| }, | |
| "FIGREF2": { | |
| "type_str": "figure", | |
| "num": null, | |
| "text": "prefinal_ending + ending: 2/~ inflexion: ?,(2+2/~) '\" suffix ~ ending: (2~28),2\"(2~2/3) C(n) -O ~ @ + @ + (,1) + (9 + (6) , (7; = 2fl + 42\" + 4/D' t-9", | |
| "uris": null | |
| }, | |
| "TABREF0": { | |
| "num": null, | |
| "text": "Three Idnds of syllable features are defined from where the features are extracted. 'Unit feature' is a syllable featm'e defined on the syllable itself. If a syllable xi itself has an idiosynchratic feature J], then xi has a unit feature g. 'Partial feature' is defined by the component of a syllable. A syllable xi is called to have a pm'tial feature 1)~, if xi includes a component 1)~, as an initial, a medial, or a final letter. 'Successive featlwe' is a mete-level feature defined for the adjacent two syllable features. For example, if there is a set of two successive syllables xixi,l that construct grammatical morphemes and that cannot construct any noun/verb, then the boundary position of a grammatk.'al morpheme is possible only at syllable xi or", | |
| "content": "<table><tr><td>Xi~ 1.</td></tr></table>", | |
| "type_str": "table", | |
| "html": null | |
| } | |
| } | |
| } | |
| } |