Copying or distributing in print or electronic forms without written permission
of Idea Group Inc. is prohibited.
??? transposition of any two adjacent characters is common;
??? missing or adding a character is common; and
??? certain consonants are more frequently interchanged than others.
Based on Damerau??™s (1964) simple method, a SPELL check program can be written
as in Figure 1.
Spelling.Correctors
There are two types of spelling programs: spell checkers and spell correctors. Spell
checkers simply look at the entered words and check whether they are correctly
spelled. Spell correctors detect misspelled words and try to correct them. A spell
corrector uses elements of pattern matching, appropriate algorithms, and coding
theory.
Much work has been done on spelling correction algorithms, some based on phonetics,
others are algorithms, clustering, and measuring distances which will be
described in the following paragraphs.
Error Detection
The two most widely used error detection methods are n-gram analysis (Morris
& Cherry, 1975; Zamora, Pollock, & Zamora, 1981) and dictionary look up (Aho
and Corasick, 1975; Knuth, 1973; Peterson, 1980).
Pages:
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786