Synthesizing context free grammars from sample strings based on inductive CYK algorithm

DOI10.1007/978-3-540-45257-7_15MaRDI QIDQ2754013zbMATH OpenFDO

Authors Katsuhiko Nakamura, Takashi Ishiwata

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_15

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2019603
• Learning context-free grammars from partially structured examples
• Incremental learning of context free grammars based on bottom-up parsing and search
• Grammatical Inference: Algorithms and Applications
• Incremental Learning of Context Free Grammars by Bridging Rule Generation and Search for Semi-optimum Rule Sets

Cited in

(6)

• Inductive synthesis of cover-grammars with the help of ant colony optimization
• 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 2019603 (Why is no real title available?)
• Grammatical Inference: Algorithms and Applications
• Symbolic encoding of LL(1) parsing and its applications

This page was built for publication: Synthesizing context free grammars from sample strings based on inductive CYK algorithm

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