While input-output examples are a natural form of specification for program synthesis engines, they can be imprecise domains such as table transformations. In this paper, we investigate how extracting readily-available information about the user intent behind these helps speed up and reduce overfitting. We present Gauss, algorithm transformations that accepts partial examples, along with graphs...