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
angular-flex-layout
alglib
jpa-annotations
indesign-server
signalr-backplane
boost-mpl
react-thunk
microprocessors
intel-vtune
clang++
analytical
clearscript
sessionid
net.p2p
unix-socket
docker-registry-mirror
azure-cosmosdb-tables
genstrings
diagnostics
slowmotion
cgsize
jquery-collision
flash-media-server
interactive-shell
dnssec
halogen
skstorereviewcontroller
monetdb-assembly-language
cartridge
gem-fury