Change to True or False types
./app/chartparser_app.py:1102: return 1
./app/chartparser_app.py:1103: return 0
./app/rdparser_app.py:544: return 1
./app/rdparser_app.py:548: return 0
./app/rdparser_app.py:558: return 1
./app/rdparser_app.py:562: return 0
./app/rdparser_app.py:576: return 1
./app/rdparser_app.py:581: return 0
./app/srparser_app.py:468: if self.reduce(): return 1
./app/srparser_app.py:469: elif self.shift(): return 1
./app/srparser_app.py:488: return 1
./app/srparser_app.py:489: return 0
./parse/recursivedescent.py:429: backtracking is possible, then backtrack, and return 1.
./parse/recursivedescent.py:430: Otherwise, return 0.
./parse/recursivedescent.py:449: return 1
./parse/recursivedescent.py:530: if len(self._history) == 0: return 0
./parse/recursivedescent.py:532: return 1
./parse/recursivedescent.py:568: if len(self._rtext) == 0: return 0
./parse/shiftreduce.py:140: if len(rightmost_stack) != len(rhs): return 0
./parse/shiftreduce.py:143: if not isinstance(rhs[i], Nonterminal): return 0
./parse/shiftreduce.py:144: if rightmost_stack[i].label() != rhs[i].symbol(): return 0
./parse/shiftreduce.py:146: if isinstance(rhs[i], Nonterminal): return 0
./parse/shiftreduce.py:147: if rightmost_stack[i] != rhs[i]: return 0
./parse/shiftreduce.py:148: return 1
./parse/shiftreduce.py:335: possible, then perform it, and return 1. Otherwise,
./parse/shiftreduce.py:336: return 0.
./parse/shiftreduce.py:354: if len(self._remaining_text) == 0: return 0
./parse/shiftreduce.py:357: return 1
./parse/shiftreduce.py:389: if len(self._history) == 0: return 0
./parse/shiftreduce.py:391: return 1
./stem/porter.py:243: if i == 0: return 0 # i == 0 never happens perhaps
./stem/porter.py:245: if not self._cons(word, i) or self._cons(word, i-1) or not self._cons(word, i-2): return 0
./stem/porter.py:249: return 0
./stem/porter.py:251: return 1
No Change
./ccg/chart.py:64: def dot(self): return 0
./ccg/chart.py:87: def length(self): return 1
./ccg/chart.py:89: def dot(self): return 0
./chunk/util.py:179: if self._tags_total == 0: return 1
./chunk/util.py:191: if div == 0: return 0
./chunk/util.py:203: if div == 0: return 0
./chunk/util.py:222: return 0
./chunk/util.py:223: return 1/(alpha/p + (1-alpha)/r)
./classify/util.py:92: return 0
./cluster/api.py:36: return 1.0
./cluster/api.py:38: return 0.0
./cluster/em.py:157: return 0
./cluster/util.py:127: return 1 - (numpy.dot(u, v) / (sqrt(numpy.dot(u, u)) * sqrt(numpy.dot(v, v))))
./compat.py:152: return 0
./corpus/reader/lin.py:76: return 1.0
./corpus/reader/wordnet.py:618: return 0
./corpus/reader/wordnet.py:699: 1 represents identity i.e. comparing a sense with itself will return 1.
./corpus/reader/wordnet.py:721: return 1.0 / (distance + 1)
./corpus/reader/wordnet.py:879: # frequency of 0 (sparse data problem), return 0.
./corpus/reader/wordnet.py:881: return 0
./corpus/reader/wordnet.py:888: return 1 / ic_difference
./corpus/reader/wordnet.py:1418: return 0
./downloader.py:554: if isinstance(item, Package): return 1
./featstruct.py:341: if id(self) in visited: return 1
./metrics/distance.py:102: return 0.0 if label1 == label2 else 1.0
./metrics/distance.py:135: return 1 - (len_intersection / float(len_union)) * m
./metrics/scores.py:115: return 0
./metrics/scores.py:116: return 1.0/(alpha/p + (1-alpha)/r)
./metrics/segmentation.py:174: return 0.0
./metrics/spearman.py:38: return 1 - (6 * float(res) / (n * (n*n - 1)))
./metrics/spearman.py:41: return 0.0
./parse/chart.py:367: def length(self): return 1
./parse/chart.py:369: def dot(self): return 0
./parse/pchart.py:51: def prob(self): return 1.0
./probability.py:199: return 0
./probability.py:418: return 0.0
./probability.py:1351: return 1.0
./probability.py:1353: return 1.0 * self._freqdist.Nr(1) / self._freqdist.N()
./probability.py:1437: return 0.0
./sem/evaluate.py:93: return 0
./test/wordnet.doctest:176:will return 1.
./tokenize/punkt.py:208: return 1
./tokenize/punkt.py:211: return 1
./tree.py:295: return 1 + max_child_height