Method of storing data in a memory circuit for AHO-corasick type character recognition automaton and corresponding storage circuit
First Claim
1. A method of storing data in a memory circuit of an Aho-Corasick type character recognition automaton, the method comprising:
- storing a tree of nodes in a memory in which each node in the tree corresponds to a state of automaton; and
operating a character recognition automation coupled to the memory circuit to perform the followingrecognizing character strings by implementing successive transitions in the tree of nodes in which each node in the tree corresponds to a state of the automaton;
recognizing a sequence of each character string, with each node in the tree being associated with a transition vector used to determine at least one destination node of a transition in the tree of nodes;
determining if transition vectors point to common destination addresses;
combining the transition vectors to form a combination vector if the transition vectors do not point to a common destination address; and
storing the nodes in the tree at memory addresses pointed to by the combination vector.
1 Assignment
0 Petitions
Accused Products
Abstract
A method of storing data in a memory circuit of an Aho-Corasick type character recognition automaton recognizes character strings by implementing successive transitions in a tree of nodes stored in a memory. Each node corresponds to a state of the automaton and to a recognition of a sequence of the character string. Each node is associated with a transition vector serves to determine the destination node or nodes of a transition. For storage of the data, a test is performed to find out whether transition vectors point to common destination addresses. The transition vectors are combined if the addresses to which the vectors point are separate by formulating a combination vector and the nodes are stored at the memory addresses pointed at by the combination vector.
24 Citations
33 Claims
-
1. A method of storing data in a memory circuit of an Aho-Corasick type character recognition automaton, the method comprising:
-
storing a tree of nodes in a memory in which each node in the tree corresponds to a state of automaton; and operating a character recognition automation coupled to the memory circuit to perform the following recognizing character strings by implementing successive transitions in the tree of nodes in which each node in the tree corresponds to a state of the automaton; recognizing a sequence of each character string, with each node in the tree being associated with a transition vector used to determine at least one destination node of a transition in the tree of nodes; determining if transition vectors point to common destination addresses; combining the transition vectors to form a combination vector if the transition vectors do not point to a common destination address; and storing the nodes in the tree at memory addresses pointed to by the combination vector. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
-
12. A method of operating an Aho-Corasick type character recognition automaton circuit comprising:
-
storing a tree of nodes in a memory in which each node in the tree corresponds to a state of the automaton; and operating a character recognition automation coupled to the memory to perform the following recognizing character strings by implementing successive transitions in the tree of nodes stored in the memory, recognizing a sequence of each character string, with each node in the tree being associated with a transition vector used to determine at least one destination node of a transition in the tree of nodes, determining if transition vectors point to common destination addresses, combining the transition vectors to form a combination vector if the transition vectors do not point to a common destination address, and storing the tree of nodes at memory addresses in the memory pointed to by the combination vector. - View Dependent Claims (13, 14, 15, 16, 17, 18, 19, 20, 21, 22)
-
-
23. An Aho-Corasick type character recognition automaton circuit comprising:
-
a memory for storing a tree of nodes in which each node in the tree corresponds to a state of the automaton; and a character recognition automation coupled to said memory and configured for recognizing character strings by implementing successive transitions in the tree of nodes stored in said memory, recognizing a sequence of each character string, with each node in the tree being associated with a transition vector used to determine at least one destination node of a transition in the tree of nodes, determining if transition vectors point to common destination addresses, and combining the transition vectors to form a combination vector if the transition vectors do not point to a common destination address, and storing the nodes in the tree at memory addresses in said memory pointed to by the combination vector. - View Dependent Claims (24, 25, 26, 27, 28, 29, 30, 31, 32, 33)
-
Specification