Reducing Discontinuous to Continuous Parsing with Pointer Network Reordering
Discontinuous constituent parsers have always lagged behind continuous approaches in terms of accuracy and speed, as the presence of constituents with discontinuous yield introduces extra complexity to the task. However, a discontinuous tree can be converted into a continuous variant by reordering tokens. Based on that, we propose to reduce discontinuous parsing to a continuous problem, which can then be directly solved by any off-the-shelf continuous parser. To that end, we develop a Pointer Network capable of accurately generating the continuous token arrangement for a given input sentence and define a bijective function to recover the original order. Experiments on the main benchmarks with two continuous parsers prove that our approach is on par in accuracy with purely discontinuous state-of-the-art algorithms, but considerably faster.
Code (1)
Tasks
SentenceMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Discontinuous Constituent Parsing with Pointer Networks
One of the most complex syntactic representations used in computational linguistics and NLP are discontinuous constituent trees, crucial for representing all grammatical phenomena of languages such as German. Recent adva…
Dependency ParsingPart-Of-Speech TaggingSentenceMultitask Pointer Network for Multi-Representational Parsing
We propose a transition-based approach that, by training a single model, can efficiently parse any input sentence with both constituent and dependency trees, supporting both continuous/projective and discontinuous/non-pr…
SentenceRethinking Boundaries: End-To-End Recognition of Discontinuous Mentions with Pointer Networks
A majority of research interests in irregular (eg, nested or discontinuous) named entity recognition (NER) have been paid on nested entities, while discontinuous entities received limited attention. Existing work for dis…
Boundary DetectionDecodernamed-entity-recognitionNamed Entity Recognition+2Unsupervised Discontinuous Constituency Parsing with Mildly Context-Sensitive Grammars
We study grammar induction with mildly context-sensitive grammars for unsupervised discontinuous parsing. Using the probabilistic linear context-free rewriting system (LCFRS) formalism, our approach fixes the rule struct…
Constituency Parsingparameter estimationTensor DecompositionIncremental Discontinuous Phrase Structure Parsing with the GAP Transition
This article introduces a novel transition system for discontinuous lexicalized constituent parsing called SR-GAP. It is an extension of the shift-reduce algorithm with an additional gap transition. Evaluation on two Ger…