EVALUATING PROGRAMS FORMED BY EXAMPLE: AN INFORMATIONAL HEURISTIC

Simple item page
dc.contributor.authorWitten, Ian H.eng
dc.contributor.authorMaulsby, David L.eng
dc.date.accessioned2008-02-26T22:39:55Z
dc.date.available2008-02-26T22:39:55Z
dc.date.computerscience1999-05-27eng
dc.date.issued1990-11-01eng
dc.description.abstractThe construction of a procedure from a few examples of its execution--a major requirement for practical programming-by-example--is inevitably a drastically underdetermined problem. At the core of any incremental programming-by-example scheme is a heuristic module that creates and modifies the program, or "model," as it is formed. In general there are countless different ways that the model might plausibly be modified; the problem is to prune the set of candidate models to keep it down to a reasonable size. We develop a principled method for evaluating and comparing alternative models of a sequence of actions. Models are finite-state automata and therefore can contain branches and loops. Based on information theory, the method computes the entropy of a model in conjunction with the entropy of the sequence used to form it--a novel form of the "minimum description length" principle. The idea is to measure a model's predictive power, taking into account the extent to which it is justified by the sequence that has been used to create it. The performance of the measure is illustrated on test cases and accords with intuition about when sufficient evidence has accumulated to prefer a more complex model to a simpler one.eng
dc.description.notesWe are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.caeng
dc.identifier.department1990-413-37eng
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/30906
dc.identifier.urihttp://hdl.handle.net/1880/45595
dc.language.isoEngeng
dc.publisher.corporateUniversity of Calgaryeng
dc.publisher.facultyScienceeng
dc.subjectComputer Scienceeng
dc.titleEVALUATING PROGRAMS FORMED BY EXAMPLE: AN INFORMATIONAL HEURISTICeng
dc.typeunknown
thesis.degree.disciplineComputer Scienceeng
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
1990-413-37.pdf
Size:
1.9 MB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.86 KB
Format:
Plain Text
Description:
Download
Collections
Science Research & Publications