使用單詞列表計算Levenshtein距離

Question

首先，我想說我是python中的新手。我試圖爲許多單詞列表計算Levenshtein距離。直到現在，我成功地爲一對單詞編寫代碼，但我在列表中遇到了一些問題。我只是HABE文字下面一個其他像這樣兩個列表： 卡洛斯 STIV 彼得

我想用Levenshtein距離爲類似的做法。可能somebady告訴我如何加載列表，然後使用函數來計算de distance？

我會感激！

這裏是我的代碼只是兩個字符串：

#!/usr/bin/env python 
# -*- coding=utf-8 -*- 

def lev_dist(source, target): 
    if source == target: 
     return 0 

#words = open(test_file.txt,'r').read().split(); 

    # Prepare matrix 
    slen, tlen = len(source), len(target) 
    dist = [[0 for i in range(tlen+1)] for x in range(slen+1)] 
    for i in xrange(slen+1): 
     dist[i][0] = i 
    for j in xrange(tlen+1): 
     dist[0][j] = j 

    # Counting distance 
    for i in xrange(slen): 
     for j in xrange(tlen): 
      cost = 0 if source[i] == target[j] else 1 
      dist[i+1][j+1] = min(
          dist[i][j+1] + 1, # deletion 
          dist[i+1][j] + 1, # insertion 
          dist[i][j] + cost # substitution 
         ) 
    return dist[-1][-1] 

if __name__ == '__main__': 
    import sys 
    if len(sys.argv) != 3: 
     print 'Usage: You have to enter a source_word and a target_word' 
     sys.exit(-1) 
    source, target = sys.argv[1], sys.argv[2] 
    print lev_dist(source, target) 

Answer 1

我終於得到了代碼從一個朋友:) 一些幫助工作您可以計算Levenshtein距離，並將其與第二個列表中每個更改腳本最後一行的單詞（即：print（list1 [0]，list2 [i]））進行比較，以將list1中的第一個單詞與每個單詞進行比較在list2中。

感謝

#!/usr/bin/env python 
# -*- coding=utf-8 -*- 

import codecs 

def lev_dist(source, target): 
    if source == target: 
     return 0 


    # Prepare a matrix 
    slen, tlen = len(source), len(target) 
    dist = [[0 for i in range(tlen+1)] for x in range(slen+1)] 
    for i in xrange(slen+1): 
     dist[i][0] = i 
    for j in xrange(tlen+1): 
     dist[0][j] = j 

    # Counting distance, here is my function 
    for i in xrange(slen): 
     for j in xrange(tlen): 
      cost = 0 if source[i] == target[j] else 1 
      dist[i+1][j+1] = min(
          dist[i][j+1] + 1, # deletion 
          dist[i+1][j] + 1, # insertion 
          dist[i][j] + cost # substitution 
         ) 
    return dist[-1][-1] 

# load words from a file into a list 
def loadWords(file): 
    list = [] # create an empty list to hold the file contents 
    file_contents = codecs.open(file, "r", "utf-8") # open the file 
    for line in file_contents: # loop over the lines in the file 
     line = line.strip() # strip the line breaks and any extra spaces 
     list.append(line) # append the word to the list 
    return list 

if __name__ == '__main__': 
    import sys 
    if len(sys.argv) != 3: 
     print 'Usage: You have to enter a source_word and a target_word' 
     sys.exit(-1) 
    source, target = sys.argv[1], sys.argv[2] 

    # create two lists, one of each file by calling the loadWords() function on the file 
    list1 = loadWords(source) 
    list2 = loadWords(target) 

    # now you have two lists; each file has to have the words you are comparing on the same lines 
    # now call you lev_distance function on each pair from those lists 

    for i in range(0, len(list1)): # so now you are looping over a range of numbers, not lines 
     print lev_dist(list1[0], list2[i]) 


# print lev_dist(source, target) 

Answer 2

不要重新發明輪子：

http://pypi.python.org/pypi/python-Levenshtein/