A Note on the Relationship between Different Types of Correction Queries
From MaRDI portal
Publication:3528420
DOI10.1007/978-3-540-88009-7_17zbMath1177.68125OpenAlexW50927962MaRDI QIDQ3528420
Publication date: 16 October 2008
Published in: Grammatical Inference: Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-88009-7_17
Computational learning theory (68Q32) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Natural language processing (68T50)
Related Items
Learning definite Horn formulas from closure queries ⋮ Necessary and sufficient conditions for learning with correction queries
Cites Work
- Unnamed Item
- Learning regular sets from queries and counterexamples
- Characterizations of monotonic and dual monotonic language learning
- Formal language identification: query learning vs. gold-style learning
- One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples
- Polynomial Time Algorithms for Learning k-Reversible Languages and Pattern Languages with Correction Queries
- On Learning Regular Expressions and Patterns Via Membership and Correction Queries
- Learning DFA from Correction and Equivalence Queries
- Inference of Reversible Languages
- The String-to-String Correction Problem
- A Characterization of the Language Classes Learnable with Correction Queries
- Language identification in the limit
- Theory and Applications of Models of Computation
