Language learning without overgeneralization

DOI10.1016/0304-3975(94)00075-TzbMath0873.68178OpenAlexW2121994960MaRDI QIDQ673781

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)

Related Items (4)

Synthesizing learners tolerating computable noisy data ⋮ Vacillatory and BC learning on noisy data ⋮ Learning languages and functions by erasing ⋮ The synthesis of language learners.

Cites Work

• Monotonic and non-monotonic inductive inference
• Prudence and other conditions on formal language learning
• Finding patterns common to a set of strings
• Learning strategies
• Inductive inference of formal languages from positive data
• Language identification in the limit
• Unnamed Item

This page was built for publication: Language learning without overgeneralization