A Caltech Library Service

Textual Features for Programming by Example

Menon, Aditya Krishna and Tamuz, Omer and Gulwani, Sumit and Lampson, Butler and Kalai, Adam Tauman (2012) Textual Features for Programming by Example. . (Submitted)

[img] PDF - Submitted Version
See Usage Policy.


Use this Persistent URL to link to this item:


In Programming by Example, a system attempts to infer a program from input and output examples, generally by searching for a composition of certain base functions. Performing a naїve brute force search is infeasible for even mildly involved tasks. We note that the examples themselves often present clues as to which functions to compose, and how to rank the resulting programs. In text processing, which is our domain of interest, clues arise from simple textual features: for example, if parts of the input and output strings are permutations of one another, this suggests that sorting may be useful. We describe a system that learns the reliability of such clues, allowing for faster search and a principled ranking over programs. Experiments on a prototype of this system show that this learning scheme facilitates efficient inference on a range of text processing tasks.

Item Type:Report or Paper (Discussion Paper)
Related URLs:
URLURL TypeDescription Paper
Tamuz, Omer0000-0002-0111-0418
Additional Information:Submitted on 17 Sep 2012. May 28, 2013.
Record Number:CaltechAUTHORS:20161114-080916122
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:71974
Deposited By: Ruth Sustaita
Deposited On:16 Nov 2016 00:01
Last Modified:03 Oct 2019 16:13

Repository Staff Only: item control page