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
cherokee
trailing-slash
table-locking
low-level-code
oculusgo
acra
pdf-viewer
winsxs
ivy
structural-equation-model
include-guards
amphp
apollostack
lowpass-filter
numba
scaling
documentum-d2
turn-by-turn
flutter-get
blackmagic
plc
fancytree
aws-sdk-go
ps2exe-gui
incredibuild
sqlite-net-extensions
google-drive-picker
jemalloc
etcd2
debugdiag