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
aop
installation-path
seq2seq
mercury
posthtml
fira-code
azure-servicebus-topics
openmrs
mobile-browser
figlet
android-music-player
senchatouch-2.4
charindex
copy-paste
rails-admin
gluon
autoprefixer
turbo-c++
redislabs
internet-explorer-10
roulette-wheel-selection
tor
object-hash
sna
icloud-documents
fishpig
dummy-data
haskell-wai
covariant-return-types
sliver-grid