DICTIONARY COMPILATIONS
First Claim
1. A computer implemented method, comprising:
- constructing a dictionary as a prefix tree having key strings associated with a plurality of nodes interconnected via branches, the plurality of nodes including at least one branch node coupled via some of the branches to sibling nodes of the branch node and child nodes of the branch node; and
assigning reference numbers to the plurality of nodes in a monotonic progression as the prefix tree is traversed along the plurality of nodes, wherein the sibling nodes are assigned the reference numbers before assigning the reference numbers to the child nodes, and wherein the child nodes are assigned the reference numbers according to order of appearance of characters in the key strings.
2 Assignments
0 Petitions
Accused Products
Abstract
Apparatus, systems, and methods operate to obtain data from a first array constructed from a directed acyclic graph formed as a prefix tree having key strings associated with a plurality of interconnected nodes, including branch nodes coupled via branches to sibling nodes and child nodes. Reference numbers are assigned to nodes in a monotonic progression as the prefix tree is traversed along the plurality of nodes. Sibling nodes are assigned reference numbers before child nodes, and child nodes are assigned reference numbers according to the order of appearance of key string characters. The first array comprises the key strings ordered according to the reference numbers. A second array can be formed as a linear searchable index derived from data in the first array, with elements of the second array comprising the reference numbers. Additional apparatus, systems, and methods are disclosed.
79 Citations
21 Claims
-
1. A computer implemented method, comprising:
-
constructing a dictionary as a prefix tree having key strings associated with a plurality of nodes interconnected via branches, the plurality of nodes including at least one branch node coupled via some of the branches to sibling nodes of the branch node and child nodes of the branch node; and assigning reference numbers to the plurality of nodes in a monotonic progression as the prefix tree is traversed along the plurality of nodes, wherein the sibling nodes are assigned the reference numbers before assigning the reference numbers to the child nodes, and wherein the child nodes are assigned the reference numbers according to order of appearance of characters in the key strings. - View Dependent Claims (2, 3, 4, 5, 6)
-
-
7. A computer implemented method, comprising:
-
retrieving data from a first array constructed from a directed acyclic graph formed as a prefix tree having key strings associated with a plurality of nodes interconnected via branches, the plurality of nodes including at least one branch node coupled via some of the branches to sibling nodes of the branch node and child nodes of the branch node, wherein reference numbers are assigned to the plurality of nodes in a monotonic progression as the prefix tree is traversed along the plurality of nodes, wherein the sibling nodes are assigned the reference numbers before assigning the reference numbers to the child nodes, wherein the child nodes are assigned the reference numbers according to order of appearance of characters in the key strings, and wherein the first array comprises the key strings ordered according to the reference numbers; and forming a second array as a linear searchable index derived from the data, with each element of the second array comprising one of the reference numbers. - View Dependent Claims (8, 9, 10, 11, 12, 13, 14)
-
-
15. A system, comprising:
-
a display; an index construction module to form a second array as a linear searchable index derived from a first array constructed from a directed acyclic graph formed as a prefix tree having key strings associated with a plurality of nodes interconnected via branches, the plurality of nodes including at least one branch node coupled via some of the branches to sibling nodes of the branch node and child nodes of the branch node, wherein reference numbers are assigned to the plurality of nodes in a monotonic progression as the prefix tree is traversed along the plurality of nodes, wherein the sibling nodes are assigned the reference numbers before assigning the reference numbers to the child nodes, wherein the child nodes are assigned the reference numbers according to order of appearance of characters in the key strings, wherein the first array comprises the key strings ordered according to the reference numbers, and wherein each element of the second array comprises one of the reference numbers; and a rendering module to display words on the display after the words have been checked for spelling against a concatenation of alphabetic characters included in the key strings in the first array. - View Dependent Claims (16, 17)
-
-
18. The system of claim 15, comprising:
-
a server to construct the first array; and a client to form the second array, the client capable of being coupled to the server via a network, the client to receive the words via a user input device coupled to the client. - View Dependent Claims (19, 20, 21)
-
-
18-1. A computer-readable medium having instructions stored therein for causing a computer to implement a method, comprising:
-
retrieving data from a first array constructed from a directed acyclic graph formed as a prefix tree having key strings associated with a plurality of nodes interconnected via branches, the plurality of nodes including at least one branch node coupled via some of the branches to sibling nodes of the branch node and child nodes of the branch node, wherein reference numbers are assigned to the plurality of nodes in a monotonic progression as the prefix tree is traversed along the plurality of nodes, wherein the sibling nodes are assigned the reference numbers before assigning the reference numbers to the child nodes, wherein the child nodes are assigned the reference numbers according to order of appearance of characters in the key strings, and wherein the first array comprises the key strings ordered according to the reference numbers; and forming a second array as a linear searchable index derived from the data, with each element of the second array comprising one of the reference numbers.
-
Specification