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

DOI10.1007/978-3-662-48395-4_6zbMath1404.68058OpenAlexW2499912761MaRDI QIDQ2963597

Ryo Yoshinaka, Alexander Clark

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

Mathematics Subject Classification ID

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

Related Items (1)

The Strong, Weak, and Very Weak Finite Context and Kernel Properties

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Learning context-free grammars from structural data in polynomial time
• The equivalence and inclusion problems for NTS languages
• NTS languages are deterministic and congruential
• Learning regular sets from queries and counterexamples
• On multiple context-free grammars
• Rich classes inferable from positive data: Length-bounded elementary formal systems
• On parsing coupled-context-free languages
• When won't membership queries help?
• Independent parallelism in finite copying parallel rewriting systems
• Efficient learning of multiple context-free languages with multidimensional substitutability from positive data
• Evolutionary induction of stochastic context free grammars
• PAC-Learning Unambiguous NTS Languages
• PAC-Learning Unambiguous k,l-NTS ≤  Languages
• The equivalence of four extensions of context-free grammars
• Language identification in the limit

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