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
clojure-java-interop
telerik
css-contain
aspell
xc16
stddraw
moles
typecasting-operator
synk
uri-fragment
cufflinks
pyvimeo
container-queries
odoo-view
facebook-c#-sdk
trilinos
.net-standard
latex2exp
ekrecurrencerule
sdwebimage
stretching
angular-chart
jubula
code-size
infobox
fc
osclass
innodb
failed-to-connect
polykinds