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.

[1]  Carlos Martín-Vide,et al.  Contextual Grammars and Dependency Trees , 2003, JEPTALNRECITAL.

[2]  Solomon Marcus,et al.  Contextual Grammars , 1969, COLING.

[3]  V. Kubon,et al.  Two Useful Measures of Word Order Complexity , 1998, Workshop On Processing Of Dependency-Based Grammars.

[4]  Igor Mel’čuk,et al.  Dependency Syntax: Theory and Practice , 1987 .

[5]  Carlos Martín-Vide,et al.  Structured Contextual Grammars , 1998, Grammars.

[6]  Frantisek Mráz,et al.  Restarting Automata, Deleting and Marcus Grammars , 2000, Recent Topics in Mathematical and Computational Linguistics.

[7]  Solomon Marcus,et al.  Contextual Grammars and Natural Languages , 1997, Handbook of Formal Languages.

[8]  Carlos Martín-Vide,et al.  Contextual Grammars as Generative Models of Natural Language , 1998, CL.

[9]  Solomon Marcus,et al.  Algebraic Linguistics Analytical Models , 1967 .

[10]  Gheorghe Paun,et al.  Marcus Contextual Grammars , 1994, Bull. EATCS.

[11]  Frantisek Mráz,et al.  On Monotonic Automata with a Restart Operation , 1999, J. Autom. Lang. Comb..

[12]  Frantisek Mráz,et al.  Restarting Automata , 1995, FCT.

[13]  Frantisek Mráz,et al.  On Restarting Automata with Rewriting , 1997, New Trends in Formal Languages.

[14]  Alexander Dikovsky,et al.  DEPENDENCIES ON THE OTHER SIDE OF THE CURTAIN , 2000 .