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
swift-composable-architecture
xib
richedit
shift-jis
eslint-plugin-import
virtual-device-manager
id-card
thinky
pusher-js
termsql
quicksight-embedding
embedding
recording
object-properties
yaf
android-typeface
coldfusionbuilder
initializing
leakcanary
performselector
docker-api
gridsearchcv
mpeg
aspxcombobox
v4-printer-driver
signal-processing
pose-detection
web-frameworks
non-english
google-datalayer
