Question

word = "work" word_set = {"word","look","wrap","pork"}

我怎样才能找到相似的单词，以便＆＃34; word＆＃34; ＆＃34;猪肉＆＃34;只需要一个字母就可以改成＆＃34; work＆＃34;？

我想知道如果有一种方法可以找到字符串和集合中的项目之间的区别。

Answer 1

使用标准库中的difflib.get_close_matches()：

import difflib

word = "work"
word_set = {"word","look","wrap","pork"}

difflib.get_close_matches(word, word_set)

返回：

['word', 'pork']

编辑如果需要，difflib.SequenceMatcher.get_opcodes()可用于计算编辑距离：

matcher = difflib.SequenceMatcher(b=word)
for test_word in word_set:
    matcher.set_seq1(test_word)
    distance = len([m for m in matcher.get_opcodes() if m[0]!='equal'])
    print(distance, test_word)

Answer 2

您可以执行以下操作：

word = "work"
word_set = set(["word","look","wrap","pork"])

for example in word_set:
    if len(example) != len(word):
        continue
    num_chars_out = sum([1 for c1,c2 in zip(example, word) if c1 != c2])
    if num_chars_out == 1:
        print(example)

Answer 3

我建议使用editdistance Python package，它提供wget http://www.dli.gov.in/scripts/FullindexDefault.htm?path1=/data7/upload/0180/365&first=35&last=479&barcode=2030020017599函数，用于计算从第一个单词到第二个单词需要更改的字符数。编辑距离与Levenshtein距离相同，这是由MattDMo建议的。

在您的情况下，如果您想识别彼此相距1个编辑距离的单词，您可以执行以下操作：

editdistance.eval

import editdistance as ed thresh = 1 w1 = "work" word_set = set(["word","look","wrap","pork"]) neighboring_words = [w2 for w2 in word_set if ed.eval(w1, w2) <= thresh] print neighboring_words评估为neighboring_words。

如何在集合中找到相似的单词？

3 个答案: