基于DFA算法的python敏感词检测

最新推荐文章于 2024-09-15 22:31:42 发布

JPX-NO

最新推荐文章于 2024-09-15 22:31:42 发布

阅读量293

点赞数

文章标签： python 算法开发语言

本文链接：https://blog.csdn.net/lojloj/article/details/131935695

版权

# -*- coding:utf-8 -*-

import time
import os


time1 = time.time()

curr_dir = os.path.dirname(os.path.abspath(__file__))
wordfilter_path = os.path.join(curr_dir, './data/中文敏感词.txt')


# DFA算法
class DFAFilter(object):
    def __init__(self):
        self.keyword_chains = {}
        self.delimit = '\x00'

    def add(self, keyword):
        global last_level, last_char, i
        keyword = keyword.lower()
        chars = keyword.strip()
        if not chars:
            return
        level = self.keyword_chains
        for i in range(len(chars)):
            if chars[i] in level:
                level = level[chars[i]]
            else:
                if not isinstance(level, dict):
                    break
                for j in range(i, len(chars)):
                    level[chars[j]] = {}
                    last_level, last_char = level, chars[j]
                    level = level[chars[j]]
                last_level[last_char] = {self.delimit: 0}
                break
        if i == len(chars) - 1:
            level[self.delimit] = 0

    def parse(self, path):
        with open(path, encoding='utf-8') as f:
            for keyword in f:
                self.add(str(keyword).strip())

    # 将文本中的敏感词替换为*
    def filter(self, message, repl="*"):
        message = message.lower()
        ret = []
        start = 0
        while start < len(message):
            level = self.keyword_chains
            step_ins = 0
            for char in message[start:]:
                if char in level:
                    step_ins += 1
                    if self.delimit not in level[char]:
                        level = level[char]
                    else:
                        ret.append(repl * step_ins)
                        start += step_ins - 1
                        break
                else:
                    ret.append(message[start])
                    break
            else:
                ret.append(message[start])
            start += 1

        return ''.join(ret)

    # 是否含有敏感词
    def is_violation(self, message):
        message = message.lower()
        ret = []
        start = 0
        while start < len(message):
            level = self.keyword_chains
            for char in message[start:]:
                if char in level:
                    return '含有敏感词'
                else:
                    ret.append(message[start])
                    break
            else:
                ret.append(message[start])
            start += 1

        return ''.join(ret)


if __name__ == "__main__":
    gfw = DFAFilter()
    path = wordfilter_path
    gfw.parse(path)
    text = "这是一个政治方面的新闻"
    # result = gfw.filter(text)
    result2 = gfw.is_violation(text)

    print(text)
    # print(result)
    print(result2)
    time2 = time.time()
    print('总共耗时：' + str(time2 - time1) + 's')