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
rich-internet-application
pubmed
custom-font
array-multisort
extjs-stores
abstract-methods
node-supervisor
react-new-window
mercurial-phases
dhl
androidjunitrunner
xamarin.forms.collectionview
java-native-library
steep
cgimage
qsa
android-assetmanager
watir
strictfp
dfply
camel-cxf
workqueue
ogre
chomsky-normal-form
azkaban
asp.net-mvc-5
graphql-dotnet
getresponsestream
horizontalpodautoscaler
nsoperationqueue
