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
tomcat5.5
g2o
android-filter
package-development
renaming
yfinance
meld
xcode-tools
quad
fringe
flutter-state
amazon-elb
grails-2.0
restore-points
cncontactformatter
future-warning
workbox
figma-api
column-alias
yui
css-animation-direction
gimp
sling
dcgan
ultimate-member
sparqlwrapper
android-diffutils
call-flow
qgraphicspixmapitem
centos7