Efficient learning of context-free grammars from positive structural examples

DOI10.1016/0890-5401(92)90003-XzbMath0764.68146OpenAlexW2083367980MaRDI QIDQ1186808

Yasubumi Sakakibara

Publication date: 28 June 1992

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(92)90003-x

zbMATH Keywords

learning context-free grammarspositive-only examplesreversible context-free grammars

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Grammars and rewriting systems (68Q42)

Related Items (20)

Learning of Structurally Unambiguous Probabilistic Grammars ⋮ Complex systems, complexity measures, grammars and model-inferring ⋮ Learning deterministic context free grammars: the Omphalos competition ⋮ LARS: a learning algorithm for rewriting systems ⋮ A model of language learning with semantics and meaning-preserving corrections ⋮ Generating grammars for SGML tagged texts lacking DTD ⋮ Recent advances of grammatical inference ⋮ Grammatical inference: An old and new paradigm ⋮ Learning failure-free PRISM programs ⋮ Learning tree languages from text ⋮ Efficiency in the Identification in the Limit Learning Paradigm ⋮ Learning discrete categorial grammars from structures ⋮ The smallest grammar problem as constituents choice and minimal grammar parsing ⋮ Grammatical inference of directed acyclic graph languages with polynomial time complexity ⋮ On the structural grammatical inference problem for some classes of context-free grammars ⋮ Meta-interpretive learning: application to grammatical inference ⋮ Remarks on the structural grammatical inference problem for context-free grammars ⋮ Learning context-free grammars using tabular representations ⋮ Smoothing and compression with stochastic \(k\)-testable tree languages ⋮ Identification of birfsa languages.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Learning context-free grammars from structural data in polynomial time
• Learning regular sets from queries and counterexamples
• Analogical and inductive inference. International workshop AII '89, Reinhardsbrunn Castle, GDR, October 1-6, 1989. Proceedings
• Queries and concept learning
• A theory of the learnable
• Inductive inference of formal languages from positive data
• Inference of Reversible Languages
• Skeletal structural descriptions
• Noncounting Context-Free Languages
• Parenthesis Grammars
• Language identification in the limit
• On the Covering and Reduction Problems for Context-Free Grammars

This page was built for publication: Efficient learning of context-free grammars from positive structural examples