Method for entering text using abbreviated word forms

Claim 1

A method for entering alphabetic information in abbreviated form and for producing automatic print-out of full readable text by using a programmable digital computer system, comprising the steps of: (A) Presenting words in one of the following categories: (i) Five and over five character words; (ii) Prefix words having at least three characters in addition to a prefix; (iii) Suffix words having at least three characters in addition to a suffix; (iv) Prefix/suffix words; (B) Entering and storing alphabetic information using the following rules, each rule corresponding to a respective said category: (i) Two first and two last characters for five and over five character words; (ii) A special character for the prefix and next 3 characters for words with a prefix; (iii) A special character for the suffix and first 3 characters for words with a suffix; (iv) A special character for the prefix, a special character for the suffix plus 3 characters between them for words containing both prefix and suffix; and (C) Scanning and comparing according to the categories and rules of (A) and (B) such stored abbreviated words with full word dictionaries and for each such abbreviated word for which a match is established, storing the full words found in a file of computer memory.

Claim 2

A method for entering alphabetic information in abbreviated form and for producing automatic print-out of full readable text by using a programmable digital computer system, comprising the steps of: (A) Presenting words in one of the following categories: (i) Five and over five character words; (ii) Prefix words having at least three characters in addition to a prefix; (iii) Suffix words having at least three characters in addition to a suffix; (iv) Prefix/suffix words; (B) Entering and storing alphabetic information using the following rules, each rule corresponding to a respective said category: (i) Two first and two last characters for five and over five character words; (ii) A special character for the prefix and next 3 characters for words with a prefix; (iii) A special character for the suffix and first 3 characters for words with a suffix; (iv) A special character for the prefix, a special character for the suffix plus 3 characters between them for words containing both prefix and suffix; and (C) Scanning and comparing according to the categories and rules of (A) and (B) such stored abbreviated words with full word dictionaries and for each such abbreviated word for which a match is established, storing the full words found in a file of computer memory.

Claim 4

A method of rapidly entering alphabetic information comprising the steps of: (a) providing a plurality of files of retrievable word abbreviations and corresponding full text words, each such file including word abbreviations formed under a different rule, said plurality of files including at least first, prefix and suffix files, (a1) said first file including words of at least five characters, (a2) said prefix file including words with one of a plurality of predefined prefixes and at least three characters in addition to a prefix, and (a3) said suffix file including words with one of a plurality of predefined suffixes and at least three characters in addition to a suffix, (b) entering text as a sequence of alphabetic characters selected in one of at least three forms, comprising: (b1) a sequence of first and last pairs of characters for words in said first file, (b2) a sequence of a character identifying one of said prefixes and three following characters for words in said prefix file, and (b3) a sequence of three characters followed by a character identifying one of said suffixes for words in said suffix file, (c) comparing text entered in said step (b) with entries in said files, and if a match is found between said entered text and an abbreviated word in one of said files, then storing, that full text word in said file associated with an abbreviated word matched with said entered text, in lieu of said entered text.

Claim 5

A method of rapidly entering alphabetic information comprising the steps of: (a) providing a plurality of files of retrievable word abbreviations and corresponding full text words, each such file including word abbreviations formed under a different rule, said plurality of files including at least first, prefix and suffix files, (a1) said first file including words of at least five characters, (a2) said prefix file including words with one of a plurality of predefined prefixes and at least three characters in addition to a prefix, and (a3) said suffix file including words with one of a plurality of predefined suffixes and at least three characters in addition to a suffix, (b) entering text as a sequence of alphabetic characters selected in one of at least three forms, comprising: (b1) a sequence of first and last pairs of characters for words in said first file, (b2) a sequence of a character identifying one of said prefixes and three following characters for words in said prefix file, and (b3) a sequence of three characters followed by a character identifying one of said suffixes for words in said suffix file, (c) comparing text entered in said step (b) with entries in said files, and if a match is found between said entered text and an abbreviated word in one of said files, then storing, that full text word in said file associated with an abbreviated word matched with said entered text, in lieu of said entered text.