The reviewed record of science sign in
Pith

arxiv: 2101.05779 · v3 · pith:YP56WFRT · submitted 2021-01-14 · cs.LG · cs.CL

Structured Prediction as Translation between Augmented Natural Languages

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:YP56WFRTrecord.jsonopen to challenge →

classification cs.LG cs.CL
keywords relationtasksaugmentedentityextractionlanguagesnaturaltranslation
0
0 comments X
read the original abstract

We propose a new framework, Translation between Augmented Natural Languages (TANL), to solve many structured prediction language tasks including joint entity and relation extraction, nested named entity recognition, relation classification, semantic role labeling, event extraction, coreference resolution, and dialogue state tracking. Instead of tackling the problem by training task-specific discriminative classifiers, we frame it as a translation task between augmented natural languages, from which the task-relevant information can be easily extracted. Our approach can match or outperform task-specific models on all tasks, and in particular, achieves new state-of-the-art results on joint entity and relation extraction (CoNLL04, ADE, NYT, and ACE2005 datasets), relation classification (FewRel and TACRED), and semantic role labeling (CoNLL-2005 and CoNLL-2012). We accomplish this while using the same architecture and hyperparameters for all tasks and even when training a single model to solve all tasks at the same time (multi-task learning). Finally, we show that our framework can also significantly improve the performance in a low-resource regime, thanks to better use of label semantics.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Task Decomposition for Efficient Annotation

    cs.CL 2026-06 unverdicted novelty 4.0

    Decomposing annotation tasks using centers from centering theory reduces aggregate inferential load via a degrees-of-freedom model and enables better sub-task allocation.