| Challenge: | Neural parsers perform well on in-domain benchmarks, but their performance degrades in well-understood ways. |
| Approach: | They analyze generalization on English and Chinese corpora to see if they can generalize to other domains. |
| Outcome: | The proposed neural parsers perform better on in-domain benchmarks than on out-of-domain corpora. |
Similar Papers
Challenges to Open-Domain Constituency Parsing (2022.findings-acl)
Copied to clipboard
| Challenge: | Existing findings on cross-domain constituency parsing are only made on a limited number of domains. |
| Approach: | They manually annotate a high-quality constituency treebank containing five domains and analyze challenges to open-domain constituency parsing using a set of linguistic features. |
| Outcome: | The proposed model significantly improves the performance of the proposed model on the domain-variant features. |
What’s Going On in Neural Constituency Parsers? An Analysis (N18-1)
Copied to clipboard
| Challenge: | a number of differences have emerged between classical and modern constituency parsing approaches . structural components like grammars and feature-rich lexicons are becoming less central . recurrent neural networks have gained traction as a powerful and general purpose tool for representation . |
| Approach: | They propose a model that implicitly learns to encode much of the same information as grammars and lexicons in the past. |
| Outcome: | The proposed model outperforms state-of-the-art models under similar conditions. |
Extending a Parser to Distant Domains Using a Few Dozen Partially Annotated Examples (P18-1)
Copied to clipboard
| Challenge: | Statistical parsers are often criticized for their performance outside of the domain they were trained on . we show that word representations reduce the need for domain adaptation when the target domain is syntactically similar to the source domain. |
| Approach: | They propose a way to adapt a parser to a syntactically similar target domain using partial annotations. |
| Outcome: | The proposed model increases the accuracy of a parser on the Wall Street Journal by 1.7% over the previous state-of-the-art model. |
Dynamic Head Selection for Neural Lexicalized Constituency Parsing (2025.acl-long)
Copied to clipboard
| Challenge: | Lexicalized parsing has traditionally been neglected in favor of unlexicalized, span-based methods. |
| Approach: | They propose a latent lexicalization framework that dynamically infers lexicals from data without relying on predefined head-finding rules. |
| Outcome: | The proposed model learns lexical dependencies directly from data, offering greater adaptability across languages and datasets. |
Meta-Learning for Domain Generalization in Semantic Parsing (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing approaches to parsing use standard supervised learning, but little attention has been given to domain generalization. |
| Approach: | They propose a meta-learning framework which targets zero-shot domain generalization for semantic parsing. |
| Outcome: | The proposed framework significantly boosts parser performance on English and Chinese spider datasets. |
Straight to the Tree: Constituency Parsing with Neural Syntactic Distance (P18-1)
Copied to clipboard
| Challenge: | Compared to traditional shift-reduce parsing schemes, our approach is free from the potentially disastrous compounding error. |
| Approach: | They propose a model that predicts a scalar for each split position in a sentence and then determines the topology of grammar tree based on syntactic distances. |
| Outcome: | The proposed model achieves the state-of-the-art single model F1 score of 92.1 on PTB and 86.4 on CTB dataset, surpassing the previous single model results by a large margin. |
On the Zero-Shot Generalization of Machine-Generated Text Detectors (2023.findings-emnlp)
Copied to clipboard
| Challenge: | rampant proliferation of large language models generates text indistinguishable from human-written language. |
| Approach: | They train neural detectors on outputs of a new generator and test their performance on held-out generators. |
| Outcome: | The proposed detectors can be built on training data from medium-sized models. |
Evaluating the Factuality of Zero-shot Summarizers Across Varied Domains (2024.eacl-short)
Copied to clipboard
| Challenge: | Recent work has shown that large language models can generate zero-shot summaries without explicit supervision that are often comparable or even preferred to manually composed reference summary. |
| Approach: | They evaluate large language models (LLMs) that generate zero-shot summaries without explicit supervision that are often comparable to manual reference summary . they acquire annotations from domain experts to identify inconsistencies in summaires and categorize errors. |
| Outcome: | The proposed model outperforms fine-tuned models in biomedical articles and legal bills across specialized domains. |
Neural Unsupervised Domain Adaptation in NLP—A Survey (2020.coling-main)
Copied to clipboard
| Challenge: | Deep neural networks excel at learning from labeled data, but learning from unlabeled data remains a challenge. |
| Approach: | They review neural unsupervised domain adaptation techniques which do not require labeled target domain data. |
| Outcome: | The proposed techniques are more challenging yet widely applicable. |
An Empirical Study of Building a Strong Baseline for Constituency Parsing (P18-2)
Copied to clipboard
| Challenge: | Sequence-to-sequence models have been used for natural language generation tasks such as machine translation and summarization. |
| Approach: | They propose to build a strong baseline based on general purpose sequence-to-sequence models for constituency parsing. |
| Outcome: | The proposed model outperforms existing models in natural language generation tasks without any explicit task-specific knowledge or architecture of constituent parsing. |