More debugging

cky_algo.py

@@ -44,6 +44,10 @@ def get_max_of_all(i, j, sent, X, pg):
     best = float("-inf")
     Y = None
     Z = None
+    best_right = float("-inf")
+    best_left = float("-inf")
+    LEFT = ''
+    RIGHT = ''
 
     for rule in rule_possibilites:
         for s in range(i, j):
@@ -54,14 +58,23 @@ def get_max_of_all(i, j, sent, X, pg):
             right, p_right = cky_help(s+1, j, sent, z, pg)
 
             prob = p_right + p_left + p_rule
-            #if i == 0 and j == len(sent) - 1:
-             #   print y, z, p_rule, p_right, p_left
-
-
+            if i == 0 and j == len(sent) - 1:
+                print y, z, rule, p_rule, left, p_left, right, p_left
+
+            if best_left < p_left:
+                best_left = p_left
+                LEFT = left
+            if best_right < p_right:
+                best_right = p_right
+                RIGHT = right
             if prob > best:
                 best = prob
                 Y = left
                 Z = right
+
+    if i == 0 and j == len(sent) - 1:
+        print "AND THE FINAL RESULTS ARE:"
+        print LEFT, best_left, RIGHT, best_right
 
     return Y, Z, best
 
@@ -84,5 +97,5 @@ def write_trees(json_trees, dest_name):
             dest.write('\n')
 
 if __name__ == '__main__':
-    main(ProbGen('new.counts'), 'problem_sentences.dat', 'out_problem.dat')
+    main(ProbGen('new.counts'), 'problem_sentences.dat', 'problem_out.dat')
 

out_problem.dat

@@ -0,0 +1 @@
+["SBARQ", ["WHADVP+ADV", "Where"], ["SBARQ", ["SQ", ["VERB", "is"], ["SQ", ["NP", ["DET", "the"], ["NP", ["NP", ["NOUN", "massive"], ["NOUN", "North"]], ["PP", ["ADP", "Korean"], ["NP", ["NOUN", "nuclear"], ["NOUN", "complex"]]]]], ["VP+VERB", "located"]]], [".", "?"]]]

out_problems.dat

@@ -0,0 +1 @@
+["S", ["NP", [".", null, null], ["NP+NOUN", "located"]], ["S", "?"]]

problem_out.dat

@@ -0,0 +1 @@
+["SBARQ", null, null]

problem_sentences.dat

@@ -0,0 +1 @@
+What are John C. Calhoun and Henry Clay known as ?