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
dynamics-business-central
onconfigurationchanged
udpipe
python-vlc
sqlcl
getspanend
angelscript
class-instance-variables
ginac
symfony-4.4
networkd3
signed-integer
requests-mock
android-trafficstats
kontent-ai
protocolexception
equals-operator
raw-types
gradle-wrapper
prestashop-1.6
rars-simulator
argo-cron-workflows
left-recursion
astoria
freetext
pymodbustcp
rope
rotor
reactor
qjson
