Claims
- 1. The method for translating a plurality of shorthand strokes, generated according to a preselected shorthand system, to text, comprising the steps of:
- (a) storing a dictionary of a preselected shorthand system in a computer, said shorthand system comprising the utilization of distinct parameter strokes to represent each homonym, thereby distinguishing a desired word from its homonym so that said distinct parameter strokes have an unambiguous text translation, at least some of the distinct parameter strokes being predefined as pointers;
- (b) then producing a computer readable record in accordance with said preselected shorthand system;
- (c) then applying the computer readable record to the computer for translating such shorthand strokes of said record, the step of applying the record to the computer comprising the steps of:
- (1) comparing the record against the dictionary to identify the portions of the record corresponding to said predefined pointers;
- (2) using the predefined pointers in the record to locate beginnings of words not represented by distinct parameter strokes, said word beginnings being defined to be the portion of the record immediately following the predefined pointers;
- (3) comparing a selected sequence of shorthand strokes starting with the first shorthand stroke immediately following the pointer, against the dictionary for locating an unambiguous match, the first located unambiguous match defining a translatable portion of the record and further defining a next pointer; and
- (4) repeating steps (2) and (3) for each pointer so defined which has an untranslated portion of the record which follows immediately thereafter to define additional pointers until all of said pointers have been located and defined.
- 2. The method of claim 1 wherein said shorthand system further comprises the utilization of distinct parameter strokes to represent suffices.
- 3. The method of claim 1 wherein said shorthand system further comprises the utilization of distinct parameter strokes to represent prefixes.
- 4. The method of claim 2 wherein said shorthand system further comprises the utilization of distinct parameter strokes to represent prefixes.
Parent Case Info
This is a continuation of application Ser. No. 502,532, filed June 13, 1983, issued Dec. 30, 1986 as U.S. Pat. No. 4,632,578 which was a continuation of application Ser. No. 250,785, filed Apr. 3, 1981, now abandoned.
US Referenced Citations (12)
Non-Patent Literature Citations (2)
Entry |
Todd, "Abbreviated Typing for word Processing", IBM Technical Disclosure Bulletin, vol. 21, No. 9, pp. 3796-3797. |
Forte et al, "Automation of Newspaper Graphics", Electronic Progress, vol. 18, No. 2, pp. 23-28. |
Continuations (2)
|
Number |
Date |
Country |
Parent |
502532 |
Jun 1983 |
|
Parent |
250785 |
Apr 1981 |
|