如何比较列表中的每个元素与另一个列表中的每个元素?
问题描述:
我想比较提取的促销代码列表与正确的促销代码列表。如何比较列表中的每个元素与另一个列表中的每个元素?
如果正在与correct_promo_code列表中的促销代码进行比较的extracted_list中的促销代码没有找到完全匹配,那么这意味着促销代码有错误。为了从correct_promo_codes列表中找到正确的促销代码,我需要找到与正在比较的(来自extracted_list)的编辑距离(levenshtein距离)最小的促销代码。
代码至今: -
import csv
with open("all_correct_promo.csv","rb") as file1:
reader1 = csv.reader(file1)
correctPromoList = list(reader1)
#print correctPromoList
with open("all_extracted_promo.csv","rb") as file2:
reader2 = csv.reader(file2)
extractedPromoList = list(reader2)
#print extractedPromoList
incorrectPromo = []
count = 0
for extracted in extractedPromoList:
if(extracted not in correctPromoList):
incorrectPromo.append(extracted)
else:
count = count + 1
#print incorrectPromo
for promos in incorrectPromo:
print promos
答
nltk.metrics.distance.edit_distance(s1, s2, transpositions=False)
计算两个字符串之间的莱文斯坦编辑距离。编辑距离是将s1转换为s2所需要替换,插入或删除的字符数。例如,将“雨”转换为“闪耀”需要三个步骤,包括两个替换和一个插入:“雨” - >“sain” - >“shin” - >“闪耀”。这些操作可能是以其他的顺序完成的,但至少需要三个步骤。
来到你代码,我觉得在下半区的一些变化将捕捉到的编辑距离 -
from nltk.metrics import distance # slow to load
extractedPromoList = ['abc','acd','abd'] # csv of extracted promo codes dummy
correctPromoList = ['abc','aba','xbz','abz','abx'] # csv to real promo codes dummy
def find_min_edit(str_,list_):
nearest_correct_promos = []
distances = {}
min_dist = 100 # arbitrary large assignment
for correct_promo in list_:
dist = distance.edit_distance(extracted,correct_promo,True) # compute Levenshtein distance
distances[correct_promo] = dist # store each score for real promo codes
if dist<min_dist:
min_dist = dist # store min distance
# extract all real promo codes with minimum Levenshtein distance
nearest_correct_promos.append(','.join([i[0] for i in distances.items() if i[1]==min_dist]))
return ','.join(nearest_correct_promos) # return a comma separated string of nearest real promo codes
incorrectPromo = {}
count = 0
for extracted in extractedPromoList:
print 'Computing %dth promo code...' % count
incorrectPromo[extracted] = find_min_edit(extracted,correctPromoList) # get comma separated str of real promo codes nearest to extracted
count+=1
print incorrectPromo
输出
Computing 0th promo code...
Computing 1th promo code...
Computing 2th promo code...
{'abc': 'abc', 'abd': 'abx,aba,abz,abc', 'acd': 'abx,aba,abz,abc'}
你的问题的最后一部分是不太清楚了...... – JClarke
如果列表中的促销代码与元组中的促销代码进行比较没有找到完全匹配,则表示促销代码有错误。为了从促销代码的元组中找到正确的促销代码,我需要找到与正在比较的元素(从列表中)编辑距离最小的元组中的促销代码。 – safwan