5. The word-processing system of claim 1, wherein said trial word is unacceptable to said operator, and said kinds of correction information comprises a succession of groups of word fragments, each fragment consisting of at least one character and each group containing a plurality of said fragments followed by an End-of-List code, and further including: (i) an address table in said storage means listing a succession of starting addresses, one for each said group of word fragments, (j) a pointer cooperating with said table and initially indicating the location storing the starting address of a first of said groups, said starting address identifying a corresponding location storing an initial word fragment in said first group; (k) means responsive to each additional depression of said discrete key for repeated incrementation of said first group starting address to indicate location of a next word fragment in said first group for supplying said next used fragment to said amending means to form a further trial word utilizing said next word fragment, each additional depression of said discrete key indicating the unacceptability of a previously-formed trial word; (l) signal means detecting said End-of-List code, and (m) incrementing means for said pointer and responsive to said signal means, to increment said pointer to locate a next one of said groups.
6. The word-processing system of claim 5, wherein said correction information held in said storage means is of the following kinds: (I) typographical correction, (II) phonetic substitutions, (III) replacement of a simply incorrect character, (IV) transposition reversal, (V) insertion of omitted characters, (VI) deletion of extra characters, and (VII) amendment of input garbled by inadvertent shift of the operator's hands relative to the keyboard during said input.