How to make Damerau-Levenshtein algorithm using list in Python?

Question

Python

The point is that the words are stored in a list and it is necessary to check which element with the original word has the least length. There are many algorithms on the Internet, but only two words, but the list is large and it will take a very long time to do it by brute force. How can this process be optimized?

Answer 1

from difflib import SequenceMatcher

Answer 2

подойти итерационно
типа ИНДЕКС