code: def results(self):
          
          d = dict()
          words = [word.strip() for word in self.haystack]
  
          if not words:
              raise NoResultException('No similar word found.')
  
          for w in words:
              d[w] = Levenshtein.ratio(self.needle, w)
  
          return sorted(d.items(), key=operator.itemgetter(1), reverse=True)
docs: Returns a list of tuple, ordered by similarity.