Sai Rama Akash Varma Sagi
Author directory2026
Cinematic Compiler: A Typed Intermediate Representation with a Deterministic Pre-Generation Constraint Checker for Multi-Shot Keyframe Continuity
Sai Rama Akash Varma Sagi | Karthik Vemireddy | Sai Ganesh Akula
Proceedings of the 15th International Joint Conference on Natural Language Processing and the 5th Conference of the Asia-Pacific Chapter of the Association for Computational Linguistics: System Demonstrations
Sai Rama Akash Varma Sagi | Karthik Vemireddy | Sai Ganesh Akula
Proceedings of the 15th International Joint Conference on Natural Language Processing and the 5th Conference of the Asia-Pacific Chapter of the Association for Computational Linguistics: System Demonstrations
Large language model-based generation pipelines commonly transform natural-language requests into structured plans before invoking expensive downstream generators, yet these plans are rarely verified before generation. We present Cinematic Compiler, an interactive system that compiles a short narrative brief into a typed Cinematic Intermediate Representation containing shots, design specifications, entity schedules, and explicit per-shot continuity constraints. A deterministic pre-generation pass checks that every shot carries the required character, costume, prop, and location facts, propagates missing constraints, and rejects contradictory briefs before any generation cost is incurred. At rendering time, the system conditions each shot on a shared character reference image using a frozen commodity image-generation backend, followed by vision-based auditing and reference-anchored repair. Across 15 benchmark briefs, the full constraint pass achieves 100% plan-level constraint coverage, compared with 2.2% for direct prompting, 22.8% for LLM-expanded prompting, and 36.5% for the intermediate representation without propagation. Reference anchoring improves identity-to-reference similarity from 0.605 to 0.714 across 13 briefs, with gains on 12 of 13 briefs, while matched text-only prompting produces no significant improvement. We further show that pairwise cross-shot similarity can reward degenerate near-static generations and therefore report identity preservation jointly with visual dynamic degree. The demonstration allows users to compile, inspect, edit, verify, generate, audit, and repair multi-shot stories through an interactive canvas, while supporting offline replay of stored runs.
2024
LeGen: Complex Information Extraction from Legal sentences using Generative Models
Chaitra C R | Sankalp Kulkarni | Sai Rama Akash Varma Sagi | Shashank Pandey | Rohit Yalavarthy | Dipanjan Chakraborty | Prajna Upadhyay
Proceedings of the Natural Legal Language Processing Workshop 2024
Chaitra C R | Sankalp Kulkarni | Sai Rama Akash Varma Sagi | Shashank Pandey | Rohit Yalavarthy | Dipanjan Chakraborty | Prajna Upadhyay
Proceedings of the Natural Legal Language Processing Workshop 2024
Constructing legal knowledge graphs from unstructured legal texts is a complex challenge due to the intricate nature of legal language. While open information extraction (OIE) techniques can convert text into triples of the form subject, relation, object, they often fall short of capturing the nuanced relationships within lengthy legal sentences, necessitating more sophisticated approaches known as complex information extraction. This paper proposes LeGen – an end-to-end approach leveraging pre-trained large language models (GPT-4o, T5, BART) to perform complex information extraction from legal sentences. LeGen learns and represents the discourse structure of legal sentences, capturing both their complexity and semantics. It minimizes error propagation typical in multi-step pipelines and achieves up to a 32.2% gain on the Indian Legal benchmark. Additionally, it demonstrates competitive performance on open information extraction benchmarks. A promising application of the resulting legal knowledge graphs is in developing question-answering systems for government schemes, tailored to the Next Billion Users who struggle with the complexity of legal language. Our code and data are available at https://github.com/prajnaupadhyay/LegalIE