In plain words: A system writes a program for each question and runs it on a large fact database, learning from question-answer pairs by trying programs and keeping ones that give the right answer. It beat the best previous approach on a question set without hand-built rules.
Abstract · Neural Symbolic Machines: Learning Semantic Parsers on Freebase with Weak Supervision
Harnessing the statistical power of neural networks to perform language understanding and symbolic reasoning is difficult, when it requires executing efficient discrete operations against a large knowledge-base. In this work, we introduce a Neural Symbolic Machine, which contains (a) a neural "programmer", i.e., a sequence-to-sequence model that maps language utterances to programs and utilizes a key-variable memory to handle compositionality (b) a symbolic "computer", i.e., a Lisp interpreter that performs program execution, and helps find good programs by pruning the search space. We apply REINFORCE to directly optimize the task reward of this structured prediction problem. To train with weak supervision and improve the stability of REINFORCE, we augment it with an iterative maximum-likelihood training process. NSM outperforms the state-of-the-art on the WebQuestionsSP dataset when trained from question-answer pairs only, without requiring any feature engineering or domain-specific knowledge.
Chen Liang, Jonathan Berant, Quoc Le, Kenneth D. Forbus, Ni Lao
arXiv:1611.00020 · cs.CL, cs.AI, cs.LG · submitted Oct 31, 2016 · updated Apr 23, 2017
abstract · pdf · html · ACL 2017 camera ready version
(GRU, in case anyone is wondering, stands for "gated recurrent unit" and is a building block of standard LSTMs)
EDIT: now that I've finished the paper, I've realized that the citations are straight-up missing. That's no good, but I'm sure the authors just messed up the arxiv upload. If OP knows them, they should let them know... failing to include any citations at all is a quick way to decrease the credibility of an article.