同义词查找器算法
|
我认为示例将比loooong描述好得多:)
假设我们有一个数组数组：
(\"Server1\", \"Server_1\", \"Main Server\", \"192.168.0.3\")
(\"Server_1\", \"VIP Server\", \"Main Server\")
(\"Server_2\", \"192.168.0.4\")
(\"192.168.0.3\", \"192.168.0.5\")
(\"Server_2\", \"Backup\")
(\"Server1\", \"Server_1\", \"Main Server\", \"192.168.0.3\", \"VIP Server\", \"192.168.0.5\")
(\"Server_2\", \"192.168.0.4\", \"Backup\")
没有找到相关结果
已邀请:
4 个回复
淑灯
联课
标记所有带有不同标记的单词。 然后搜索集合中的所有单词，如果发现索引为和的两个词是同义词，则用标记和的所有词标记较少的两个词。在迭代之后，您将获得所有同义词组。 这是一种肮脏且并非完全有效的解决方案，我相信人们可以通过联合发现的结构获得更高的性能。呢率篓舍烫
$data = array( array(\"Server1\", \"Server_1\", \"Main Server\", \"192.168.0.3\"), array(\"Server_1\", \"VIP Server\", \"Main Server\"), array(\"Server_2\", \"192.168.0.4\"), array(\"192.168.0.3\", \"192.168.0.5\"), array(\"Server_2\", \"Backup\"), ); do { $foundSynonyms = false; foreach ( $data as $firstKey => $firstValue ) { foreach ( $data as $secondKey => $secondValue ) { if ( $firstKey === $secondKey ) { continue; } if ( array_intersect($firstValue, $secondValue) ) { $data[$firstKey] = array_unique(array_merge($firstValue, $secondValue)); unset($data[$secondKey]); $foundSynonyms = true; break 2; // outer foreach } } } } while ( $foundSynonyms ); print_r($data);Array ( [0] => Array ( [0] => Server1 [1] => Server_1 [2] => Main Server [3] => 192.168.0.3 [4] => VIP Server [6] => 192.168.0.5 ) [2] => Array ( [0] => Server_2 [1] => 192.168.0.4 [3] => Backup ) )娠频摩
a = [set((\"Server1\", \"Server_1\", \"Main Server\", \"192.168.0.3\")), set((\"Server_1\", \"VIP Server\", \"Main Server\")), set((\"Server_2\", \"192.168.0.4\")), set((\"192.168.0.3\", \"192.168.0.5\")), set((\"Server_2\", \"Backup\"))] b = {} c = set() for s in a: full_s = s.copy() for d in s: if b.get(d): full_s.update(b[d]) for d in full_s: b[d] = full_s c.add(frozenset(full_s)) for k,v in b.items(): fsv = frozenset(v) if fsv in c: print(list(fsv)) c.remove(fsv)