Method for entering text using abbreviated word forms

• US 4,760,528 A
• Filed: 09/18/1985
• Issued: 07/26/1988
• Est. Priority Date: 09/18/1985
• Status: Expired due to Term

• Current Assignee: Leonid D. Levin
• Original Assignee: Leonid D. Levin
• Inventors: Levin, Leonid D.
• Primary Examiner(s): Smith, Jerry
• Assistant Examiner(s): Jablon, Clark A.
• Application Number:
  US06/777,311
• Time in Patent Office: 1,042 Days
• Field of Search: 364/200 MS File, 364/900 MS File, 364/419, 364/709, 400/98
• US Class Current: 715/234
• CPC Class Codes: G06F 3/023 Arrangements for converting discrete items of information into a coded form, e.g. arrangements for interpreting keyboard generated codes as alphanumeric codes, operand codes or instruction codes
• CPC Class Codes: G06F 40/274 Converting codes to words; Guess-ahead of partial word inputs

Abstract

An abbreviated text entering system is described which provides a plurality of files each of which includes a full text word and a corresponding abbreviated word. In each of the files the abbreviated word is formed using a different rule, and at least one file is provided for words of five or more characters, a different file is provided for words including one of a plurality of predefined prefixes, a further file is provided for words including one or more predefined suffixes, and another file is provided for words which include one of a plurality of predefined prefixes and one of a plurality of predefined suffixes. Entered text is compared with the abbreviated word forms, and on a match, that full text word corresponding to the matched abbreviated text is stored in lieu of the entered text.

Claims

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.

2. The method of claim 1 which includes a step of printing said full words found in step (C).

3. 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.

4. A method as recited in claim 3 wherein said plurality of files include a prefix/suffix file including words with one of said plurality of predefined prefixes and one of said plurality of predefined suffixes and at least three characters in addition to prefix and suffix,

and wherein there are at least four forms in which text may be entered including:

(b4) a sequence of a character identifying one of said prefixes followed by three characters followed by another character identifying one of said suffixes.

5. A method as recited in claim 3 wherein said comparing step (c) includes

examining said entered text to determine which one of said files is to be used for said comparison.

6. A method as recited in claim 3 further comprising printing, in lieu of said entered text, that full text word stored in said step (c).