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
pyad
high-load
art-runtime
infinispan
static-site-generation
safenet
md-chip
livebindings
aura-framework
mupdf
allegrograph
jacoco
dingo-api
tinkercad
mailgun
info
web-developer-toolbar
aad-pod-identity
yodlee
linqpad
pivot-table
httplistenerrequest
pandoc
ruby-on-rails-5
python-descriptors
postorder
gff
javafx-8
at-sign
compilationmode