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
mongoose-schema
unity-test-framework
parallel-execution
fieldlist
optionmenu
database-deployment
socketrocket
hamming-numbers
conky
go-micro
jls
qnetworkaccessmanager
java.nio.file
akka
powershell-v5.1
office365api
checked-exceptions
ios7.1
owl-api
darkaonlinel5-swagger
metamodel
linux-distro
notistack
last-modified
heaps-algorithm
react-native-splash-screen
skadnetwork
mixed-case
anonymous-access
sr-feuser-registration