Module graph_match 

Fuzzy RDF graph matching (Ma, Li & Ma) — degree-aware similarity and the approximate subgraph match that is the identity-reconciliation primitive.

• fuzzy_similarity — fuzzy Jaccard / Dice over degree-bearing triples.
• approximate — ranked, tolerant subgraph matching → a closeMatch proposal with a degree (never an asserted identity).

Re-exports

pub use approximate::approximate_match;

pub use approximate::MatchResult;

pub use fuzzy_similarity::fuzzy_dice;

pub use fuzzy_similarity::fuzzy_jaccard;

pub use fuzzy_similarity::FuzzyTriple;

Modules

approximate

Approximate fuzzy subgraph matching (Ma, Li & Ma ch 5.3) — find the mapping of a query pattern’s nodes onto a data graph that best matches it, tolerantly and ranked by a fuzzy score. This is the machine-proposes half of “machine proposes closeMatch, signed human ratifies exactMatch”: it returns a mapping and a degree, never a resolved identity (the out-of-band-remainder invariant).

fuzzy_similarity

Fuzzy RDF graph similarity (Ma, Li & Ma ch 3.4) — a degree-aware similarity between two fuzzy RDF graphs (triples carrying a membership degree). The fuzzy Jaccard generalizes set overlap to graded membership: shared structure counts in proportion to how strongly both graphs assert it. Kernel-class Reduction.