Skip to Main content Skip to Navigation
Conference papers

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

Philippe de Groote 1 Sylvain Pogodalla 1
1 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Mots-clés : logique linéaire formal language linear logic lambda calculus categorial grammar langage formel grammaire catégorielle lambda-calcul
Document type :
Conference papers
Complete list of metadata

Cited literature [8 references]  Display  Hide  Download
https://hal.inria.fr/inria-00107690
Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Wednesday, December 13, 2006 - 1:26:24 PM
Last modification on : Friday, February 4, 2022 - 3:30:31 AM
Long-term archiving on: : Tuesday, April 6, 2010 - 8:09:42 PM

File

Vignette du document
A03-R-243.pdf

Identifiers

  • HAL Id : inria-00107690, version 1

Collections

CNRS | INRIA | LORIA | UNIV-LORRAINE | INRIA2

Citation

Philippe de Groote, Sylvain Pogodalla. m-Linear Context-Free Rewriting Systems as Abstract Categorial Grammars. Proceedings of Eighth Meeting on Mathematics of Language (MOL 8), Jun 2003, Bloomington, Indiana, United States. pp.71-80. ⟨inria-00107690⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

165

Files downloads

136

 

Contact                    Legal Notice                    Personal Data