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
spectral-density
applicationsettingsbase
blockingqueue
sas-gtl
http-proxy-middleware
clojurescript-javascript-interop
tasker
react-snap
bazel-query
opendj
ctc
internal-link
cumulus
ionicons
scene7
h2o-wave
icontrol
radupload
move-constructor
iab
porter-stemmer
amazon-cloudwatch-metrics
pdf.js
sardine
fortify
overload-resolution
fftw
bentley-itwin
pdfptable
tac