Skip to content
Open access

EVENTFORGE: OPTIMIZABLE EVENT SCHEMA INDUCTION WITH HYBRID RAG+KG STORAGE

Aug 2026 · World Journal of Advanced Research and Reviews · Vol 31, pp. 584-591 · 1 citation

TL;DR

This paper presents EventForge, an open-source system that reframes schema induction as typed DSPy programs and co-locates the induced knowledge graph with a hierarchical dense-retrieval index in a single PostgreSQL/pgvector substrate.

Abstract

Scientific literature, incident reports and technical documents encode process knowledge that is largely opaque to keyword search and modern retrieval-augmented generation. Event schema induction makes this knowledge available as a queryable graph, but current large-language-model inducers are often organized as hand-crafted prompt cascades that are brittle across models and difficult to improve from data. This paper presents EventForge, an open-source system that reframes schema induction as typed DSPy programs and co-locates the induced knowledge graph with a hierarchical dense-retrieval index in a single PostgreSQL/pgvector substrate. The system reads PDFs, extracts event candidates with DSPy ChainOfThought modules, removes near duplicates with sentence-embedding similarity, stores events in a NetworkX graph, and persists graph and retrieval artifacts together for hybrid RAG+KG querying. On a 12-PDF corpus spanning medical imaging, remote sensing, LLM security, and curriculum learning, EventForge induces 393 events and 286 graph relationships in 497.8 seconds on gpt-4o-mini, with a 6.2% near-duplicate rejection rate. The study reports system behavior, runtime, cost, graph yield, duplicate control, and implementation limitations, while leaving gold-standard event and edge F1 evaluation for future work.

Read PDF

Similar papers

Open access 2026

EviGraphRAG: Constraint-Verified Retrieval-Augmented Question Answering over Event Knowledge Graphs

EviGraphRAG is proposed, a ranker-agnostic reliability layer that separates candidate ranking from exact verification and explicit abstention, and exact conjunction over represented event constraints and linked source-record connectivity can improve selective reliability, while parser quality and candidate retrieval re...

Yu-Teng Sun, Yang Su, Xu-An Wang · 0 citations
#artificial intelligence Preprint Aug 2026

post-graph-rag: A PostgreSQL-Native Graph RAG Engine

Post-graph-rag builds a denser graph everywhere, answers comparably with lower query latency, and supports temporal evolution the baseline lacks: 13 and 8 relationships superseded on a novel sequence and a decade of filings, against zero.

C. Rajah · 0 citations
#artificial intelligence Preprint Sep 2026

Build2SPARQL: A Large-Scale Text-to-SPARQL Benchmark Dataset for Building Knowledge Graph Querying

Building automation systems are increasingly represented as semantic knowledge graphs (KGs) using ontologies such as Brick and ASHRAE 223P, creating a machine-readable substrate for artificial-intelligence applications. One promising application is translating natural-language questions into SPARQL (text-to-SPARQL), wh...

Wooyoung Jung · 0 citations
#machine learning Preprint Sep 2026

Machine-Interpretable Information: Compiling Documents into Searchable and Readable Protocol States

This work introduces Machine-Interpretable Information (MII), the first agent-to-agent (A2A) document-to-state protocol, and demonstrates strong cross-model interoperability across heterogeneous LLMs -- despite the Writer using a legacy GPT-2 vocabulary, forcing genuine semantic translation rather than token-level memo...

Yi-Fan Wang, De-Jing Dou · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.