Criteria of language learning
From MaRDI portal
Cited in
(58)- Paradigms of truth detection
- Learning in the presence of partial explanations
- Maximal machine learnable classes
- On the danger of half-truths
- Learning in the presence of inaccurate information
- On aggregating teams of learning machines
- Language learning from texts: Degrees of intrinsic complexity and their characterizations
- Learning pattern languages over groups
- The synthesis of language learners.
- Intrinsic complexity of learning geometrical concepts from positive data
- Maps of restrictions for behaviourally correct learning
- Learning languages with decidable hypotheses
- Mapping monotonic restrictions in inductive inference
- Normal forms for semantically witness-based learners in inductive inference
- Results on memory-limited U-shaped learning
- Learning multiple languages in groups
- Learning languages from positive data and a limited number of short counterexamples
- Learning languages from positive data and a finite number of queries
- On the role of update constraints and text-types in iterative learning
- Effectivity questions for Kleene's recursion theorem
- Robust learning of automatic classes of languages
- Learning pattern languages over groups
- Learning families of closed sets in matroids
- Gold-style learning theory. A selection of highlights since Gold
- Strongly non-U-shaped language learning results by general techniques
- Effectivity questions for Kleene's recursion theorem
- Learning in Friedberg Numberings
- Numberings Optimal for Learning
- Learning correction grammars
- Learning from streams
- Learning and classifying
- Learnability: admissible, co-finite, and hypersimple languages
- Prudence in vacillatory language identification
- Hypothesis spaces for learning
- Aspects of complexity of probabilistic learning under monotonicity constraints
- Closedness properties in ex-identification
- Topological separations in inductive inference
- On the non-existence of maximal inference degrees for language identification
- On learning existentially definable subsets in a computable structure
- 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
- On the inference of approximate programs
- Prudence and other conditions on formal language learning
- Learning and extending sublanguages
- When unlearning helps
- Non-U-shaped vacillatory and team learning
- Learning in Friedberg numberings
- Numberings optimal for learning
- Iterative learning of simple external contextual languages
This page was built for publication: Criteria of language learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4742321)