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
swagger-ui
dllregistration
azure-virtual-network
grails3
flooding
function-expression
neo4j-browser
python-camelot
svg-morphing
bootstrap-table
fortran
etcd
jinternalframe
dft
nomnoml
elasticui
stoi
yocto-layer
nfsclient
extending-classes
opentbs
password-recovery
wordpress-rest-api
urlsplit
btcpay-server
kotlin-maven-plugin
avmutableaudiomixinputparameters
phoenix-channels
kiali
expirationhandler
