Can MAGI footnote relationships be used for knowledge graph construction? #7
-
|
The footnote relationship system caught my eye. In my work with analytics, we build knowledge graphs to map data lineage and dependencies. The typed Has anyone experimented with:
This could be powerful for data catalog and lineage tracking. |
Beta Was this translation helpful? Give feedback.
Replies: 4 comments
-
|
This is one of the things that excited me most about MAGI. The footnotes essentially give you a pre-built edge list for a knowledge graph. You could parse
Combined with |
Beta Was this translation helpful? Give feedback.
-
|
We're actually exploring something similar. The advantage over pure NLP-based graph construction is that MAGI relationships are author-defined, so they're more accurate than inferred relationships. For data lineage specifically, you could define custom The combination of explicit relationships (footnotes) + implicit relationships (shared entities/tags) gives you both precision and discovery. |
Beta Was this translation helpful? Give feedback.
-
|
This is exactly what I was hoping to hear. The author-defined vs. NLP-inferred distinction is important for compliance - auditors want to know that lineage relationships were intentionally documented, not guessed. I'm going to prototype a MAGI-to-Neo4j ingestion pipeline. The front matter gives me node properties, footnotes give me edges, and ai-script blocks could even automate the generation of missing relationship suggestions. Will report back. |
Beta Was this translation helpful? Give feedback.
-
|
We've actually prototyped this! Using the footnote relationships to build a Neo4j knowledge graph. The workflow:
The biggest win was for our internal compliance docs where regulatory requirements cascade through multiple document layers. The Would be happy to share the parser script if there's interest — it's about 80 lines of Python. |
Beta Was this translation helpful? Give feedback.
This is one of the things that excited me most about MAGI. The footnotes essentially give you a pre-built edge list for a knowledge graph.
You could parse
.mdafiles and for each footnote:doc-idin front matter = source nodedoc-idin footnote = target noderel-type= edge typerel-desc= edge metadataCombined with
entitiesas node properties andtagsfor clustering, you've got a rich graph without any NLP extraction needed - the relationships are already explicit.