Appeal No. 95-2429
Application No. 07/916,770
and September 25, 1996, and both amendments were entered by the
examiner. The former amendment resulted in the withdrawal of
rejections under 35 U.S.C. §§ 112 and 101 [Paper #s 11 and 12].
The claimed invention pertains to a computer system and
computer implemented method for storing and searching a
multiplicity of dictionary entries. Specifically, each
dictionary entry is stored as a group of data structures. Each
data structure of the group is made up of a plurality of
hierarchically related entries.
Representative claim 1 is reproduced as follows:
1. A computer system for storing a multiplicity of dictionary
entries, said system comprising:
a memory;
a group of data structures stored in said memory for each of said
dictionary entries, each of said data structures in each group
comprising a root entry common for said group, a data segment
entry for data, a label entry which indicates a type of said data
and is a node in a label entry hierarchy, and a label sequence
entry indicating a path of label entries in said label entry
hierarchy between the label entry of said each data structure and
said root entry, some of said data segments in each group
collectively forming a word definition; and
means for searching said data structures.
The examiner relies on the following reference:
Simonetti 5,295,261 Mar. 15, 1994
(filed July 27, 1990)
2
Page: Previous 1 2 3 4 5 6 7 8 9 Next
Last modified: November 3, 2007