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
saleslogix
named-routing
method-dispatch
reswift
neo4j-driver
video-encoding
nestjs-config
newrow
static-methods
wincc
quicktime
google-advertising-id
ocx
azure-worker-roles
game-maker-language
jank
serenity-bdd
tfs-aggregator
quarkus-oidc
fbo
gaussian
goblin-graph-library
f#-3.1
chrome-native-messaging
decltype-auto
jetson-xavier
apfs
movabletype
signals2
apollo-angular