Skip to Main content Skip to Navigation
Conference papers

Parsing TAG with Abstract Categorial Grammar.

Sylvain Salvati 1
1 SIGNES - Linguistic signs, grammar and meaning: computational logic for natural language
CNRS - Centre National de la Recherche Scientifique : UMR5800, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Inria Bordeaux - Sud-Ouest, Université Sciences et Technologies - Bordeaux 1
Abstract : This paper presents informally an Earley algorithm for TAG which behaves as the algorithm given by [SJ88]. This algorithm is a specialization to TAG of a more general algorithm dedicated to second order ACGs. As second order ACGs allows to encode Linear Context Free Rewriting Systems (LCFRS) [dGP04], the main purpose of this paper is to give a rough presentation of formal tools which can be used to design efficient algorithms for LCFRS.
Document type :
Conference papers
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download
Contributor : Sylvain Salvati <>
Submitted on : Tuesday, November 4, 2008 - 5:00:43 PM
Last modification on : Thursday, February 11, 2021 - 2:52:01 PM
Long-term archiving on: : Monday, June 7, 2010 - 7:22:59 PM


Files produced by the author(s)


  • HAL Id : inria-00334009, version 1



Sylvain Salvati. Parsing TAG with Abstract Categorial Grammar.. TAG+8: Workshop On Tree Adjoining Grammar And Related Formalisms, 2006, Sidney, Australia. ⟨inria-00334009⟩



Record views


Files downloads