Pith. sign in

REVIEW 3 cited by

75 Languages, 1 Model: Parsing Universal Dependencies Universally

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1904.02099 v3 pith:EBXHBV2T submitted 2019-04-03 cs.CL cs.LG

classification cs.CLcs.LG
keywords languagesudifymultilingualmodeluniversalbertdependenciesevaluate
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We present UDify, a multilingual multi-task model capable of accurately predicting universal part-of-speech, morphological features, lemmas, and dependency trees simultaneously for all 124 Universal Dependencies treebanks across 75 languages. By leveraging a multilingual BERT self-attention model pretrained on 104 languages, we found that fine-tuning it on all datasets concatenated together with simple softmax classifiers for each UD task can result in state-of-the-art UPOS, UFeats, Lemmas, UAS, and LAS scores, without requiring any recurrent or language-specific components. We evaluate UDify for multilingual learning, showing that low-resource languages benefit the most from cross-linguistic annotations. We also evaluate for zero-shot learning, with results suggesting that multilingual training provides strong UD predictions even for languages that neither UDify nor BERT have ever been trained on. Code for UDify is available at https://github.com/hyperparticle/udify.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Small and Practical BERT Models for Sequence Labeling

    cs.CL 2019-08 conditional novelty 6.0 of 10

    Distilling multilingual BERT into a 3-layer, 256-unit student yields a CPU-fast sequence labeler that is within about one F1 point of the teacher and beats a strong LSTM baseline.

  2. Deep Contextualized Word Embeddings in Transition-Based and Graph-Based Dependency Parsing -- A Tale of Two Parsers Revisited

    cs.CL 2019-08 conditional novelty 6.0 of 10

    Across 13 languages, deep contextualized embeddings (ELMo and BERT) improve transition-based dependency parsers more than graph-based ones, making the two families nearly equivalent.

  3. Context Aware Lemmatization and Morphological Tagging Method in Turkish

    cs.CL 2025-01 reject novelty 3.0 of 10

    A BiLSTM plus Turkish BERT lemmatizer and morphological tagger is tested on IMST and PUD, beating SIGMORPHON 2019 on most metrics but not on PUD lemmatization accuracy, while the paper's claim of being the first conte...

Pith tools