19. A text search system for deciding en bloc whether or not a plurality of user-designator search terms exist in a text composed of characters expressed in the form of character codes, characterized in that said system comprises: character string storage means for storing the text; parallel filtering means for fetching character codes sequentially on an n-by-n character basis from the text read out from said character string storage means to thereby make decision for m, where m represents a divisor of n, characters in parallel 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 concatenate character strings and output said n concatenate character codes only when they are included in said search term; character string matching means for deciding by matching en bloc whether or not said search terms exist in a compound character string constituted by a chain of character strings each composed of n concatenate character codes outputted from said parallel filtering means; and synchronizing means provided between said parallel filtering means and said character string matching means for buffering differences in processing speed while transferring data from said parallel filtering means to said character string matching means.
19. A text search system for deciding en bloc whether or not a plurality of user-designator search terms exist in a text composed of characters expressed in the form of character codes, characterized in that said system comprises: character string storage means for storing the text; parallel filtering means for fetching character codes sequentially on an n-by-n character basis from the text read out from said character string storage means to thereby make decision for m, where m represents a divisor of n, characters in parallel 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 concatenate character strings and output said n concatenate character codes only when they are included in said search term; character string matching means for deciding by matching en bloc whether or not said search terms exist in a compound character string constituted by a chain of character strings each composed of n concatenate character codes outputted from said parallel filtering means; and synchronizing means provided between said parallel filtering means and said character string matching means for buffering differences in processing speed while transferring data from said parallel filtering means to said character string matching means. 21. A text search system set forth in claim 19, characterized in that said filtering means includes parallel filtering means, wherein every time an input character code is fetched on a one-by-one character basis sequentially from the text read out from said character string storage means, said parallel filtering means makes decision for m, where m represents a divisor of n, characters in parallel as to whether or not the character codes of n characters fetched till then inclusive of said input character code are included in the search terms as a string of concatenate characters, for thereby outputting the character code fetched first of said n concatenate character codes to said character string matching means only when said character codes of n characters are decided as being included in said search terms as a concatenate character string.