论文信息 - m-Linear Context-Free Rewriting Systems as Abstract Categorial Grammars

m-Linear Context-Free Rewriting Systems as Abstract Categorial Grammars

This paper presents a coding of m-linear context-free rewriting systems (m-LCFRS) into abstract categorial grammars (ACG). Thus, it shows the latter formalism, which offers a powerful grammatical framework based on a small set of computational primitives, is able to reach some interesting classes of languages w.r.t. natural language modeling.

Sylvain Pogodalla | Philippe de Groote | P. D. Groote | S. Pogodalla

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

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

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

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

[5] Carl Jesse Pollard,et al. Generalized phrase structure grammars, head grammars, and natural language , 1984 .

[6] David J. Weir,et al. Characterizing Structural Descriptions Produced by Various Grammatical Formalisms , 1987, ACL.

[7] Jens Michaelis,et al. Transforming Linear Context-Free Rewriting Systems into Minimalist Grammars , 2001, LACL.

[8] Henk Barendregt,et al. The Lambda Calculus: Its Syntax and Semantics , 1985 .

[9] Tadao Kasami,et al. On Multiple Context-Free Grammars , 1991, Theor. Comput. Sci..