Loading src/absinth.py +3 −3 Changes for src/absinth.py: 3 added lines, 3 removed lines. Original line number Diff line number Diff line Loading @@ -608,10 +608,10 @@ def colour_graph(graph: nx.Graph, root_hub_list: list) -> nx.Graph: return graph def disambiguate_colour(graph: nx.Graph, root_hub_list, context_list: list) -> dict: def disambiguate_colour(graph: nx.Graph, root_hub_list: list, context_list: list) -> dict: """Clusters senses to root hubs using a coloured graph. This algorithm colours the graph using (a method with a name i don't know) This algorithm colours the graph using evolutionary graph theory and calculates scores for each root hub given a context based on this graph. Args: Loading Loading @@ -766,7 +766,7 @@ def disambiguate_mst(graph: nx.Graph, root_hub_list: list, pass # If disambiguator does not detect a sense, return singleton. if np.max(score_array) == 0: if any(score_array): pass Loading Loading
src/absinth.py +3 −3 Changes for src/absinth.py: 3 added lines, 3 removed lines. Original line number Diff line number Diff line Loading @@ -608,10 +608,10 @@ def colour_graph(graph: nx.Graph, root_hub_list: list) -> nx.Graph: return graph def disambiguate_colour(graph: nx.Graph, root_hub_list, context_list: list) -> dict: def disambiguate_colour(graph: nx.Graph, root_hub_list: list, context_list: list) -> dict: """Clusters senses to root hubs using a coloured graph. This algorithm colours the graph using (a method with a name i don't know) This algorithm colours the graph using evolutionary graph theory and calculates scores for each root hub given a context based on this graph. Args: Loading Loading @@ -766,7 +766,7 @@ def disambiguate_mst(graph: nx.Graph, root_hub_list: list, pass # If disambiguator does not detect a sense, return singleton. if np.max(score_array) == 0: if any(score_array): pass Loading