2003 · 16 citations · 4 references
ComputingComputer ScienceAlgorithmsComputational LinguisticsMachine LearningDirected Acyclic GraphsGrammarGraph AlgorithmsGraph MiningGraph-based LearningParsingContext-free Grammar InductionContext-free GrammarsDirected Acyclic Graph LearningGrammar InferenceGrammar Learning From ExamplesMinimum Description LengthParsing AlgorithmsSubstructure Searching
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.
4
Diane J. Cook, Lawrence B. Holder · IEEE Intelligent Systems and their Applications · 2000 · 411 citations