Patent US3408002A successfully refreshed from Google Patents.
Patent US5295238A successfully refreshed from Google Patents.
US5295238A
Expired / Lapsed
US
⏱️ 0.0 years remaining
System, method, and font for printing cursive character strings
Assignee: HIGHLIGHTS FOR CHILDREN Inc A Corp OF DELAWARE
•
Filing: 1991-04-30
•
Granted: 1994-03-15
•
Expires: 2011-04-30
Abstract
Abstract A mathematically describable outline font and system for generating cursively concatenated text output using context-sensitive letter forms drawn from a single, standard ASCII character set. In creating such letter forms, each letter of the alphabet, is reduced to its basemost, non-context-sensitive form and joined by context dependent connector characters, as determined upon base letterform pairs. Special characters and connectors are also substituted in the presence of predetermined adjacent character pairs, providing an unbroken sequence of output characters which simulates human cursive handwriting as taught by the Zanerian method. Unlike script fonts currently available in the art which rely on overlapping or disjointed connector components in an attempt to simulate handwriting, the font and system of type generation disclosed by the present invention produces electronically set type having interconnected cursive characters and a common stroke width.
Inventors
- 👤 Nathan A. Dickson
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 18:36
CPC Classifications
G; G06; G06F; G06F40/00; G06F40/10; G06F40/103; G06F40/109; G06K; G06K15/00; G06K15/02; G06K2215/00; G06K2215/0002; G06K2215/002; G06K2215/0028; G06K2215/0062; G06K2215/0065; G06K2215/0068
Claims Analysis
Total Claims: 27
Claim 1
Independent Claim
267 words
A system for forming a visually perceptible context sensitive cursively concatinated sequence of font characters from a string of input characters, comprising: an electronically accessible computer employable memory, including: a first memory component retaining definitions for printed formation of base letter forms, a second memory component retaining definitions for printed formation of connector forms, a third memory component retaining a first family of character groups associated with respect to common said connector forms in adjacency with and to the left of another character; and a fourth memory component retaining a second family of character groups associated with respect to common said connector forms in adjacency with and to the right of another character; an input providing a sequence of input signals identifying a said string of input characters; a processor responsive to said input signals for accessing said third and fourth memory components to locate data representing the presence of mutually adjacent ones of said input characters within said first and second families of character groups, for accessing said second memory component to derive a said definition of a said connector form corresponding with said located data, for accessing said first memory component to derive a definition of a said base letter form for each of said mutually adjacent ones of said input characters, and for deriving output signals corresponding with a cursively concatenated sequence of said derived definitions of said base letter forms and said derived definition of said connector form; and an output responsive to said output signals for providing a cursively concatenated visual representation corresponding with said mutually adjacent ones of said input characters.
Claim 2
Independent Claim
267 words
A system for forming a visually perceptible context sensitive cursively concatinated sequence of font characters from a string of input characters, comprising: an electronically accessible computer employable memory, including: a first memory component retaining definitions for printed formation of base letter forms, a second memory component retaining definitions for printed formation of connector forms, a third memory component retaining a first family of character groups associated with respect to common said connector forms in adjacency with and to the left of another character; and a fourth memory component retaining a second family of character groups associated with respect to common said connector forms in adjacency with and to the right of another character; an input providing a sequence of input signals identifying a said string of input characters; a processor responsive to said input signals for accessing said third and fourth memory components to locate data representing the presence of mutually adjacent ones of said input characters within said first and second families of character groups, for accessing said second memory component to derive a said definition of a said connector form corresponding with said located data, for accessing said first memory component to derive a definition of a said base letter form for each of said mutually adjacent ones of said input characters, and for deriving output signals corresponding with a cursively concatenated sequence of said derived definitions of said base letter forms and said derived definition of said connector form; and an output responsive to said output signals for providing a cursively concatenated visual representation corresponding with said mutually adjacent ones of said input characters.
Claim 3
Dependent Claim
19 words
The system of claim 1 in which said definitions of base letter forms correspond with characters of non-context-sensitive form.
Claim 4
Dependent Claim
56 words
The system of claim 1 wherein each character within each character group of said first family retained by said third memory component has common concatenation attributes for connective association with one of said connector forms with respect to a character located within a said character group of said second family retained by said fourth memory component.
Claim 5
Dependent Claim
57 words
The system of claim 1 wherein each character within each character group of said second family retained by said fourth memory component has common concatenation attributes for connective association with one of said connector forms with respect to a character located within a said character group of said first family and retained by said third memory component.
Claim 6
Dependent Claim
43 words
The system of claim 1 in which each said character group within said first and second families is represented by respective first and second family identifiers; and said located data is derived from a compiled pairing of said first and second family identifiers.
Claim 7
Dependent Claim
50 words
The system of claim 1 in which said third memory component retained first family contains the three character groups comprising the characters: a, d, h, i, l, m, n, q, r, t, u, A, K, M, N, U; b, v, w; and c, e, f, k, x, C, E, R.
Claim 8
Dependent Claim
32 words
The system of claim 1 in which said third memory component retained first family contains the three character groups comprising the characters: g, j, y, z, J, Z; o; and p, s.
Claim 9
Dependent Claim
40 words
The system of claim 1 in which said third memory component retained first family contains the four character groups comprising the characters: B, D, F, G, I, L, O, P, Q, S, T, V, W, X; H; Y; and space.
Claim 10
Dependent Claim
35 words
The system of claim 1 in which said fourth memory component retained second family contains the three character groups comprising the characters: a, d, h, g, q; b, f, h, k, l; and c, o.
Claim 11
Dependent Claim
36 words
The system of claim 1 in which said fourth memory component retained second family contains the three character groups comprising the characters: e; i, j, p, t, u, w; and m, n, v, x, y, z.
Claim 12
Dependent Claim
27 words
The system of claim 1 in which said fourth memory component retained second family contains the four character groups comprising the characters: r; s; 's; and space.
Claim 13
Dependent Claim
77 words
The system of claim 1 in which said electronically accessible memory includes a fifth memory component retaining a compilation of exception combinations of adjacent characters and corresponding definitions for the printed formation of unique exception connector forms; and said processor is responsive to the occurrence of a said exception combination within said string of input characters to access said fifth memory component for a corresponding said definition for the printed formation of a unique exception connector form.
Claim 14
Dependent Claim
30 words
The system of claim 12 in which said compilation of exception combinations of adjacent characters comprises: f space, f's, l's, q space, q u, q's, y j, and y p.
Claim 15
Dependent Claim
67 words
The system of claim 1 in which said electronically accessible memory includes a sixth memory component retaining a compilation of exception said located data and uniquely corresponding definitions for the printed formation of exception base letter forms; and said processor is responsive to the occurrence of said exception located data to derive a said uniquely corresponding definition for the printed formation of an exception base letter form.
Claim 16
Dependent Claim
29 words
The system of claim 1 in which the sum of said letter form and connector form descriptions retained in said first and second memory components does not exceed 256.
Claim 17
Independent Claim
207 words
The method for forming a printed sequence of cursively concatenated font characters corresponding with a given string of characters, comprising the steps of: providing a first compilation of cursive base letter forms; providing a second compilation of cursive connector forms; providing a third compilation of a first family of character groups in which the characters therein are uniquely associated with respect to common connector forms in adjacency with and to the left of another character; providing a fourth compilation of a second family of character groups in which the characters therein are uniquely associated with respect to common said connector forms in adjacency with, and to the right of, another character; identifying the presence of each character within said given string of characters within character groups of said first and second families and deriving data corresponding with a said identified presence; selecting a said base letter form from said first compilation for the characters of said given string; selecting a said cursive connector form in correspondence with said derived data for pairs of adjacent characters within said given string of characters; and combining each said selected base letter form and said corresponding selected connector form to provide a cursively concatenated print-out of said given string of characters.
Claim 18
Independent Claim
207 words
The method for forming a printed sequence of cursively concatenated font characters corresponding with a given string of characters, comprising the steps of: providing a first compilation of cursive base letter forms; providing a second compilation of cursive connector forms; providing a third compilation of a first family of character groups in which the characters therein are uniquely associated with respect to common connector forms in adjacency with and to the left of another character; providing a fourth compilation of a second family of character groups in which the characters therein are uniquely associated with respect to common said connector forms in adjacency with, and to the right of, another character; identifying the presence of each character within said given string of characters within character groups of said first and second families and deriving data corresponding with a said identified presence; selecting a said base letter form from said first compilation for the characters of said given string; selecting a said cursive connector form in correspondence with said derived data for pairs of adjacent characters within said given string of characters; and combining each said selected base letter form and said corresponding selected connector form to provide a cursively concatenated print-out of said given string of characters.
Claim 19
Independent Claim
19 words
The method of 16 in which said first compilation of cursive base letter forms are provided as outline definitions.
Claim 20
Independent Claim
19 words
The method of 16 in which said first compilation of cursive base letter forms are provided as outline definitions.
Claim 21
Independent Claim
18 words
The method of 16 in which said second compilation of cursive connector forms are provided as outline definitions.
Claim 22
Independent Claim
18 words
The method of 16 in which said second compilation of cursive connector forms are provided as outline definitions.
Claim 23
Independent Claim
30 words
The method of 16 in which said first family of character groups are combined with said second family of character groups within a matrix from which said data are derived.
Claim 24
Independent Claim
30 words
The method of 16 in which said first family of character groups are combined with said second family of character groups within a matrix from which said data are derived.
Claim 25
Dependent Claim
53 words
The method of claim 16 which includes the steps of: providing a fifth compilation of exception combinations of pairs of adjacent characters and corresponding unique exception connector forms; and combining each said selected base letter form of the pair thereof corresponding with a said exception combination with a said unique exception connector form.
Claim 26
Dependent Claim
46 words
The method of claim 16 which includes the steps of: providing a sixth compilation of exception said data and uniquely corresponding exception base letter forms; and selecting a said exception base letter form as said selected base letter form on the occurrence of said exception data.
Claim 27
Dependent Claim
20 words
The method of claim 16 in which the sum of said first and second compilations does not exceed 256 forms.
References Cited (Backward Citations)
US4181972A
Cited
US4244657A
Cited
JPS59230754A
Cited
US5131766A
Cited
US5137383A
Cited
US5109352A
Cited
US5131090A
Cited
US5119296A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-03-14 | 1997-09-13 | 1998-03-15 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-03-14 | 2001-09-13 | 2002-03-15 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-03-14 | 2005-09-13 | 2006-03-15 | $7700.00 | Window Closed / Lapsed |