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
netlify-function
lowercase
rust-diesel
clrprofiler
gnark
panflute
trivially-deconstructible
android-snackbar
oslo
cancelanimationframe
win32con
ktorm
service-worker-config
auth0-lock
e2e-testing
rails7
ssrf
azure-sql-managed-instance
border-image
minix
ocg
lbph-algorithm
standard-deviation
amazon-lex
rollupjs
metatrader4
run-script
onevpl
open-policy-agent
hyperledger-caliper