TW291550B - Software technology for English spell checking - Google Patents

Abstract

A software technology for English spell checking, which could judge if the English word spell is wrong by checking English word which is 00put into computer by binary way, and based on spell method of input English word with wrong spell finding all possible spell with similar pronunciation, comprises of the following steps: (1) performing filtering procedure including the following steps: (i) if all are consonant, then it could not perform correction; (ii) deleting non-English and character except symbol "-"; (iii) filtering same repeated consonant to single consonant; (2) performing replacement and transform procedure including the following steps: (i) to string processed after step (1), according to English alphabet A, B, ..., Z dividing into 26 groups, each group supplies specific replacement method separately according to phonetic method, and performing group replacement into the following structure: A (B, C, D) E (F, G) in which A, B, C, D, E, F, G is substring respectively, and the substring in () means it is replaceable; (ii) re-transforming the above A(B, C, D) E (F, G) to full string array ABEF ABEG ACEF ACEG ADEF ADEG 0xfe (3) performing filtering procedure including the following steps: (i) filtering same and repeated vowel to leave one; (ii) if previous phonet of k or g phonet is n, then replacing n with ; (iii) if previous phonet of special t is s, then s + special t = t, if previous phonet of special t is k, then k + special t = tt , otherwise restoring special to normal ; (4) deciding -ed pronunciation including the following steps: (i) if string "ed" is on the last, and if pervious phonet is p, k, s, t, tt, (theta), f, then ed corresponding phonet is corrected to t; (ii) if step (4-i) case does not exist, and previous phonet is not d or t, then changing phonet corresponding to ed into d; (iii) if step (4-i) and (4-ii) do not exist, then changing phonet corresponding to ed into Id; (5) performing the following steps: (i) deleting null character in string array; (ii) with every phonetic string as basis searching matched word; (iii) deriving similarly phonetic string from every phonetic string in string array to search matched word, in which the derivation rule is as following; from the second phonet, when meeting contiguous consonant, one time deleting one consonant, forming one new phonetic string; (6) displaying all matched word on computer screen for being browsed by user.