Sciweavers

13 search results - page 2 / 3
» Towards Object-Oriented Graphs and Grammars
Sort
View
FLAIRS
2003
13 years 6 months ago
MDL-Based Context-Free Graph Grammar Induction
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 biase...
Istvan Jonyer, Lawrence B. Holder, Diane J. Cook
TAGT
1998
Springer
184views Graph Theory» more  TAGT 1998»
13 years 8 months ago
A Framework for Adding Packages to Graph Transformation Approaches
Graphs are a commonly used formalism for modeling many different kinds of static and dynamic data. In many applications, data modeling can be improved by using hierarchically struc...
Giorgio Busatto, Gregor Engels, Katharina Mehner, ...
ESSLLI
1999
Springer
13 years 8 months ago
Towards Discontinuous Grammar
This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...
Matthias T. Kromann
EACL
1993
ACL Anthology
13 years 5 months ago
Towards efficient parsing with proof-nets
This paper presents a method for parsing associative Lambek grammars based on graphtheoretic properties. Connection graphs, which are a simplified version of proof-nets, are actua...
Alain Lecomte
ENTCS
2010
133views more  ENTCS 2010»
13 years 4 months ago
Towards Measurable Types for Dynamical Process Modeling Languages
Process modeling languages such as "Dynamical Grammars" are highly expressive in the processes they model using stochastic and deterministic dynamical systems, and can b...
Eric Mjolsness