34. The computer readable storage medium according to claim 33 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).
34. The computer readable storage medium according to claim 33 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). 35. The computer readable storage medium according to claim 34 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.