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
path-manipulation
bit
editmode
relative-addressing
hookrouter
httpwebrequest
caddy
urlize
objectscript
http-status-code-303
hyperledger-fabric
pdf.js
iteritems
org.json
okta
raspberry-pi3
uwb
samsung-galaxy-watch-4
reduction
timestep
django-orm
collective-intelligence
scikits
flask-testing
flutter-dialog
syslog4j
javafx
ossec
wine
fastparquet