通过不同的距离度量，用同一个字母找到最接近的拼写

Question

我正在尝试编写一个函数，通过不同的n-gram和距离度量，找到单词（可能拼写错误）的最接近拼写。在

对于我现在所拥有的

from nltk.corpus import words from nltk import ngrams from nltk.metrics.distance import edit_distance, jaccard_distance first_letters = ['A','B','C'] spellings = words.words() def recommendation(word): n = 3 # n means 'n'-grams, here I use 3 as an example spellings_new = [w for w in spellings if (w[0] in first_letters)] dists = [________(set(ngrams(word, n)), set(ngrams(w, n))) for w in spellings_new] # ______ is the distance measure return spellings_new[dists.index(min(dists))]

Answer 1

你真的很接近。w[0] == word[0]可用于检查第一个字母是否相同。之后，set(w)和{}可以用来将单词转换成字母集。然后我把它传给了jaccard_distance，只因为那是你已经进口的。有可能有更好的解决办法。在

def recommendation(word):
    n = 3
    # n means 'n'-grams, here I use 3 as an example
    spellings_new = [w for w in spellings if (w[0] == word[0])]
    dists = [jaccard_distance(set(w), set(word)) for w in spellings_new]
    return spellings_new[dists.index(min(dists))]