Given 2 strings s and t. I need to find for each substring in s edit distance(Levenshtein distance) to t. Actually I need to know for each i position in s what
dispose
bcp
asyncresttemplate
name-hiding
mfrc522
nebula
startup-error
connection-close
cross-window-scripting
fortify-source
resque-scheduler
superclass
dcevm
marp
pep585
network-protocols
aurora-near
pocketsphinx
odoo.sh
mobile-config
activity-indicator
android-signing
django-parler
text-based
osx-leopard
ldap3
sysadmin
forwarderrorcorrection
links
fastadapter