Integrating Supertag Features into Neural Discontinuous Constituent Parsing
Lukas Mielczarek

TL;DR
This paper investigates enhancing neural discontinuous constituent parsing by integrating supertag features, exploring pipeline and joint training methods across various formal frameworks to improve parsing accuracy and efficiency.
Contribution
It introduces the use of supertag information into neural transition-based discontinuous parsing, comparing pipeline and joint training approaches across multiple formal frameworks.
Findings
Supertag integration improves parsing accuracy.
Joint training outperforms pipeline approach.
Frameworks like CCG and LTAG are effective auxiliary tasks.
Abstract
Syntactic parsing is essential in natural-language processing, with constituent structure being one widely used description of syntax. Traditional views of constituency demand that constituents consist of adjacent words, but this poses challenges in analysing syntax with non-local dependencies, common in languages like German. Therefore, in a number of treebanks like NeGra and TIGER for German and DPTB for English, long-range dependencies are represented by crossing edges. Various grammar formalisms have been used to describe discontinuous trees - often with high time complexities for parsing. Transition-based parsing aims at reducing this factor by eliminating the need for an explicit grammar. Instead, neural networks are trained to produce trees given raw text input using supervised learning on large annotated corpora. An elegant proposal for a stack-free transition-based parser…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications · Natural Language Processing Techniques
