Method and system for filtering website content

• US 20060123338A1
• Filed: 11/18/2004
• Published: 06/08/2006
• Est. Priority Date: 11/18/2004
• Status: Active Grant

• Current Assignee: NeoPets, Inc. (ViacomCBS Incorporated)
• Original Assignee: NeoPets, Inc. (ViacomCBS Incorporated)
• Inventors: McCaffrey, William Joseph, Dohring, Doug Carl
• Granted Patent: US 7,549,119 B2
• Time in Patent Office: Days
• US Class Current: 715/234
• CPC Class Codes: G06F 40/163 Handling of whitespace
• CPC Class Codes: G06F 40/205 Parsing

Abstract

A method and system for filtering website content prevents undesirable words or phrases from appearing in website postings sent by website users. The invention intercepts all content submitted by the user, and processes the content before posting it on the website. Intercepted content is first processed through a blocking subroutine, which first calls a preprocessing subroutine and then calls a content breakdown subroutine. The content breakdown subroutine utilizes a recursive comparison subroutine to identify undesirable words or phrases against previously identified words or phrases stored in a database. Options may be set in the system to replace the inappropriate content with acceptable content and then post the message or block the message entirely. The user may or may not be notified that their message has been blocked or replaced. The program then calls a matching subroutine for further processing of the intercepted content.

Claims

1. A method for filtering content submitted by a user for dissemination over a communication forum, the method comprising the steps of:

(a) intercepting the content submitted by the user to the communication forum;

(b) preprocessing said intercepted content through a preprocessing subroutine to yield a modified content by reducing said intercepted content to its least common denominator;

(c) breaking said modified content down through a content breakdown subroutine into a plurality of strings of words, wherein each successive string of words drops the first word from the previous string of words;

(d) processing each of said plurality of strings of words through a recursive comparison subroutine to attempt to identify at least one undesirable term that matches a previously identified undesirable term stored in a secondary database of undesirable terms, wherein each of said previously identified undesirable terms is a word or a phrase; and

(e) when said at least one undesirable term is identified, blocking the content submitted by the user from appearing on the communication forum.

2. A method according to claim 1 wherein preprocessing step (b) further comprises the steps of:

(b1) analyzing said intercepted content for HTML tags;

(b2) converting each of a white space to a space, wherein said white space is a one of a space, a tab, a return, an end of line character, and any of an other character that is displayed on a display device as said white space to a viewer;

(b3) removing each of a punctuation character at an end of a word, wherein said word is a string of characters;

(b4) converting each of an uppercase letter into a corresponding lowercase letter;

(b5) performing a character mapping on the results of said steps (b2), (b3), and (b4) of the intercepted content;

(b6) utilizing the results of said step (b5), changing a three or more of any consecutively repeated character to two of said consecutively repeated character or to a one of said consecutively repeated character based upon a predefined list; and

(b7) deleting a any remaining spaces at the end of said intercepted content.

3. A method according to claim 2 wherein analyzing step (b1) further comprises the steps of:

(b1a) when said HTML tags are present, separating said HTML tags from a non-HTML text of said intercepted content;

(b1b) concatenating said non-HTML text with a space where said HTML tag was located in said intercepted content;

(b1c) sending said concatenated non-HTML text to said converting step (b2) for continued processing;

(b1d) copying a text inside said HTML tags to a file; and

(b1e) processing said text inside each said HTML tags through steps (b2), (b4), and (b7).

4. A method according to claim 2 wherein performing a character mapping step (b5) further comprises the steps of:

(b5a) finding each character or a string of characters having a one-to-one relationship with a predetermined phonetic or symbolic character, wherein each said character or said string of characters having said one-to-one relationship is replaced with its said predetermined phonetic or symbolic character;

(b5b) replacing each of a remaining non-replaced numeric character with a zero; and

(b5c) replacing each of a remaining non-replaced predetermined non-numeric character and each of a remaining non-replaced predetermined non-alphabetic character with an asterisk.

5. A method according to claim 1 wherein processing step (d) further comprises the steps of:

(d1) checking a first character of a first of said plurality of strings of words against a predefined alias character list, wherein each of said alias characters is a predefined character mapping where more than one character in an ordered sequence is mapped to a single character;

(d2) when a match is found in said step (d1) for said first character of a first word of said first plurality of strings of words, building a temporary alias list for said first character;

(d3) comparing said first character against a first character of all said previously identified undesirable terms in said secondary database of undesirable terms for a match;

(d4) when a match is found, checking to see if said first character is at an end of said first word;

(d5) when said first character is not at said end of said first word, calling, by said recursive comparison subroutine, said recursive comparison subroutine recursively;

(d6) moving to a next character in said first word of said first plurality of strings of words;

(d7) repeating steps (d1) through (d6) for said next character;

(d8) repeating step (d7) for each remaining character in said first word of said first plurality of strings of words;

(d9) repeating steps (d1) through (d8) for each of a next word in said first of said plurality of strings of words; and

(d10) repeating steps (d1) through (d9) for the remaining plurality of strings of words.

6. A method according to claim 5 wherein building step (d2) further comprises the steps of:

(d2a) when a match is not found for said first character of a first word of said first plurality of strings of words, determining if there are any of said alias characters left for said first character of said first word;

(d2b) when said determining step (d2a) result is yes, replacing said first character of said first word with a next alias character in said ordered sequence and passing control to said comparing step (d3) for continued processing;

(d2c) when said determining step (d2a) result is no, determining if said recursive comparison subroutine is pointing to said first character of said first word of said first plurality of strings of words on its way back up from said recursion;

(d2d) when said determining step (d2c) result is no, stepping back up a level recursively to a previous character position and passing control to said determining step (d2a) for continued processing;

(d2e) when said determining step (d2c) result is yes, returning any said at least one undesirable terms found to said blocking step (e).

7. A method according to claim 6 wherein checking step (d4) further comprises the steps of:

(d4a) when said first character is at an end of said first word, determining if a flag has been set in said secondary database of undesirable terms, wherein said flag is set at an end of each of said previously identified undesirable terms;

(d4b) when said determining step (d4a) result is yes, indicating that said first word matches a one of said previously identified undesirable terms, saving into a memory said first word as said at least one undesirable term, and passing control to step (d4c);

(d4c) when said determining step (d4a) result is no, or after said saving step (d4b), determining if said recursive comparison subroutine has reached an end of said first of said plurality of strings of words;

(d4d) when said determining step (d4c) result is no, passing control to said calling step (d5) for continued processing; and

(d4e) when said determining step (d4c) result is yes, passing control to step (d2c).

8. A method according to claim 7 wherein returning step (d2e) further comprises the steps of:

(d2e1) when any said at least one undesirable terms are returned from said recursive comparison subroutine, determining if a replacement option has been selected;

(d2e2) when said determining step (d2e1) result is yes, checking a database for a replacement term for any of said at least one undesirable terms;

(d2e3) when said determining step (d2e1) result is no, passing control to step (d2e5);

(d2e4) when said determining step (d2e2) result is yes, replacing any of said at least one undesirable terms with said replacement terms in the content yielding a replacement string;

(d2e5) when said determining step (d2e2) result is no, storing any of said at least one undesirable terms in said memory;

(d2e6) determining if a search for another match option has been selected;

(d2e7) when said determining step (d2e6) result is no, determining if there are any words left to test in said first plurality of strings of words;

(d2e8) when said determining step (d2e6) result is yes, passing control to said blocking step (e);

(d2e9) when said determining step (d2e7) result is no, passing control to said blocking step (e); and

(d2e10) when said determining step (d2e7) result is yes, returning any said at least one undesirable terms and any said replacement string to said processing step (d).

9. A method according to claim 8 further comprising the steps of:

(d2e11) when any said at least one undesirable terms are not returned from said recursive comparison subroutine, passing control to said step (d2e7); and

(d2e12) when said determining step (d2e7) result is no, passing control to said blocking step (e) with an OK indication.

10. A method according to claim 9 wherein blocking step (e) further comprises the steps of:

(e1) when no said at least one undesirable terms have been returned from said processing step (d), determining if any said OK indication or any said replacement string has been returned;

(e2) when said determining step (e1) result is said OK indication, posting the content to the communication forum;

(e3) when said determining step (e1) result is said replacement string, replacing all or part of the content with said replacement string yielding an altered content;

(e4) determining if a notify user option has been selected;

(e5) when said determining step (e4) result is yes, notifying the user that all or part of the content has been replaced;

(e6) posting said altered content to the communication forum; and

(e7) when said determining step (e4) result is no, posting said altered content to the communication forum without notifying the user.

11. A method according to claim 1 further comprising the steps of:

(f) storing in a file the content intercepted from the user, a user ID for the user, and any of an OK indications, any of at least one undesirable terms, and any of a replacement string resulting from preprocessing step (b), breaking step (c), and processing step (d);

(g) processing said intercepted content through a matching subroutine to identify new permutations of undesirable terms; and

(h) erasing said file.

12. A method according to claim 11 wherein processing step (g) further comprises the steps of:

(g1) repeating preprocessing steps (b1) through (b7) of claim 2 for said intercepted content;

(g2) removing any white space from said intercepted content remaining after said preprocessing steps (b1) through (b7);

(g3) processing said intercepted content through a matching breakdown subroutine to attempt to identify at least one matching phrase;

(g4) when said at least one matching phrase has been identified, determining if a first of said at least one matching phrase is already stored in a database of terms;

(g5) when said determining step (g4) result is yes, passing control to said determining step (g7) for continued processing;

(g6) when said determining step (g4) result is no, entering said at least one matching phrase into said database of terms as a not reviewed term;

(g7) determining if there is a next said at least one matching phrase;

(g8) when said determining step (g7) result is yes, passing control to said determining step (g4) for said next said at least one matching phrase; and

(g9) when said determining step (g7) result is no, passing control to said erasing step (h).

13. A method according to claim 12 wherein step (g6) further comprises reviewing said not reviewed term and designating a category for said not reviewed term.

14. A method according to claim 12 wherein processing step (g3) further comprises the steps of:

(g3a) breaking the content up into a plurality of strings, wherein each successive one of said plurality of strings begins with a successive character of the content;

(g3b) processing a first of said plurality of strings through a recursive matching comparison subroutine to attempt to identify said at least one matching phrase that is similar to a one of said previously identified undesirable terms stored in said secondary database of undesirable terms;

(g3c) determining if said at least one matching phrase has been identified in said first of said plurality of strings;

(g3d) when said determining step (g3c) result is no, determining if there are more of said plurality of strings to be processed;

(g3e) when said determining step (g3d) result is yes, passing control to said processing step (g3b) for a next of said plurality of strings;

(g3f) when said determining step (g3d) result is no, passing control to said determining step (g4);

(g3g) when said determining step (g3c) result is yes, determining if an option to look for only a one of said at least one matching phrase has been selected;

(g3h) when said determining step (g3g) result is no, storing said at least one matching phrase in a memory and passing control to said determining step (g3d); and

(g3i) when said determining step (g3g) result is yes, passing control to said determining step (g4).

15. A method according to claim 14 wherein processing step (g3b) further comprises the steps of:

(g3b1) checking a first character of a first of said plurality of strings against a predefined alias character list, wherein each of said alias characters is a predefined character mapping where more than one character in an ordered sequence is mapped to a single character;

(g3b2) when a match is found in said step (g3b1) for said first character of said first of said plurality of strings, building a temporary alias character list for said first character;

(g3b3) comparing said first character against a first character of all said previously identified undesirable terms in said secondary database of undesirable terms for a match;

(g3b4) when a match is found, counting the match toward a predetermined total of counted matches needed to identify said at least one matching phrase;

(g3b5) for said match, determining if a flag has been set in a current position of said previously identified undesirable term in said secondary database of undesirable terms, indicating an end of said previously identified undesirable term;

(g3b6) when said determining step (g3b5) result is no, passing control to step (g3b10);

(g3b7) when said determining step (g3b5) result is yes, determining if a total of said counted matches is equal to said predetermined total of counted matches needed to identify said at least one matching phrase;

(g3b8) when said determining step (g3b7) result is yes, saving said first of said plurality of strings as said at least one matching phrase;

(g3b9) when said determining step (g3b7) result is no, passing control to step (g3b10);

(g3b10) determining if said recursive matching comparison subroutine has reached an end of said first of said plurality of strings;

(g3b11) when said determining step (g3b10) result is no, calling, by said recursive matching comparison subroutine, said recursive matching comparison subroutine recursively;

(g3b12) moving to a next character in said first of said plurality of strings and passing control to said checking step (g3b1) for said next character;

(g3b13) repeating steps (g3b1) through (g3b12) for said next character; and

(g3b14) repeating step (g3b13) for each remaining character in said first of said plurality of strings.

16. A method according to claim 15 wherein step (g3b7) further comprises requiring said predetermined total of counted matches to be a percentage of the total number of characters in said previously identified undesirable term to identify said at least one matching term.

17. A method according to claim 15 wherein step (g3b7) further comprises requiring said predetermined total of counted matches to be a hard coded number that is based upon the total number of characters in said previously identified undesirable term, said hard coded number being less than or equal to the number of characters in said previously identified undesirable term, in order to identify said at least one matching term.

18. A method according to claim 15 wherein comparing step (g3b3) further comprises the steps of:

(g3b3a) when a match is not found, determining if there are any said alias characters in said temporary alias character list left to be used for comparison in place of said first character;

(g3b3b) when said determining step (g3b3a) result is yes, replacing said first character with a first alias character in said temporary alias character list and passing control to said comparing step (g3b3) for said first alias character;

(g3b3c) when said determining step (g3b3a) result is no, determining if there are any wildcards left to substitute for said first character; and

(g3b3d) when said determining step (g3b3c) result is yes, replacing said first character with said wildcard and passing control to said comparing step (g3b3).

19. A method according to claim 18 wherein step (g3b3c) further comprises requiring said wildcard to be used for said first character in said first of said plurality of strings for at least a one of replacing said first character when there is not a direct match, taking the place of an absent character to expand said first of said plurality of strings, and matching a void to contract said first of said plurality of strings.

20. A method according to claim 18 wherein determining step (g3b10) further comprises the steps of:

(g3b10a) when said determining step (g3b3c) result is no, passing control to step (g3b10b);

(g3b10b) when said determining step (g3b10) result is yes, determining if said recursive matching comparison subroutine is pointing to said first string position;

(g3b10c) when said determining step (g3b10b) result is no, stepping back up a level recursively to a previous character position and returning to said determining step (g3b3a) for continued processing;

(g3b10d) when said determining step (g3b10b) result is yes, passing control to said determining step (g3c).

21. A system for filtering content submitted by a user for dissemination over a communication forum, the system comprising:

a software program for intercepting the content submitted by a user through an input device for dissemination over a communication forum;

a blocking subroutine of said software program for filtering said intercepted content;

a preprocessing subroutine of said software program for preprocessing said intercepted content to yield a modified content which reduces said intercepted content to its least common denominator;

a content breakdown subroutine of said software program for breaking said modified content down into a plurality of strings of words, wherein each successive string of words drops the first word from the previous string of words;

a secondary database of undesirable terms accessed by said software program, wherein a list of previously identified undesirable terms are stored, and further wherein each of said previously identified undesirable terms is a word or a phrase; and

a recursive comparison subroutine of said software program for processing recursively each of said plurality of strings of words to identify at least one undesirable term that matches a one of said previously identified undesirable terms stored in said secondary databse of undesirable terms;

wherein when said at least one undesirable term is identified, said blocking subroutine blocks the content submitted by the user from appearing on the communication forum.

22. The system according to claim 21 wherein said preprocessing subroutine:

analyzes said intercepted content for HTML tags;

converts each of a white space to a space, wherein said white space is a one of a space, a tab, a return, an end of line character, and any of an other character that is displayed on a display device as said white space to a viewer;

removes each of a punctuation character at an end of a word, wherein said word is a string of characters;

converts each of an uppercase letter into a corresponding lowercase letter;

performs a character mapping on the intercepted content;

changes a three or more of any consecutively repeated character to two of said consecutively repeated character or to a one of said consecutively repeated character based upon a predefined list; and

deletes a any remaining spaces at the end of said intercepted content.

23. The system according to claim 22 wherein said preprocessing subroutine:

separates said HTML tags when present from a non-HTML text of said intercepted content;

concatenates said non-HTML text with a space where said HTML tag was located in said intercepted content;

sends said concatenated non-HTML text back to the beginning of said preprocessing subroutine for continued processing;

copies a text inside said HTML tags to a file; and

sends said text inside said HTML tags for simplified processing through said preprocessing subroutine by performing only a portion of the processing.

24. The system according to claim 22 wherein said preprocessing subroutine during said character mapping:

finds each character or a string of characters having a one-to-one relationship with a predetermined phonetic or symbolic character, wherein each said character or said string of characters having said one-to-one relationship is replaced with its said predetermined phonetic or symbolic character;

replaces each of a remaining non-replaced numeric character with a zero; and

replaces each of a remaining non-replaced predetermined non-numeric character and each of a remaining non-replaced predetermined non-alphabetic character with an asterisk.

25. The system according to claim 21 further comprising:

a database accessed by said software program; and

a predefined alias character list stored in said database, wherein each of said alias characters is a predefined character mapping where more than one character in an ordered sequence is mapped to a single character, wherein a first character of a first of said plurality of strings of words is checked by said recursive comparison subroutine against said predefined alias character list, and when a match is found, a temporary alias list is built for said first character, wherein said recursive comparison subroutine substitutes each of said alias characters in said list for said first character in said ordered sequence for processing.

26. The system according to claim 25 wherein said database further comprises:

a list of replacement terms, wherein a one of said replacement terms is used to replace said at least one undesirable term in the content for dissemination over the communication forum.

27. The system according to claim 21 wherein said software program further comprises:

a matching subroutine which processes said intercepted content to identify new permutations of undesirable terms.

28. The system according to claim 27 wherein the communication forum is a one of a an internal email system, an external email system, an instant messaging system, a message board, and a chat room, the system further comprising:

a sponsor of the communication forum, wherein said sponsor is a one of a website owner, a website sponsor, an internet service provider, and a company providing an intranet to its employees.

29. The system according to claim 28 further comprising:

a sponsor interface, wherein a one or more not reviewed terms generated by said matching subroutine and stored in a database are reviewed by said sponsor, are assigned a category by said sponsor, and stored in said database or in said secondary database of undesirable terms based upon said category assigned to said one or more not reviewed terms.

30. The system according to claim 21 further comprising:

a server computer, wherein said server computer supports the communication forum, and said software program resides on said server computer.

31. The system according to claim 21 further comprising:

a client computer; and

a web browser residing on said client computer;

wherein the user accesses said communication forum from said client computer through said web browser.

32. The system according to claim 21 further comprising:

a matching breakdown subroutine to identify at least one matching phrase, wherein said matching breakdown subroutine breaks the content up into a plurality of strings, wherein each successive one of said plurality of strings begins with a successive character of the content.

33. The system according to claim 32 further comprising:

a recursive matching comparison subroutine, wherein said recursive matching comparison subroutine recursively processes each of said plurality of strings to attempt to identify said at least one matching phrase that is similar to a one of said previously identified undesirable terms stored in said secondary database of undesirable terms, and when said at least one matching phrase has been identified, storing said at least one matching phrase in a memory.

34. A computer readable storage medium storing instructions that, when executed by a processor, cause the processor to perform a method for filtering content submitted by a user for dissemination over a communication forum, the method comprising the steps of:

(a) intercepting the content submitted by the user to the communication forum;

(b) preprocessing said intercepted content through a preprocessing subroutine to yield a modified content by reducing said intercepted content to its least common denominator;

(c) breaking said modified content down through a content breakdown subroutine into a plurality of strings of words, wherein each successive string of words drops the first word from the previous string of words;

(d) processing each of said plurality of strings of words through a recursive comparison subroutine to attempt to identify at least one undesirable term that matches a previously identified undesirable term stored in a secondary database of undesirable terms, wherein each of said previously identified undesirable terms is a word or a phrase; and

(e) when said at least one undesirable term is identified, blocking the content submitted by the user from appearing on the communication forum.

35. The computer readable storage medium according to claim 34 wherein preprocessing step (b) further comprises the steps of:

(b1) analyzing said intercepted content for HTML tags;

(b2) converting each of a white space to a space, wherein said white space is a one of a space, a tab, a return, an end of line character, and any of an other character that is displayed on a display device as said white space to a viewer;

(b3) removing each of a punctuation character at an end of a word, wherein said word is a string of characters;

(b4) converting each of an uppercase letter into a corresponding lowercase letter;

(b5) performing a character mapping on the results of said steps (b2), (b3), and (b4) of the intercepted content;

(b6) utilizing the results of said step (b5), changing a three or more of any consecutively repeated character to two of said consecutively repeated character or to a one of said consecutively repeated character based upon a predefined list; and

(b7) deleting a any remaining spaces at the end of said intercepted content.

36. The computer readable storage medium according to claim 35 wherein analyzing step (b1) further comprises the steps of:

(b1a) when said HTML tags are present, separating said HTML tags from a non-HTML text of said intercepted content;

(b1b) concatenating said non-HTML text with a space where said HTML tag was located in said intercepted content;

(b1c) sending said concatenated non-HTML text to said converting step (b2) for continued processing;

(b1d) copying a text inside said HTML tags to a file; and

(b1e) processing said text inside each said HTML tags through steps (b2), (b4), and (b7).

37. The computer readable storage medium according to claim 35 wherein performing a character mapping step (b5) further comprises the steps of:

(b5a) finding each character or a string of characters having a one-to-one relationship with a predetermined phonetic or symbolic character, wherein each said character or said string of characters having said one-to-one relationship is replaced with its said predetermined phonetic or symbolic character;

(b5b) replacing each of a remaining non-replaced numeric character with a zero; and

(b5c) replacing each of a remaining non-replaced predetermined non-numeric character and each of a remaining non-replaced predetermined non-alphabetic character with an asterisk.

38. The computer readable storage medium according to claim 34 wherein processing step (d) further comprises the steps of:

(d1) checking a first character of a first of said plurality of strings of words against a predefined alias character list, wherein each of said alias characters is a predefined character mapping where more than one character in an ordered sequence is mapped to a single character;

(d2) when a match is found in said step (d1) for said first character of a first word of said first plurality of strings of words, building a temporary alias list for said first character;

(d3) comparing said first character against a first character of all said previously identified undesirable terms in said secondary database of undesirable terms for a match;

(d4) when a match is found, checking to see if said first character is at an end of said first word;

(d5) when said first character is not at said end of said first word, calling, by said recursive comparison subroutine, said recursive comparison subroutine recursively;

(d6) moving to a next character in said first word of said first plurality of strings of words;

(d7) repeating steps (d1) through (d6) for said next character;

(d8) repeating step (d7) for each remaining character in said first word of said first plurality of strings of words;

(d9) repeating steps (d1) through (d8) for each of a next word in said first of said plurality of strings of words; and

(d10) repeating steps (d1) through (d9) for the remaining plurality of strings of words.

39. The computer readable storage medium according to claim 38 wherein building step (d2) further comprises the steps of:

(d2a) when a match is not found for said first character of a first word of said first plurality of strings of words, determining if there are any of said alias characters left for said first character of said first word;

(d2b) when said determining step (d2a) result is yes, replacing said first character of said first word with a next alias character in said ordered sequence and passing control to said comparing step (d3) for continued processing;

(d2c) when said determining step (d2a) result is no, determining if said recursive comparison subroutine is pointing to said first character of said first word of said first plurality of strings of words on its way back up from said recursion;

(d2d) when said determining step (d2c) result is no, stepping back up a level recursively to a previous character position and passing control to said determining step (d2a) for continued processing;

(d2e) when said determining step (d2c) result is yes, returning any said at least one undesirable terms found to said blocking step (e).

40. The computer readable storage medium according to claim 39 wherein checking step (d4) further comprises the steps of:

(d4a) when said first character is at an end of said first word, determining if a flag has been set in said secondary database of undesirable terms, wherein said flag is set at an end of each of said previously identified undesirable terms;

(d4b) when said determining step (d4a) result is yes, indicating that said first word matches a one of said previously identified undesirable terms, saving into a memory said first word as said at least one undesirable term, and passing control to step (d4c);

(d4c) when said determining step (d4a) result is no, or after said saving step (d4b), determining if said recursive comparison subroutine has reached an end of said first of said plurality of strings of words;

(d4d) when said determining step (d4c) result is no, passing control to said calling step (d5) for continued processing; and

(d4e) when said determining step (d4c) result is yes, passing control to step (d2c).

41. The computer readable storage medium according to claim 40 wherein returning step (d2e) further comprises the steps of:

(d2e1) when any said at least one undesirable terms are returned from said recursive comparison subroutine, determining if a replacement option has been selected;

(d2e2) when said determining step (d2e1) result is yes, checking a database for a replacement term for any of said at least one undesirable terms;

(d2e3) when said determining step (d2e1) result is no, passing control to step (d2e5);

(d2e4) when said determining step (d2e2) result is yes, replacing any of said at least one undesirable terms with said replacement terms in the content yielding a replacement string;

(d2e5) when said determining step (d2e2) result is no, storing any of said at least one undesirable terms in said memory;

(d2e6) determining if a search for another match option has been selected;

(d2e7) when said determining step (d2e6) result is no, determining if there are any words left to test in said first plurality of strings of words;

(d2e8) when said determining step (d2e6) result is yes, passing control to said blocking step (e);

(d2e9) when said determining step (d2e7) result is no, passing control to said blocking step (e); and

(d2e10) when said determining step (d2e7) result is yes, returning any said at least one undesirable terms and any said replacement string to said processing step (d).

42. The computer readable storage medium according to claim 41 further comprising the steps of:

(d2e11) when any said at least one undesirable terms are not returned from said recursive comparison subroutine, passing control to said step (d2e7); and

(d2e12) when said determining step (d2e7) result is no, passing control to said blocking step (e) with an OK indication.

43. The computer readable storage medium according to claim 42 wherein blocking step (e) further comprises the steps of:

(e1) when no said at least one undesirable terms have been returned from said processing step (d), determining if any said OK indication or any said replacement string has been returned;

(e2) when said determining step (e1) result is said OK indication, posting the content to the communication forum;

(e3) when said determining step (e1) result is said replacement string, replacing all or part of the content with said replacement string yielding an altered content;

(e4) determining if a notify user option has been selected;

(e5) when said determining step (e4) result is yes, notifying the user that all or part of the content has been replaced;

(e6) posting said altered content to the communication forum; and

(e7) when said determining step (e4) result is no, posting said altered content to the communication forum without notifying the user.

44. The computer readable storage medium according to claim 34 further comprising the steps of:

(f) storing in a file the content intercepted from the user, a user ID for the user, and any of an OK indications, any of at least one undesirable terms, and any of a replacement string resulting from preprocessing step (b), breaking step (c), and processing step (d);

(g) processing said intercepted content through a matching subroutine to identify new permutations of undesirable terms; and

(h) erasing said file.

45. The computer readable storage medium according to claim 44 wherein processing step (g) further comprises the steps of:

(g1) repeating preprocessing steps (b1) through (b7) of claim 35 for said intercepted content;

(g2) removing any white space from said intercepted content remaining after said preprocessing steps (b1) through (b7);

(g3) processing said intercepted content through a matching breakdown subroutine to attempt to identify at least one matching phrase;

(g4) when said at least one matching phrase has been identified, determining if a first of said at least one matching phrase is already stored in a database of terms;

(g5) when said determining step (g4) result is yes, passing control to said determining step (g7) for continued processing;

(g6) when said determining step (g4) result is no, entering said at least one matching phrase into said database of terms as a not reviewed term;

(g7) determining if there is a next said at least one matching phrase;

(g8) when said determining step (g7) result is yes, passing control to said determining step (g4) for said next said at least one matching phrase; and

(g9) when said determining step (g7) result is no, passing control to said erasing step (h).

46. The computer readable storage medium according to claim 45 wherein step (g6) further comprises reviewing said not reviewed term and designating a category for said not reviewed term.

47. The computer readable storage medium according to claim 45 wherein processing step (g3) further comprises the steps of:

(g3a) breaking the content up into a plurality of strings, wherein each successive one of said plurality of strings begins with a successive character of the content;

(g3b) processing a first of said plurality of strings through a recursive matching comparison subroutine to attempt to identify said at least one matching phrase that is similar to a one of said previously identified undesirable terms stored in said secondary database of undesirable terms;

(g3c) determining if said at least one matching phrase has been identified in said first of said plurality of strings;

(g3d) when said determining step (g3c) result is no, determining if there are more of said plurality of strings to be processed;

(g3e) when said determining step (g3d) result is yes, passing control to said processing step (g3b) for a next of said plurality of strings;

(g3f) when said determining step (g3d) result is no, passing control to said determining step (g4);

(g3g) when said determining step (g3c) result is yes, determining if an option to look for only a one of said at least one matching phrase has been selected;

(g3h) when said determining step (g3g) result is no, storing said at least one matching phrase in a memory and passing control to said determining step (g3d); and

(g3i) when said determining step (g3g) result is yes, passing control to said determining step (g4).

48. The computer readable storage medium according to claim 47 wherein processing step (g3b) further comprises the steps of:

(g3b1) checking a first character of a first of said plurality of strings against a predefined alias character list, wherein each of said alias characters is a predefined character mapping where more than one character in an ordered sequence is mapped to a single character;

(g3b2) when a match is found in said step (g3b1) for said first character of said first of said plurality of strings, building a temporary alias character list for said first character;

(g3b3) comparing said first character against a first character of all said previously identified undesirable terms in said secondary database of undesirable terms for a match;

(g3b4) when a match is found, counting the match toward a predetermined total of counted matches needed to identify said at least one matching phrase;

(g3b5) for said match, determining if a flag has been set in a current position of said previously identified undesirable term in said secondary database of undesirable terms, indicating an end of said previously identified undesirable term;

(g3b6) when said determining step (g3b5) result is no, passing control to step (g3b10);

(g3b7) when said determining step (g3b5) result is yes, determining if a total of said counted matches is equal to said predetermined total of counted matches needed to identify said at least one matching phrase;

(g3b8) when said determining step (g3b7) result is yes, saving said first of said plurality of strings as said at least one matching phrase;

(g3b9) when said determining step (g3b7) result is no, passing control to step (g3b10);

(g3b10) determining if said recursive matching comparison subroutine has reached an end of said first of said plurality of strings;

(g3b11) when said determining step (g3b10) result is no, calling, by said recursive matching comparison subroutine, said recursive matching comparison subroutine recursively;

(g3b12) moving to a next character in said first of said plurality of strings and passing control to said checking step (g3b1) for said next character;

(g3b13) repeating steps (g3b1) through (g3b12) for said next character; and

(g3b14) repeating step (g3b13) for each remaining character in said first of said plurality of strings.

49. The computer readable storage medium according to claim 48 wherein step (g3b7) further comprises requiring said predetermined total of counted matches to be a percentage of the total number of characters in said previously identified undesirable term to identify said at least one matching term.

50. The computer readable storage medium according to claim 48 wherein step (g3b7) further comprises requiring said predetermined total of counted matches to be a hard coded number that is based upon the total number of characters in said previously identified undesirable term, said hard coded number being less than or equal to the number of characters in said previously identified undesirable term, in order to identify said at least one matching term.

51. The computer readable storage medium according to claim 48 wherein comparing step (g3b3) further comprises the steps of:

(g3b3a) when a match is not found, determining if there are any said alias characters in said temporary alias character list left to be used for comparison in place of said first character;

(g3b3b) when said determining step (g3b3a) result is yes, replacing said first character with a first alias character in said temporary alias character list and passing control to said comparing step (g3b3) for said first alias character;

(g3b3c) when said determining step (g3b3a) result is no, determining if there are any wildcards left to substitute for said first character; and

(g3b3d) when said determining step (g3b3c) result is yes, replacing said first character with said wildcard and passing control to said comparing step (g3b3).

52. The computer readable storage medium according to claim 51 wherein step (g3b3c) further comprises requiring said wildcard to be used for said first character in said first of said plurality of strings for at least a one of replacing said first character when there is not a direct match, taking the place of an absent character to expand said first of said plurality of strings, and matching a void to contract said first of said plurality of strings.

53. The computer readable storage medium according to claim 51 wherein determining step (g3b10) further comprises the steps of:

(g3b10a) when said determining step (g3b3c) result is no, passing control to step (g3b10b);

(g3b10b) when said determining step (g3b10) result is yes, determining if said recursive matching comparison subroutine is pointing to said first string position;

(g3b10c) when said determining step (g3b10b) result is no, stepping back up a level recursively to a previous character position and returning to said determining step (g3b3a) for continued processing;

(g3b10d) when said determining step (g3b10b) result is yes, passing control to said determining step (g3c).