We showed how you can build an autocorrect based on Jaccard distance by returning also the probability of each word. We will create three different spelling recommenders, that each takes a list of misspelled words and recommends a correctly spelled word for every word in the list. For every misspelled word, the recommender should find the word in correct_spellings that has the shortest distance and starts with the same letter as the misspelled word, and return that word as a recommendation. Note: Each of the two different recommenders will use a different distance measure. Also, we will work with Q-grams which are equivalent to N-grams but they referred to characters instead of tokens.