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
mit-scratch
fetchall
process-monitoring
data-masking
queryover
non-english
tkinter-photoimage
remote-administration
word-count
self-signed
iocp
mt940
bulletphysics
insertafter
dojo-1.6
corretto
chessboard.js
modal-sheet
spin
ssjs
rxjs7
junction-table
hierarchical-clustering
azure-sql-server-managed-instance
javascript-injection
ggmosaic
text-styling
hover
send-port
android-application-restart