Learning context-free grammars from partially structured examples

DOI10.1007/978-3-540-45257-7_19MaRDI QIDQ2754019zbMATH OpenFDO

Authors Hidenori Muramatsu, Y. Sakakibara

Publication date 11 November 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-45257-7_19

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Learning context-free grammars using tabular representations
• Learning context-free grammars from structural data in polynomial time
• Grammatical Inference: Algorithms and Applications
• Efficient learning of context-free grammars from positive structural examples
• scientific article; zbMATH DE number 2019603

Cited in

(13)

• Learning algorithms
• Learning deterministic context free grammars: the Omphalos competition
• Learning context-free grammars using tabular representations
• Incremental learning of context free grammars based on bottom-up parsing and search
• scientific article; zbMATH DE number 1670722 (Why is no real title available?)
• Learning Cover Context-Free Grammars from Structural Data
• Learning tree languages from text
• Unsupervised Learning of Probabilistic Context-Free Grammar using Iterative Biclustering
• Incremental Learning of Context Free Grammars by Bridging Rule Generation and Search for Semi-optimum Rule Sets
• Learning with partially ordered representations
• Grammatical Inference: Algorithms and Applications
• Learning failure-free PRISM programs
• Learning context-free grammars from structural data in polynomial time

This page was built for publication: Learning context-free grammars from partially structured examples

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