La terminologie grammaticale russe résulte d’une synthèse des terminologies grecque et latine qui s’est opérée au début du xviie siècle dans la grammaire slavonne de Meletius Smotrickij. Cependant, pour raisons historiques, culturelles religieuses, le socle grec a été fondateur. Cet article retrace genèse les principaux traités grammaticaux slavon. Centré sur dénomination parties discours, il a...

“Growth grammars” are extended parametric Lindenmayer systems, enriched by some novel features (expand operator, global sensitivity, interpretive rules, arithmetical-structural operators). They can serve as a formal basis for describing functionalstructural plant models from the literature. This is demonstrated on three well-known models having in common that they were originally developed with...

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...