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
deepface
bexio
r5r
azure-nsg
workload-scheduler
qemu
linkedin-api
selenium-firefoxdriver
thrift
company-mode
flow-framework
bleu
circularreveal
prototypal-inheritance
opentripplanner
angular4-httpclient
jenkins-slack-plugins
zend-debugger
google-workflows
m
airflow-connections
bmc
seqlock
tsconfig-paths
wso2mi
datarow
probot
transformable
azure-blob-trigger
openwebstart