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
game-maker-studio-1.4
xai
b-lang
exceed
mysql
large-object-heap
workbox
react-apollo-hooks
class-validator
shallow-copy
atoti
pyfmi
accelerated-mobile-page
partial-methods
flask-cache
seeding
menu-items
swiftui-zstack
nhibernate-mapping
popup
quasiquotes
aws-permissions
dynamics-nav-2013
dotnetnuke-5
balance
noindex
skeleton-css-boilerplate
owner
formborderstyle
circleimage