Paper: Morphological Analysis (A Formal Approach)

ACL ID C73-1002
Title Morphological Analysis (A Formal Approach)
Venue International Conference on Computational Linguistics
Session Main Conference
Year 1973
Authors

form: w description of w (w,B) OT 6. TI--m MORPHOLOGICAL ANALYSING STEP Let x E segm(CHAR*) Case I. x = ep. There is nothing to analyse. Case 2. a. ~ ~N such that x = {Ul} {.~} ... {..}^ ui e WORD2 O PS (i= 1, 2, ... , n). Let {q, t~ ....., t,}c_ {1, 2, ... , n}; p ~> 1 Let k be a map k: {tl, t, ..... tp}---+ {tl, t,, ... , tp} such that k is ONE-TO-ONE and ONTO. Then (k(q), k(&), ... , k(tp)) is a permutation of (tx, t, ..... tp). We call {u~(tl)}, {uk(t,)} ..... {u,(tp)} a " subsequence" of {u~} ... {u,} Examfle. Let x = {u.} {u.} {,.} Then a) {,.}; (p= 1) b) (u,} (,.}; (p = 2) MORPHOLOGICAL ANALYSIS c) {u3} {us} {u~}; (p = 3) d) {ux} {us} {us}; (p = 3) are subsequences of {u~} {us} {us} 17 Definition. Let T be the set of all subsequences (derived in the above shown manner) of a given x ...