Learning strategies

DOI10.1016/S0019-9958(82)91097-XMaRDI QIDQ3327744zbMATH OpenOpenAlexFDO

Authors Michael Stob, Scott Weinstein, Daniel N. Osherson

Publication date 1982

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0019-9958(82)91097-x

zbMATH Keywords

learning strategynatural language

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Learning and adaptive systems in artificial intelligence (68T05) Mathematical psychology (91E99)

Recommendations

• On the study of first language acquisition
• The Problem of Learning the Semantics of Quantifiers
• Learning and Extending Sublanguages
• Learning and extending sublanguages
• Generalization and specialization strategies for learning r. e. languages

Cited in

(36)

• Prescribed learning of r.e. classes
• On the danger of half-truths
• Learnability of automatic classes
• Maps of restrictions for behaviourally correct learning
• Normal forms for semantically witness-based learners in inductive inference
• Towards a map for incremental learning in the limit from positive and negative information
• Learning languages in the limit from positive information with finitely many memory changes
• Strategic learning in teams
• On the role of update constraints and text-types in iterative learning
• Priced learning
• Combining models of approximation with partial learning
• Identifying features in the presence of competing evidence. The case of first-language acquisition
• A map of update constraints in inductive inference
• NEW LEARNING STRATEGIES IN BUSTILLOS AND OLIVEIRA MODEL
• Hypothesis Spaces for Learning
• Learnability: admissible, co-finite, and hypersimple languages
• Prudence in vacillatory language identification
• Language learning without overgeneralization
• Hypothesis spaces for learning
• Learners based on transducers
• Partial learning of recursively enumerable languages
• Optimal language learning from positive data
• Language learning without overgeneralization
• Classifying different criteria for learning algebraic structures
• On the Weihrauch degree of the additive Ramsey theorem
• Hilbert's tenth problem for term algebras with a substitution operator
• Complemented subsets and Boolean-valued, partial functions
• Defining long words succinctly in FO and MSO
• On the first-order parts of problems in the Weihrauch degrees
• Algorithmically random series
• Ideal presentations and numberings of some classes of effective quasi-Polish spaces
• Lower bounds on () and other properties of -register machines
• Reifying dynamical algebra: maximal ideals in countable rings, constructively
• Maps for learning indexable classes
• Cautious limit learning
• Prudence and other conditions on formal language learning

This page was built for publication: Learning strategies

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