aspects of multimodal categorial grammars
نویسنده
چکیده
Logical and linguistic aspects of multimodal categorial grammars
منابع مشابه
Multimodal categorial dependency grammars
Multimodal categorial dependency grammars introduced in this paper represent a uniform and efficient solution to the problem of compositional analysis of discontinuous dependencies (cross-serial dependencies included).
متن کاملS4 enriched multimodal categorial grammars are context-free
Bar-Hillel et al. [1] prove that applicative categorial grammars weakly recognize the context-free languages. Buszkowski [2] proves that grammars based on the product-free fragment of the non-associative Lambek calculus NL recognize exactly the contextfree languages. Kandulski [7] furthers this result by proving that grammars based on NL also recognize exactly the context-free languages. Jäger ...
متن کاملThe Turing Completeness of Multimodal Categorial Grammars
In this paper, we demonstrate that the multimodal categorial grammars are in fact Turing-complete in their weak generative capacity. The result follows from a straightforward reduction of generalized rewriting systems to a mixed associative and modal categorial calculus. We conclude with a discussion of a restriction to the so-caled weak Sahlqvist lexical rules, for which we can ensure decidabi...
متن کامل(Multimodal) Categorial Grammar and Minimalist Program: some reflexions and comparisons
Several proposals have been made in order to implement some aspects of the Minimalist Program (and among them Stabler’s minimalist grammars) logically. Among these proposals, we compare W.Vermaat’s thesis and a previous paper of the author. Then we confront these works with the new perspective brought by Lecomte and Retoré, which seems to gain in clarity by separating the syntactic and the sema...
متن کاملS4 enriched multimodal categorial grammars are context-free: Corrigendum
Plummer [3] showed that categorial grammars based on NLS4, the non-associative multimodal Lambek Calculus enriched with S4 axioms, weakly recognize context-free languages. However, the proof contains a gap. We correct the earlier proof, utilizing a technique given in Buszkowski [1]. This technique immediately proves that NLS4 is decidable in polynomial time.
متن کامل