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
ipaas
exoplayer-media-item
tdd
boilerplate
ash
mount
vigra
hostname
hoisting
cloc
maplist
infrastructure-as-code
netflix-ribbon
amazon-ecr
asp.net-core-hosted-services
ruby-comparable
pyxel
boundfield
tippyjs
google-news
sprint
ipvs
soql
jquery-ui-autocomplete
oauth-2.1
metatable
cdktf
supercollider
ghidra
librt