<SYSTEM_TASK:>
Solve the following problem using Python, implementing the functions described below, one line at a time
<END_TASK>
<USER_TASK:>
Description:
 def results(self):
 """ Returns a list of tuple, ordered by similarity. """

        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)