14. A method of detecting the inclusion of at least one record comprising string of words from a list of pre-defined records in an input string of words, comprising: A. pre-processing the list of records in the manner that each record is represented by a string comprising a plurality of sections wherein each of the said sections (chunks) comprises a pre-defined number of elementary words, creating a list of chunks, comprising all chunks of said pre-defined records, wherein if a chunk appears in more than one record this chunk is included only once in the said list of chunks; B. associating to each chunk a “Begin of Record” attribute whenever the said chunk is the first chunk in the chunk representation of a record; C. associating to each chunk a “End of Record” attribute whenever the said chunk is the last chunk in the chunk representation of a record; D. calculating for each record an Incremental Hash Function (IHF); said calculating compromising: i. starting with an arbitrary initial value; ii. processing sequentially each chunk of the record; and, iii. calculating the IHF for each of said processed chunks as an arbitrarily first predefined function of the said chunk has not been associated with a “Begin of Record” attribute, and as a reversible operation of a second predefined function of the said chunk and the previously calculated IHF value where the said chunk has been associated with a “Begin of Record” attribute; E. calculating ΔI function for each record as the inverse of the said reversible operation of the IHF value at the last chunk of the record, and the said initial value of the IHF for that record; F. associating to each chunk having an “End of Record” attribute, the values of all ΔI function for all records for which that chunk is the last chunk; G. representing the input string as a string of chunks (input string of chunks); H. processing sequentially each chunk of the said input string of chunks, and for each said chunk setting a Partial Match Flag if the said chunk appears in the said list of chunks and if either the said Chunk has a “Begin of Record” attribute, or the Partial Match Flag was previously set; I. if said chunk has an “End of Record” attribute, calculating a set of ΔJ function values, each one being the result of the inverse of the said reversible operation of the IHF value at the said chunk of the input string of chunks, and the IHF value obtained immediately before calculating the IHF for a chunk having a “Begin of Record” attribute; and, J. asserting a “Probable Match” in case the said chunk has an “End of Record” attribute and at least one of the &J functions from the said set of ΔJ functions equals one of the ΔI functions associated to the said chunk wherein a “Probable Match” indicates a high probability that at least one record is included in the input string.
14. A method of detecting the inclusion of at least one record comprising string of words from a list of pre-defined records in an input string of words, comprising: A. pre-processing the list of records in the manner that each record is represented by a string comprising a plurality of sections wherein each of the said sections (chunks) comprises a pre-defined number of elementary words, creating a list of chunks, comprising all chunks of said pre-defined records, wherein if a chunk appears in more than one record this chunk is included only once in the said list of chunks; B. associating to each chunk a “Begin of Record” attribute whenever the said chunk is the first chunk in the chunk representation of a record; C. associating to each chunk a “End of Record” attribute whenever the said chunk is the last chunk in the chunk representation of a record; D. calculating for each record an Incremental Hash Function (IHF); said calculating compromising: i. starting with an arbitrary initial value; ii. processing sequentially each chunk of the record; and, iii. calculating the IHF for each of said processed chunks as an arbitrarily first predefined function of the said chunk has not been associated with a “Begin of Record” attribute, and as a reversible operation of a second predefined function of the said chunk and the previously calculated IHF value where the said chunk has been associated with a “Begin of Record” attribute; E. calculating ΔI function for each record as the inverse of the said reversible operation of the IHF value at the last chunk of the record, and the said initial value of the IHF for that record; F. associating to each chunk having an “End of Record” attribute, the values of all ΔI function for all records for which that chunk is the last chunk; G. representing the input string as a string of chunks (input string of chunks); H. processing sequentially each chunk of the said input string of chunks, and for each said chunk setting a Partial Match Flag if the said chunk appears in the said list of chunks and if either the said Chunk has a “Begin of Record” attribute, or the Partial Match Flag was previously set; I. if said chunk has an “End of Record” attribute, calculating a set of ΔJ function values, each one being the result of the inverse of the said reversible operation of the IHF value at the said chunk of the input string of chunks, and the IHF value obtained immediately before calculating the IHF for a chunk having a “Begin of Record” attribute; and, J. asserting a “Probable Match” in case the said chunk has an “End of Record” attribute and at least one of the &J functions from the said set of ΔJ functions equals one of the ΔI functions associated to the said chunk wherein a “Probable Match” indicates a high probability that at least one record is included in the input string. 20. The method according to claim 14 wherein chunks of the chunk representation of records are not overlapping, and where starting complementary and ending complementary data are used to verify final Partial match.