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
libzip
whitespace
mapbox-gl-geocoder
gcdwebserver
processor
waitforsingleobject
sdmx
template-variables
lazziya.expresslocalization
android-authenticator
address-bar
pyeda
jks
digraphs
message-map
term-query
offsetwidth
du
arrow-kt
muxer
non-web
has-many-through
lighthouse-ci
mongoskin
pdf-writer
modelmetadata
precision-recall
jaws-screen-reader
mat-input
cdda