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
sa-mp
cvs
progress-4gl
syncdb
venn-diagram
jacorb
genius-api
format-specifiers
uiimagepickercontroller
google-cloud-translate
input-language
code-documentation
grep
webpack-stream
flutter-date-range-picker
google-cloud-functions
es5-shim
trello
madexcept
spring-reactive
atom-liveserver
ganglia
nlg
gtk2hs
libtomcrypt
dynamicobject
tph
dronekit-android
git-bare
rspec3