Tree Adjoining Grammar
Related Papers
Some Computational Properties of Tree Adjoining Grammars
Tree Adjoining Grammar (TAG) is u formalism for natural language grammars. Some of the basic notions of TAG's were introduced in [Jo~hi,Levy, mad Takakashi I~'Sl and by [Jo~hi, l~l. A …...
Parsing French with Tree Adjoining Grammar: some linguistic accounts
We present the first sizable grammar written for TAG. We present the linguistic coverage of our grammar, and explain the linguistic reasons which lead us to choose the particular representations. …...
A Functional Approach to Generation with TAG
It has been hypothesized that Tree Adjoining Grammar (TAG) is particularly well suited for sentence generation. It is unclear, however, how a sentence generation system based on TAG should choose …...
An Alternative Conception of Tree-Adjoining Derivation
The precise formulation of derivation for tree- adjoining grammars has important ramifications for a wide variety of uses of the formalism, from syntactic analysis to semantic interpretation and statistical language …...
The Use of Shared Forests in Tree Adjoining Grammar Parsing
We study parsing of tree adjoining gram- mars with particular emphasis on the use of shared forests to represent all the parse trees deriving a well-formed string. We show that …...
Tabular Algorithms for TAG Parsing
We describe several tabular algorithms for Tree Adjoining Grammar parsing, creating a continuum from simple pure bottom-up algorithms to complex pre- dictive algorithms and showing what transformations must be applied …...
Generating Parallel Multilingual LFG-TAG Grammars from a MetaGrammar
We introduce a MetaGrammar, which al- lows us to automatically generate, from a single and compact MetaGrammar hier- archy, parallel Lexical Functional Gram- mars (LFG) and Tree-Adjoining Gram- mars (TAG) …...
Wrapping of Trees
We explore the descriptive power, in terms of syn- tactic phenomena, of a formalism that extends Tree- Adjoining Grammar (TAG) by adding a fourth level of hierarchical decomposition to the …...
Integrating a Unification-Based Semantics in a Large Scale Lexicalised Tree Adjoining Grammar for French
In contrast to LFG and HPSG, there is to date no large scale Tree Adjoining Gram- mar (TAG) equiped with a compositional semantics. In this paper, we report on the …...
TAG, Dynamic Programming, and the Perceptron for Efficient, Feature-Rich Parsing
We describe a parsing approach that makes use of the perceptron algorithm, in conjunction with dynamic programming methods, to recover full constituent-based parse trees. The formalism allows a rich set …...
Efficiently Parsable Extensions to Tree-Local Multicomponent TAG
Recent applications of Tree-Adjoining Gram- mar (TAG) to the domain of semantics as well as new attention to syntactic phenomena have given rise to increased interested in more ex- pressive …...
From Partial toward Full Parsing
Full-Parsing systems able to analyze sentences robustly and completely at an appropriate accuracy can be useful in many computer applications like information retrieval and machine translation systems. Increasing the domain …...
Non-Projective Parsing for Statistical Machine Translation
We describe a novel approach for syntax- based statistical MT, which builds on a variant of tree adjoining grammar (TAG). Inspired by work in discriminative depen- dency parsing, the key …...
Exploring the Spinal-STIG Model for Parsing French
AbstractWe evaluate statistical parsing of French using two probabilistic models derived from the Tree Adjoining Grammar framework: a Stochastic Tree Insertion Grammars model (STIG) and a specific instance of this …...
The Importance of Rule Restrictions in CCG
Combinatory Categorial Grammar (CCG) is generally construed as a fully lexicalized formalism, where all grammars use one and the same universal set of rules, and cross- linguistic variation is isolated …...
Further Developments in Treebank Error Detection Using Derivation Trees
AbstractThis work describes how derivation tree fragments based on a variant of Tree Adjoining Grammar (TAG) can be used to check treebank consistency. Annotation of word sequences are compared both …...
A Context Free TAG Variant
We propose a new variant of Tree- Adjoining Grammar that allows adjunc- tion of full wrapping trees but still bears only context-free expressivity. We provide a transformation to context-free form, …...
Text Generation: Reexamining G-TAG with Abstract Categorial Grammars (Génération de textes : G-TAG revisité avec les Grammaires Catégorielles Abstraites) [in French]
. G-TAG is a formalism dedicated to text generation. It relies on the Tree Adjoining Grammar (TAG) for- malism and extends it with several specific notions allowing for the construction …...
The IIT Bombay Hindi-English Translation System at WMT 2014
In this paper, we describe our English- Hindi and Hindi-English statistical sys- tems submitted to the WMT14 shared task. The core components of our translation systems are phrase based (Hindi-English) …...
LR Parsing for LCFRS
LR parsing is a popular parsing strategy for variants of Context-Free Grammar (CFG). It has also been used for mildly context-sensitive formalisms, such as Tree-Adjoining Gram- mar. In this paper, …...
End-to-End Graph-Based TAG Parsing with Neural Networks
AbstractWe present a graph-based Tree Adjoining Grammar (TAG) parser that uses BiLSTMs, highway connections, and character-level CNNs. Our best end-to-end parser, which jointly performs supertagging, POS tagging, and parsing, outperforms …...
Deconstructing Supertagging into Multi-Task Sequence Prediction
AbstractSupertagging is a sequence prediction task where each word is assigned a piece of complex syntactic structure called a supertag. We provide a novel approach to multi-task learning for Tree …...