MDL-Based Context-Free Graph Grammar Induction

István Jónyer, Lawrence B. Holder, Diane J. Cook

2003 · 16 citations · 4 references

Concepts

Abstract

We present an algorithm for the inference of context-free graph grammars from examples. The algorithm builds on an earlier system for frequent substructure discovery, and is biased toward grammars that minimize description length. Grammar features include recursion, variables and relationships.

References

4