add SGS ingress

buildingmotif/ingresses/semantic_graph_synthesis.py

@@ -0,0 +1,49 @@
+from typing import List
+
+from rdflib import Graph, Namespace
+
+from buildingmotif.dataclasses import Library, Template
+from buildingmotif.ingresses.base import GraphIngressHandler
+from buildingmotif.ingresses.naming_convention import NamingConventionIngress
+from buildingmotif.semantic_graph_synthesizer.bindings_utils import (
+    evaluate_bindings,
+    unify_bindings,
+)
+from buildingmotif.semantic_graph_synthesizer.classes import TokenizedLabel
+from buildingmotif.semantic_graph_synthesizer.semantic_graph_synthesizer import (
+    SemanticGraphSynthesizer,
+)
+
+
+class SemanticGraphSynthesizerIngress(GraphIngressHandler):
+    def __init__(self, upstream: NamingConventionIngress, libraries: List[Library]):
+        self.upstream = upstream
+        self.libraries = libraries
+
+        self.sgs = SemanticGraphSynthesizer()
+        # Add templates from libraries; the synthesizer will look at these to determine the "best fit"
+        # for each group of input tokens
+        for library in libraries:
+            self.sgs.add_templates_from_library(library)
+
+    def graph(self, ns: Namespace) -> Graph:
+        g = Graph()
+        # converts the input records to TokenizedLabels
+        labels = [TokenizedLabel.from_dict(x.fields) for x in self.upstream.records]
+        # this groups labels into LabelSets based on shared sets of token classes.
+        # This is used to speed up the matching process as we can figure out which labels are compatible
+        bindings_list = self.sgs.find_bindings_for_labels(labels)
+        unified_bindings_list = unify_bindings(bindings_list)
+        # at this point, the unified_bindings_list contains the best fit for each group of input tokens
+
+        # for each group of labels, evaluate the bindings and add the resulting graph to the output
+        for ub in unified_bindings_list:
+            ev = evaluate_bindings(ub)
+            # if the evaluation returns a Template, we need to mint new URIs in the given namespace
+            # for any unbound parameters. If it returns a Graph, we can just add it to the output.
+            if isinstance(ev, Template):
+                _, graph = ev.fill(ns)
+            else:
+                graph = ev
+            g += graph
+        return g