Incremental learning of context free grammars based on bottom-up parsing and search

DOI10.1016/J.PATCOG.2005.01.004MaRDI QIDQ2485077zbMATH OpenOpenAlexFDO

Authors Katsuhiko Nakamura, Masashi Matsumoto

Publication date 3 August 2005

Published in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.patcog.2005.01.004

zbMATH Keywords

Chomsky normal formIncremental learningUnambiguous grammarContext free languageCYK algorithmSynapse

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 2019603
• Grammatical Inference: Algorithms and Applications
• Incremental Learning of Context Free Grammars by Bridging Rule Generation and Search for Semi-optimum Rule Sets
• scientific article; zbMATH DE number 1670726
• Learning context-free grammars from structural data in polynomial time
• Efficient learning of context-free grammars from positive structural examples
• Learning context free grammars with the syntactic concept lattice
• Learning context free grammars with the finite context property: a correction of A. Clark's algorithm
• Efficient parallel and incremental parsing of practical context-free languages

Cites work

• scientific article; zbMATH DE number 1670722 (Why is no real title available?)
• scientific article; zbMATH DE number 1670726 (Why is no real title available?)
• scientific article; zbMATH DE number 2019603 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• The minimum consistent DFA problem cannot be approximated within any polynomial
• When won't membership queries help?

Cited in

(9)

• Incremental sigmoid belief networks for grammar learning
• Symbolic encoding of LL(1) parsing and its applications
• scientific article; zbMATH DE number 1670722 (Why is no real title available?)
• scientific article; zbMATH DE number 2019603 (Why is no real title available?)
• Incremental Learning of Context Free Grammars by Bridging Rule Generation and Search for Semi-optimum Rule Sets
• Grammatical Inference: Algorithms and Applications
• Inductive synthesis of cover-grammars with the help of ant colony optimization
• Grammatical Inference: Algorithms and Applications
• LARS: a learning algorithm for rewriting systems

This page was built for publication: Incremental learning of context free grammars based on bottom-up parsing and search

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