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
http-token-authentication
electron-builder
hashicorp-packer
odm
taxonomy
element-ui
osgi-fragment
webkit-transition
matrix-profile
xirr
ikimagekit
pythonocc
valuechangelistener
pull
bukkit
qgraphicsitem
ops4j
accent-insensitive
rfc5322
fresco
stl-format
nettcpbinding
sanitize
lxml.html
external-dns
amazon-mws
static-pages
react-native-testing-library
scalafix
git-notes