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

Statistical Parsing of Tree Wrapping Grammars

We describe an approach to statistical parsing with Tree-Wrapping Grammars (TWG). TWG is a tree-rewriting formalism which includes the tree-combination operations of substitution, sister-adjunction and tree-wrapping subs…

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…

Top-Down RST Parsing Utilizing Granularity Levels in Documents

Some downstream NLP tasks exploit discourse dependency trees converted from RST trees. To obtain better discourse dependency trees, we need to improve the accuracy of RST trees at the upper parts of the structures. Thus,…

Easy-First Dependency Parsing with Hierarchical Tree LSTMs

We suggest a compositional vector representation of parse trees that relies on a recursive combination of recurrent-neural network encoders. To demonstrate its effectiveness, we use the representation as the backbone of …

Tree Adjunction as Minimalist Lowering