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
fluentd
contentful-management
base32
gui-builder
helper
html5lib
ui-scroll
direct2d
swupdate
firebase-console
clip
rdiff-backup
swish
matrix-profile
bzip
anki
git-credential-winstore
vichuploaderbundle
submatrix
spring-java-config
linqpad
triton
pygubu
capture
electron-builder
minimal-apis
spring-jersey
xcode4.3
inputaccessoryview
qt5.11
