The synthesis of language learners.
From MaRDI portal
Publication:1854290
DOI10.1006/inco.1998.2782zbMath1045.68571OpenAlexW2073509834MaRDI QIDQ1854290
Sanjay Jain, John Case, Ganesh R. Baliga
Publication date: 14 January 2003
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1998.2782
Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05) Automata and formal grammars in connection with logical questions (03D05)
Related Items (19)
An approach to intrinsic complexity of uniform learning ⋮ Learning pattern languages over groups ⋮ Learning theory in the arithmetic hierarchy. II. ⋮ Gold-Style Learning Theory ⋮ Separation of uniform learning classes. ⋮ Discontinuities in pattern inference ⋮ Learning indexed families of recursive languages from positive data: A survey ⋮ Learnability and positive equivalence relations ⋮ Synthesizing learners tolerating computable noisy data ⋮ Mind change efficient learning ⋮ Increasing the power of uniform inductive learners ⋮ Learnability and positive equivalence relations ⋮ Partial learning of recursively enumerable languages ⋮ Classifying the Arithmetical Complexity of Teaching Models ⋮ Learning Pattern Languages over Groups ⋮ Learning from Streams ⋮ Inductive inference of approximations for recursive concepts ⋮ Relations between Gold-style learning and query learning ⋮ A non-learnable class of E-pattern languages
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A connotational theory of program structure
- Comparison of identification criteria for machine inductive inference
- Language learning without overgeneralization
- Inductive inference of monotonic formal systems from positive data
- On the power of probabilistic strategies in inductive inference
- One-sided error probabilistic inductive inference and reliable frequency identification
- Prudence and other conditions on formal language learning
- Probability and plurality for aggregations of learning machines
- Synthesizing inductive expertise
- Finding patterns common to a set of strings
- Learning elementary formal systems
- Learning recursive functions from approximations
- Learnability: Admissible, co-finite, and hypersimple languages
- Characterizations of monotonic and dual monotonic language learning
- Language learning with some negative information
- Gödel numberings of partial recursive functions
- A theory of the learnable
- Probabilistic inductive inference
- Inductive inference of formal languages from positive data
- Inference of Reversible Languages
- Periodicity in generations of automata
- Toward a mathematical theory of inductive inference
- The Power of Vacillation in Language Learning
- Inductive Logic Programming: Theory and methods
- Criteria of language learning
- A STRUCTURAL CRITERION FOR RECURSIVE ENUMERATION WITHOUT REPETITION
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Recursively enumerable classes and their application to recursive sequences of formal theories
- Language identification in the limit
- Vacillatory and BC learning on noisy data
- Synthesizing noise-tolerant language learners
This page was built for publication: The synthesis of language learners.
