Canonical context-free grammars and strong learning: two approaches

zbMATH Open1376.68079MaRDI QIDQ4599201FDOQ4599201

Authors: Alexander Clark 

Publication date: 18 December 2017

Full work available at URL: https://aclweb.org/anthology/W/W15/W15-2309.pdf

Recommendations

• Learning trees from strings: a strong learning algorithm for some context-free grammars
• Efficient learning of context-free grammars from positive structural examples
• Learning cover context-free grammars from structural data
• Grammatical Inference: Algorithms and Applications
• Learning context-free grammars from structural data in polynomial time

Mathematics Subject Classification ID

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

Cited In (6)

• Learning Cover Context-Free Grammars from Structural Data
• Title not available (Why is that?)
• Learning context free grammars with the syntactic concept lattice
• Learning context-free grammars from structural data in polynomial time
• Learning deterministic context free grammars: the Omphalos competition
• Learning trees from strings: a strong learning algorithm for some context-free grammars

This page was built for publication: Canonical context-free grammars and strong learning: two approaches

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