Approximate Language Identification

A theory of approximate language identification analogous to the existing theory of exact language identification is introduced. In the approximate language identification problem a grammar is sought from a solution space of grammars whose language approximates an unidentified language with a specified degree of accuracy. A model for this problem is given in which a class of metrics on languages is defined, and a series of grammar inference procedures for approximate language identification is presented. A comparison of corresponding results for exact and approximate language identification yields two distinct ways in which the results for approximate language identification are stronger than those for exact language identification.

[1]  E. Mark Gold,et al.  Language Identification in the Limit , 1967, Inf. Control..

[2]  Ray J. Solomonoff,et al.  A Formal Theory of Inductive Inference. Part II , 1964, Inf. Control..

[3]  James J. Horning,et al.  A Procedure for Grammatical Inference , 1971, IFIP Congress.

[4]  James Jay Horning,et al.  A study of grammatical inference , 1969 .

[5]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[6]  Martin D. Davis,et al.  Computability and Unsolvability , 1959, McGraw-Hill Series in Information Processing and Computers.

[7]  Jerome A. Feldman,et al.  Some Decidability Results on Grammatical Inference and Complexity , 1972, Inf. Control..

[8]  Jeffrey D. Ullman,et al.  Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[9]  Manuel Blum.  On the Size of Machines , 1967, Inf. Control..

[10]  Richard Michael Wharton,et al.  Grammatical inference and approximation. , 1973 .

[11]  Ray J. Solomonoff,et al.  A Formal Theory of Inductive Inference. Part I , 1964, Inf. Control..

[12]  Franklin F. Kuo,et al.  IFIP Congress 71. , 1971 .