Towards Dual Approaches for Learning Context-Free Grammars Based on Syntactic Concept Lattices

DOI10.1007/978-3-642-22321-1_37zbMath1221.68109OpenAlexW169773246MaRDI QIDQ5199987

Ryo Yoshinaka

Publication date: 29 July 2011

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22321-1_37

Mathematics Subject Classification ID

Computational learning theory (68Q32) Grammars and rewriting systems (68Q42)

Related Items (8)

Four one-shot learners for regular tree languages and their polynomial characterizability ⋮ Distributional learning of conjunctive grammars and contextual binary feature grammars ⋮ Learning context-free grammars from positive data and membership queries ⋮ Distributional learning of parallel multiple context-free grammars ⋮ The Strong, Weak, and Very Weak Finite Context and Kernel Properties ⋮ Learning Conjunctive Grammars and Contextual Binary Feature Grammars ⋮ Probabilistic learnability of context-free grammars with basic distributional properties from positive examples ⋮ Distributional Learning and Context/Substructure Enumerability in Nonlinear Tree Grammars

This page was built for publication: Towards Dual Approaches for Learning Context-Free Grammars Based on Syntactic Concept Lattices