Dynamic Oracles for Top-Down and In-Order Shift-Reduce Constituent Parsing (D18-1)
Copied to clipboard
| Challenge: | Top-down and in-order shift-reduce constituent parsers are the most accurate known shift-reducing algorithms for constituent paring. |
| Approach: | They propose to use dynamic oracles to train two of the most accurate shift-reduce algorithms for constituent parsing. |
| Outcome: | The proposed top-down and in-order shift-reduce parsers improve on the WSJ benchmark. |
Similar Papers
A Dynamic Oracle for Linear-Time 2-Planar Dependency Parsing (N18-2)
Copied to clipboard
| Challenge: | Existing dynamic oracles for greedy parsers can handle non-projective syntax, but none are available for these types of training. |
| Approach: | They propose an efficient dynamic oracle for training the 2-Planar transition-based parser with over 99% coverage on non-projective syntactic corpora. |
| Outcome: | The proposed model outperforms the static training strategy in the vast majority of languages tested and scored better on most datasets than the arc-hybrid parser enhanced with the Swap transition. |
Enriched In-Order Linearization for Faster Sequence-to-Sequence Constituent Parsing (2020.acl-main)
Copied to clipboard
| Challenge: | Sequence-to-sequence constituent parsing requires a linearization to represent trees as sequences. Top-down tree linearizations have achieved the best accuracy to date. |
| Approach: | They propose to use an in-order shift-reduce linearization instead of a top-down tree linearization to represent trees as sequences. |
| Outcome: | The proposed approach achieves the best accuracy to date on the English PTB dataset among fully-supervised single-model sequence-to-sequence constituent parsers. |
A Complete Shift-Reduce Chinese Discourse Parser with Robust Dynamic Oracle (2020.acl-main)
Copied to clipboard
| Challenge: | Existing work on hierarchical discourse parsing in English is based on the RST-style one. |
| Approach: | They propose a Chinese discourse parser that integrates pre-trained text encoder and employs novel training strategies to improve rhetorical relation recognition. |
| Outcome: | The proposed system achieves state-of-the-art performance in Chinese discourse parsing. |
Exploiting Dynamic Oracles to Train Projective Dependency Parsers on Non-Projective Trees (N18-2)
Copied to clipboard
| Challenge: | Several strategies have been proposed to overcome the projectivity constraint by introducing transition-based dependency parsers that can build non-projective dependencies. |
| Approach: | They propose a modification of dynamic oracles to allow use of non-projective data . their method consistently outperforms traditional projectivization and pseudo-projectivisation approaches . |
| Outcome: | The proposed method outperforms projectivization and pseudo-projectivisation methods on 73 treebanks and achieves significant gains for non-projective languages. |
Improving Coverage and Runtime Complexity for Exact Inference in Non-Projective Transition-Based Dependency Parsers (N18-2)
Copied to clipboard
| Challenge: | Non-projective dependency trees account for 12.59% of all training sentences in the annotated Universal Dependencies (UD) 2.1 data. |
| Approach: | They generalize Cohen et al.'s (2011) parser to a family of non-projective transition-based dependency parsers allowing polynomial-time exact inference. |
| Outcome: | The proposed system can be extended to include a variant that reduces time complexity to O(n6), improving over the known bounds in exact inference for non-projective transition-based parsing. |
Automatically Selecting the Best Dependency Annotation Design with Dynamic Oracles (N18-2)
Copied to clipboard
| Challenge: | Multiple annotation conventions have been proposed for representing dependency structures. |
| Approach: | They propose to consider a set of syntactic references encoding alternative syntak representations to train a parser with a dynamic oracle. |
| Outcome: | The proposed approach can predict the best syntactic representation among all possible references. |
A Unifying Theory of Transition-based and Sequence Labeling Parsing (2020.coling-main)
Copied to clipboard
| Challenge: | Existing parsers that read sentences from left to right are not learning to parse them. |
| Approach: | They propose a mapping from transition-based parsing algorithms that read sentences from left to right to sequence labeling encodings of syntactic trees. |
| Outcome: | The proposed algorithms are learnable and comparable to existing encodings. |
Better, Faster, Stronger Sequence Tagging Constituent Parsers (N19-1)
Copied to clipboard
| Challenge: | Existing efforts to speed up constituent parsing have focused on chart-based or shift-reduce parsers. |
| Approach: | They propose to use auxiliary losses and sentence-level fine-tuning to mitigate greedy decoding issues. |
| Outcome: | The proposed model surpasses the performance of sequence tagging constituent parsers on the English and Chinese Penn Treebank datasets and reduces their parsing time even further. |
Dynamic Oracle for Neural Machine Translation in Decoding Phase (L18-1)
Copied to clipboard
| Challenge: | Existing methods to improve NMT performance but there is a discrepancy between training and inference when decoding. |
| Approach: | They propose to use Scheduled Sampling to reduce the discrepancy between training and inference in NMT when decoding to mitigate the discrépancy. |
| Outcome: | The proposed methods improve translation quality over standard NMT system. |
Top-down Discourse Parsing via Sequence Labelling (2021.eacl-main)
Copied to clipboard
| Challenge: | Discourse analysis is a systematic way to understand how texts are segmented hierarchically into discourse units. |
| Approach: | They propose a top-down approach to discourse parsing that is conceptually simpler than its predecessors. |
| Outcome: | The proposed model eliminates the decoder and reduces the search space for splitting points. |