Learning balls of strings from edit corrections

MaRDI QIDQ3096174zbMATH OpenFDO

Authors Leonor Becerra-Bonache, Colin de la Higuera, Jean-Christophe Janodet, Frédéric Tantini

Publication date 8 November 2011

Full work available at URL http://www.jmlr.org/papers/v9/becerra-bonache08a.html

zbMATH Keywords

balls of stringscorrection queriesedit distancegrammatical inferenceoracle learning

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05) Natural language processing (68T50)

Recommendations

• Correction queries in active learning
• On Learning Regular Expressions and Patterns Via Membership and Correction Queries
• A Characterization of the Language Classes Learnable with Correction Queries
• A Note on the Relationship between Different Types of Correction Queries
• Learning DFA from Correction and Equivalence Queries

Cited in

(6)

• Computing the expected edit distance from a string to a PFA
• Learning grammars and automata with queries
• A model of language learning with semantics and meaning-preserving corrections
• Learning Languages from Bounded Resources: The Case of the DFA and the Balls of Strings
• Computing the expected edit distance from a string to a probabilistic finite-state automaton
• Volume formula and growth rates of the balls of strings under the edit distances

This page was built for publication: Learning balls of strings from edit corrections

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