mlsanityData to 7 Oct 2026

Substructure Distribution Projection for Zero-Shot Cross-Lingual Dependency Parsing

arXiv 2110.08538 ↗First posted 16 Oct 2021cs.CLcited by 5

Not on the map. Why?

Abstract (arXiv)

We present substructure distribution projection (SubDP), a technique that projects a distribution over structures in one domain to another, by projecting substructure distributions separately. Models for the target domains can be then trained, using the projected distributions as soft silver labels. We evaluate SubDP on zero-shot cross-lingual dependency parsing, taking dependency arcs as substructures: we project the predicted dependency arc distributions in the source language(s) to target language(s), and train a target language parser to fit the resulting distributions. When an English treebank is the only annotation that involves human effort, SubDP achieves better unlabeled attachment score than all prior work on the Universal Dependencies v2.2 (Nivre et al., 2020) test set across eight diverse target languages, as well as the best labeled attachment score on six out of eight languages. In addition, SubDP improves zero-shot cross-lingual dependency parsing with very few (e.g., 50) supervised bitext pairs, across a broader range of target languages.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 28 of its 69 references that are in the map. First posted on arXiv 16 Oct 2021.

Builds on

28 of 69 references.

References · 28

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  4. 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,243
  5. 2019Unsupervised Cross-lingual Representation Learning at Scalecited by 3,907
  6. 2020Multilingual Denoising Pre-training for Neural Machine Translationcited by 1,028
  7. 2019How multilingual is Multilingual BERT?cited by 642
  8. 2016Deep Biaffine Attention for Neural Dependency Parsingcited by 334
  9. 2020Universal Dependencies v2: An Evergrowing Multilingual Treebank Collectioncited by 269
  10. 2019WikiMatrix: Mining 135M Parallel Sentences in 1620 Language Pairs from Wikipediacited by 221
  11. 2020SimAlign: High Quality Word Alignments without Parallel Training Data using Static and Contextualized Embeddingscited by 155
  12. 2019Cross-Lingual Alignment of Contextual Word Embeddings, with Applications to Zero-shot Dependency Parsingcited by 69
16 more
  1. 2020Cross-lingual Retrieval for Iterative Self-Supervised Trainingcited by 54
  2. 2020Efficient Second-Order TreeCRF for Neural Dependency Parsingcited by 48
  3. 2019Cross-Lingual BERT Transformation for Zero-Shot Dependency Parsingcited by 46
  4. 2020Single-/Multi-Source Cross-Lingual NER via Teacher-Student Learning on Unlabeled Data in Target Languagecited by 37
  5. 2016Many Languages, One Parsercited by 26
  6. 2021Substructure Substitution: Structured Data Augmentation for NLPcited by 25
  7. 2020A Cross-Task Analysis of Text Span Representationscited by 21
  8. 2021Bilingual Lexicon Induction via Unsupervised Bitext Construction and Word Alignmentcited by 19
  9. 2019Polyglot Contextual Representations Improve Crosslingual Transfercited by 16
  10. 2019Cross-lingual Dependency Parsing with Unlabeled Auxiliary Languagescited by 13
  11. 2019Target Language-Aware Constrained Inference for Cross-lingual Dependency Parsingcited by 11
  12. 2019Cross-Lingual Dependency Parsing Using Code-Mixed TreeBankcited by 10
  13. 2016Cross-Lingual Syntactic Transfer with Limited Resourcescited by 8
  14. 2019Low-Resource Syntactic Transfer with Unsupervised Source Reorderingcited by 8
  15. 2019Cross-Lingual Syntactic Transfer through Unsupervised Adaptation of Invertible Projectionscited by 7
  16. 2021PPT: Parsimonious Parser Transfer for Unsupervised Cross-Lingual Adaptationcited by 6

Built on by

Cited by year

Citing papers per year: 2022: 2; 2023: 0; 2024: 3.

5 papers.