32. A text search method for deciding en bloc whether or not a plurality of user-designated search terms exist in a text composed of characters expressed in the form of character codes, characterized in that character codes are sequentially fetched from said text to thereby make a decision as to whether or not n, where n represents an integer not smaller than 2, character codes as fetched are included in said search terms as a concatenate character string and output by extracting said n concatenate character codes, referred to as concatenate filtering, only when they are included in said search terms, and that matching is performed en bloc for deciding whether or not said search terms exist in a compound character string constituted by a chain of character strings each composed of the n concatenate character codes as outputted, and synchronizing between said filtering step and said matching step for buffering differences in processing speed while transferring data from said filtering step to said matching step.
35. A text search method set forth in claim 32, characterized in that in said concatenate filtering is effected by using a pointer table storing order numbers, referred to as serial numbers, allotted in correspondence to the character codes included in the search term designated previously in slots indicated by said character codes, and a concatenate filtering table storing flags indicating "ON" in slots accessed by using as addresses therefore codes each represented by a string of the serial numbers corresponding to n concatenate character codes, respectively, which are included in the designated search term while storing "OFF" in the other slots.