def match(s, t):
"""
2つの記事s,tを受け取り、
レーベンシュタイン距離が近い文同士をペアにして返す。
return text1, text2, Levenshtein Distance
"""
ldlist = []
for ssen in s:
ssen = ssen.replace("\n", "")
if len(ssen) == 0:
pass
else:
ld = []
lddict = {}
for tsen in t:
tsen = tsen.replace("\n", "")
ldresult = Levenshtein.lds(ssen, tsen)
Levenshtein.ld.cache_clear()
ld.append(ldresult)
lddict[ldresult] = (ssen, tsen)
u = lddict[min(ld)], min(ld)
ldlist.append(u)
return ldlist
