Parsing Gapping Constructions Based on Grammatical and Semantic Roles (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for parsing sentences with gapping recover elided elements from redundant elements . grammatical and semantic tags are used to identify gaps in a coordinated structure . |
| Approach: | They propose a method of parsing sentences with gapping to recover elided elements . they use constituent trees annotated with grammatical and semantic roles . |
| Outcome: | The proposed method outperforms the previous method in terms of F-measure and recall. |
Similar Papers
Sentences with Gapping: Parsing and Reconstructing Elided Predicates (N18-1)
Copied to clipboard
| Challenge: | Sentences with gapping lack an overt predicate to indicate the relation between two or more arguments. |
| Approach: | They propose two methods for parsing to a Universal Dependencies graph representation that explicitly encodes the elided material with additional nodes and edges. |
| Outcome: | The proposed methods reconstruct elided material from dependency trees with high accuracy when the parser correctly predicts the existence of a gap. |
Parsing Headed Constituencies (2024.lrec-main)
Copied to clipboard
| Challenge: | Using constituency and dependency trees, syntactic representations are preferred for tasks such as nominal phrase extraction and identification of terminology. |
| Approach: | They propose a parsing technique that generates headed constituency trees which combine information typically contained in constituency and dependency trees. |
| Outcome: | The proposed method generates headed constituency trees with discontinuities and can generate constituency tree with discontinuity. |
On Eliciting Syntax from Language Models via Hashing (2024.emnlp-main)
Copied to clipboard
| Challenge: | Unsupervised parsing aims to infer syntactic structure from raw text . despite its importance, advancements in this task have been slow . |
| Approach: | They propose to use unsupervised parsing to infer syntactic structure from raw text . they upgrade the bit-level CKY to first-order to encode lexicon and syntax . |
| Outcome: | The proposed method shows competitive performance on various datasets. |
BERT-Proof Syntactic Structures: Investigating Errors in Discontinuous Constituency Parsing (2021.findings-acl)
Copied to clipboard
| Challenge: | Recent results show that pretrained language models can be used for many tasks with high accuracy and high performance. |
| Approach: | They propose two methods for automatically analysing discontinuous parsers' errors. |
| Outcome: | The proposed methods characterize errors of a state-of-the-art transition-based discontinuous parser and provide an overview of the contribution of BERT to this task. |
On Parsing as Tagging (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to reduce constituency parsing to tagging are based on linearization, learning, and decoding . linearization of the derivation tree is the most critical factor in achieving accurate parsers as taggers . |
| Approach: | They propose a pipeline with three steps for reducing constituency parsing to tagging . they find that linearization and learning are critical factors for accurate parsers . |
| Outcome: | The proposed pipelines are linearized, learning, and decoded, and have three steps to achieve accurate parsing as taggers. |
High-order Joint Constituency and Dependency Parsing (2024.lrec-main)
Copied to clipboard
| Challenge: | Syntactic parsing aims to reveal how sentences are syntactically structured. |
| Approach: | They propose to produce compatible constituency and dependency trees simultaneously for input sentences . they adopt a much more efficient decoding algorithm and explore joint modeling at training phase . |
| Outcome: | The proposed model significantly improves matching ratio of whole trees compared to separate models . the proposed model adopts a much more efficient decoding algorithm . |
Discontinuous Constituent Parsing as Sequence Labeling (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to discontinuous parsing are complex and low-level. |
| Approach: | They propose to encode discontinuities as nearly ordered permutations of the input sequence. |
| Outcome: | The proposed model is fast and accurate under the right representation. |
Unsupervised Parsing via Constituency Tests (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for unsupervised parsing rely on constituency tests . linguists can judge a sentence's grammatical validity by modifying it via some transformation . |
| Approach: | They propose a method for unsupervised parsing based on a constituency test . they specify a set of transformations and use an unsupervised neural acceptability model to make grammaticality decisions. |
| Outcome: | The proposed method achieves 62.8 F1 on the Penn Treebank test set, an improvement of 7.6 points over the previous best results. |
Dependency parsing with structure preserving embeddings (2021.eacl-main)
Copied to clipboard
| Challenge: | Modern neural approaches to dependency parsing are trained to predict a tree structure by learning a contextual representation for tokens in a sentence and a head–dependent scoring function. |
| Approach: | They propose to combine a contextual representation for tokens and a head–dependent scoring function to learn interpretable representations by training a parser to explicitly preserve structural properties of a tree. |
| Outcome: | The proposed approach yields strong tree distance preservation and parsing performance on par with a competitive graph-based parser. |
Discourse Representation Parsing for Sentences and Documents (P19-1)
Copied to clipboard
| Challenge: | Experimental results show that our model outperforms competitive baselines by a wide margin. |
| Approach: | They propose a neural model which parses discourse structures of arbitrary length and granularity. |
| Outcome: | The proposed model outperforms baseline models on sentence- and document-level benchmarks. |