Research Article

Morphology-Based Spell Checker for Dawurootsuwa Language

Algorithm 2

Morphological generator
BEGIN
(1) Take erroneous morphemes from an error corrector
(2) for each erroneous morpheme
(3) Classify morphemes into different error classes
(4)if the root and suffix are valid then
(5)  Append the suffix to root and generated words
(6)else if the root is valid and the suffix is invalid then
(7)  Generate a list of words for the valid root
(8)else if the root is invalid and the suffix is valid then
(9)  Generate a list of words
(10)else
(11)  Concatenate input morphemes
(12)end if
END