Challenge: Sequence-to-Sequence (S2S) models have been successful on text generation tasks . however, learning complex structures with S2S models remains challenging .
Approach: They propose to use constrained decoding to model part-of-speech tagging, named entity recognition, constituency, and dependency parsing tasks with 3 lexically diverse linearization schemas and corresponding constrained coding methods.
Outcome: The proposed methods outperform the state-of-the-art on four core tasks.

Similar Papers

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.
Transforming Sequence Tagging Into A Seq2Seq Task (2022.emnlp-main)

Copied to clipboard

Challenge: Pretrained, large, generative language models have had great success in a wide range of sequence tagging and structured prediction tasks.
Approach: They propose to use a new format for casting input text sentences and their output labels into the input and target of a Seq2Seq model and introduce it to test their hypothesis.
Outcome: The proposed format shows to be both simpler and more effective and devoid of hallucination.
Bringing Emerging Architectures to Sequence Labeling in NLP (2026.eacl-long)

Copied to clipboard

Challenge: Pretrained Transformer encoders are the dominant approach to sequence labeling . however, few have been applied to sequence labels on flat or simplified tasks .
Approach: They propose to use pretrained Transformer encoders to model relations across words . they find that the architectures adapt well across tagging tasks that vary in complexity .
Outcome: The proposed architectures perform well across tagging tasks across languages and datasets.
Compositional Generalization via Semantic Tagging (2021.findings-emnlp)

Copied to clipboard

Challenge: Existing neural sequence-to-sequence models fail at compositional generalization, i.e., they cannot generalize to unseen compositions of seen components.
Approach: They propose a decoding framework that preserves expressivity and generality of sequence-to-sequence models while featuring lexicon-style alignments and disentangled information processing.
Outcome: The proposed framework improves compositional generalization across model architectures, domains, and semantic formalisms on three semantic parsing datasets.
Leveraging AMR Graph Structure for Better Sequence-to-Sequence AMR Parsing (2024.lrec-main)

Copied to clipboard

Challenge: Recent studies on AMR parsing often regard this task as a seq2seq translation problem.
Approach: They propose to translate AMR graphs into AMR token sequences in pre-processing and recover AMR from sequences after decoding.
Outcome: The proposed approach outperforms baseline and achieves 85.5 0.1 and 84.2 0.2 Smatch scores on AMR 2.0 and AMR 3.0.
Parsing linearizations appreciate PoS tags - but some are fussy about errors (2022.aacl-short)

Copied to clipboard

Challenge: Recent work on the impact of PoS tags on graph- and transition-based parsers suggests that they are only useful when tagging accuracy is prohibitively high or in low-resource scenarios.
Approach: They examine the impact of PoS tags on graph- and transition-based parsers and propose to use them in a new paradigm for sequence labeling.
Outcome: The proposed model is best when tagging accuracy and resource availability are high.
Dependency Parsing via Sequence Generation (2022.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for dependency parsing are transition-based, graph-based and sequence-to-sequence method.
Approach: They propose to achieve dependency parsing (DP) via Sequence Generation (SG) by utilizing only the pre-trained language model without any auxiliary structures.
Outcome: The proposed method performs well on DP benchmarks including PTB, UD2.2, SDP15 and SemEval16.
More Embeddings, Better Sequence Labelers? (2020.findings-emnlp)

Copied to clipboard

Challenge: Existing work suggests contextual embeddings improve sequence labeling accuracy . but, there is no definite conclusion on whether concatenating different kinds of embeddables is effective .
Approach: They propose a family of contextual embeddings that improves sequence labeling accuracy . they conduct extensive experiments on 3 tasks over 18 datasets and 8 languages .
Outcome: The proposed family of contextual embeddings improves the accuracy of sequence labelers over non-contextual embedders.
Character-level Representations Improve DRS-based Semantic Parsing Even in the Age of BERT (2020.emnlp-main)

Copied to clipboard

Challenge: a new method of analysis based on semantic tags demonstrates that character-level representations improve performance across a subset of selected semantic phenomena.
Approach: They combine character-level and contextual language model representations to improve performance on Discourse Representation Structure parsing.
Outcome: The proposed model improves performance on a subset of selected semantic phenomena.
What can we learn from Semantic Tagging? (D18-1)

Copied to clipboard

Challenge: a recent study shows that multi-task learning improves performance of NLP tasks by exploiting similarities between tasks.
Approach: They employ semantic tagging as an auxiliary task for three NLP tasks . they compare full neural network sharing, partial neural network shared and learning what to share .
Outcome: The proposed model improves for part-of-speech tagging, universal dependency parsing and natural language inference.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations