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
etcd
cgitb
vimgrep
dart-async
pwabuilder
rightnow-crm
myst
rgtk2
tcpserver
ironsource
altivec
payment-processing
upstream-branch
unnamed-namespace
webdynpro
startup-error
vectorization
xml-libxml
imputation
tree-shaking
4d-database
qt5.11
pbm
passive-event-listeners
spring-social-twitter
ash
qtpositioning
ie-compatibility-mode
pysyft
android-memory