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
word-boundaries
awsdeploy
java-test-fixtures
contactsui
firebase-mlkit
pysolr
mikro-orm
google-sso
tempus-dominus-datetimepicker
oboe
pdfpage
symbian
webdriver-w3c-spec
dijit.dialog
google-maps-android-api-3
textualize
rngcryptoserviceprovider
botium-box
racklog
intel-myriadx
visual-studio-liveshare
angular-state-managmement
delphi-2009
projectwise
webbrowser-control
javascript-globalize
polaris
userinfo
emacs-prelude
motorola-emdk