Learning Context Free Grammars with the Syntactic Concept Lattice

DOI10.1007/978-3-642-15488-1_5zbMath1291.68189OpenAlexW1661696594MaRDI QIDQ3588363

Alexander Clark

Publication date: 10 September 2010

Published in: Grammatical Inference: Theoretical Results and Applications (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items

A Language Theoretic Approach to Syntactic Structure ⋮ Language-theoretic and finite relation models for the (full) Lambek calculus ⋮ Four one-shot learners for regular tree languages and their polynomial characterizability ⋮ Distributional learning of conjunctive grammars and contextual binary feature grammars ⋮ Polynomial inference of universal automata from membership and equivalence queries ⋮ Automatic Concepts and Automata-Theoretic Semantics for the Full Lambek Calculus ⋮ 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 ⋮ On Some Extensions of Syntactic Concept Lattices: Completeness and Finiteness Results