Using MDL for Grammar Induction

DOI10.1007/11872436_24MaRDI QIDQ3541871zbMATH OpenOpenAlexFDO

Authors Pieter Adriaans, Ceriel Jacobs

Publication date 27 November 2008

Published in Grammatical Inference: Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11872436_24

Mathematics Subject Classification ID

Computational learning theory (68Q32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Grammars and rewriting systems (68Q42)

Recommendations

• Minimum description length induction, Bayesianism, and Kolmogorov complexity
• Learning as Data Compression
• Applying MDL to learn best model granularity
• Model selection based on minimum description length
• scientific article; zbMATH DE number 740676

Cited in

(5)

• scientific article; zbMATH DE number 740676 (Why is no real title available?)
• Between order and chaos: The quest for meaningful information
• scientific article; zbMATH DE number 1696484 (Why is no real title available?)
• FlexFringe: modeling software behavior by learning probabilistic automata
• Learning as Data Compression

This page was built for publication: Using MDL for Grammar Induction

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