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
authenticationchallenge
avalonedit
uglifyjs2
applitools
code-conversion
marginal-effects
systemevent
stylus
petri-net
node-addon-api
slicers
silktest
tableau-desktop
categorization
tiles
orientdb2.2
post-processor
entitygraph
glowroot
firebase-authentication
connection
yubikey
file-properties
qt5.9
fullpage.js
cmocka
virtual-pc
getfiles
windows-users
mergemap