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
upboard
skeleton-ui
gcc4.7
teradata-aster
reparsepoint
django-import-export
tokenize
getmodulefilename
yarnpkg
max-size
hidpi
thai
react-gql
mifos
kadena
rvalue-reference
adjacency-matrix
zarith
const-iterator
java-assist
producer-consumer
smtpappender
portaudio
bintray
kendonumerictextbox
mjs
composite-literals
aws-app-config
base-tag
shunting-yard