Multiple Adjunction in Feature-Based Tree-Adjoining Grammar

Efficiency of Top-Down Parsing of Recursive Adjunction for Tree Adjoining Grammar

TREE ADJOINING GRAMMAR BASED “LANGUAGE INDEPENDENT GENERATOR”

This paper proposes language independent natural language generator for Tree Adjoining Grammar (TAG)[8] based Machine Translation System. In this model, the TAG based parsing and generation approach considered for the sy…

German and French Neural Supertagging Experiments for LTAG Parsing

We present ongoing work on data-driven parsing of German and French with Lexicalized Tree Adjoining Grammars. We use a supertagging approach combined with deep learning. We show the challenges of extracting LTAG supertag…

Multiple Context-Free Tree Grammars: Lexicalization and Characterization

Multiple (simple) context-free tree grammars are investigated, where "simple" means "linear and nondeleting". Every multiple context-free tree grammar that is finitely ambiguous can be lexicalized; i.e., it can be transf…

A Lie-algebraic perspective on Tree-Adjoining Grammars

We provide a novel mathematical implementation of tree-adjoining grammars using two combinatorial definitions of graphs. With this lens, we demonstrate that the adjoining operation defines a pre-Lie operation and subsequ…