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
dynamic-loading
roku
prototype-pattern
nsstring
spring-expression
cssnext
ilogger
installanywhere
tcplistener
fuelphp
microk8s
dcraw
cypher-shell
jsxgraph
nonetype
infrared
pljava
apple-mail
jst
tokenuri
ocg
sqlite-json1
newrow
pyo3
mongodb-3.6
independent-set
safari-push-notifications
nested-statement
accumulo
gst-launch