Richard A Gillam, Age 812686 Ct S, Palo Alto, CA 94306

6470347, Oct 22, 2002

Sep 1, 1999

09/388417

Richard Theodore Gillam - San Jose CA

International Business Machines Corporation - Armonk NY

G06F 1700

707101, 707 10, 7071041, 704 10

Disclosed is a system, method, and program for generating a data structure in computer memory for storing strings, such as words in a dictionary. Each string includes at least one character from a set of characters. An arrangement of nodes is determined to store the characters such that the arrangement of the nodes is capable of defining a tree structure. An array data structure is generated to store the nodes. The array includes a row for each node and a column for each character in the set of characters. A non-empty cell identifies a node for the character indicated in the column of the cell that has descendant nodes in the row indicated in the cell content for the node. The array data structure is processed to eliminate at least one row in the array data structure to reduce a number of bytes needed to represent the array data structure. In this way, the array data structure following the processing requires less bytes of storage space then before the processing.

6493662, Dec 10, 2002

Feb 11, 1998

09/022192

Richard Gillam - San Jose CA

International Business Machines Corporation - Armonk NY

G06F 1720

704 9, 704 1

A number translation engine is based on a textual description of the procedure for spelling out a number in any of a variety of languages. The number translation engine comprises an output alphabetical representation formatter which, in turn, comprises a formatting engine and rule set. Each rule within a rule set includes a base output alphabetical representation and an indication to the formatting engine, either implicitly or explicitly, of a range of numerical values for which the rule applies. The formatting engine obtains a base output alphabetical representation from an appropriate rule within a rule set and builds up an output alphabetical representation, adding output alphabetical representations from other rules within the rule set, as necessary. Additionally, where appropriate, a rule indicates where âadditionalâ output alphabetical representations may be placed in relation to the base, or root, output alphabetical representation in order to construct a complete output alphabetical representation. The formatting engine may operate in concert with various rule sets in order to effect various numerical-to-alphabetical translations.

6513002, Jan 28, 2003

Feb 11, 1998

09/022191

Richard Gillam - San Jose CA

International Business Machines Corporation - Armonk NY

G06F 1727

704 9, 704257

A number translation engine is based on a textual description of the procedure for spelling out a number in any of a variety of languages. The number translation engine comprises an output alphabetical representation formatter which, in turn, comprises a formatting engine and rule set. Each rule within a rule set includes a base output alphabetical representation and an indication to the formatting engine, either implicitly or explicitly, of a range of numerical values for which the rule applies. The formatting engine obtains a base output alphabetical representation from an appropriate rule within a rule set and builds up an output alphabetical representation, adding output alphabetical representation s from other rules within the rule set, as necessary. Additionally, where appropriate, a rule indicates where âadditionalâ output alphabetical representation s may be placed in relation to the base, or root, output alphabetical representation in order to construct a complete output alphabetical representation. The formatting engine may operate in concert with various rule sets in order to effect various numerical-to-alphabetical translations.

6626960, Sep 30, 2003

Sep 1, 1999

09/388330

Richard Theodore Gillam - San Jose CA

International Business Machines Corporation - Armonk NY

G06F 1700

715531, 715521, 382229, 704 9, 704 10

Disclosed is a system, method, and program for generating a table for use by a computer in determining a location of a boundary, such as a word boundary, between two characters in text. A first table indicates a boundary between characters when processing text in a first direction, such as the forward direction. A second table is generated based on the content of the first table. The second table can be used to determine whether one boundary is located between any two consecutive characters processed in a second direct ion, such as the backward direction.

6671856, Dec 30, 2003

Sep 1, 1999

09/388007

Richard Theodore Gillam - San Jose CA

International Business Machines Corporation - Armonk NY

G06F 1700

715531, 715532, 704 10, 382229

Disclosed is a system, method, and program for determining boundaries in a string of characters using a dictionary, wherein the substrings in the dictionary may comprise words. A determination is made of all possible initial substrings of the string in the dictionary. One initial substring is selected such that all the characters following the initial substring can be divided into at least one substring in the dictionary. The boundaries follow each of the initial substring and the at least one substring that includes all the characters following the initial substring.

6742164, May 25, 2004

Sep 1, 1999

09/388329

Richard Theodore Gillam - San Jose CA

International Business Machines Corporation - Armonk NY

G06F 1700

715531, 715521

Disclosed is a system, method, and program for generating a data structure for use by a computer in determining a location of boundaries in text. The data structure is initialized and at least one regular expression is processed. Input characters in the at least one regular expression are then processed to determine at least one transition to at least one state. A determination is then made as to whether one input character would cause a non-deterministic transition. Additional states are added to the data structure to transform the non-deterministic transition to a deterministic transition.

6092092, Jul 18, 2000

Mar 13, 1998

9/042296

Douglas Felt - Menlo Park CA
John Raley - San Francisco CA
Richard Gillam - San Jose CA

International Business Machines Corporation - Armonk NY

G06F 1500
G06O 1100

707530

Character style information is stored in an array, in parallel with character information stored within another data structure. The style information array has more memory allocated to it than would be required to store the style information. This surplus memory is employed to form a "gap" in the array at a location corresponding to the point at which characters are being modified. The gap permits rapid revisions to character style information, while the array storage mechanism permits rapid random access to the style information of any character. Character style information may be mapped to corresponding characters using a run--array mechanism which associates a style with characters through use of an offset which indicates a starting character to which the style applies and a run length which indicates the number of characters to which the style applies. Additionally, the offset may be related to the beginning or to the end of the document, depending upon whether the associated style run falls before or after the memory gap.