You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
45 lines
1.0 KiB
45 lines
1.0 KiB
Morphological analysis
|
|
|
|
effective-root = ROOT | LF-ROOT DERIV | PREFIX RF-ROOT |
|
|
STRONG
|
|
|
|
suffix = DERIV | INFL
|
|
affixed-word = { PREFIX } effective-root { suffix }
|
|
|
|
absolute-word = ABSOLUTE | ABSOLUTE INFL { suffix } | INITIAL
|
|
affixed-word
|
|
|
|
word = affixed-word | absolute-word
|
|
|
|
compound-absolute = absolute-word | absolute-word HYPHEN com-
|
|
pound | ABSOLUTE INFL { suffix } compound-affixed
|
|
|
|
compound-affixed = affixed-word | affixed-word HYPHEN compound |
|
|
affixed-word compound-affixed
|
|
|
|
compound = compound-affixed | compound-absolute
|
|
|
|
DERIV
|
|
|
|
HYPHEN
|
|
INFL
|
|
|
|
ROOT
|
|
STRONG
|
|
|
|
PREFIX
|
|
|
|
HYPHEN
|
|
INFL
|
|
|
|
PREF DERIV
|
|
Figure 3-1: State transition diagram for the morph sequence FSM
|
|
|
|
Figure 3-1 shows the state transition diagram of the FSM. Each state of the
|
|
FSM represents a summary of the type sequence of the morphs which have been
|
|
stripped from the word being decomposed. It is this state which is passed as a
|
|
parameter to the recursive decomposition procedure. The “right context”
|
|
represented by each state is easily expressed and is summarized below. For each
|
|
|
|
31
|