Language learning without overgeneralization

DOI10.1016/0304-3975(94)00075-TzbMATH Open0873.68178OpenAlexW2121994960MaRDI QIDQ673781FDOQ673781

Gianfranco Bilardi, Shyam Kapur

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00075-t

zbMATH Keywords

language learnability

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Title not available (Why is that?)
• Learning strategies
• Inductive inference of formal languages from positive data
• Language identification in the limit
• Monotonic and non-monotonic inductive inference
• Prudence and other conditions on formal language learning
• Finding patterns common to a set of strings

Cited In (9)

• Title not available (Why is that?)
• The synthesis of language learners.
• Prudence and other conditions on formal language learning
• Title not available (Why is that?)
• Synthesizing learners tolerating computable noisy data
• Vacillatory and BC learning on noisy data
• Learning languages and functions by erasing
• Learning languages in a union
• Language learning without overgeneralization

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Optimal Language Learning 👍 👎
• Generalization and specialization strategies for learning r. e. languages 👍 👎
• Strongly non-U-shaped language learning results by general techniques 👍 👎
• AN APPROACH TO LINGUISTIC INSTRUCTION BASED LEARNING 👍 👎
• Language learning without overgeneralization 👍 👎
• Learning language intersections 👍 👎

This page was built for publication: Language learning without overgeneralization

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