Home | History | Annotate | Download | only in python2.7

Lines Matching full:ratio

79     .ratio() returns a float in [0, 1], measuring the "similarity" of the
80 sequences. As a rule of thumb, a .ratio() value over 0.6 means the
83 >>> print round(s.ratio(), 3)
144 ratio()
148 Return an upper bound on .ratio() relatively quickly.
151 Return an upper bound on ratio() very quickly.
228 >>> s.ratio()
241 >>> s.ratio()
244 >>> s.ratio()
267 >>> s.ratio()
270 >>> s.ratio()
636 def ratio(self):
644 .ratio() is expensive to compute if you haven't already computed
650 >>> s.ratio()
663 """Return an upper bound on ratio() relatively quickly.
665 This isn't defined beyond that it is an upper bound on .ratio(), and
692 """Return an upper bound on ratio() very quickly.
694 This isn't defined beyond that it is an upper bound on .ratio(), and
695 is faster to compute than either .ratio() or .quick_ratio().
743 s.ratio() >= cutoff:
744 result.append((s.ratio(), x))
986 # note that ratio() is only expensive to compute the first
991 cruncher.ratio() > best_ratio:
992 best_ratio, best_i, best_j = cruncher.ratio(), i, j