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
jblas
property-observer
spring-boot-jpa
arrayofarrays
android-studio-2.2
integer
culling
truthtable
mysql-x-devapi
plist
watson-conversation
uint16
plutus
mule
foundry-workshop
elaboration
react-simple-maps
widget
map-directions
uri.js
matlab-spm
seq-logging
examplematcher
calloc
kotlin-script
batching
signal-strength
composite-key
exiftool
jackson-dataformat-avro