8. A dictionary storage apparatus for use with a source of characters, the apparatus containing a list of correctly-spelled words for verifying the spelling order of character inputs, comprising: (a) input means for receiving character inputs, (b) an end-of-word input among said characer inputs, (c) a starting address for said word list, (d) a first storage means for storing character information structured to sequentially check the spelling order of a first predetermined series of received character inputs, said character information in said first storage means being held in groups by alphabetic order of association in particular sets of character combinations having a predetermined number of characters, (e) a second storage means xtending from said first storage means and containing further character information structured to check the spelling order of a variable string of character inputs strung from said predetermined series to validate spelling of words, said further character information in said second storage means comprising a tree structure with a plurality of branches, each of said branches stemming from a discrete one of said sets and holding a plurality of character-containing word remnants associated with said discrete one set; (f) means for sequentially scanning said character information, beginning with said starting address; (g) signal output means connected to said first and second storage means for generating a signal immediately in response to received character input being out of spelling order as structured in said first and second storage means and determined by said comparison means, (h) a word terminator code marking the end of each word in said character information stored in said first storage means and in said second storage means, and (i) further means operable to return said scanning means to said starting address in response to receipt of said end-of-word input while scanning said word terminator code marking the end of a word in said list.
8. A dictionary storage apparatus for use with a source of characters, the apparatus containing a list of correctly-spelled words for verifying the spelling order of character inputs, comprising: (a) input means for receiving character inputs, (b) an end-of-word input among said characer inputs, (c) a starting address for said word list, (d) a first storage means for storing character information structured to sequentially check the spelling order of a first predetermined series of received character inputs, said character information in said first storage means being held in groups by alphabetic order of association in particular sets of character combinations having a predetermined number of characters, (e) a second storage means xtending from said first storage means and containing further character information structured to check the spelling order of a variable string of character inputs strung from said predetermined series to validate spelling of words, said further character information in said second storage means comprising a tree structure with a plurality of branches, each of said branches stemming from a discrete one of said sets and holding a plurality of character-containing word remnants associated with said discrete one set; (f) means for sequentially scanning said character information, beginning with said starting address; (g) signal output means connected to said first and second storage means for generating a signal immediately in response to received character input being out of spelling order as structured in said first and second storage means and determined by said comparison means, (h) a word terminator code marking the end of each word in said character information stored in said first storage means and in said second storage means, and (i) further means operable to return said scanning means to said starting address in response to receipt of said end-of-word input while scanning said word terminator code marking the end of a word in said list. 9. The dictionary storage apparatus of claim 8, further including an end-of-table character, and wherein said first and second storage means include blocks of a register, each branch having said character information therein stored in a respective block, at least some characters of said word remnants being found in separate, random-length word portions hierarchically interspersed in said block in accordance with the order of the alphabet, and said word terminator following a last word remnant in each branch being followed in turn by said end-of-table character.