Learning Correction Grammars

DOI10.1007/978-3-540-72927-3_16MaRDI QIDQ5432435zbMATH OpenOpenAlexFDO

Authors Lorenzo Carlucci, Sanjay Jain, John Case

Publication date 3 January 2008

Published in Learning Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72927-3_16

zbMATH Keywords

learning correction grammarslearning in the limitrecursively enumerable languages

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
• A Characterization of the Language Classes Learnable with Correction Queries
• Program size complexity of correction grammars in the Ershov hierarchy
• 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

Cited in

(6)

• 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
• Learning correction grammars
• Incremental Learning with Ordinal Bounded Example Memory
• scientific article; zbMATH DE number 64173 (Why is no real title available?)

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 Q5432435)