Abstract Families of Abstract Categorial Languages

We show that the class of string languages generated by abstract categorial grammars is a substitution-closed full AFL. The result also holds of each class G(m,n) in de Groote's hierarchy. We also show that the class of string languages generated by lexicalized ACGs is a substitution-closed AFL, and that most of the results about string languages carry over to tree languages.

[1]  Philippe de Groote,et al.  Towards Abstract Categorial Grammars , 2001, ACL.

[2]  Max Dauchet,et al.  Forêts Algébriques et Homomorphismes Inverses , 1978, Inf. Control..

[3]  David J. Weir,et al.  Characterizing mildly context-sensitive grammar formalisms , 1988 .

[4]  Stephan Oepen,et al.  39th Annual Meeting and 10th Conference of the European Chapter , 2001 .

[5]  Ryo Yoshinaka,et al.  Lexicalization of Second-Order ACGs , 2005 .

[6]  Grzegorz Rozenberg,et al.  Handbook of formal languages, vol. 3: beyond words , 1997 .

[7]  Aravind K. Joshi,et al.  Tree-Adjoining Grammars , 1997, Handbook of Formal Languages.

[8]  Daniel Götzmann.  Multiple Context-Free Grammars , 2007 .

[9]  Hubert Comon,et al.  Tree automata techniques and applications , 1997 .

[10]  Sylvain Pogodalla,et al.  On the Expressive Power of Abstract Categorial Grammars: Representing Context-Free Formalisms , 2004, J. Log. Lang. Inf..

[11]  Philippe de Groote,et al.  Tree-Adjoining Grammars as Abstract Categorial Grammars , 2002, TAG+.

[12]  Sylvain Salvati,et al.  Problèmes de filtrage et problème d'analyse pour les grammaires catégorielles abstraites. (Matching problem and parsing problem for abstract categorial grammars) , 2005 .

[13]  Gerald Gazdar,et al.  Applicability of Indexed Grammars to Natural Languages , 1988 .

[14]  J. Roger Hindley,et al.  BCK-Combinators and Linear lambda-Terms have Types , 1989, Theor. Comput. Sci..

[15]  Ryo Yoshinaka,et al.  The Complexity and Generative Capacity of Lexicalized Abstract Categorial Grammars , 2005, LACL.

[16]  Nissim Francez,et al.  Basic simple type theory , 1998 .

[17]  Alfred V. Aho,et al.  Indexed Grammars—An Extension of Context-Free Grammars , 1967, SWAT.

[18]  Ferenc Gécseg,et al.  Tree Languages , 1997, Handbook of Formal Languages.

[19]  Seymour Ginsburg,et al.  Studies In Abstract Families Of Languages , 1969 .

[20]  Uwe Reyle,et al.  Natural Language Parsing and Linguistic Theories , 1988 .

[21]  Bruno Guillaume,et al.  Vector addition tree automata , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[22]  Seymour Ginsburg,et al.  Abstract Families of Languages , 1967, SWAT.