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
brms
openvms
sqoop2
google-roads-api
event-dispatching
eof
azure-cloud-services
dbca
outlook-restapi
next-pwa
largenumber
dask-distributed
katana
bunyan
clickhouse-backup
graphql-tag
android-library
crt
aws-certificate-manager
ilias
xelatex
facade
powerset
a2dp
ews-javascript-api-auth
microsoft-graph-cloudcommunications
kreya
finalizer
pipe
node.js-connect