9. A text search system 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 said system comprises: character string storage means for storing a text; concatenate filtering means for fetching character codes sequentially from the text read out from said character string storage means to thereby make 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 said n concatenate character codes only when said codes are included in said search terms; character string matching means for deciding by matching en bloc whether or not said search terms exist in a compound character string composed of a chain of the character strings each constituted by n concatenate character codes outputted from said concatenate filtering means; and synchronizing means provided between said concatenate filtering means and said character string matching means for buffering differences in processing speed while transferring data from said concatenate filtering means to said character string matching means.
10. A text search system set forth in claim 9, characterized in that the n concatenate character codes fetched from said character string storage means are divided into a first character code string, referred to as a leading text code string including m character codes as counted from the leading one of said n concatenate character codes, inclusive of said leading code, and a second character code string, referred to as a trailing text code string, including n-m character codes succeeding to said leading text code string, said concatenate filtering means including: offset storage means which is accessed with an address represented by said leading text code string and which stores therein undermentioned offset values; offset adding means for determining a sum of an offset value outputted from said offset storage means and said trailing text code string; verify storage means for storing n concatenate character codes contained in the search terms as designated, said verify storage means being accessed by using the output of said offset addition means as an address; and character code string comparing means for comparing the n concatenate character codes read out from said verify storage means with n concatenate character codes read out from said character string storage means, to thereby output a coincidence signal when said comparison results in coincidence; wherein said offset storage means stores the offset values in slots which are accessed by using as addresses m character codes, referred to as a leading term code string, as counted from the start of the n concatenate character codes, referred to as a term code string, contained in the designated search term, said offset values being obtained by subtracting from address values of the slots of said verify storage means in which said term code string is stored the values of n-m character code strings, referred to as trailing term code strings, which succeed to the leading term code string of said term code string.