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
gkmatchmaker
winlogon
bonferroni
node-ffi
uiviewanimationtransition
equality
python-zipfile
word-interop
open-flash-chart
mendel-os
scopus
cmake-custom-command
spring-cloud-gateway
graph-api-explorer
color-conversion
aiortc
power-apps-custom-connector
sign-in-with-google
projection
fetch-metadata
antd-mobile
popper.js
system-testing
federation
spring-projections
sapui5
web-scripting
sqoop2
vosk
racing
