WikiPatents - Community Patent Review
Create Free Account  |  License or Sell Your Patent  |  WikiPatents Marketplace  |  WikiPatents Blog
Username:  Password:  
    
Advanced Search
Graphic word spelling correction using automated dictionary comparisons with phonetic skeletons    
United States Patent4580241   
Link to this pagehttp://www.wikipatents.com/4580241.html
Inventor(s)Kucera; Henry (Providence, RI)
AbstractAutomated spelling correction converts, by prescribed linguistic procedures, each word to be corrected to a skeleton, and compares that skeleton with a data base of skeletons derived by identical linguistic procedures from a dictionary of correctly spelled words. In the event of a match between the two skeletal terms, the correctly spelled word (or words) associated with the matched skeleton is presented for replacement of the misspelled word. In the event the comparison does not yield a correct match, the skeletal form of the misspelled word is repeatedly modified and each modified form is compared with the data base of skeletons.
   














 Title Information Submit all comments and votes
 
Patent Text Patent PDF Print Page Summary File History
Plain text PDF images Print Summary File History
Inventor     Kucera; Henry (Providence, RI)
Owner/Assignee     Houghton Mifflin Company (Boston, MA)
Patent assignment
All assignments
Publication Date     April 1, 1986
Application Number     06/467,834
PAIR File History     Application Data   Transaction History
Image File Wrapper   Patent Term   Fees
Litigation
Filing Date     February 18, 1983
US Classification     715/533 400/63 400/83 400/98 434/167
Int'l Classification     G06F 005/00 G06F 011/00 G06F 015/20
Examiner     Thomas; James D.
Assistant Examiner     Williams; A.
Attorney/Law Firm     Lahive & Cockfield
Address
Parent Case    
Priority Data    
USPTO Field of Search     364/200 MS File 364/900 MS File 364/300 364/418 381/41 381/42 381/43 381/44 434/176 434/178 434/157 434/167 400/63 400/83 400/98 400/100 400/102 400/109 400/110
Patent Tags     graphic word spelling correction automated dictionary comparisons phonetic skeletons
   
Enter a comma (,) or semicolon (;) between multiple tag words/phrases.
Describe this patent:
 Amusing   
 Clever   
 Complex   
 Efficient   
 Historic   
 Important   
 Innovative   
 Interesting   
 Practical   
 Simple   
[no votes]
Patent WIKI

Share information and news about this patent, including information and news about the technology, inventors, company, ligation and licensing.

 References Submit all comments and votes
 
*references marked with an asterisk below are user-added references
 U.S. References
 
Add a new US reference:  
ReferenceRelevancyCommentsReferenceRelevancyComments
4498143
Strzelecki
715/535
Feb,1985

[0 after 0 votes]
4498148
Glickman
715/533
Feb,1985

[0 after 0 votes]
4484305
Ho
715/535
Nov,1984

[0 after 0 votes]
4471459
Dickinson
715/533
Sep,1984

[0 after 0 votes]
4400828
Pirz
704/238
Aug,1983

[0 after 0 votes]
4383307
Gibson, III
715/533
May,1983

[0 after 0 votes]
4355371
Convis
715/533
Oct,1982

[0 after 0 votes]
4355302
Aldefeld
704/243
Oct,1982

[0 after 0 votes]
4342085
Glickman
715/532
Jul,1982

[0 after 0 votes]
4270182
Asija
704/8
May,1981

[0 after 0 votes]
4181813
Marley
704/251
Jan,1980

[0 after 0 votes]
4145739
Dunning
709/211
Mar,1979

[0 after 0 votes]
4136395
Kolpek
715/533
Jan,1979

[0 after 0 votes]
4096934
Kirmser
400/110
Jun,1978

[0 after 0 votes]
4068301
Ishino
711/117
Jan,1978

[0 after 0 votes]
4041467
Cota
715/534
Aug,1977

[0 after 0 votes]
4010445
Hoshino
382/231
Mar,1977

[0 after 0 votes]
3995254
Rosenbaum
382/231
Nov,1976

[0 after 0 votes]
3969698
Bollinger
382/225
Jul,1976

[0 after 0 votes]
3760355
Bruckert
708/212
Sep,1973

[0 after 0 votes]
3704345
Coker
704/266
Nov,1972

[0 after 0 votes]
3568156
Thompson
219/613
Mar,1971

[0 after 0 votes]
4284846
Marley
704/253
Dec,1969

[0 after 0 votes]
 Foreign References
 Other References
 Market Review Submit all comments and votes
   
Market Size
Estimate the gross annual revenues of the relevant market sector:
> $10B
$5B - $10B
$2B - $5B
$500M - $2B
$100M - $500M
$10M - $100M
$1M - $10M
$500K - $1M
$100K - $500K
< $100K
[No votes]
$0
 
$0   $2.5B   $5B   $7.5B   $10B
Market Share
Estimate the percentage of the relevant market sector this invention will capture:
75% - 100%
50% - 74.99%
25% - 49.99%
10 - 24.99%
5 - 9.99%
2 - 4.99%
1 - 1.99%
< 1%
[No votes]
0.0%
 
0%   25%   50%   75%   100%
Reasonable Royalty
What percentage of gross sales should the inventor or assignee be paid?
75% - 100%
50% - 74.99%
25% - 49.99%
10 - 24.99%
5 - 9.99%
2 - 4.99%
1 - 1.99%
< 1%
[No votes]
0.0%
 
0%   25%   50%   75%   100%
Public's "Guesstimation" of Royalty Value
Market SizeN/A[No votes]
xMarket ShareN/A[No votes]
xReasonable RoyaltyN/A[No votes]

N/A

License Availablity
If you are NOT the owner or assignee, answer here:
Yes, license is available for purchase

No, license is not currently available



[No votes]
License Availablity
If you ARE the owner or assignee, answer here:
Yes, license is available for purchase

No, license is not currently available



[No votes]
Competitive Advantage
Does this invention have a significant competitive advantage over similar technologies?
Yes

No



[No votes]
Most helpful competitive advantage comment
[No comments]

Commercial Alternatives
Are there viable commercial alternatives for this invention?
Yes

No



[No votes]
Most helpful commercial alternative comment
[No comments]

 Technical Review Submit all comments and votes
 Claims Submit all comments and votes
 


Having described the invention, what is claimed as new and secured by Letters Patent is:

1. A process for the automated spelling correction of a graphic word, said process comprising the steps of

A. converting each graphic word of a machine-stored and machine-readable dictionary set of correctly spelled words to a specified linguistically salient word skeleton and storing also the resultant set of word skeletons,

B. converting a designated word from a conventional graphic representation to said specified linguistically salient word skeleton and storing the resultant word skeleton,

each said converting step comprising the steps of

(i) omitting from the word skeleton produced thereby a selected alpha set, if any, of the word being converted which lacks isomorphy with a phonetic representation of that selected set, and

(ii) replacing with a different linguistic symbol another selected alpha set, if any, of the word being converted which lacks isomorphy with a phonetic representation of that other selected set,

C. comparing said skeleton of said designated word with said dictionary set of word skeletons,

D. responding to a match from said comparison of word skeletons and producing from the matching skeleton of said dictionary set a corrective set of one or more corresponding grapic words of said dictionary set, and

E. producing a visual display of said corrective word set.

2. A process according to claim 1 in which each said converting step produces a word skeleton having lesser linguistic discrepancy from a phonetic representation of the word being converted than the graphic form of that word has.

3. A process according to claim 1 comprising the further steps of

A. responding to the absence of a selected match from said comparison of word skeletons and modifying said skeleton of said designated word,

B. comparing said modified skeleton with said dictionary set of word skeletons, and

C. repeating said modifying step and said modified-skeleton comparing step selectively in response to the continued absence of said selected match.

4. A process according to claim 1 in which said converting steps include the steps of selectively providing a four-way vocalic distinction in the skeleton of a short word and selectively providing only a two-way vocalic distinction in the skeleton of a long word.

5. A process according to claim 4 in which said converting steps include the further step of classifying a word having only a single set of one or more contiguous vowels, other than a silent final vowel, as a short word.

6. In a process for automated spelling correction by the comparison of a graphic word to be corrected with a dictionary set of correctly spelled words to produce a corrective set of one or more dictionary words selectively matching the designated word, the improvement comprising the steps of

A. producing from the designated word in conventional graphic representation, by a first transformation, a designated-word skeleton representing linguistically-salient phonetic features of that word, said transformation comprising the steps of

(i) omitting from the skeleton produced thereby a selected alpha set, if any, of the word being converted which lacks isomorphy with a phonetic representation of that selected set, and p2 (ii) replacing with a different linguistic symbol another seleted alpha set, if any, of the word being converted which lacks isomorphy with a phonetic representation of that other selected set,

B. effecting said comparison by comparing said designated-word skeleton with a set of dictionary-word skeletons, each skeleton of which corresponds to one said correctly-spelled word and which represents linguistically-salient features of that word according to said same first transformation, and

C. selecting from said dictionary set of words the one or more words which correspond to the dictionary-word skeleton which exactly matches the designated-word skeleton, thereby to produce said corrective set of words.

7. In automated spelling according to claim 6, the further improvement comprising the steps of

A. selectively modifying, in response to the absence of an acceptable match of skeletons, said designated-word skeleton by replacing one set of one or more skeleton symbols with a different set of such symbols,

B. repeating said comparing step with the midified skeleton, and

C. selectively repeating said modifying step and said compare-repeating step in response to the continued absence of an acceptable match of skeletons.

8. In apparatus for automated spelling correction by the comparison of a graphic word to be corrected with a dictionary set of correctly spelled words to produce a corrective set of one or more dictionary words selectively matching the designated word, the improvement comprising,

A. means for producing from the designated word in conventional graphic representation, by a first transformation, a designated-word skeleton representing linguistically-salient phonetic features of that word, said transformation means comprising means for

(i) omitting from the skeleton produced thereby a selected alpha set, if any, of the word being converted which lacks isomorphy with a phonetic representation of that selected set, and

(ii) replacing with a different linguistic symbol another seleted alpha set, if any, of the word being converted which lacks isomorphy with a phonetic representation of that other selected set,

B. means for effecting said comparison by comparing said designated-word skeleton with a set of dictionary-word skeletons, each skeleton of which corresponds to one said correctly-spelled word and which represents linguistically-salient features of that word according to said same first transformation, and

C. means for selecting from said dictionary set of words the one or more words which correspond to the dictionary-word skeleton which exactly matches the designated-word skeleton, thereby to produce said corrective set of words.

9. In apparatus for automated spelling according to claim 8, the further improvement comprising

A. means for selectively modifying, in response to the absence of an exact match of skeletons, said designated-word skeleton by replacing one set of one or more skeleton symbols with a different set of such symbols,

B. means for repeating said comparing step with the modified skeleton, and

C. means for selectively repeating said modifying step and said compare-repeating step in response to the continued absence of an exact match of skeletons.

10. Apparatus for the automated spelling correction of a graphic word, said apparatus comprising

A. means for converting each graphic word of a machine-stored and machine-readable dictionary set of correctly spelled words to a specified linguistically salient word skeleton and for storing also the resultant set of word skeletons, and for convertins a designated word from conventional graphic representation to said specified linguistically salient word skeleton and for storing the resultant word skeleton, said converting means comprising

(i) means for elimating from the word skeleton produced thereby a selected alpha set, if any, of the word being converted which lack isomorphy with a phonetic representation of that selected set, and

(ii) means for replacing with a different linguistic symbol another selected alpha set, if any, of the word being converted which lacks isomorphy with a phonetic representation of that other selected set,

B. means for comparing said skeleton of said designated word with said dictionary set of word skeletons,

C. means for responding to a match from said comparison of word skeletons and for producing from the matching skeleton of said dictionary set a corrective set of one or more corresponding graphic words of said dictionary set, and

D. means for producing a visual display of said corrective word set.

11. Apparatus according to claim 10 in which said converting means includes means for producing a word skeleton having lesser linguistic discrepancy from the phonetic representation of a word being converted than the graphic form of that word has.

12. Apparatus according to claim 10 further comprising

A. means for responding to the absence of a match from said comparison of word skeletons and for modifying said skeleton of said designated word,

B. means for comparing said modified skeleton with said dictionary set of word skeletons, and

C. means for repeating said modifying operation and said modified-skeleton comparing operation selectively in response to the continued absence of said selected match.

13. Apparatus according to claim 10 in which said converting means includes means for selectively providing a four-way vocalic distinction in the skeleton of a short word and selectively providing only a two-way vocalic distinction in the skeleton of a long word.

14. Apparatus according to claim 13 in which said converting means includes means for classifying a word having only a single set of one or more contiguous vowels, other than a silent final vowel, as a short word.

15. A process according to claim 1 in which each said converting step further comprises the steps of

(i) converting to an alpha set "s", an alpha set consisting of a character "c" followed immediately by any one of the characters "e", "i", and "y",

(ii) converting to an alpha set "s", a non-word-initial alpha set "z",

(iii) converting to an alpha set "kw", an alpha set "qu", and

(vi) converting to an alpha set "r", a word-initial alpha set "wr".

16. A process according to claim 15 in which each said converting step further comprises sequential steps selected from the sequential steps of

(i) converting to an alpha set "w", an alpha set "wh" which is followed immediately by any one of the characters "e", "i", "a", and "y",

(ii) converting to an alpha set "kh", an alpha set "tch",

(iii) converting to an alpha set "kh", an alpha set "tu" which

(a) is followed by a single occurrence of any one of the characters "r", "n", "m", and "l" which, in turn, is followed by any one of the characters "e", "a", "i", "o", and "y", and

(b) does not begin in character position one or in character position two of the word,

(iv) converting to an alpha set "kho", an alpha set which

(a) consists of a character sequence "tu" followed by any one of the characters "o", "a", and "e", and

(b) which does not begin in character position one or character position two of the word being converted,

(v) converting to a first non-alpha symbol, a word-final alpha set "y" which does not form a portion of a word having a character length less than three,

(vi) converting to said first symbol, a word-final alpha set "ie" which does not form a portion of a word having a character length less than four,

(vii) converting to said first symbol, a word-final alpha set "i" which does not form a portion of a word having a character length less than three,

(viii) converting to said first symbol, an alpha set which

(a) consists of either of the characters "i" or "y", and

(b) is both preceded and followed by any one of the characters "e", "i", "o", "a", and "u",

(ix) converting to an alpha set "i", an alpha set "y" which is immediately preceded by a consonant,

(x) converting to an alpha set "sh", an alpha set which

(a) consists of either of the character sequences "si" or "ti",

(b) is followed immediately by any one of the characters "a", "o", and "u", and

(c) does not begin in character position one or character position two of the word,

(xi) converting to an alpha set "ge", a word-final alpha set "gue" which does not begin in character position one or character position two of the word,

(xii) converting to an alpha set "oo", an alpha set "ue",

(xiii) converting to an alpha set "oo", an alpha set which consists of any one of the characters "e", "a", and "o" followed by either of the characters "u" or "w", and which

(a) is followed by a consonant, or

(b) is word-final,

(xiv) converting to a trace symbol, a word-final alpha set which

(a) consists of either of the character sequences "ea" or "ia", and

(b) does not form a portion of a word having a character length less than four,

(xv) converting to a trace symbol, a word-initial alpha set consisting of one or more occurrences any of the characters "a", "e", "i", "o", and "u",

(xvi) converting to an alpha set "g", an alpha set "dg",

(xvii) converting to an alpha set "k", an alpha set "c",

(xviii) converting an alpha set consisting of either of a doubly-adjacent or triply-adjacent occurrence of a single consonant to an alpha set being said single consonant,

(xix) converting to an alpha set "x", an alpha set "ks",

(xx) converting to an alpha set "xhon", a non-word-initial alpha set "xion",

(xxi) converting to an alpha set "s", a word-initial alpha set "ps",

(xxii) converting to an alpha set "r", an alpha set "rh",

(xxiii) converting to an alpha set "te", a non-word-initial alpha set "ght",

(xxiv) converting to an alpha set "f", an alpha set "ph",

(xxv) converting to an alpha set "n", an alpha set "gn",

(xxvi) converting to an alpha set "n", a word-initial alpha set which consists of either of the character sequences "kn" or "pn", and

(xxvii) converting to an alpha set "x", an alpha set "xs".

17. A process according to claim 16 in which each said converting step further comprises sequential steps selected from the sequential steps of

(i) converting to a second non-alpha symbol, an alpha set which consists of any one of the characters "e", "i", and "a" and which is preceded by

(a) exclusively consonants, or

(b) a trace symbol, resulting from a prior-executed conversion step, which is followed exclusively by consonants,

(ii) converting to a third non-alpha symbol, an alpha set which consists of either of the characters "o" or "u" and which is preceded by

(a) exclusively consonants, or

(b) a trace symbol, resulting from a prior-executed conversion step, which is followed exclusively by consonants,

(iii) converting to said third symbol, a non-word-initial second symbol which results from a prior conversion step, and which is followed by a singly-occurring character "r" which

(1) is followed by a consonant not a character "r", or

(2) is word-final,

(iv) converting to said third symbol, a word-final alpha set "o" which forms a portion of a word having a character length of two or more,

(v) converting to said third symbol, a word-final alpha set "oe" which forms a portion of a word having a character length of two or more,

(vi) converting to a fourth non-alpha symbol, a second symbol which results from a prior conversion step, and which is followed exclusively by consonants, and

(vii) converting to a fifth non-alpha symbol, a third symbol which results from a prior conversion step, which is followed exclusively by consonants,

(viii) deleting a non-word-initial alpha set consisting of one or more occurrences of any of the characters "a", "e", "i", "o", "u", and "y".

18. In apparatus according to claim 8, the further improvement in which said transformation means further comprises means for

(i) converting to an alpha set "s", an alpha set consisting of a character "c" followed immediately by any one of the characters "e", "i", and "y",

(ii) converting to an alpha set "s", a non-word-initial alpha set "z",

(iii) converting to an alpha set "kw", an alpha set "qu", and

(iv) converting to an alpha set "r", a word-initial alpha set "wr".

19. In apparatus according to claim 18, the further improvement in which said transformation means further comprises means for executing sequential operations selected from the sequential operations of

(i) converting to an alpha set "w", an alpha set "wh" which is followed immediately by any one of the characters "e", "i", "a", and "y",

(ii) converting to an alpha set "kh", an alpha set "tch",

(iii) converting to an alpha set "kh", an alpha set "tu" which

(a) is followed by a single occurrence of any one of the characters "r", "n", "m", and "l" which, in turn, is followed by any one of the characters "e", "a", "i", "o", and "y", and

(b) does not begin in character position one or in character position two of the word,

(iv) converting to an alpha set "kho", an alpha set which

(a) consists of a character sequence "tu" followed by any one of the characters "o", "a", and "e", and

(b) which does not begin in character position one or character position two of the word being converted,

(v) converting to a first non-alpha symbol, a word-final alpha set "y" which does not form a portion of a word having a character length less than three,

(vi) converting to said first symbol, a word-final alpha set "ie" which does not form a portion of a word having a character length less than four,

(vii) converting to said first symbol, a word-final alpha set "i" which does not form a portion of a word having a character length less than three,

(viii) converting to said first symbol, an alpha set which

(a) consists of either of the characters "i" or "y", and

(b) is both preceded and followed by any one of the characters "e", "i", "o", "a", and "u",

(ix) converting to an alpha set "i", an alpha set "y" which is immediately preceded by a consonant,

(x) converting to an alpha set "sh", an alpha set which

(a) consists of either of the character sequences "si" or "ti",

(b) is followed immediately by any one of the characters "a", "o", and "u", and

(c) does not begin in character position one or character position two of the word,

(xi) converting to an alpha set "ge", a word-final alpha set "gue" which does not begin in character position one or character position two of the word,

(xii) converting to an alpha set "oo", an alpha set "ue",

(xiii) converting to an alpha set "oo", an alpha set which consists of any one of the characters "e", "a", and "o" followed by either of the characters "u" or "w", and which

(a) is followed by a consonant, or

(b) is word-final,

(xiv) converting to a trace symbol, a word-final alpha set which

(a) consists of either of the character sequences "ea" or "ia ", and

(b) does not form a portion of a word having a character length less than four,

(xv) converting to a trace symbol, a word-initial alpha set consisting of one or more occurrences any of the characters "a", "e", "i", "o", and "u",

(xvi) converting to an alpha set "g", an alpha set "dg",

(xvii) converting to an alpha set "k", an alpha set "c",

(xviii) converting an alpha set consisting of either of a doubly-adjacent or triply-adjacent occurrence of a single consonant to an alpha set being said single consonant,

(xix) converting to an alpha set "x", an alpha set "ks",

(xx) converting to an alpha set "xhon", a non-word-initial alpha set "xion",

(xxi) converting to an alpha set "s", a word-initial alpha set "ps",

(xxii) converting to an alpha set "r", an alpha set "rh",

(xxiii) converting to an alpha set "te", a non-word-initial alpha set "ght",

(xxiv) converting to an alpha set "f", an alpha set "ph",

(xxv) converting to an alpha set "n", an alpha set "gn",

(xxvi) converting to an alpha set "n", a word-initial alpha set which consists of either of the character sequences "kn" or "pn", and

(xxvii) converting to an alpha set "x", an alpha set "xs".

20. In apparatus according to claim 19, the further improvement in which said transformation means further comprises means for executing sequential operations selected from the sequential operations of

(i) converting to a second non-alpha symbol, an alpha set which consists of any one of the characters "e", "i", and "a" and which is preceded by

(a) exclusively consonants, or

(b) a trace symbol, resulting from a prior-executed conversion step, which is followed exclusively by consonants,

(ii) converting to a third non-alpha symbol, an alpha set which consists of either of the characters "o" or "u" and which is preceded by

(a) exclusively consonants, or

(b) a trace symbol, resulting from a prior-executed conversion step, which is followed exclusively by consonants,

(iii) converting to said third symbol, a non-word-initial second symbol which results from a prior conversion step, and which is followed by a singly-occurring character "r" which

(1) is followed by a consonant not a character "r", or

(2) is word-final,

(iv) converting to said third symbol, a word-final alpha set "o" which forms a portion of a word having a character length of two or more,

(v) converting to said third symbol, a word-final alpha set "oe" which forms a portion of a word having a character length of two or more,

(vi) converting to a fourth non-alpha symbol, a second symbol which results from a prior conversion step, and which is followed exclusively by consonants, and

(vii) converting to a fifth non-alpha symbol, a third symbol which results from a prior conversion step, which is followed exclusively by consonants,

(viii) deleting a non-word-initial alpha set consisting of one or more occurrences of any of the characters "a", "e", "i", "o", "u", and "y".
 Description Submit all comments and votes
 


BACKGROUND

This invention relates to an automated spelling correction method and apparatus which operates with a selected skeleton form of words, in lieu of processing words in the conventional graphic form of every-day printed matter. More particularly, the invention provides automated spelling correction which converts each misspelled word to a selected skeleton form, and processes the skeleton to find the correct spelling.

Spelling correction with word skeletons according to the invention has many advantages, including the capability for successfully correcting nearly all misspellings, including those with multiple errors, and with high speed operation. The practice of the invention simplifies and further speeds up spelling correction because it produces an unusually small number of correct suggestions from which the user is to select the correct replacement for any given misspelled word. In many instances it produces only a single correct replacement.

Word processors commonly have a spelling verifier, which is a system for identifying misspelled words. However, the automated correction of a misspelled word, once it is identified, is a far more difficult task than simply identifying the misspelling. One leading spelling corrector currently marketed for word processors typically presents a user with five to seven suggestions to replace one faulty word. This relatively large number of suggested correct words delays the user, who must consider each candidate within the context of the text being prepared. Another problem is to correct a high percentage of misspellings, or otherwise the user incurs further delay to perform a manual dictionary look-up in the event the automated correction fails.

The prior art regarding spelling correction includes the disclosures in U.S. Pat. Nos. 3,969,968 and 4,355,371. Also of interest is the disclosure in U.S. Pat. No. 3,995,254 regarding word verification.

Objects of this invention are to provide improved automated spelling correction suitable for use on a word processor, and more particularly to provide a method and apparatus for automated spelling correction which can correct all but few misspellings and which operates with sufficient high speed for convenient on-line use and operator interaction.

Another object is to provide such a spelling correction method and apparatus which produces only a small number of correctly-spelled suggestions to replace a misspelled word, and which hence requires minimal user decisions and correspondingly requires few user operations.

A further object of the invention is to provide spelling correction of the above character which is suitable for use with different languages and, further, which can readily be implemented with programmable digital computers of the types used in present day word processing equipment.

Other objects of the invention will in part be obvious and will in part appear hereinafter.

GENERAL DESCRIPTION

A spelling correction system according to the invention operates on a skeletized form of words. That is, the system has a data base of correctly spelled words both in conventional graphic form and in skeletized form. The system converts a misspelled word to a like skeletized form as the first step in processing that word to find the corresponding correctly spelled word.

The system converts a graphic word to a corresponding word skeleton in a manner that reduces each word to a selected set of linguistically salient features. One property of the conversion of a word to a skeleton which the invention provides is that it anticipates spelling errors. Spelling errors commonly stem from a lack of correspondence, i.e. a lack isomorphy, between the every day or graphic form of a word and the phonetic, spoken form of that word. As one example, the following four words all have the same phonetic long "e" sound in the second syllable, but represent that sound with four different spellings: "proceed", "precede", "