Distributional Learning of Context-Free and Multiple Context-Free Grammars

DOI10.1007/978-3-662-48395-4_6zbMATH Open1404.68058OpenAlexW2499912761MaRDI QIDQ2963597FDOQ2963597

Authors: Alexander Clark, Ryo Yoshinaka 

Publication date: 15 February 2017

Published in: Topics in Grammatical Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48395-4_6

Recommendations

• Distributional learning of parallel multiple context-free grammars
• Distributional Learning of Simple Context-Free Tree Grammars
• Integration of the Dual Approaches in the Distributional Learning of Context-Free Grammars
• Distributional learning of conjunctive grammars and contextual binary feature grammars
• Distributional learning of some nonlinear tree grammars
• Distributional Learning and Context/Substructure Enumerability in Nonlinear Tree Grammars
• Distributional learning of abstract categorial grammars
• Distributional learning of some context-free languages with a minimally adequate teacher
• Probabilistic learnability of context-free grammars with basic distributional properties from positive examples
• scientific article; zbMATH DE number 2209444

Mathematics Subject Classification ID

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

Cites Work

• Learning regular sets from queries and counterexamples
• Language identification in the limit
• The equivalence of four extensions of context-free grammars
• Rich classes inferable from positive data: Length-bounded elementary formal systems
• When won't membership queries help?
• Learning context-free grammars from structural data in polynomial time
• On multiple context-free grammars
• On parsing coupled-context-free languages
• Polynomial identification in the limit of substitutable context-free languages
• PAC-Learning Unambiguous NTS Languages
• Efficient learning of multiple context-free languages with multidimensional substitutability from positive data
• NTS languages are deterministic and congruential
• PAC-learning unambiguous \(k,l \mathrm{-NTS}^{\leq}\) languages
• The equivalence and inclusion problems for NTS languages
• Independent parallelism in finite copying parallel rewriting systems
• Evolutionary induction of stochastic context free grammars
• Using contextual representations to efficiently learn context-free languages
• Title not available (Why is that?)

Cited In (12)

• Integration of the Dual Approaches in the Distributional Learning of Context-Free Grammars
• Unsupervised Learning of Probabilistic Context-Free Grammar using Iterative Biclustering
• Learning Cover Context-Free Grammars from Structural Data
• Towards dual approaches for learning context-free grammars based on syntactic concept lattices
• Distributional Learning of Simple Context-Free Tree Grammars
• The Strong, Weak, and Very Weak Finite Context and Kernel Properties
• Learning deterministic context free grammars: the Omphalos competition
• Distributional Learning and Context/Substructure Enumerability in Nonlinear Tree Grammars
• Using contextual representations to efficiently learn context-free languages
• Distributional learning of abstract categorial grammars
• PAC Learning of Some Subclasses of Context-Free Grammars with Basic Distributional Properties from Positive Data
• Title not available (Why is that?)

This page was built for publication: Distributional Learning of Context-Free and Multiple Context-Free Grammars

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