Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
12-liner: simplest solution in Clear category for Moria Doors by przemyslaw.daniel
def likeness(a, b):
result = ((a[0] == b[0]) + (a[-1] == b[-1]))*10
result += min(len(a), len(b))/max(len(a), len(b))*30
result += len(set(a) & set(b))/len(set(a) | set(b))*50
return result
def find_word(string):
from re import findall
word, result = findall(r'[a-z]+', string.lower())[::-1], []
for i in word:
result += [sum([likeness(i, j) for j in word])]
return word[result.index(max(result))]
Dec. 30, 2017
Comments: