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
pmml
quickgraph
section508
range-types
azure-blockchain-workbench
scoring-profile
replit
sink
google-image-search
circlize
aws-networking
autoloader
tokbox
engopen
mkmapviewdelegate
treap
phpfog
primefaces-extensions
perfect-square
frame-grab
alloca
tail-recursion
ubuntu-9.04
monetdb-assembly-language
rxtest
que
datadetectortypes
phppresentation
yardstick
payment-gateway