In this paper we present a new parsing algorithm for linear indexed grammars (LIGs) in the same spirit as the one described in (Vijay-Shanker and Weir, 1993) for tree adjoining grammars. For a LIG L and an input string x of length n, we build a non ambiguous context-free grammar whose sentences are all (and exclusively) valid derivation sequences in L which lead to x. We show that this grammar ...

Tree Adjoining Grammar (TAG) is a useful formalism for describing the syntactic structure of natural languages. In practice, a large part of wide coverage TAGs is formed by trees that satisfy the restrictions imposed by Tree Insertion Grammar (TIG), a simpler formalism. This characteristic can be used to reduce the practical complexity of TAG parsing, applying the standard adjunction operation ...

We propose here an algorithm that decides whether a state of an innnite graph deened by a graph grammar satisses a given formula of the alternation-free-calculus. We rst show how graph grammars enable to nitely represent innnite transition systems. In particular, a connection is made between a state of the graph grammar and the states of the innnite graph it represents. We then present succinct...

In natural language generation using symbolic grammars, state-of-the-art realisation rankers use statistical models incorporating both language model and structural features. The rankers depend on multiple structures produced by the particular large-scale symbolic grammars to rank the output; for languages with smaller resources and in-development grammars, we look at the feasibility of an alte...

Cet ouvrage est le deuxieme volume d’une serie de livres consacres a l’histoire la linguistique romane. Le premier traite periode allant des debuts jusqu’a 1492 et ete publie un an apres mort d’Eugenio Coseriu (1921-2002), dans l’adaptation Reinhard Meisterfeld (1940-2017) (Coseriu & 2003). Deux autres volumes sont prevus cette serie : troisieme qui portera sur langues, phonetique grammaire aux...