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
ms-jet-ace
xlsm
liquibase-hibernate
slim-jquery
sql-server-2019
skeletal-mesh
worker
mri
spark-kafka-integration
base-class
move-constructor
string-operations
git-init
sciter
wcfserviceclient
facebook-social-plugins
swd
recording
action-filter
wfastcgi
splitbrain
ctad
bindingflags
huawei-account
heapalloc
android-studio-4.2
wkb
promql
saaj
microsoft-live-meeting