Sorted dependency insertion grammars

An enhanced generative formalism is proposed based on the combination of two features: contextual derivation (as in Marcus contextual grammars) and sorted dependency structures (as in dependency grammars). The model is related to a variant of restarting automaton with rewriting and deletion. Preliminary results on the generative power as well as closure and decidability properties of the new model are presented.