Type-Directed Synthesis of Visualizations from Natural Language Queries
We propose a new technique based on program synthesis for automatically generating visualizations from natural language queries. Our method parses the natural language query into a refinement type specification using the intents-and-slots paradigm and leverages type-directed synthesis to generate a set of visualization programs that are most likely to meet the user's intent. Our refinement type system captures useful hints present in the natural language query and allows the synthesis algorithm to reject visualizations that violate well-established design guidelines for the input data set. We have implemented our ideas in a tool called Graphy and evaluated it on NLVCorpus, which consists of 3 popular datasets and over 700 real-world natural language queries. Our experiments show that Graphy significantly outperforms state-of-the-art natural language based visualization tools, including transformer and rule-based ones.
Thu 1 DecDisplayed time zone: Auckland, Wellington change
01:00 - 02:30 | |||
01:00 15mResearch paper | SHARP: fast incremental context-sensitive pointer analysis for JavaPre-recorded V-OOPSLA DOI | ||
01:15 15mTalk | Reasoning about Distributed Reconfigurable Systems V-OOPSLA Emma Ahrens RWTH Aachen University, Marius Bozga CNRS; Université Grenoble Alpes, Radu Iosif CNRS; Université Grenoble Alpes, Joost-Pieter Katoen RWTH Aachen University DOI | ||
01:30 15mTalk | Type-Directed Synthesis of Visualizations from Natural Language Queries V-OOPSLA Jocelyn (Qiaochu) Chen University of Texas at Austin, Shankara Pailoor University of Texas at Austin, Celeste Barnaby University of Texas at Austin, Abby Criswell University of Texas at Austin, Chenglong Wang Microsoft Research, Greg Durrett University of Texas at Austin, Işıl Dillig University of Texas at Austin DOI | ||
01:45 15mTalk | Model Checking for a Multi-Execution Memory Model V-OOPSLA DOI | ||
02:00 30mLive Q&A | Q&A for Session 3 V-OOPSLA |