← Back to Patent Explorer
EP0661670A2 Expired / Lapsed EP ⏱️ 0.0 years remaining

System and method for generating glyphs for unknown characters

Assignee: Digital Equipment Corp
•
Filing: 1994-12-14
•
Granted: —
•
Expires: 2014-12-14
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method and apparatus for generating glyphs for text elements input to a computer having a memory with at least one look-up table storing glyphs corresponding to such text elements. Each text element is made up of at least one code point, and often of several code points. The system searches the table for a glyph representing an input text element, and if it is not found methodically generates subsets of the text element and searches the table for glyphs representing each of the subsets. Default characters are generated for code points not represented in the table. The system uses a classification for each code point, such as the Unicode classifications, and handles unknown code points in a manner dependent upon their classification. Where a text element includes two characters with an intermediate joining character, and the text element as a whole is not represented in the table, the two characters are output for rendering separately. Where a text element includes combining characters and the combined text element as whole is not represented in the table, the system generates the characters separately and then combines them for rendering as a single glyph. Unknown combining characters are replaced by a code point for a blank combining character, for allowing any surrounding combining characters to be rendered in a combined fashion.

Inventors

  • 👤 John I. Mcconnell
  • 👤 Mordehai Huberman

Bibliographic Details

Application Number —
Jurisdiction EP
Data Source google_patents
Last Synchronized 2026-11-09 12:46
CPC Classifications
G; G06; G06K; G06K7/00; G06K7/10; G06K7/14; G06K7/1404; G06K7/1408; G06K7/143; G06K19/00; G06K19/06; G06K19/06009; G06K19/06037; G06T; G06T11/00; G06T11/20; G06T11/23

Claims Analysis

Total Claims: 12
Claim 1
Independent Claim 139 words
A method for generating glyphs from a text element comprising a plurality of code points, each code point representing one said glyph, the method being executed by a program stored in a computer having a processor controlling a memory, with at least one look-up table stored in the memory ad associating a predefined set of said code points with a predefined set of said glyphs, the method including the steps of: (1) determining whether the text element has a associated glyph in the table, ad if so, proceeding to step 4, and otherwise proceeding to step 2; (2) modifying the text element by removing a first predefined subset of the text element; (3) determining whether the modified text element has a associated glyph in the table, and if so, proceeding to step 4; and (4) outputting the associated glyph.
Claim 2
Dependent Claim 72 words
The method of claim 1, wherein, if the determination of step 3 is negative, step 3 includes the step of: (5) returning to step 2 to further modify the text element, and executing step 3 using the further modified text element; and (6) repeating steps 2-3-5 with further modifications to the text element until a further modified text element has a associated glyph in the table, and then proceeding to step 4.
Claim 3
Dependent Claim 59 words
The method of claim 2, wherein step 6 includes the steps of: if a predetermined criterion is reached before an associated glyph is located in the table for the modified text element, then ceasing the modification to the text element upon reaching the predetermined criterion, and generating a default glyph as the associated glyph for the modified text element.
Claim 4
Dependent Claim 86 words
The method of claim 3, wherein step 2 includes the step of removing at least one code point from the text element, ad the predetermined criterion includes a determination that the text element is empty, the method further including the steps of: generating a text element remainder when removing the at least one code point from the text element; and after step 4 is carried out using the associated glyph for the modified text element, returning to step 1, using the remainder as the text element
Claim 5
Dependent Claim 69 words
The method of claim 1, wherein step 2 includes the step of removing a code point from the text element, further including the steps of: generating a text element remainder when removing the at least one code point from the text element; and after step 4 is carried out using the associated glyph for the modified text element, returning to step 1, using the remainder as the text element
Claim 6
Dependent Claim 41 words
The method of claim 5, wherein the removed code point is a code point for a combining character having no associated glyph in the table, and step 3 includes the steps of: replacing the combining character with a default combining character.
Claim 7
Independent Claim 297 words
A method for generating glyphs from a stream of character codes input into a computer system having a processor coupled to a memory storing software for carrying out the method and an output device coupled to the processor, the method including the steps of: (1) generating a first regular expression comprising a initial set of character codes from the input stream, the regular expression corresponding to a predefined syntax; (2) determining whether the first regular expression is found in the look-up table, and if so, retrieving a glyph corresponding to the first regular expression and proceeding to step 8; (3) if the first regular expression is not found in the look-up table, generating a first subset of the initial set of character codes as a current subset, and a first remainder of the initial set of character codes as a current remainder, the first remainder of input character codes including at least one code not included in the first subset; (4) determining whether the current subset of character codes is found in the look-up table, and if so, retrieving a glyph corresponding to the current subset and proceeding to step 7, and otherwise proceeding to step 5; (5) generating a new subset of the input character codes as the current subset and a new remainder of the input character codes as the current remainder, the current remainder including at least one code not included in the current subset; (6) determining whether a predetermined criterion is met, and if not, returning to step 4, and if so, proceeding to step 7; (7) if none of the generated subsets was located in the look-up table, designating at least one default character as a retrieved glyph and proceeding to step 8; (8) outputting the retrieved glyph to the output device.
Claim 8
Independent Claim 165 words
A system for generating output glyphs corresponding to an input text element comprising a plurality of code points representing characters for display, including a computer having a memory storing at least one glyph table, the system including: a look-up handler for searching the table to locate a correct glyph for the text element; a fallback handler for processing the text element if a correct glyph for the text element is not located by the look-up handler, including: first generating means for generating at least one subset of the code points constituting the text element; locating means for searching the table to locate a correct glyph for the subset; and second generating means for generating a default glyph for the subset if the correct glyph for the subset is not located by the locating means; the program further including input means for receiving said correct and default glyphs from said fallback handler and output means for outputting each said correct glyph and default glyph for display.
Claim 9
Dependent Claim 46 words
The system of claim 8, wherein: each code point has a predetermined classification; and the system further includes parser means for determining the classification for each code point in the text element and for passing the classifications along with the text element to the look-up handler.
Claim 10
Dependent Claim 36 words
The system of claim 9, wherein: one said classification corresponds to a joining code point indicating that a preceding code point and a following code point are to be represented by glyphs that are joined together.
Claim 11
Dependent Claim 110 words
The system of claim 10, wherein: a first subset of the input text element includes a code point for a first character, followed by a code point for a joining character, followed by a code point for a third character; and the second generating means includes means for generating a blank default character in lieu of the joining character when a glyph for the first subset as a whole is not located in the look-up tables, and passing the code points for the first and third characters to the locating means for locating a glyph for each of the first and third characters separately for output by said output means.
Claim 12
Dependent Claim 141 words
The system of claim 10, wherein: a first subset of the input text element includes a code point for a first character, followed by a code point for a second character, followed by a code point for a third character, each of the second and third characters comprising a combining character, where the first and third characters are represented in the look-up table but the second character is not; and the second generating means includes means for passing the code points for the first and third characters to the locating means for locating a first glyph for the first character and a second glyph for the third character, and for combining the first and second glyphs into a combined glyph representing the first and third characters, and for passing the combined glyph to said output means for outputting said combined glyph.

References Cited (Backward Citations)

No citation records indexed.

USPTO Annuity & Maintenance Windows

Maintenance schedule is calculated for granted US utility patents.

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag