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
watson-knowledge-studio
persistent-volume-claims
oci-terraform
hls.js
authlogic
qemu
jsencrypt
pyarmor
pygame-clock
graph-data-science
autodiscovery
switch-material
memoise
datepickerdialog
gstring
logonserver
annotation-processor
resx
fbspectrum
powerschool
dart-shelf
defineproperty
wonderware
devstack
jackson-dataformat-xml
contract-first
llvm-ir
doctrine-migrations
camel-zipfile
flutter-streambuilder