System for plural-string search with a parallel collation of a first partition of each string followed by finite automata matching of second partitions
First Claim
1. In a symbol string search apparatus a symbol string search method for making a judgement of whether or not a plurality of symbol strings of interest to be searched for exist in a symbol string to be searched which is composed of symbols represented by codes, the method comprising the steps of:
- dividing each of the plurality of symbol strings of interest into a first partial symbol string and a second partial symbol string;
performing for each of said first partial symbol strings of the plurality of symbol strings of interest a leading collation processing using a parallel collation means for collating, in parallel, symbols constituting said first partial symbol string with symbols constituting the symbol string to be search on a symbol basis, said parallel collation means generating a coincidence signal when there is a coincidence for at least one first partial symbol string;
responsive to said coincidence signal, activating, for a second partial symbol string corresponding to said coincidence, a posterior collation processing with a subsequent symbol string to be searched, the posterior collation processing being performed by use of a finite state automaton executing means including a state transition table which stores control data referred to during the posterior collation processing, the plurality of symbol strings of interest to be searched for being judged as having been successfully searched for in a case where said subsequent symbol string to be searched completely satisfies a search condition for the second partial symbol string corresponding to said coincidence during the posterior collation processing.
0 Assignments
0 Petitions
Accused Products
Abstract
A parallel comparator for performing a parallel and high-speed processing for collation of partial character strings which are partially taken out of a plurality of character strings of interest to be searched out with a character string to be searched in which document data to be searched is arranged sequentially from a leading character, is provided in a front stage of an automaton executing device. Only when a part of the character string to be searched coincides with the partial character string set in the comparator, the collation of the remaining portion of the character string to be searched is performed by the automaton executing device. Also, it is possible to set "don'"'"'t care" in which a character at any position in the partial character string is ignored at the time of comparison by the comparator and to set a negation condition in which the comparison by the comparator is made taking the negation of a character at any position in the partial character string.
93 Citations
31 Claims
-
1. In a symbol string search apparatus a symbol string search method for making a judgement of whether or not a plurality of symbol strings of interest to be searched for exist in a symbol string to be searched which is composed of symbols represented by codes, the method comprising the steps of:
-
dividing each of the plurality of symbol strings of interest into a first partial symbol string and a second partial symbol string; performing for each of said first partial symbol strings of the plurality of symbol strings of interest a leading collation processing using a parallel collation means for collating, in parallel, symbols constituting said first partial symbol string with symbols constituting the symbol string to be search on a symbol basis, said parallel collation means generating a coincidence signal when there is a coincidence for at least one first partial symbol string; responsive to said coincidence signal, activating, for a second partial symbol string corresponding to said coincidence, a posterior collation processing with a subsequent symbol string to be searched, the posterior collation processing being performed by use of a finite state automaton executing means including a state transition table which stores control data referred to during the posterior collation processing, the plurality of symbol strings of interest to be searched for being judged as having been successfully searched for in a case where said subsequent symbol string to be searched completely satisfies a search condition for the second partial symbol string corresponding to said coincidence during the posterior collation processing. - View Dependent Claims (2)
-
-
3. A symbol string search apparatus comprising:
-
(a) first external information accessing means for input of a symbol string code to be searched which is composed of symbols represented by codes; (b) leading collation processing means for performing leading collation processing between the symbol string to be searched and a first partial symbol string of each of a plurality of symbol strings of interest which are to be searched for, said leading collation processing means including a parallel collation means for collating, in parallel, symbols constituting each of the first partial symbol strings of interest to be searched for with the symbol string to be searched on a symbol basis, said parallel collation means generating a coincidence signal when there is a coincidence for at least one first partial symbol string; (c) posterior collation processing means including a finite state automaton execution means and being responsive to said coincidence signal, for activating posterior collation processing between a subsequent symbol string to be searched and a second partial symbol string corresponding to said coincidence, by performing finite state automaton processing from a current state indicated by said coincidence signal, said finite state automaton executing means generating an output indicating that the plurality of symbol strings of interest to be searched for are judged as having been successfully searched for in a case where said subsequent symbol string to be searched completely satisfies a search condition for the second partial symbol string corresponding to said coincidence; (d) data storage means for storing data for control of the finite state automaton processing when said posterior collation processing is performed; and (e) second external information accessing means for input of said output from said finite state automaton executing means. - View Dependent Claims (4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22)
-
-
23. A semiconductor integrated circuit comprising:
-
(a) first external information accessing means for input of a symbol string which is to be searched and which is composed of symbols represented by codes; (b) leading collation processing means for performing leading collation processing between said symbol string to be searched and a first partial symbol string of each of a plurality of symbol strings of interest which are to be searched for, said leading collation processing means including a parallel collation means for collating, in parallel, symbols constituting each of the first partial symbol strings of interest to be searched for with the symbol string to searched on a symbol basis, said parallel collation means generating a coincidence signal when there is a coincidence for at least one first partial symbol string; (c) posterior collation processing means including a finite state automaton execution means and being responsive to said coincidence signal, for activating a processing for posterior collation between a subsequent symbol string to be searched input from said first external information accessing means and a second partial symbol string corresponding to said coincidence, said finite state automaton executing means generating an output indicating that the plurality of symbol strings of interest to be searched for are judged as having been successfully searched for in a case where said subsequent symbol string to be searched completely satisfies a search condition for the second partial symbol string corresponding to said coincidence; (d) data storage means for storing data for control of the finite state automaton processing when the posterior collation processing is performed; and (e) second external information accessing means for input of said output from said finite state automaton executing means, wherein as least two kinds of elements (a) to (e) are integrated on the same semiconductor chip. - View Dependent Claims (24, 25, 26, 27, 28, 29, 30, 31)
-
Specification