Biermann, Alan W.
Toward Natural Language Computation
Biermann, Alan W.
American Journal of Computational Linguistics, Volume 6, Number 2, April-June 1980
The Inference of Regular LISP Programs from Examples
Biermann, Alan W.
—A class of LISP programs that is analogous to the finite-state automata is defined, and an algorithm is given for constructing such programs from examples of their input-output behavior. It is shown that the algorithm has robust performance for a wide variety of inputs and that it converges to a solution on the basis of minimum input information.IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS, VOL. SMC-8, NO. 8,