def main(self, treeFile1, treeFile2):
trees1 = ma_util.readPenn(treeFile1)
trees2 = ma_util.readPenn(treeFile2)
for (t1, t2) in itertools.izip_longest(trees1, trees2, fillvalue=F):
if t1 == F or t2 == F:
raise ValueError('Tree length not equal or other breakage')
self.handleTree(t1, t2)
self.printSummary(self.total, self.correct, self.gold, self.predicted)
if self.interesting:
self.printSummary(self.totalI, self.correctI)
def main(fileName, n):
trees = ma_util.readPenn(fileName)
for tree in trees:
if len(tree.leaves()) >= n:
print "Sentiment: %s" % tree.node
print map(lambda x: x.encode('utf-8'), tree.leaves())
