Learning correction grammars

DOI10.2178/JSL/1243948324MaRDI QIDQ3630576zbMATH OpenOpenAlexFDO

Authors Lorenzo Carlucci, Sanjay Jain, John Case

Publication date 4 June 2009

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2178/jsl/1243948324

zbMATH Keywords

computably enumerable languageslearning correction grammarslearning in the limit

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Computational learning theory (68Q32) Memory and learning in psychology (91E40)

Recommendations

• Learning Correction Grammars
• Program size complexity of correction grammars in the Ershov hierarchy
• A Characterization of the Language Classes Learnable with Correction Queries
• Learning context free grammars with the finite context property: a correction of A. Clark's algorithm
• Necessary and sufficient conditions for learning with correction queries

Cites work

• A Machine-Independent Theory of the Complexity of Recursive Functions
• Comparison of identification criteria for machine inductive inference
• Criteria of language learning
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 1414293 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Inductive inference of formal languages from positive data
• Language identification in the limit
• Machine learning of higher-order programs
• On a hierarchy of sets. III
• ON LEARNING LIMITING PROGRAMS
• On the Forms of the Predicates in the Theory of Constructive Ordinals
• On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
• On the role of procrastination in machine learning
• Program size restrictions in computational learning
• Proof-theoretic analysis of termination proofs
• Recursive Structures and Ershov's Hierarchy
• The Power of Vacillation in Language Learning
• Toward a mathematical theory of inductive inference
• Tradeoffs in the inductive inference of nearly minimal size programs

Cited in

(7)

• Rice and Rice-Shapiro theorems for transfinite correction grammars
• Program size complexity of correction grammars in the Ershov hierarchy
• A model of language learning with semantics and meaning-preserving corrections
• Learning the Language of Error
• Difficulties in Forcing Fairness of Polynomial Time Inductive Inference
• scientific article; zbMATH DE number 64173 (Why is no real title available?)
• Learning Correction Grammars

This page was built for publication: Learning correction grammars

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3630576)