Given that context-free grammars (CFG) cannot adequately describe natural languages,
grammar formalisms beyond CFG that are still computationally tractable are of central …

We describe DyALog, an environment aimed to compile and run tabular-based parsers for
various unification-based formalisms used for Natural Language Processing. Besides …

We describe several tabular algorithms for Tree Adjoining Grammar parsing, creating a
continuum from simple pure bottom-up algorithms to complex predictive algorithms and …

Increasing the domain of locality by using Tree Adjoining Grammars (TAG) caused some
applications, such as machine translation, to employ it for the disambiguation process …

Dans cette thèse, nous proposons une architecture logicielle (SemTAG) permettant de
réaliser un calcul sémantique pour grammaires d'Arbres Adjoints. Plus précisément, cette …

A Tabular Interpretation of Bottom-up Automata for TAG Page 1 A Tabular Interpretation of
Bottom-up Automata for TAG Eric de la Clergerie INRIA Domaine de Voluceau Rocquencourt …

We propose a modular design of tabular parsing algorithms for tree-adjoining languages.
The modularity is made possible by a separation of the parsing strategy from the mechanism …

Generalizing ideas presented for 2-stack automata in (Éric Villemonte de la Clergerie,
2001), we introduce Thread Automata [TA], a new automata formalism that may be used to …

Éric Villemonte de la Clergerie Page 1 Refining Tabular Parsers for TAGs Éric Villemonte de
la Clergerie INRIA, Domaine de Voluceau Rocquencourt, BP 105, 78153 Le Chesnay (France) …

Tools and resources for Tree Adjoining Grammars Page 1 Tools and resources for Tree
Adjoining Grammars François Barthélemy, CEDRIC – CNAM, 92 Rue St Martin FR-75141 Paris …