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
bridging-header
embree
pg8000
azure-iot-dps
libmproxy
command-window
print-job-control
ruby-on-rails-5.2
gdal-python-bindings
localbroadcastmanager
neosemantics
azure-pipelines-release-task
aws-storage-gateway
mouse-position
cocor
flutter-text
hierarchical-trees
swift-optionals
sitecore-xdb
keepass
django-database-functions
objective-c-2.0
gamma-function
constraintlayout-barrier
playback-rate
gmail-pop
komodo
zend-framework
stored-procedures
nullif