How to use JSON-LD Reference Graph Auditor
- Enter one document, an array of documents or supported @graph objects containing the identities you want to compare.
- Supply the separate local context and base URL. Embedded @context values are ignored with a note; strings become reference values only where the supported context declares that behavior.
- Choose a supplied definition in the updated inspector. Use Jump to supplied definition for declared reference targets; unentered targets remain unresolved within this evidence.
- Review repeated identities, differing declared types and cycles as separate observations. Download the graph, complete edge CSV or text report if needed.
Example: JSON-LD Reference Graph Auditor
Compare two documents sharing Alex’s identity, with two unresolved references and a mutual Alex/Sam relationship cycle.
Options
- Local context
- Only the supported term/vocabulary and reference declarations are expanded. Remote contexts are never retrieved.
- Node identity
- Explicit identities can connect declarations across documents. A reference without a declaration remains unresolved within the supplied evidence.
- JSON-LD documents
- One JSON value: a document, an array of documents, or objects with an @graph array. Up to 12 documents, 500 nodes and 200,000 characters.
- Local context subset
- A JSON object with @vocab plus optional term definitions. A term may map to a string IRI or an object with "@id" and/or "@type": "@id" to mark reference values. Nothing is fetched.
- Base URL for relative values
- Relative @id values resolve against this address locally. It is never requested.
Supported inputs and limits
- Up to 12 documents, 500 nodes, 200,000 document characters and 30 nesting levels.
- Separate context JSON is limited to 40,000 characters and a local vocabulary/term/reference subset.
- Embedded contexts are ignored; remote contexts and declarations are not fetched.
- Blank-node labels are scoped per document.
- The result table shows up to 300 edges; exports retain the supported complete graph.
More details
No full JSON-LD expansion, RDF reasoning, vocabulary certification or rich-result eligibility check.
Where your input is processed
This tool does not upload your inputs. See the limits for anything saved on your device.
A relationship cycle can be valid
Two people can reference one another without making the JSON-LD invalid. Review repeated declarations and conflicting supplied types as separate findings. The bounded graph does not perform RDF reasoning, certify full JSON-LD expansion or establish search rich-result eligibility.
Questions about JSON-LD Reference Graph Auditor
Is every cycle an error?
No. Cycles are shown as relationships and can be valid.
Are external contexts loaded?
No. Use the supported local context subset for this inspection.
Does an unresolved edge prove invalid data?
The referenced declaration may exist outside the documents you supplied.