Spelling-checkers </term> have become an integral part of most <term> text processing software </term>
different reasons among which the speed of processing prevails they are usually based
lr,15-2-C90-3072,bq are usually based on <term> dictionaries of word forms </term> instead of <term> words </term>
dictionaries of word forms </term> instead of <term> words </term> . This approach is sufficient
describing <term> inflection </term> for the purpose of building <term> spelling-checkers </term> for
spelling-checkers </term> for such languages . The speed of the resulting program lies somewhere in
resulting program lies somewhere in the middle of the scale of existing <term> spelling-checkers
lies somewhere in the middle of the scale of existing <term> spelling-checkers </term> for
<term> 360K floppy </term> , whereas the number of recognized <term> word forms </term> exceeds
hide detail