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
cisco
brakeman
kotlin-reified-type-parameters
sceneview
smtpappender
fido
sketchup
vimdiff
sentence-similarity
stringwriter
dynamicparameters
deployment">deployment
stdbool
auctex
try-catch-finally
confluent-rest-proxy
cld2
gitea
firepad
datomic
.net-core-3.1
evolutionary-algorithm
odoo-9
scope
urlrequest
nerdtree
jspinclude
u8darts
rethinkdb-javascript
varray