Supertagging-based Parsing with Linear Context-free Rewriting Systems
We present the first supertagging-based parser for LCFRS. It utilizes neural classifiers and tremendously outperforms previous LCFRS-based parsers in both accuracy and parsing speed. Moreover, our results keep up with the best (general) discontinuous parsers, particularly the scores for discontinuous constitutents are excellent. The heart of our approach is an efficient lexicalization procedure which induces a lexical LCFRS from any discontinuous treebank. It is an adaptation of previous work by M\"orbitz and Ruprecht (2020). We also describe a modification to usual chart-based LCFRS parsing that accounts for supertagging and introduce a procedure for the transformation of lexical LCFRS derivations into equivalent parse trees of the original treebank. Our approach is implemented and evaluated on the English Discontinuous Penn Treebank and the German corpora NeGra and Tiger.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Re-thinking Supertags in Linear Context-free Rewriting Systems for Constituency Parsing
Recently, a supertagging-based approach for parsing discontinuous constituent trees with linear context-free rewriting systems (LCFRS) was introduced. We reformulate their algorithm for the extraction of supertags from t…
Constituency ParsingLexicalization of Probabilistic Linear Context-free Rewriting Systems
In the field of constituent parsing, probabilistic grammar formalisms have been studied to model the syntactic structure of natural language. More recently, approaches utilizing neural models gained lots of traction in t…
Efficient parsing with Linear Context-Free Rewriting Systems
Data-Driven Parsing using Probabilistic Linear Context-Free Rewriting Systems
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…