当前位置:首页 > 编程笔记 > 正文
已解决

PHP实现DFA算法,查找关键词

来自网友在路上 168868提问 提问时间:2023-09-28 07:39:19阅读次数: 68

最佳答案 问答题库688位专家为你答疑解惑

# 添加关键词 到全局字典dict里面
protected function addWord($strWord)
{$len = mb_strlen($strWord,'UTF-8');$curNode = &$this->dict;for ($index = 0; $index < $len; $index++) {$word = mb_substr($strWord, $index, 1, 'UTF-8');if (!isset($curNode[$word])) {$curNode[$word] = [];}$curNode =& $curNode[$word];}$curNode['end'] = 1;
}
# 根据字典dict搜索关键词public function searchMatchWords($strWords)
{$len = mb_strlen($strWords, 'UTF-8');$result = [];for ($index = 0; $index < $len; $index++) {$wordLength = $this->searchWord($strWords, $index);if ($wordLength > 0) {$words = mb_substr($strWords, $index, $wordLength, 'UTF-8');if (!isset($result[$words])) {$result[$words] = 1;} else {$result[$words] = $result[$words]++;}$index += $wordLength - 1;}}return $result;
}protected function searchWord($strWords, $beginIndex)
{$len = mb_strlen($strWords, 'UTF-8');$curNode = $this->dict;$isEnd = false;$wordLength = 0;for ($index = $beginIndex; $index < $len; $index++) {$word = mb_substr($strWords, $index, 1, 'UTF-8');if (!isset($curNode[$word])) {break;}$wordLength++;$curNode = $curNode[$word];if (isset($curNode['end'])) {$isEnd = true;}}if (!$isEnd) {$wordLength = 0;}return $wordLength;
}

参考文档

DFA算法匹配关键词 - 简书

查看全文

99%的人还看了

猜你感兴趣

版权申明

本文"PHP实现DFA算法,查找关键词":http://eshow365.cn/6-15088-0.html 内容来自互联网,请自行判断内容的正确性。如有侵权请联系我们,立即删除!