All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Faking a Teacher Works! Dependency Scoring Learning and Corpus Boosting for Translation-Based Cross-Lingual Dependency Parsing

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F23%3ARN9VY6ID" target="_blank" >RIV/00216208:11320/23:RN9VY6ID - isvavai.cz</a>

  • Result on the web

    <a href="https://papers.ssrn.com/sol3/papers.cfm?abstract_id=4626681" target="_blank" >https://papers.ssrn.com/sol3/papers.cfm?abstract_id=4626681</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.2139/ssrn.4626681" target="_blank" >10.2139/ssrn.4626681</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Faking a Teacher Works! Dependency Scoring Learning and Corpus Boosting for Translation-Based Cross-Lingual Dependency Parsing

  • Original language description

    "Cross-lingual dependency parsing is one valuable research topic in natural language processing, where treebank translation is a prospective approach of it. Due to the divergence of languages, this method would inevitably generate noise during translation and auto-alignment. To reduce the problem, we exploit MetaNet to compute quality scores for each dependency and identify low-score ones as noise. MetaNet is a fake teacher that learns to score homework (dependencies) by comparing answers from the top student (strong parser) and the regular student (weak parser) without knowing the correct answer (gold-standard). With the scoring capability of MetaNet, we then design an iterative algorithm to boost the target treebank quality, which trains with high-quality dependencies and relabels the low-quality dependencies. We conduct experiments on Universal Dependency Treebank v2.2 to evaluate our method. Results show that our approach is highly effective with significant performance improvements across a diverse set of 10 languages. We also provide detailed analysis and discussions."

  • Czech name

  • Czech description

Classification

  • Type

    O - Miscellaneous

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

  • Continuities

Others

  • Publication year

    2023

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů