From Language to Programs: Bridging Reinforcement Learning and Maximum Marginal Likelihood

Citations Over TimeTop 1% of 2017 papers

Abstract

Our goal is to learn a semantic parser that maps natural language utterances into executable programs when only indirect supervision is available: examples are labeled with the correct execution result, but not the program itself. Consequently, we must search the space of programs for those that output the correct result, while not being misled by spurious programs: incorrect programs that coincidentally output the correct result. We connect two common learning paradigms, reinforcement learning (RL) and maximum marginal likelihood (MML), and then present a new learning algorithm that combines the strengths of both. The new algorithm guards against spurious programs by combining the systematic search traditionally employed in MML with the randomized exploration of RL, and by updating parameters such that probability is spread more evenly across consistent programs. We apply our learning algorithm to a new neural semantic parser and show significant gains over existing state-of-theart results on a recent context-dependent semantic parsing task.

Related Papers

• → Few-Shot Semantic Parsing with Language Models Trained on Code(2022)37 cited
• → Text to Code Conversion Using Deep Learning for NLP(2020)3 cited
• → Automatic Labeling of Semantic Roles with a Dependency Parser in Hungarian Economic Texts(2015)1 cited
• → A Hybrid Approach to Parsing Natural Languages(2016)1 cited
• → Context parsing (not only) of the object-file-format description language(2013)