Tree-adjoining grammar

Known as: Tag, Tree adjoining grammar, Tree adjoining grammars

Tree-adjoining grammar (TAG) is a grammar formalism defined by Aravind Joshi. Tree-adjoining grammars are somewhat similar to context-free grammars…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2014

This thesis constitutes an exploration of the applications of tree adjoining grammar (TAG) to natural language syntax. Perhaps…

2010

In order to construct a generic grammatical resource for Arabic language, we have chosen to develop an Arabic grammar based on…

2006

The ability to represent cross-serial dependencies is one of the central features of Tree Adjoining Grammar (TAG). The class of…

2003

To make any sort of optimality argument, or rational engineering decision, one needs a fairly precise understanding of the…

2003

For reasons of maintenance, economy and consistency, devising ways of factorising the information contained in a grammar is…

2001

We define a new model of automata for the description of bidirectional parsing strategies for tree adjoining grammars and a…

2000

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

1996

In this paper, I will develop the formal foundations of a theory of complexity that underlies theory of grammatical induction…

1993

Lexicalized context-free grammar (LCFG) is a tree-based formalism that makes use of both tree substitution and a restricted form…

1991

In this paper we provide an implementation strategy to map a functional specification of an utterance into a syntactically well…