Distributional learning of parallel multiple context-free grammars

DOI10.1007/S10994-013-5403-2zbMath1317.68085OpenAlexW1980918784MaRDI QIDQ479454

Alexander Clark, Ryo Yoshinaka

Publication date: 5 December 2014

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-013-5403-2

zbMATH Keywords

grammatical inferencesemilinearitymildly context-sensitive

Mathematics Subject Classification ID

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

Related Items (6)

Distributional learning of conjunctive grammars and contextual binary feature grammars ⋮ Efficiency in the Identification in the Limit Learning Paradigm ⋮ Automatic learning from positive data and negative counterexamples ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Grammatical inference: Theoretical results and applications. 10th international colloquium, ICGI 2010, Valencia, Spain, September 13--16, 2010. Proceedings
• Learning regular sets from queries and counterexamples
• Finding patterns common to a set of strings
• On multiple context-free grammars
• Rich classes inferable from positive data: Length-bounded elementary formal systems
• Efficient learning of multiple context-free languages with multidimensional substitutability from positive data
• Polynomial Time Learning of Some Multiple Context-Free Languages with a Minimally Adequate Teacher
• Theory of Formal Systems. (AM-47)
• Inferring Grammars for Mildly Context Sensitive Languages in Polynomial-Time
• Learning Context Free Grammars with the Syntactic Concept Lattice
• Polynomial-Time Identification of Multiple Context-Free Languages from Positive Data and Membership Queries
• Inference of Reversible Languages
• The equivalence of four extensions of context-free grammars
• Towards Dual Approaches for Learning Context-Free Grammars Based on Syntactic Concept Lattices
• Three models for the description of language
• Language identification in the limit
• Logical Aspects of Computational Linguistics

This page was built for publication: Distributional learning of parallel multiple context-free grammars