Triple graph grammars (TGGs) are a formal and intuitive concept for the specification of model transformations. Their main advantage is an automatic derivation of operational rule...
Hartmut Ehrig, Claudia Ermel, Frank Hermann, Ulrik...
In this paper, we describe the research using machine learning techniques to build a comma checker to be integrated in a grammar checker for Basque. After several experiments, and...
An index for an r.e. class of languages (by definition) generates a sequence of grammars defining the class. An index for an indexed family of recursive languages (by definition) ...
Probabilistic grammars offer great flexibility in modeling discrete sequential data like natural language text. Their symbolic component is amenable to inspection by humans, while...
—This paper describes and tests the utility of a meta Grammar approach to Grammatical Evolution (GE). Rather than employing a fixed grammar as is the case with canonical GE, und...