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.
50 lines
2.6 KiB
50 lines
2.6 KiB
Morphological analysis
|
|
|
|
change code to see if it is compatible with the change (or lack of
|
|
change). If the morph requires a spelling change, then it is rejected if
|
|
a change was not made. If the morph forbids a change and a change
|
|
|
|
was made, it is also rejected.
|
|
Changes which have the notation “(+)” suppress the checking of the spelling
|
|
change code. This allows the correct decomposition to be found for morphs which
|
|
normally forbid spelling changes such as free (free+ing — freeing, but free+ed —
|
|
freed). Changes which carry the notation “(*)” are made only for derivational suf-
|
|
fixes.
|
|
|
|
3.5 An example of a decomposition
|
|
|
|
Figure 3-2 details the process by which DECOMP arrives at the decomposition
|
|
scarcity —scarce+ity. Lines with the label “Decomp:” are produced during
|
|
decomposition and document the recursive process. Lines which begin with a
|
|
quoted string show the parameter states when a new level of recursion is entered.
|
|
The quoted string itself is the current remainder to be covered and the information
|
|
in brackets [ ] is the current state of the FSM as described in Section 3.4.3. The
|
|
number in angle brackets < > is the current score. Lines which begin with
|
|
“Matched” indicate that a morph match has been found. The morph spelling and
|
|
type are given followed by the action taken as a result of the match.
|
|
|
|
Lines labelled with “DECOMP:” show the data on the output stream from
|
|
DECOMP to the next module. This information is described in Section 3.3 above
|
|
and the lines are commented in italics.
|
|
|
|
Initially, the remainder is the entire word scarcity and the cost is zero. The
|
|
longest matching morph is city, which is a root and is legal in the rightmost posi-
|
|
tion; hence decomposition proceeds to scar which is also a root. This yields the
|
|
legal double-root covering scar+city with a total cost of 234. Next, decomposition
|
|
backs up to the remainder scar to see if there are other possible coverings. Both
|
|
attempts to cover scar fail, however, since the minimum possible cost for each
|
|
|
|
covering would exceed the cost of the one already found.
|
|
After the possibilities of scar have been exhausted, recursion backs up to
|
|
|
|
scarcity to try the next longest morph after city. This morph is the derivational
|
|
suffix ity and leaves a remainder scarce which is successfully covered by a root.
|
|
This yields a new low cost; hence scarce+ity supersedes scar+city as the preferred
|
|
covering. Spelling changes are attempted on scarce but these fail to yield a cover-
|
|
ing.
|
|
|
|
Finally, the recursion backs up to scarcity to try the shortest match y. With
|
|
the spelling change to scarcite, DECOMP is able to match the root cite but since
|
|
|
|
35
|