Optimal language learning from positive data
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3833940 (Why is no real title available?)
- scientific article; zbMATH DE number 517033 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Analogical and inductive inference. International workshop AII '89, Reinhardsbrunn Castle, GDR, October 1-6, 1989. Proceedings
- Comparison of identification criteria for machine inductive inference
- Inductive inference of automata, functions and programs
- Inductive inference of formal languages from positive data
- Language identification in the limit
- Learning strategies
- Non-U-shaped vacillatory and team learning
- Prudence and other conditions on formal language learning
- Results on memory-limited U-shaped learning
- Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations
- Toward a mathematical theory of inductive inference
- U-shaped, iterative, and iterative-with-counter learning
- When unlearning helps
Cited in
(9)- Learning languages in the limit from positive information with finitely many memory changes
- `Ideal learning' of natural language: positive results about learning from positive evidence
- A map of update constraints in inductive inference
- MDL in the limit
- Strongly non-U-shaped language learning results by general techniques
- Algorithmic Learning Theory
- Towards a map for incremental learning in the limit from positive and negative information
- scientific article; zbMATH DE number 2080663 (Why is no real title available?)
- Optimal Language Learning
This page was built for publication: Optimal language learning from positive data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q642522)