In graph reinforcement, observed mappings were modeled as a bipartite graph with source (S) and target (T) character sequences and weighted with the learnt alignment probabilities (M).
the mapping between s ∈ S and t ∈ T was m(s,t).