33
44class SparseArc : # sparse representation of an arc
55 def __init__ (self , head , dependent , s = 0.0 ):
6- self .head = int ( head )
7- self .dependent = int ( dependent )
6+ self .head = head
7+ self .dependent = dependent
88 self .score = s
99 self .feat_vec = []
1010
@@ -15,8 +15,8 @@ def __init__(self, head, dependent, s=0.0):
1515class FullArc : # full representation of an arc
1616 def __init__ (self , head , dependent , head_form , dependent_form , head_lemma , dependent_lemma , head_pos ,
1717 dependent_pos , dependent_rel , s = 0.0 ):
18- self .head = int ( head )
19- self .dependent = int ( dependent )
18+ self .head = head
19+ self .dependent = dependent
2020 self .score = s
2121 self .feat_vec = []
2222
@@ -59,7 +59,7 @@ def __init__(self, tokens):
5959 new_arc = SparseArc (token1 .id , token2 .id )
6060 dependents .append (new_arc )
6161 if dependents :
62- self .heads [int ( token1 .id ) ] = dependents
62+ self .heads [token1 .id ] = dependents
6363
6464
6565class FullGraph : # full representation of a graph (keys: heads, values: FullArc objects)
@@ -77,7 +77,7 @@ def __init__(self, tokens):
7777 token1 .pos , token2 .pos , token2 .rel )
7878 dependents .append (new_arc )
7979 if dependents :
80- self .heads [int ( token1 .id ) ] = dependents
80+ self .heads [token1 .id ] = dependents
8181
8282
8383class CompleteFullGraph : # complete, full representation of a graph (keys: heads, values: FullArc objects)
@@ -90,12 +90,12 @@ def __init__(self, tokens):
9090 self .heads [0 ].append (new_arc )
9191 for token1 in tokens :
9292 dependents = []
93- for token2 in tokens :
93+ for token2 in ( token2 for token2 in tokens if token2 . head == token1 . id ) :
9494 new_arc = FullArc (token1 .id , token2 .id , token1 .form , token2 .form , token1 .lemma , token2 .lemma , \
9595 token1 .pos , token2 .pos , token2 .rel )
9696 dependents .append (new_arc )
9797 if dependents :
98- self .heads [int ( token1 .id ) ] = dependents
98+ self .heads [token1 .id ] = dependents
9999
100100
101101def reverse_head_graph (graph ): # reverses a normal graph to a graph where the dependents are the keys
0 commit comments