Research Article
Morphology-Based Spell Checker for Dawurootsuwa Language
| | BEGIN | | (1) | Take erroneous tokens from an error corrector | | (2) | Read the input tokens from left to right and right to left | | (3) | if tokens contain a valid root and a valid suffix then | | (4) | strip them and replay the root and suffix to the error detector | | (5) | else if tokens contain an invalid root and a valid suffix then | | (6) | strip the suffix and replay unknown morphemes to the error detector | | (7) | else if tokens contain a valid root and an invalid suffix then | | (8) | strip the root and replay a list of root and unknown morphemes to the error detector | | (9) | else | | (10) | return tokens | | (11) | end if | | | END |
|
