21. An apparatus comprising: a finite state machine having a plurality of states logically coupled to each other via one or more paths, the plurality of states being mapped to a plurality of N-grams in an output table, wherein the finite state machine is operable to simultaneously search for the plurality of N-grams through a string of bytes in a single pass, wherein the string of bytes represents non-segmented text written in a non-delimited language; a counting module coupled to the finite state machine to count a number of occurrences of each of the plurality of N-grams in the string of bytes while tracing operations of the finite state machine over the string of bytes; and a classifying engine coupled to the counting module to classify the non-segmented text based on the number of occurrences of each of the plurality of N-grams, to block the string of bytes and to generate an error message if the non-segmented text is classified to be in a prohibited category, and to cause a display device to render the non-segmented text if the non-segmented text is classified to be in an allowable category.
21. An apparatus comprising: a finite state machine having a plurality of states logically coupled to each other via one or more paths, the plurality of states being mapped to a plurality of N-grams in an output table, wherein the finite state machine is operable to simultaneously search for the plurality of N-grams through a string of bytes in a single pass, wherein the string of bytes represents non-segmented text written in a non-delimited language; a counting module coupled to the finite state machine to count a number of occurrences of each of the plurality of N-grams in the string of bytes while tracing operations of the finite state machine over the string of bytes; and a classifying engine coupled to the counting module to classify the non-segmented text based on the number of occurrences of each of the plurality of N-grams, to block the string of bytes and to generate an error message if the non-segmented text is classified to be in a prohibited category, and to cause a display device to render the non-segmented text if the non-segmented text is classified to be in an allowable category. 22. The apparatus of claim 21 , wherein the classifying engine is operable to compare the number of occurrences of each of the plurality of N-grams against corresponding information in a first model to determine if the non-segmented text is likely to be within the prohibited category.