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
gaps-and-islands
dita
react-leaflet
duplication
bucket
edmx-designer
redisjson
directoryentry
vue-treeselect
azure-automation
mod-python
angular-translate
powershell-sdk
amazon-rekognition
barbajs
ransac
svelte-store
postgresql-14
short-circuit-evaluation
grasshopper
quay.io
nest-asyncio
sensenet
coroutine
value-iteration
quarto
azure-data-factory-2
building
code-coverage
aspnet-compiler