Automating string processing in spreadsheets using input-output examples
Indexed incrossref
Abstract
We describe the design of a string programming/expression language that supports restricted forms of regular expressions, conditionals and loops. The language is expressive enough to represent a wide variety of string manipulation tasks that end-users struggle with. We describe an algorithm based on several novel concepts for synthesizing a desired program in this language from input-output examples. The synthesis algorithm is very efficient taking a fraction of a second for various benchmark examples. The synthesis algorithm is interactive and has several desirable features: it can rank multiple solutions and has fast convergence, it can detect noise in the user input, and it supports an active interaction…
Citation impact
588
total citations
- FWCI
- 38.24
- Percentile
- 100%
- References
- 23
Citations per year
Authors
1Topics & keywords
Topics
Keywords
- Computer science
- String (physics)
- Benchmark (surveying)
- Programming language
- Variety (cybernetics)
- Regular expression
- Algorithm
- Rank (graph theory)
No related works found for this paper.