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
uikeyboard
dtd-parsing
libhdfs
graphqlclient
xps
advantage-database-server
caemitterlayer
icmpv6
phrets
strcmp
stencil-compiler
cwd
return-type
ansible-vault
dfm
subpixel
strict-transport-security
external-url
json-annotation
plumatic-schema
labview
sharp-snmp
dx-data-grid
redis-rdb
eye-tracking
angular-jest
obspy
client-library
mplcursors
integrate
