A Formal Model for Plausible Dependencies in Lexicalized Tree Adjoining Grammar

Detecting and Correcting Syntactic Errors in Machine Translation Using Feature-Based Lexicalized Tree Adjoining Grammars

Prefix Lexicalization of Synchronous CFGs using Synchronous TAG

We show that an epsilon-free, chain-free synchronous context-free grammar (SCFG) can be converted into a weakly equivalent synchronous tree-adjoining grammar (STAG) which is prefix lexicalized. This transformation at mos…

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…

Towards a Compositional Analysis of German Light Verb Constructions (LVCs) Combining Lexicalized Tree Adjoining Grammar (LTAG) with Frame Semantics

Complex predicates formed of a semantically {`}light{'} verbal head and a noun or verb which contributes the major part of the meaning are frequently referred to as {`}light verb constructions{'} (LVCs). In the paper, we…

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…