Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Span-based semantic parsing for compositional generalization
Despite the success of sequence-to-sequence (seq2seq) models in semantic parsing,
recent work has shown that they fail in compositional generalization, ie, the ability to …
recent work has shown that they fail in compositional generalization, ie, the ability to …
Overview of the SPMRL 2013 shared task: A cross-framework evaluation of parsing morphologically rich languages
This paper reports on the first shared task on statistical parsing of morphologically rich lan-
guages (MRLs). The task features data sets from nine languages, each available both in …
guages (MRLs). The task features data sets from nine languages, each available both in …
[ΒΙΒΛΙΟ][B] Compendium of Neurosymbolic Artificial Intelligence
If only it were possible to develop automated and trainable neural systems that could justify
their behavior in a way that could be interpreted by humans like a symbolic system. The field …
their behavior in a way that could be interpreted by humans like a symbolic system. The field …
Parsing as reduction
We reduce phrase-representation parsing to dependency parsing. Our reduction is
grounded on a new intermediate representation," head-ordered dependency trees", shown …
grounded on a new intermediate representation," head-ordered dependency trees", shown …
Span-based discontinuous constituency parsing: a family of exact chart-based algorithms with time complexities from O (n^ 6) down to O (n^ 3)
C Corro - arxiv preprint arxiv:2003.13785, 2020 - arxiv.org
We introduce a novel chart-based algorithm for span-based parsing of discontinuous
constituency trees of block degree two, including ill-nested structures. In particular, we show …
constituency trees of block degree two, including ill-nested structures. In particular, we show …
Data-driven parsing using probabilistic linear context-free rewriting systems
This paper presents the first efficient implementation of a weighted deductive CYK parser for
Probabilistic Linear Context-Free Rewriting Systems (PLCFRSs). LCFRS, an extension of …
Probabilistic Linear Context-Free Rewriting Systems (PLCFRSs). LCFRS, an extension of …
Data-oriented parsing with discontinuous constituents and function tags
Statistical parsers are e ective but are typically limited to producing projective dependencies
or constituents. On the other hand, linguisti-cally rich parsers recognize non-local relations …
or constituents. On the other hand, linguisti-cally rich parsers recognize non-local relations …
Tree-Averaging Algorithms for Ensemble-Based Unsupervised Discontinuous Constituency Parsing
We address unsupervised discontinuous constituency parsing, where we observe a high
variance in the performance of the only previous model in the literature. We propose to build …
variance in the performance of the only previous model in the literature. We propose to build …
Span-based LCFRS-2 parsing
The earliest models for discontinuous constituency parsers used mildly context-sensitive
grammars, but the fashion has changed in recent years to grammar-less transition-based …
grammars, but the fashion has changed in recent years to grammar-less transition-based …
[PDF][PDF] Discontinuous incremental shift-reduce parsing
W Maier - Proceedings of the 53rd Annual Meeting of the …, 2015 - aclanthology.org
Discontinuous Incremental Shift-reduce Parsing Page 1 Proceedings of the 53rd Annual Meeting
of the Association for Computational Linguistics and the 7th International Joint Conference on …
of the Association for Computational Linguistics and the 7th International Joint Conference on …